./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for termination
Using default analysis
Version 8be7027f
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_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-wip.dk.perfect-tracechecks-8be7027-m
[2024-11-12 21:44:11,360 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-12 21:44:11,436 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf
[2024-11-12 21:44:11,440 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-12 21:44:11,441 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-12 21:44:11,477 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-12 21:44:11,477 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-12 21:44:11,478 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-12 21:44:11,479 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-12 21:44:11,481 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-12 21:44:11,481 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-12 21:44:11,482 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-12 21:44:11,482 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-12 21:44:11,482 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2024-11-12 21:44:11,484 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2024-11-12 21:44:11,485 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2024-11-12 21:44:11,485 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2024-11-12 21:44:11,485 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2024-11-12 21:44:11,486 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2024-11-12 21:44:11,486 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-12 21:44:11,486 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2024-11-12 21:44:11,487 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-12 21:44:11,487 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-12 21:44:11,487 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-12 21:44:11,488 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-12 21:44:11,488 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2024-11-12 21:44:11,488 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2024-11-12 21:44:11,489 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2024-11-12 21:44:11,489 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-12 21:44:11,489 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-11-12 21:44:11,490 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-12 21:44:11,490 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-12 21:44:11,490 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2024-11-12 21:44:11,490 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-12 21:44:11,491 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-12 21:44:11,491 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-12 21:44:11,491 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-12 21:44:11,491 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-12 21:44:11,492 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2024-11-12 21:44:11,492 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-11-12 21:44:11,755 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-12 21:44:11,783 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-12 21:44:11,786 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-12 21:44:11,787 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-12 21:44:11,788 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-12 21:44:11,789 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c
[2024-11-12 21:44:13,314 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-12 21:44:13,508 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-12 21:44:13,509 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c
[2024-11-12 21:44:13,519 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a506f99d0/0c683ec6fc1d4c7fb94fedcf7dabe611/FLAG2238b29d9
[2024-11-12 21:44:13,532 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a506f99d0/0c683ec6fc1d4c7fb94fedcf7dabe611
[2024-11-12 21:44:13,535 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-12 21:44:13,536 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-12 21:44:13,538 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-12 21:44:13,538 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-12 21:44:13,544 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-12 21:44:13,545 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:44:13" (1/1) ...
[2024-11-12 21:44:13,546 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@288c46b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13, skipping insertion in model container
[2024-11-12 21:44:13,546 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:44:13" (1/1) ...
[2024-11-12 21:44:13,575 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-12 21:44:13,786 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-12 21:44:13,801 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-12 21:44:13,830 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-12 21:44:13,855 INFO  L204         MainTranslator]: Completed translation
[2024-11-12 21:44:13,856 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13 WrapperNode
[2024-11-12 21:44:13,856 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-12 21:44:13,857 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-12 21:44:13,857 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-12 21:44:13,857 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-12 21:44:13,865 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ...
[2024-11-12 21:44:13,878 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ...
[2024-11-12 21:44:13,902 INFO  L138                Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90
[2024-11-12 21:44:13,904 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-12 21:44:13,905 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-12 21:44:13,905 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-12 21:44:13,905 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-12 21:44:13,917 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ...
[2024-11-12 21:44:13,917 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ...
[2024-11-12 21:44:13,920 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ...
[2024-11-12 21:44:13,943 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-11-12 21:44:13,944 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ...
[2024-11-12 21:44:13,944 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ...
[2024-11-12 21:44:13,954 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ...
[2024-11-12 21:44:13,966 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ...
[2024-11-12 21:44:13,968 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ...
[2024-11-12 21:44:13,969 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ...
[2024-11-12 21:44:13,972 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-12 21:44:13,973 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-12 21:44:13,973 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-12 21:44:13,973 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-12 21:44:13,975 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ...
[2024-11-12 21:44:14,007 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-12 21:44:14,024 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 21:44:14,074 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-12 21:44:14,079 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2024-11-12 21:44:14,131 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-12 21:44:14,132 INFO  L130     BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_28_0
[2024-11-12 21:44:14,132 INFO  L138     BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_28_0
[2024-11-12 21:44:14,132 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-12 21:44:14,132 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-11-12 21:44:14,132 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#2
[2024-11-12 21:44:14,132 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#3
[2024-11-12 21:44:14,132 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#4
[2024-11-12 21:44:14,133 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-11-12 21:44:14,133 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-12 21:44:14,133 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-12 21:44:14,133 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2024-11-12 21:44:14,133 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#3
[2024-11-12 21:44:14,133 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#4
[2024-11-12 21:44:14,135 INFO  L130     BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0
[2024-11-12 21:44:14,135 INFO  L138     BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0
[2024-11-12 21:44:14,135 INFO  L130     BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_28_0
[2024-11-12 21:44:14,135 INFO  L138     BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_28_0
[2024-11-12 21:44:14,135 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-12 21:44:14,136 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-12 21:44:14,136 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-12 21:44:14,136 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-12 21:44:14,136 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#2
[2024-11-12 21:44:14,136 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#3
[2024-11-12 21:44:14,137 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#4
[2024-11-12 21:44:14,137 INFO  L130     BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0
[2024-11-12 21:44:14,137 INFO  L138     BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0
[2024-11-12 21:44:14,138 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-12 21:44:14,244 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-12 21:44:14,246 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-12 21:44:14,555 INFO  L?                        ?]: Removed 15 outVars from TransFormulas that were not future-live.
[2024-11-12 21:44:14,556 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-12 21:44:14,578 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-12 21:44:14,578 INFO  L316             CfgBuilder]: Removed 2 assume(true) statements.
[2024-11-12 21:44:14,579 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:44:14 BoogieIcfgContainer
[2024-11-12 21:44:14,579 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-12 21:44:14,580 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2024-11-12 21:44:14,580 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2024-11-12 21:44:14,584 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2024-11-12 21:44:14,585 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-12 21:44:14,585 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 09:44:13" (1/3) ...
[2024-11-12 21:44:14,586 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a21dcda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:44:14, skipping insertion in model container
[2024-11-12 21:44:14,586 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-12 21:44:14,586 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (2/3) ...
[2024-11-12 21:44:14,587 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a21dcda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:44:14, skipping insertion in model container
[2024-11-12 21:44:14,587 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-12 21:44:14,587 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:44:14" (3/3) ...
[2024-11-12 21:44:14,589 INFO  L332   chiAutomizerObserver]: Analyzing ICFG recursified_nested_6.c
[2024-11-12 21:44:14,645 INFO  L301   stractBuchiCegarLoop]: Interprodecural is true
[2024-11-12 21:44:14,646 INFO  L302   stractBuchiCegarLoop]: Hoare is None
[2024-11-12 21:44:14,646 INFO  L303   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2024-11-12 21:44:14,646 INFO  L304   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2024-11-12 21:44:14,646 INFO  L305   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2024-11-12 21:44:14,646 INFO  L306   stractBuchiCegarLoop]: Difference is false
[2024-11-12 21:44:14,646 INFO  L307   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2024-11-12 21:44:14,647 INFO  L311   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2024-11-12 21:44:14,652 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-11-12 21:44:14,674 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 23
[2024-11-12 21:44:14,675 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-12 21:44:14,675 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-12 21:44:14,681 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-12 21:44:14,681 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-12 21:44:14,681 INFO  L333   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2024-11-12 21:44:14,682 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-11-12 21:44:14,688 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 23
[2024-11-12 21:44:14,688 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-12 21:44:14,688 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-12 21:44:14,688 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-12 21:44:14,689 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-12 21:44:14,697 INFO  L747   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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;" 
[2024-11-12 21:44:14,698 INFO  L749   eck$LassoCheckResult]: Loop: "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" 
[2024-11-12 21:44:14,704 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:44:14,705 INFO  L85        PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times
[2024-11-12 21:44:14,718 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:44:14,719 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274806241]
[2024-11-12 21:44:14,719 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:14,720 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:44:14,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:44:14,842 INFO  L357             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-12 21:44:14,865 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:44:14,890 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-12 21:44:14,893 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:44:14,893 INFO  L85        PathProgramCache]: Analyzing trace with hash 71729, now seen corresponding path program 1 times
[2024-11-12 21:44:14,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:44:14,893 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962875284]
[2024-11-12 21:44:14,893 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:14,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:44:14,903 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:14,956 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 21:44:14,956 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962875284]
[2024-11-12 21:44:14,957 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962875284] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 21:44:14,957 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034422362]
[2024-11-12 21:44:14,957 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:14,957 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 21:44:14,958 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 21:44:14,960 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-12 21:44:14,961 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-12 21:44:15,016 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:15,018 INFO  L256         TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-12 21:44:15,019 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2024-11-12 21:44:15,037 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2024-11-12 21:44:15,048 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034422362] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-12 21:44:15,048 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-12 21:44:15,048 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 3
[2024-11-12 21:44:15,050 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586713047]
[2024-11-12 21:44:15,050 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-12 21:44:15,054 INFO  L764   eck$LassoCheckResult]: loop already infeasible
[2024-11-12 21:44:15,055 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 21:44:15,084 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-12 21:44:15,084 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-12 21:44:15,087 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 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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-11-12 21:44:15,137 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 21:44:15,138 INFO  L93              Difference]: Finished difference Result 50 states and 64 transitions.
[2024-11-12 21:44:15,139 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 64 transitions.
[2024-11-12 21:44:15,142 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 27
[2024-11-12 21:44:15,151 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 37 states and 47 transitions.
[2024-11-12 21:44:15,152 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 37
[2024-11-12 21:44:15,152 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 37
[2024-11-12 21:44:15,153 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions.
[2024-11-12 21:44:15,156 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-12 21:44:15,157 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 37 states and 47 transitions.
[2024-11-12 21:44:15,172 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions.
[2024-11-12 21:44:15,185 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37.
[2024-11-12 21:44:15,186 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 27 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2024-11-12 21:44:15,189 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions.
[2024-11-12 21:44:15,190 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 37 states and 47 transitions.
[2024-11-12 21:44:15,192 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-12 21:44:15,197 INFO  L426   stractBuchiCegarLoop]: Abstraction has 37 states and 47 transitions.
[2024-11-12 21:44:15,197 INFO  L333   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2024-11-12 21:44:15,197 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 47 transitions.
[2024-11-12 21:44:15,200 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 27
[2024-11-12 21:44:15,202 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-12 21:44:15,202 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-12 21:44:15,203 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-12 21:44:15,203 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1]
[2024-11-12 21:44:15,204 INFO  L747   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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;" 
[2024-11-12 21:44:15,204 INFO  L749   eck$LassoCheckResult]: Loop: "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" 
[2024-11-12 21:44:15,205 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:44:15,208 INFO  L85        PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times
[2024-11-12 21:44:15,208 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:44:15,209 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040974794]
[2024-11-12 21:44:15,209 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:15,209 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:44:15,240 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:44:15,240 INFO  L357             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-12 21:44:15,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:44:15,266 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-12 21:44:15,268 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:44:15,271 INFO  L85        PathProgramCache]: Analyzing trace with hash 1059433137, now seen corresponding path program 1 times
[2024-11-12 21:44:15,271 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:44:15,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10594233]
[2024-11-12 21:44:15,272 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:15,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:44:15,300 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:15,614 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:15,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:15,715 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-12 21:44:15,719 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:15,724 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 21:44:15,724 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10594233]
[2024-11-12 21:44:15,725 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10594233] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 21:44:15,725 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090092016]
[2024-11-12 21:44:15,725 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:15,725 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 21:44:15,726 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 21:44:15,744 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-12 21:44:15,746 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-12 21:44:15,818 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:15,819 INFO  L256         TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-12 21:44:15,821 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2024-11-12 21:44:15,908 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2024-11-12 21:44:16,014 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090092016] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-12 21:44:16,015 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-12 21:44:16,015 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12
[2024-11-12 21:44:16,015 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455720808]
[2024-11-12 21:44:16,015 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-12 21:44:16,016 INFO  L764   eck$LassoCheckResult]: loop already infeasible
[2024-11-12 21:44:16,016 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 21:44:16,016 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-12 21:44:16,017 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2024-11-12 21:44:16,017 INFO  L87              Difference]: Start difference. First operand 37 states and 47 transitions. cyclomatic complexity: 15 Second operand  has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6)
[2024-11-12 21:44:16,451 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 21:44:16,451 INFO  L93              Difference]: Finished difference Result 57 states and 74 transitions.
[2024-11-12 21:44:16,452 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 74 transitions.
[2024-11-12 21:44:16,454 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 39
[2024-11-12 21:44:16,464 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 74 transitions.
[2024-11-12 21:44:16,464 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 57
[2024-11-12 21:44:16,465 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 57
[2024-11-12 21:44:16,465 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 57 states and 74 transitions.
[2024-11-12 21:44:16,465 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-12 21:44:16,466 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 57 states and 74 transitions.
[2024-11-12 21:44:16,466 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 57 states and 74 transitions.
[2024-11-12 21:44:16,470 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51.
[2024-11-12 21:44:16,470 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 36 states have internal predecessors, (38), 13 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14)
[2024-11-12 21:44:16,473 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions.
[2024-11-12 21:44:16,473 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 51 states and 65 transitions.
[2024-11-12 21:44:16,474 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2024-11-12 21:44:16,475 INFO  L426   stractBuchiCegarLoop]: Abstraction has 51 states and 65 transitions.
[2024-11-12 21:44:16,475 INFO  L333   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2024-11-12 21:44:16,475 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 65 transitions.
[2024-11-12 21:44:16,476 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 39
[2024-11-12 21:44:16,476 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-12 21:44:16,476 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-12 21:44:16,481 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-12 21:44:16,481 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1]
[2024-11-12 21:44:16,481 INFO  L747   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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;" 
[2024-11-12 21:44:16,482 INFO  L749   eck$LassoCheckResult]: Loop: "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" 
[2024-11-12 21:44:16,482 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:44:16,482 INFO  L85        PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 3 times
[2024-11-12 21:44:16,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:44:16,483 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726912095]
[2024-11-12 21:44:16,483 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:16,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:44:16,503 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:44:16,504 INFO  L357             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-12 21:44:16,510 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:44:16,513 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-12 21:44:16,514 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:44:16,514 INFO  L85        PathProgramCache]: Analyzing trace with hash -1279131801, now seen corresponding path program 1 times
[2024-11-12 21:44:16,514 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:44:16,514 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079048832]
[2024-11-12 21:44:16,514 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:16,515 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:44:16,553 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,097 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:17,106 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,189 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:17,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,239 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:17,241 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,244 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2024-11-12 21:44:17,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,308 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:17,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,348 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:17,351 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,354 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-12 21:44:17,366 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,380 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:17,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,387 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:17,389 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,393 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-12 21:44:17,424 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,432 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:17,439 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,441 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:17,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,452 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-12 21:44:17,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,469 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:17,471 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,475 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:17,477 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,481 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-12 21:44:17,491 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,497 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:17,500 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,503 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:17,507 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,510 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 21:44:17,510 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079048832]
[2024-11-12 21:44:17,511 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079048832] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 21:44:17,511 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7314536]
[2024-11-12 21:44:17,511 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:17,511 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 21:44:17,511 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 21:44:17,513 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-12 21:44:17,516 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-12 21:44:17,774 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:17,780 INFO  L256         TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 14 conjuncts are in the unsatisfiable core
[2024-11-12 21:44:17,785 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2024-11-12 21:44:17,842 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-11-12 21:44:17,915 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2024-11-12 21:44:18,168 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [7314536] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-12 21:44:18,169 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-12 21:44:18,169 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14
[2024-11-12 21:44:18,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647435579]
[2024-11-12 21:44:18,169 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-12 21:44:18,170 INFO  L764   eck$LassoCheckResult]: loop already infeasible
[2024-11-12 21:44:18,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 21:44:18,170 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-12 21:44:18,171 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182
[2024-11-12 21:44:18,171 INFO  L87              Difference]: Start difference. First operand 51 states and 65 transitions. cyclomatic complexity: 19 Second operand  has 14 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 4 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 2 states have call predecessors, (11), 4 states have call successors, (11)
[2024-11-12 21:44:18,412 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 21:44:18,412 INFO  L93              Difference]: Finished difference Result 57 states and 73 transitions.
[2024-11-12 21:44:18,412 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 73 transitions.
[2024-11-12 21:44:18,414 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 39
[2024-11-12 21:44:18,418 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 73 transitions.
[2024-11-12 21:44:18,418 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 57
[2024-11-12 21:44:18,418 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 57
[2024-11-12 21:44:18,419 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 57 states and 73 transitions.
[2024-11-12 21:44:18,419 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-12 21:44:18,419 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 57 states and 73 transitions.
[2024-11-12 21:44:18,419 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 57 states and 73 transitions.
[2024-11-12 21:44:18,427 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53.
[2024-11-12 21:44:18,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 53 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 37 states have internal predecessors, (39), 13 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15)
[2024-11-12 21:44:18,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions.
[2024-11-12 21:44:18,429 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 53 states and 67 transitions.
[2024-11-12 21:44:18,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-12 21:44:18,431 INFO  L426   stractBuchiCegarLoop]: Abstraction has 53 states and 67 transitions.
[2024-11-12 21:44:18,431 INFO  L333   stractBuchiCegarLoop]: ======== Iteration 4 ============
[2024-11-12 21:44:18,431 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 67 transitions.
[2024-11-12 21:44:18,432 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 39
[2024-11-12 21:44:18,432 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-12 21:44:18,433 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-12 21:44:18,437 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-12 21:44:18,438 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1]
[2024-11-12 21:44:18,438 INFO  L747   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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;" 
[2024-11-12 21:44:18,438 INFO  L749   eck$LassoCheckResult]: Loop: "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" 
[2024-11-12 21:44:18,440 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:44:18,441 INFO  L85        PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 4 times
[2024-11-12 21:44:18,441 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:44:18,441 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153469733]
[2024-11-12 21:44:18,441 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:18,442 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:44:18,451 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:44:18,453 INFO  L357             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-12 21:44:18,456 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:44:18,458 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-12 21:44:18,459 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:44:18,459 INFO  L85        PathProgramCache]: Analyzing trace with hash 2041173201, now seen corresponding path program 1 times
[2024-11-12 21:44:18,459 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:44:18,459 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543864552]
[2024-11-12 21:44:18,459 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:18,460 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:44:18,496 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:18,974 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:18,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,075 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:19,081 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,139 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:19,141 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,193 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:19,195 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,197 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-12 21:44:19,198 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,200 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31
[2024-11-12 21:44:19,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,269 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:19,277 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,324 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:19,326 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,349 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:19,351 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,353 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-12 21:44:19,354 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,357 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-12 21:44:19,365 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,379 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:19,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,387 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:19,388 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,390 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:19,391 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,393 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-12 21:44:19,396 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,398 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-12 21:44:19,411 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,517 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:19,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,571 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:19,573 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,598 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:19,601 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,603 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-12 21:44:19,605 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,609 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-12 21:44:19,619 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,628 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:19,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,643 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:19,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,646 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:19,648 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,649 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-12 21:44:19,651 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,652 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147
[2024-11-12 21:44:19,660 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,668 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:19,673 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,677 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:19,679 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,681 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:19,683 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,686 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-12 21:44:19,687 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:19,690 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 21:44:19,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543864552]
[2024-11-12 21:44:19,690 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543864552] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 21:44:19,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967882203]
[2024-11-12 21:44:19,691 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:19,691 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 21:44:19,691 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 21:44:19,693 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-12 21:44:19,694 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-12 21:44:20,032 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:20,041 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 35 conjuncts are in the unsatisfiable core
[2024-11-12 21:44:20,058 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2024-11-12 21:44:20,070 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2024-11-12 21:44:20,266 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2024-11-12 21:44:20,901 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967882203] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-12 21:44:20,902 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-12 21:44:20,902 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 23
[2024-11-12 21:44:20,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048275612]
[2024-11-12 21:44:20,902 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-12 21:44:20,903 INFO  L764   eck$LassoCheckResult]: loop already infeasible
[2024-11-12 21:44:20,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 21:44:20,904 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2024-11-12 21:44:20,904 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506
[2024-11-12 21:44:20,905 INFO  L87              Difference]: Start difference. First operand 53 states and 67 transitions. cyclomatic complexity: 19 Second operand  has 23 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 9 states have call successors, (26), 8 states have call predecessors, (26), 7 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22)
[2024-11-12 21:44:21,378 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 21:44:21,379 INFO  L93              Difference]: Finished difference Result 59 states and 74 transitions.
[2024-11-12 21:44:21,379 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 74 transitions.
[2024-11-12 21:44:21,382 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 39
[2024-11-12 21:44:21,385 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 74 transitions.
[2024-11-12 21:44:21,386 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 59
[2024-11-12 21:44:21,387 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 59
[2024-11-12 21:44:21,387 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 59 states and 74 transitions.
[2024-11-12 21:44:21,388 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-12 21:44:21,388 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 59 states and 74 transitions.
[2024-11-12 21:44:21,390 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59 states and 74 transitions.
[2024-11-12 21:44:21,395 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57.
[2024-11-12 21:44:21,397 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 57 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 39 states have internal predecessors, (41), 13 states have call successors, (13), 4 states have call predecessors, (13), 8 states have return successors, (17), 14 states have call predecessors, (17), 13 states have call successors, (17)
[2024-11-12 21:44:21,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions.
[2024-11-12 21:44:21,398 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 57 states and 71 transitions.
[2024-11-12 21:44:21,400 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-11-12 21:44:21,401 INFO  L426   stractBuchiCegarLoop]: Abstraction has 57 states and 71 transitions.
[2024-11-12 21:44:21,401 INFO  L333   stractBuchiCegarLoop]: ======== Iteration 5 ============
[2024-11-12 21:44:21,401 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 71 transitions.
[2024-11-12 21:44:21,402 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 39
[2024-11-12 21:44:21,402 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-12 21:44:21,402 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-12 21:44:21,411 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-12 21:44:21,412 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1]
[2024-11-12 21:44:21,412 INFO  L747   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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;" 
[2024-11-12 21:44:21,412 INFO  L749   eck$LassoCheckResult]: Loop: "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" 
[2024-11-12 21:44:21,413 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:44:21,414 INFO  L85        PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 5 times
[2024-11-12 21:44:21,414 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:44:21,414 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849660563]
[2024-11-12 21:44:21,414 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:21,414 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:44:21,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:44:21,427 INFO  L357             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-12 21:44:21,431 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:44:21,433 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-12 21:44:21,434 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:44:21,434 INFO  L85        PathProgramCache]: Analyzing trace with hash 1291761457, now seen corresponding path program 1 times
[2024-11-12 21:44:21,434 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:44:21,434 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75517744]
[2024-11-12 21:44:21,434 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:21,435 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:44:21,501 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:22,429 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:22,445 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:22,620 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:22,629 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:22,709 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:22,715 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:22,763 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:22,765 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:22,797 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:22,799 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:22,801 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-12 21:44:22,803 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:22,805 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-12 21:44:22,814 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:22,823 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:22,827 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:22,834 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:22,837 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:22,840 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:22,842 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:22,843 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:22,844 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:22,846 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-12 21:44:22,847 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:22,848 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-12 21:44:22,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:22,852 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-12 21:44:22,864 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,007 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,016 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,065 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,069 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,103 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,146 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:23,148 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,149 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-12 21:44:23,151 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,152 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-12 21:44:23,160 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,168 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,173 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,178 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,181 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,183 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,184 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,185 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:23,186 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,188 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-12 21:44:23,189 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,190 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-12 21:44:23,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,193 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148
[2024-11-12 21:44:23,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,224 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,234 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,236 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,239 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,240 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,241 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:23,242 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,243 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-12 21:44:23,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,246 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-12 21:44:23,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,259 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,264 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,270 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,276 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,277 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,278 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:23,279 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,280 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-12 21:44:23,281 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,282 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-12 21:44:23,283 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,285 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221
[2024-11-12 21:44:23,298 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,312 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,316 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,322 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,328 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,329 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,330 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:23,330 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,332 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-12 21:44:23,333 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,334 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-12 21:44:23,342 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,351 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,361 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,368 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,369 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,370 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:23,371 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,373 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-12 21:44:23,374 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,375 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-12 21:44:23,377 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,378 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294
[2024-11-12 21:44:23,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,409 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,414 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,420 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,423 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,426 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,428 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:23,428 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,430 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-12 21:44:23,431 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,432 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-12 21:44:23,438 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,445 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,449 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,455 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,457 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,459 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,460 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,461 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:23,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,463 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-12 21:44:23,464 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,465 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-12 21:44:23,467 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,468 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367
[2024-11-12 21:44:23,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,498 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,502 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,508 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,514 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,517 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:23,518 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,519 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-12 21:44:23,520 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,521 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-12 21:44:23,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,535 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,546 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,548 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,552 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:23,553 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,554 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-12 21:44:23,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,556 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-12 21:44:23,557 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,559 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-12 21:44:23,560 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:23,562 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 21:44:23,563 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75517744]
[2024-11-12 21:44:23,563 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75517744] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 21:44:23,563 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050672475]
[2024-11-12 21:44:23,563 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:23,563 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 21:44:23,564 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 21:44:23,565 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-12 21:44:23,567 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-12 21:44:24,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:24,275 INFO  L256         TraceCheckSpWp]: Trace formula consists of 3392 conjuncts, 27 conjuncts are in the unsatisfiable core
[2024-11-12 21:44:24,288 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2024-11-12 21:44:24,298 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-11-12 21:44:24,493 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2024-11-12 21:44:25,811 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050672475] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-12 21:44:25,812 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-12 21:44:25,812 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24
[2024-11-12 21:44:25,812 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120208997]
[2024-11-12 21:44:25,813 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-12 21:44:25,814 INFO  L764   eck$LassoCheckResult]: loop already infeasible
[2024-11-12 21:44:25,814 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 21:44:25,815 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-11-12 21:44:25,815 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552
[2024-11-12 21:44:25,816 INFO  L87              Difference]: Start difference. First operand 57 states and 71 transitions. cyclomatic complexity: 19 Second operand  has 24 states, 19 states have (on average 3.473684210526316) internal successors, (66), 17 states have internal predecessors, (66), 9 states have call successors, (35), 9 states have call predecessors, (35), 7 states have return successors, (28), 6 states have call predecessors, (28), 9 states have call successors, (28)
[2024-11-12 21:44:26,145 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 21:44:26,146 INFO  L93              Difference]: Finished difference Result 61 states and 75 transitions.
[2024-11-12 21:44:26,146 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 75 transitions.
[2024-11-12 21:44:26,149 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 39
[2024-11-12 21:44:26,151 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 75 transitions.
[2024-11-12 21:44:26,154 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 61
[2024-11-12 21:44:26,155 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 61
[2024-11-12 21:44:26,155 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 61 states and 75 transitions.
[2024-11-12 21:44:26,156 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-12 21:44:26,156 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 61 states and 75 transitions.
[2024-11-12 21:44:26,156 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61 states and 75 transitions.
[2024-11-12 21:44:26,159 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61.
[2024-11-12 21:44:26,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 61 states, 38 states have (on average 1.131578947368421) internal successors, (43), 41 states have internal predecessors, (43), 13 states have call successors, (13), 4 states have call predecessors, (13), 10 states have return successors, (19), 15 states have call predecessors, (19), 13 states have call successors, (19)
[2024-11-12 21:44:26,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions.
[2024-11-12 21:44:26,165 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 61 states and 75 transitions.
[2024-11-12 21:44:26,166 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-11-12 21:44:26,167 INFO  L426   stractBuchiCegarLoop]: Abstraction has 61 states and 75 transitions.
[2024-11-12 21:44:26,167 INFO  L333   stractBuchiCegarLoop]: ======== Iteration 6 ============
[2024-11-12 21:44:26,167 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 75 transitions.
[2024-11-12 21:44:26,168 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 39
[2024-11-12 21:44:26,168 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-12 21:44:26,168 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-12 21:44:26,178 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-12 21:44:26,180 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [48, 48, 36, 36, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1]
[2024-11-12 21:44:26,180 INFO  L747   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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;" 
[2024-11-12 21:44:26,181 INFO  L749   eck$LassoCheckResult]: Loop: "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" 
[2024-11-12 21:44:26,181 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:44:26,182 INFO  L85        PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 6 times
[2024-11-12 21:44:26,183 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:44:26,183 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325316710]
[2024-11-12 21:44:26,183 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:26,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:44:26,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:44:26,192 INFO  L357             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-12 21:44:26,195 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:44:26,198 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-12 21:44:26,199 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:44:26,199 INFO  L85        PathProgramCache]: Analyzing trace with hash 1945603185, now seen corresponding path program 1 times
[2024-11-12 21:44:26,199 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:44:26,199 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343474980]
[2024-11-12 21:44:26,199 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:26,200 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:44:26,500 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:29,703 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:29,749 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,108 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,120 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,343 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,351 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,532 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,534 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,539 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,541 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:30,546 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,612 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,732 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,734 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,784 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:30,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,787 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-12 21:44:30,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,791 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-12 21:44:30,801 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,812 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,825 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,831 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,837 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,839 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,841 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,842 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,843 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:30,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,850 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,852 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,854 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,854 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,856 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:30,857 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,859 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-12 21:44:30,860 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,861 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-12 21:44:30,863 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,867 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117
[2024-11-12 21:44:30,889 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,909 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,916 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,923 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,934 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,938 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,939 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,941 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:30,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,947 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,951 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,952 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,953 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:30,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,956 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-12 21:44:30,957 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,959 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-12 21:44:30,967 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,977 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:30,991 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:30,996 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,002 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,006 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,007 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,008 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:31,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,015 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,019 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,021 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,022 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:31,023 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,025 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-12 21:44:31,026 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,027 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-12 21:44:31,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,030 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232
[2024-11-12 21:44:31,051 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,074 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,080 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,088 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,099 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,103 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,104 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,106 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:31,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,113 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,115 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,117 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,118 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,119 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:31,120 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,121 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-12 21:44:31,123 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,124 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-12 21:44:31,132 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,143 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,150 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,158 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,163 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,176 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,181 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,182 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,184 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:31,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,192 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,196 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,198 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:31,199 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,201 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-12 21:44:31,202 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,204 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-12 21:44:31,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,208 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347
[2024-11-12 21:44:31,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,247 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,254 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,262 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,267 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,273 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,275 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,277 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,278 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,280 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:31,283 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,287 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,289 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,292 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,293 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,294 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:31,296 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,297 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-12 21:44:31,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,300 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-12 21:44:31,308 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,320 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,327 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,336 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,342 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,348 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,352 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,354 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,357 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:31,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,364 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,366 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,368 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,369 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,370 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:31,372 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,373 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-12 21:44:31,374 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,376 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-12 21:44:31,378 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,380 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 462
[2024-11-12 21:44:31,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,463 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,469 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,478 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,482 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,489 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,490 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,492 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,495 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:31,498 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,501 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,503 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,506 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,507 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,508 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:31,509 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,511 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-12 21:44:31,512 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,513 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-12 21:44:31,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,532 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,538 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,545 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,550 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,557 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,558 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,560 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,561 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,564 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:31,567 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,572 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,574 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,576 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,577 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,579 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:31,580 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,581 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-12 21:44:31,583 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,585 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-12 21:44:31,587 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,589 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 577
[2024-11-12 21:44:31,611 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,631 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,637 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,646 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,651 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,657 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,658 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,660 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,662 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,667 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:31,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,675 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,679 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,680 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,681 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:31,682 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,683 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-12 21:44:31,684 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,687 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-12 21:44:31,695 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,705 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,711 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,722 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,727 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,734 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,736 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,738 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,739 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,740 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:31,743 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,747 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,748 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,752 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:31,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,754 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-11-12 21:44:31,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,756 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-12 21:44:31,758 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,759 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-12 21:44:31,760 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:31,762 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 21:44:31,763 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343474980]
[2024-11-12 21:44:31,763 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343474980] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 21:44:31,763 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793732000]
[2024-11-12 21:44:31,763 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:31,763 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 21:44:31,763 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 21:44:31,765 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-12 21:44:31,767 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-12 21:44:32,715 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:32,746 INFO  L256         TraceCheckSpWp]: Trace formula consists of 4808 conjuncts, 68 conjuncts are in the unsatisfiable core
[2024-11-12 21:44:32,762 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2024-11-12 21:44:32,799 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-11-12 21:44:33,131 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2024-11-12 21:44:35,549 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [793732000] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-12 21:44:35,549 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-12 21:44:35,550 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 14] total 38
[2024-11-12 21:44:35,552 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229676228]
[2024-11-12 21:44:35,552 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-12 21:44:35,553 INFO  L764   eck$LassoCheckResult]: loop already infeasible
[2024-11-12 21:44:35,554 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 21:44:35,554 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2024-11-12 21:44:35,555 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1226, Unknown=0, NotChecked=0, Total=1406
[2024-11-12 21:44:35,556 INFO  L87              Difference]: Start difference. First operand 61 states and 75 transitions. cyclomatic complexity: 19 Second operand  has 38 states, 29 states have (on average 2.896551724137931) internal successors, (84), 30 states have internal predecessors, (84), 16 states have call successors, (45), 10 states have call predecessors, (45), 11 states have return successors, (36), 12 states have call predecessors, (36), 16 states have call successors, (36)
[2024-11-12 21:44:36,210 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 21:44:36,211 INFO  L93              Difference]: Finished difference Result 67 states and 81 transitions.
[2024-11-12 21:44:36,211 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 81 transitions.
[2024-11-12 21:44:36,213 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 39
[2024-11-12 21:44:36,215 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 81 transitions.
[2024-11-12 21:44:36,215 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 67
[2024-11-12 21:44:36,215 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 67
[2024-11-12 21:44:36,215 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 67 states and 81 transitions.
[2024-11-12 21:44:36,219 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-12 21:44:36,219 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 67 states and 81 transitions.
[2024-11-12 21:44:36,219 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 67 states and 81 transitions.
[2024-11-12 21:44:36,225 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67.
[2024-11-12 21:44:36,225 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-11-12 21:44:36,226 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions.
[2024-11-12 21:44:36,226 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 67 states and 81 transitions.
[2024-11-12 21:44:36,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2024-11-12 21:44:36,227 INFO  L426   stractBuchiCegarLoop]: Abstraction has 67 states and 81 transitions.
[2024-11-12 21:44:36,227 INFO  L333   stractBuchiCegarLoop]: ======== Iteration 7 ============
[2024-11-12 21:44:36,227 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 81 transitions.
[2024-11-12 21:44:36,228 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 39
[2024-11-12 21:44:36,228 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-12 21:44:36,228 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-12 21:44:36,238 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-12 21:44:36,238 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [144, 144, 96, 96, 96, 60, 60, 48, 48, 48, 48, 48, 48, 48, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1]
[2024-11-12 21:44:36,238 INFO  L747   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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;" 
[2024-11-12 21:44:36,239 INFO  L749   eck$LassoCheckResult]: Loop: "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" 
[2024-11-12 21:44:36,243 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:44:36,243 INFO  L85        PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 7 times
[2024-11-12 21:44:36,244 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:44:36,244 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409108616]
[2024-11-12 21:44:36,244 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:36,244 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:44:36,253 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:44:36,253 INFO  L357             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-12 21:44:36,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:44:36,259 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-12 21:44:36,260 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:44:36,260 INFO  L85        PathProgramCache]: Analyzing trace with hash 1859450993, now seen corresponding path program 2 times
[2024-11-12 21:44:36,260 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:44:36,261 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073932298]
[2024-11-12 21:44:36,261 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:36,261 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:44:36,809 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,612 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,634 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,673 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,684 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,702 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,726 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,730 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,731 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,733 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,734 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,735 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:43,741 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,750 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,752 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,754 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,757 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,758 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,759 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:43,764 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,770 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,778 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,781 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,782 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,783 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:43,786 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,789 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,791 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,793 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,795 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,796 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,797 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,798 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:43,799 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,801 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-12 21:44:43,802 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,803 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-12 21:44:43,815 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,831 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,857 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,879 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,882 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,884 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,886 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,888 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,889 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,891 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:43,898 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,906 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,912 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,913 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,915 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,916 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,917 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:43,922 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,929 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,931 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,934 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,935 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,937 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,938 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,939 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:43,943 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,947 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,952 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,956 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:43,957 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,958 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:43,960 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,961 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-12 21:44:43,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,964 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-12 21:44:43,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:43,967 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221
[2024-11-12 21:44:44,023 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:44,786 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:44,811 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:45,420 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:45,436 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:45,955 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:45,958 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:45,965 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:45,967 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:45,968 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:45,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:45,971 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:45,984 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,231 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,235 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,353 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,447 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,449 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,488 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:46,495 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,502 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,504 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,506 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,508 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,510 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,510 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,511 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:46,514 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,520 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,527 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,530 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,531 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,532 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:46,533 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,534 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-12 21:44:46,535 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,537 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-12 21:44:46,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,571 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,582 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,595 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,605 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,617 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,622 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,624 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,626 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,626 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,628 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:46,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,643 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,645 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,648 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,650 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,651 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,654 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:46,659 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,665 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,667 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,669 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,673 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,674 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,675 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:46,678 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,681 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,684 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,686 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,688 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,690 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,691 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:46,692 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,694 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-12 21:44:46,695 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,696 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-12 21:44:46,697 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,698 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 440
[2024-11-12 21:44:46,729 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,761 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,771 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,784 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,795 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,806 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,809 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,815 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,819 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,820 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,821 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:46,828 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,837 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,840 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,842 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,844 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,846 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,847 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,849 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:46,855 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,861 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,864 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,867 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,869 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,871 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,872 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,873 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:46,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,881 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,883 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,885 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,887 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,888 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,889 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,890 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:46,892 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,893 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-12 21:44:46,894 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,896 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-12 21:44:46,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,924 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,950 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,974 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,980 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,985 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:46,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:46,987 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:46,996 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,009 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,012 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,015 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,019 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,020 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,022 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,028 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,035 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,038 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,041 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,043 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,045 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,047 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,049 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,059 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,062 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,065 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,067 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,069 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,071 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,072 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,073 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,074 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-12 21:44:47,076 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,077 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-12 21:44:47,079 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,083 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 659
[2024-11-12 21:44:47,119 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,153 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,164 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,174 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,185 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,197 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,200 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,202 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,204 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,206 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,209 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,230 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,244 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,247 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,250 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,254 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,256 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,263 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,270 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,274 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,277 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,279 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,281 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,283 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,284 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,289 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,294 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,300 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,305 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,308 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,311 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-12 21:44:47,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,314 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-12 21:44:47,327 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,342 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,371 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,397 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,400 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,403 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,405 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,408 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,409 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,411 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,420 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,431 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,435 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,438 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,440 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,443 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,444 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,446 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,453 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,461 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,464 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,467 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,470 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,472 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,474 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,475 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,480 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,484 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,488 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,491 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,496 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,497 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,498 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,500 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,502 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-12 21:44:47,503 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,505 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-12 21:44:47,506 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,508 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 878
[2024-11-12 21:44:47,545 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,577 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,664 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,679 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,688 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,703 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,706 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,709 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,711 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,713 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,714 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,715 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,723 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,735 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,737 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,739 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,741 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,742 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,743 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,744 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,749 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,754 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,756 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,758 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,760 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,761 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,762 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,764 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,773 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,778 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,782 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,784 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,787 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-12 21:44:47,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,789 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-12 21:44:47,804 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,824 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,839 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,856 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,868 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,879 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,881 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,883 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,887 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,889 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,896 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,904 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,907 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,910 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,912 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,914 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,915 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,916 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,921 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,928 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,931 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,934 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,939 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,940 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,942 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,946 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,952 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,957 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,960 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,962 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:47,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,965 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:47,966 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,968 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-12 21:44:47,969 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,971 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-12 21:44:47,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:47,975 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1097
[2024-11-12 21:44:48,016 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,045 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,058 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,076 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,088 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,103 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,108 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,110 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,111 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,112 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,113 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:48,121 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,130 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,133 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,135 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,137 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,139 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,139 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,141 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:48,147 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,153 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,156 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,158 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,160 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,162 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,163 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,164 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:48,168 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,172 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,177 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,179 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,181 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,182 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,183 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:48,184 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,185 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-12 21:44:48,186 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,188 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-12 21:44:48,201 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,216 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,245 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,267 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,270 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,272 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,274 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,276 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,277 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,279 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:48,288 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,297 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,302 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,304 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,306 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,308 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:48,314 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,321 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,328 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,330 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,331 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,332 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,333 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:48,337 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,341 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,347 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,350 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,352 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:48,353 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,354 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-12 21:44:48,355 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,356 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-12 21:44:48,357 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,358 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-11-12 21:44:48,359 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:48,363 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 21:44:48,364 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073932298]
[2024-11-12 21:44:48,364 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073932298] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 21:44:48,364 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696354507]
[2024-11-12 21:44:48,364 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-12 21:44:48,364 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 21:44:48,364 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 21:44:48,367 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-12 21:44:48,369 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-12 21:44:49,008 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-12 21:44:49,009 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2024-11-12 21:44:49,009 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19
[2024-11-12 21:44:49,009 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218791961]
[2024-11-12 21:44:49,009 INFO  L85    oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2024-11-12 21:44:49,010 INFO  L764   eck$LassoCheckResult]: loop already infeasible
[2024-11-12 21:44:49,010 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 21:44:49,011 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2024-11-12 21:44:49,011 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342
[2024-11-12 21:44:49,011 INFO  L87              Difference]: Start difference. First operand 67 states and 81 transitions. cyclomatic complexity: 19 Second operand  has 19 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 8 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (20), 6 states have call predecessors, (20), 8 states have call successors, (20)
[2024-11-12 21:44:49,380 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 21:44:49,381 INFO  L93              Difference]: Finished difference Result 69 states and 83 transitions.
[2024-11-12 21:44:49,381 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 83 transitions.
[2024-11-12 21:44:49,382 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 39
[2024-11-12 21:44:49,386 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 83 transitions.
[2024-11-12 21:44:49,386 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 69
[2024-11-12 21:44:49,387 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 69
[2024-11-12 21:44:49,387 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 69 states and 83 transitions.
[2024-11-12 21:44:49,387 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-12 21:44:49,387 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 69 states and 83 transitions.
[2024-11-12 21:44:49,388 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 69 states and 83 transitions.
[2024-11-12 21:44:49,393 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69.
[2024-11-12 21:44:49,394 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 69 states, 42 states have (on average 1.119047619047619) internal successors, (47), 45 states have internal predecessors, (47), 13 states have call successors, (13), 4 states have call predecessors, (13), 14 states have return successors, (23), 19 states have call predecessors, (23), 13 states have call successors, (23)
[2024-11-12 21:44:49,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions.
[2024-11-12 21:44:49,399 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 69 states and 83 transitions.
[2024-11-12 21:44:49,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-11-12 21:44:49,400 INFO  L426   stractBuchiCegarLoop]: Abstraction has 69 states and 83 transitions.
[2024-11-12 21:44:49,400 INFO  L333   stractBuchiCegarLoop]: ======== Iteration 8 ============
[2024-11-12 21:44:49,404 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 83 transitions.
[2024-11-12 21:44:49,405 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 39
[2024-11-12 21:44:49,405 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-12 21:44:49,405 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-12 21:44:49,413 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-12 21:44:49,414 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [192, 192, 144, 144, 144, 60, 60, 48, 48, 48, 48, 48, 48, 48, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1]
[2024-11-12 21:44:49,414 INFO  L747   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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;" 
[2024-11-12 21:44:49,415 INFO  L749   eck$LassoCheckResult]: Loop: "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" 
[2024-11-12 21:44:49,418 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:44:49,418 INFO  L85        PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 8 times
[2024-11-12 21:44:49,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:44:49,419 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593308741]
[2024-11-12 21:44:49,420 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:49,420 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:44:49,432 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:44:49,433 INFO  L357             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-12 21:44:49,435 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:44:49,444 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-12 21:44:49,445 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:44:49,445 INFO  L85        PathProgramCache]: Analyzing trace with hash -594918031, now seen corresponding path program 3 times
[2024-11-12 21:44:49,445 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:44:49,445 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571297335]
[2024-11-12 21:44:49,446 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:44:49,446 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:44:49,869 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:56,199 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:56,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:57,541 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:57,559 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:57,968 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:57,982 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:58,410 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:58,413 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:58,421 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:58,423 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:58,425 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:58,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:58,428 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:58,429 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:58,430 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:44:58,445 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:58,776 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:58,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:58,923 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:58,926 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,039 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,042 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,104 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,152 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:44:59,161 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,168 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,170 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,173 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,175 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,177 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,180 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,181 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,182 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:44:59,186 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,191 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,194 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,197 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,199 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,201 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,204 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,206 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:44:59,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,208 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-11-12 21:44:59,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,211 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-12 21:44:59,232 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,247 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,257 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,267 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,276 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,285 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,287 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,290 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,291 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,293 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,296 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,296 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,297 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:44:59,304 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,311 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,315 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,318 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,319 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,320 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,321 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,322 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:44:59,326 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,331 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,334 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,336 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,341 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,342 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,344 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,345 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:44:59,348 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,351 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,353 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,355 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,357 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,359 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,361 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,361 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,362 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:44:59,363 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,363 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-11-12 21:44:59,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,365 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-12 21:44:59,366 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,367 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261
[2024-11-12 21:44:59,407 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,443 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,455 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,470 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,496 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,499 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,502 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,505 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,507 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,509 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,511 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,512 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,513 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:44:59,522 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,533 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,540 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,543 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,545 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,547 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,548 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,549 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,550 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:44:59,557 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,564 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,568 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,571 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,573 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,576 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,577 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,579 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,580 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,581 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:44:59,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,590 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,593 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,597 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,599 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,602 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,604 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,606 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,607 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,608 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:44:59,609 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,610 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-11-12 21:44:59,612 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,613 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-12 21:44:59,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,645 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,658 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,675 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,688 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,704 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,707 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,711 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,714 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,716 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,718 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,720 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,721 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,723 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:44:59,732 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,759 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,763 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,766 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,769 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,772 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,777 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,779 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:44:59,787 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,798 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,801 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,805 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,808 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,811 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,813 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,816 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,818 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:44:59,823 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,828 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,832 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,836 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,839 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,841 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,843 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,845 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,847 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:44:59,848 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,849 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-11-12 21:44:59,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,851 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-12 21:44:59,852 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,853 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 520
[2024-11-12 21:44:59,898 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,936 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,950 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,967 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,979 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:44:59,993 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:44:59,997 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,001 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,007 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,010 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,012 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,013 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,015 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:00,025 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,036 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,040 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,044 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,048 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,051 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,053 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,055 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,058 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:00,066 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,074 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,078 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,082 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,086 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,089 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,094 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,097 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:00,102 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,108 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,112 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,115 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,120 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,122 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,124 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,126 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:00,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,128 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-11-12 21:45:00,128 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,129 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-12 21:45:00,142 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,157 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,169 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,181 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,204 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,211 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,214 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,216 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,219 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,221 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,222 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,223 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:00,235 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,247 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,254 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,257 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,259 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,262 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,265 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,268 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:00,277 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,285 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,290 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,294 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,300 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,302 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,304 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,306 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:00,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,315 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,319 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,322 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,325 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,328 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,330 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,332 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,333 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,334 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:00,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,336 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-11-12 21:45:00,337 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,338 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-12 21:45:00,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,340 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 779
[2024-11-12 21:45:00,374 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,403 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,430 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,442 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,459 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,463 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,468 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,472 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,475 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,480 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,482 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,484 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:00,495 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,508 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,513 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,519 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,526 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,529 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,531 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,533 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,534 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:00,543 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,552 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,557 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,562 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,565 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,568 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,575 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,577 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,579 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:00,585 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,591 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,596 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,601 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,606 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,609 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,612 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,615 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,617 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,619 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:00,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,622 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-11-12 21:45:00,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,625 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-12 21:45:00,641 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,660 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,675 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,688 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,701 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,713 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,717 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,721 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,724 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,727 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,730 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,732 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,733 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,735 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:00,745 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,755 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,759 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,763 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,766 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,769 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,773 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,776 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:00,784 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,791 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,796 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,799 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,803 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,806 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,808 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,811 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,812 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,814 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:00,820 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,825 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,830 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,833 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,837 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,840 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,843 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,846 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,847 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,849 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:00,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,851 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-11-12 21:45:00,852 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,853 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-12 21:45:00,854 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,855 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1038
[2024-11-12 21:45:00,891 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,920 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,933 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,946 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,960 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,972 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:00,980 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:00,984 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,014 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,019 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,021 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,023 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:01,035 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,045 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,050 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,054 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,061 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,064 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,066 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,067 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,069 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:01,077 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,085 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,090 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,094 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,098 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,102 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,107 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,108 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,110 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:01,116 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,121 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,130 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,134 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,138 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,141 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,144 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,145 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,147 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:01,148 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,150 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-11-12 21:45:01,151 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,152 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-12 21:45:01,170 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,191 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,222 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,236 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,249 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,259 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,263 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,266 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,272 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,274 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,275 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:01,289 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,304 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,310 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,315 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,321 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,325 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,329 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,332 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,334 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,335 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:01,346 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,356 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,367 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,372 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,377 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,380 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,383 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,385 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,387 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:01,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,402 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,408 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,413 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,423 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,426 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,429 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,432 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,433 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:01,435 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,437 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-11-12 21:45:01,439 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,441 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-12 21:45:01,442 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,444 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1297
[2024-11-12 21:45:01,490 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,522 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,550 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,565 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,578 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,583 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,588 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,592 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,595 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,599 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,601 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,603 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,604 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:01,617 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,628 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,637 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,642 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,645 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,649 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,651 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,653 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,654 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:01,664 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,673 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,678 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,683 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,687 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,691 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,694 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,697 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,699 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,701 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:01,708 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,713 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,719 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,723 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,732 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,738 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,740 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,742 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:01,744 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,745 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-11-12 21:45:01,747 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,748 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-12 21:45:01,764 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,785 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,804 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,821 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,852 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,858 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,863 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,868 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,871 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,875 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,878 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,880 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,881 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:01,894 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,906 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,912 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,916 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,922 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,925 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,929 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,932 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,936 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:01,947 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,957 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,967 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,975 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,979 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,982 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:01,984 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,985 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:01,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:01,997 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:02,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:02,008 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:02,013 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:02,017 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:02,020 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:02,023 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:02,025 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:02,027 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-12 21:45:02,028 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:02,030 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2024-11-12 21:45:02,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:02,032 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-12 21:45:02,033 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:02,035 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 21:45:02,035 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571297335]
[2024-11-12 21:45:02,035 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571297335] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 21:45:02,035 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288129411]
[2024-11-12 21:45:02,036 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-12 21:45:02,036 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 21:45:02,036 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 21:45:02,040 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-12 21:45:02,040 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-11-12 21:45:02,818 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-12 21:45:02,818 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2024-11-12 21:45:02,818 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20
[2024-11-12 21:45:02,818 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625405675]
[2024-11-12 21:45:02,819 INFO  L85    oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2024-11-12 21:45:02,819 INFO  L764   eck$LassoCheckResult]: loop already infeasible
[2024-11-12 21:45:02,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 21:45:02,820 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2024-11-12 21:45:02,820 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380
[2024-11-12 21:45:02,821 INFO  L87              Difference]: Start difference. First operand 69 states and 83 transitions. cyclomatic complexity: 19 Second operand  has 20 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 8 states have call successors, (18), 4 states have call predecessors, (18), 7 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20)
[2024-11-12 21:45:03,249 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 21:45:03,250 INFO  L93              Difference]: Finished difference Result 71 states and 85 transitions.
[2024-11-12 21:45:03,250 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 85 transitions.
[2024-11-12 21:45:03,251 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 39
[2024-11-12 21:45:03,252 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 85 transitions.
[2024-11-12 21:45:03,253 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 71
[2024-11-12 21:45:03,253 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 71
[2024-11-12 21:45:03,253 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 71 states and 85 transitions.
[2024-11-12 21:45:03,253 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-12 21:45:03,253 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 71 states and 85 transitions.
[2024-11-12 21:45:03,254 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 71 states and 85 transitions.
[2024-11-12 21:45:03,257 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71.
[2024-11-12 21:45:03,257 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-11-12 21:45:03,258 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions.
[2024-11-12 21:45:03,258 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 71 states and 85 transitions.
[2024-11-12 21:45:03,262 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-11-12 21:45:03,263 INFO  L426   stractBuchiCegarLoop]: Abstraction has 71 states and 85 transitions.
[2024-11-12 21:45:03,263 INFO  L333   stractBuchiCegarLoop]: ======== Iteration 9 ============
[2024-11-12 21:45:03,264 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 85 transitions.
[2024-11-12 21:45:03,265 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 39
[2024-11-12 21:45:03,265 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-12 21:45:03,265 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-12 21:45:03,270 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-12 21:45:03,270 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [240, 240, 192, 192, 192, 60, 60, 48, 48, 48, 48, 48, 48, 48, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1]
[2024-11-12 21:45:03,271 INFO  L747   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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;" 
[2024-11-12 21:45:03,271 INFO  L749   eck$LassoCheckResult]: Loop: "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" 
[2024-11-12 21:45:03,273 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:45:03,273 INFO  L85        PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 9 times
[2024-11-12 21:45:03,273 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:45:03,274 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189099101]
[2024-11-12 21:45:03,274 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:45:03,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:45:03,284 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:45:03,284 INFO  L357             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-12 21:45:03,285 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:45:03,295 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-12 21:45:03,296 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:45:03,296 INFO  L85        PathProgramCache]: Analyzing trace with hash -637971343, now seen corresponding path program 4 times
[2024-11-12 21:45:03,296 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:45:03,297 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071868264]
[2024-11-12 21:45:03,297 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:45:03,297 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:45:03,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,481 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,508 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,551 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,564 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,598 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,614 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,641 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,649 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,651 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,655 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,660 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,663 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,664 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,665 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:08,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,693 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,697 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,701 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,704 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,707 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,713 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,715 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,717 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,718 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,719 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:08,727 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,738 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,742 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,746 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,750 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,753 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,756 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,759 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,761 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,763 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,764 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,765 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:08,770 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,776 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,784 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,791 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,794 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,797 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,799 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,801 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,802 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,804 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:08,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,807 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132
[2024-11-12 21:45:08,808 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,810 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-12 21:45:08,829 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,854 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,873 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,895 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,912 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,933 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,938 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,943 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,946 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,951 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,953 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,956 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,959 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,961 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,963 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:08,976 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,988 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:08,995 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:08,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,001 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,006 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,008 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,010 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,012 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:09,019 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,028 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,035 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,038 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,041 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,043 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,046 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,047 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,049 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,050 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,051 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:09,056 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,061 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,065 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,069 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,072 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,075 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,077 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,080 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,083 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,085 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,086 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,087 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:09,088 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,090 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132
[2024-11-12 21:45:09,091 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,092 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-12 21:45:09,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,095 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301
[2024-11-12 21:45:09,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,176 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,210 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,223 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,239 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,243 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,247 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,253 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,258 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,260 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,262 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,263 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,264 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:09,275 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,288 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,292 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,295 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,302 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,307 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,311 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,313 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:09,321 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,330 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,334 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,338 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,341 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,344 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,347 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,350 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,351 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,353 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,354 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,355 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:09,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,365 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,369 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,373 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,376 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,380 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,385 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,388 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,390 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,391 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:09,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,393 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132
[2024-11-12 21:45:09,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,396 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-12 21:45:09,413 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,437 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,453 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,478 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,494 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,510 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,513 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,517 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,520 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,523 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,525 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,528 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,530 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,531 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,532 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,533 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:09,543 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,554 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,558 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,561 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,564 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,567 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,572 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,574 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,576 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,576 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,577 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:09,585 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,592 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,596 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,599 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,603 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,606 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,609 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,611 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,614 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,616 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,617 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,619 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:09,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,629 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,637 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,640 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,643 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,646 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,649 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,651 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,653 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,654 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,656 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:09,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,658 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132
[2024-11-12 21:45:09,659 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,660 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-12 21:45:09,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,662 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 600
[2024-11-12 21:45:09,687 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,716 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,730 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,750 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,766 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,784 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,794 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,799 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,803 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,807 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,810 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,813 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,815 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,818 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:09,830 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,845 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,855 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,860 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,864 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,871 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,873 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,876 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,878 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:09,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,898 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,904 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,908 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,913 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,917 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,921 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,924 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,929 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,931 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,932 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:09,939 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,945 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,950 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,955 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,960 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,964 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,971 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,974 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,976 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:09,978 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,979 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:09,980 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,981 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132
[2024-11-12 21:45:09,982 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:09,983 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-12 21:45:10,001 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,024 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,040 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,059 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,075 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,093 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,104 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,113 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,121 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,127 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,128 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,129 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:10,144 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,165 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,170 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,175 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,180 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,185 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,189 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,192 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,195 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,198 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,200 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,202 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:10,213 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,224 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,229 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,234 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,239 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,242 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,246 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,249 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,254 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,257 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:10,263 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,268 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,277 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,282 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,286 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,289 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,292 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,297 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:10,298 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,300 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:10,301 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,302 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132
[2024-11-12 21:45:10,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,304 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-12 21:45:10,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:10,307 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 899
[2024-11-12 21:45:10,379 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:12,067 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:12,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:12,711 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:12,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:13,210 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:13,214 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:13,220 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:13,222 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:13,224 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:13,225 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:13,226 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:13,227 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:13,228 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:13,229 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:13,229 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:13,242 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:13,581 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:13,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:13,718 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:13,722 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:13,844 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:13,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:13,927 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:13,930 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:13,986 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:13,988 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,032 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:14,042 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,051 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,054 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,057 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,059 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,062 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,064 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,066 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,067 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,069 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,070 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,070 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:14,074 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,079 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,082 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,085 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,090 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,094 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,097 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,098 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,098 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:14,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,100 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132
[2024-11-12 21:45:14,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,102 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-12 21:45:14,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,146 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,159 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,176 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,189 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,205 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,212 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,215 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,218 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,220 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,222 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,224 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,225 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,226 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,227 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:14,237 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,249 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,256 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,259 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,262 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,264 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,267 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,268 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,270 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,271 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,272 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:14,278 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,287 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,290 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,294 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,300 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,302 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,305 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,308 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,310 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:14,315 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,320 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,323 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,327 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,331 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,334 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,337 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,339 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,341 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,343 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,346 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:14,346 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,348 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132
[2024-11-12 21:45:14,349 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,350 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-12 21:45:14,351 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,353 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1198
[2024-11-12 21:45:14,386 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,416 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,428 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,441 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,452 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,464 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,468 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,471 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,473 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,476 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,480 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,481 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,483 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,484 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:14,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,502 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,506 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,509 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,514 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,516 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,519 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,521 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,522 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,524 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,525 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:14,531 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,538 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,541 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,544 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,547 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,550 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,552 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,554 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,556 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,557 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,557 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:14,561 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,565 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,568 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,571 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,574 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,577 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,579 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,581 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,583 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,584 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,585 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,586 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:14,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,587 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132
[2024-11-12 21:45:14,588 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,588 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-12 21:45:14,601 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,616 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,628 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,641 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,653 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,665 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,669 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,672 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,675 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,677 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,680 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,682 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,683 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,685 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,685 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,686 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:14,696 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,705 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,713 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,719 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,722 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,725 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,726 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,727 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,728 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:14,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,742 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,749 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,752 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,756 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,760 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,763 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,765 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,767 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,769 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:14,774 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,780 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,790 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,794 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,798 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,802 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,805 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,807 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,810 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,811 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,812 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:14,813 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,814 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132
[2024-11-12 21:45:14,815 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,816 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-12 21:45:14,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,819 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1497
[2024-11-12 21:45:14,863 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,897 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,924 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,937 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,950 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,955 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,958 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,965 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,970 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,974 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:14,975 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,976 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:14,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:14,996 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,000 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,004 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,008 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,011 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,014 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,016 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,020 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,021 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,022 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:15,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,037 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,042 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,045 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,052 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,058 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,060 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,062 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,063 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,064 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:15,070 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,075 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,079 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,083 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,090 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,096 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,101 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,103 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,104 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:15,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,106 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132
[2024-11-12 21:45:15,107 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,108 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-12 21:45:15,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,138 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,152 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,165 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,179 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,191 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,195 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,199 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,202 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,207 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,211 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,215 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,218 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,220 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,221 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,223 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:15,236 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,251 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,256 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,261 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,270 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,275 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,278 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,281 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,284 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,285 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,287 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:15,298 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,308 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,314 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,319 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,328 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,332 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,335 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,338 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,340 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,342 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,343 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:15,350 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,356 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,367 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,373 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,377 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,381 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,385 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,388 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,390 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:15,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,393 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-12 21:45:15,394 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,396 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132
[2024-11-12 21:45:15,396 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,398 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143
[2024-11-12 21:45:15,399 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:15,402 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 21:45:15,402 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071868264]
[2024-11-12 21:45:15,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071868264] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 21:45:15,403 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755366014]
[2024-11-12 21:45:15,403 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-12 21:45:15,403 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 21:45:15,403 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 21:45:15,407 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-12 21:45:15,410 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-11-12 21:45:16,445 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-12 21:45:16,445 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2024-11-12 21:45:16,445 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22
[2024-11-12 21:45:16,446 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52123621]
[2024-11-12 21:45:16,446 INFO  L85    oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2024-11-12 21:45:16,447 INFO  L764   eck$LassoCheckResult]: loop already infeasible
[2024-11-12 21:45:16,447 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 21:45:16,447 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2024-11-12 21:45:16,447 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462
[2024-11-12 21:45:16,447 INFO  L87              Difference]: Start difference. First operand 71 states and 85 transitions. cyclomatic complexity: 19 Second operand  has 22 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 9 states have call successors, (19), 4 states have call predecessors, (19), 8 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22)
[2024-11-12 21:45:16,723 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 21:45:16,723 INFO  L93              Difference]: Finished difference Result 73 states and 87 transitions.
[2024-11-12 21:45:16,723 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 87 transitions.
[2024-11-12 21:45:16,724 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 39
[2024-11-12 21:45:16,725 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 87 transitions.
[2024-11-12 21:45:16,725 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 73
[2024-11-12 21:45:16,725 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 73
[2024-11-12 21:45:16,725 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 73 states and 87 transitions.
[2024-11-12 21:45:16,726 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-12 21:45:16,726 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 73 states and 87 transitions.
[2024-11-12 21:45:16,726 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 73 states and 87 transitions.
[2024-11-12 21:45:16,729 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73.
[2024-11-12 21:45:16,730 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 73 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 47 states have internal predecessors, (49), 13 states have call successors, (13), 4 states have call predecessors, (13), 16 states have return successors, (25), 21 states have call predecessors, (25), 13 states have call successors, (25)
[2024-11-12 21:45:16,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions.
[2024-11-12 21:45:16,731 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 73 states and 87 transitions.
[2024-11-12 21:45:16,733 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2024-11-12 21:45:16,734 INFO  L426   stractBuchiCegarLoop]: Abstraction has 73 states and 87 transitions.
[2024-11-12 21:45:16,734 INFO  L333   stractBuchiCegarLoop]: ======== Iteration 10 ============
[2024-11-12 21:45:16,734 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 87 transitions.
[2024-11-12 21:45:16,735 INFO  L131   ngComponentsAnalysis]: Automaton has 5 accepting balls. 39
[2024-11-12 21:45:16,735 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-12 21:45:16,735 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-12 21:45:16,740 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-12 21:45:16,740 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [288, 288, 240, 240, 240, 60, 60, 48, 48, 48, 48, 48, 48, 48, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1]
[2024-11-12 21:45:16,741 INFO  L747   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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;" 
[2024-11-12 21:45:16,741 INFO  L749   eck$LassoCheckResult]: Loop: "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#119#return;" "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;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#121#return;" "assume true;" >"#125#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#127#return;" "assume true;" >"#115#return;" "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;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#117#return;" "assume true;" >"#117#return;" "assume true;" >"#123#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" 
[2024-11-12 21:45:16,743 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:45:16,743 INFO  L85        PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 10 times
[2024-11-12 21:45:16,743 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:45:16,743 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664300533]
[2024-11-12 21:45:16,743 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:45:16,744 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:45:16,759 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:45:16,760 INFO  L357             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-12 21:45:16,761 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-12 21:45:16,779 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-12 21:45:16,780 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 21:45:16,780 INFO  L85        PathProgramCache]: Analyzing trace with hash -545509519, now seen corresponding path program 5 times
[2024-11-12 21:45:16,780 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 21:45:16,781 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908548373]
[2024-11-12 21:45:16,781 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 21:45:16,781 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 21:45:17,459 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,159 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,350 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,380 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,409 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,411 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,414 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,419 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,424 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,426 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,429 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,430 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,432 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,433 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,434 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:22,445 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,460 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,464 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,468 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,472 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,475 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,481 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,485 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,487 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,489 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,489 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,490 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:22,498 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,508 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,516 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,518 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,522 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,527 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,529 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,531 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,533 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,534 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,535 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,536 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:22,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,545 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,549 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,553 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,557 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,560 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,563 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,566 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,568 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,570 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,571 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,573 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,574 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,575 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:22,576 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,577 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152
[2024-11-12 21:45:22,578 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,579 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163
[2024-11-12 21:45:22,597 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,617 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,630 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,644 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,656 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,669 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,672 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,675 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,678 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,681 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,683 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,685 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,687 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,689 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,691 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,692 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,692 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:22,701 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,712 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,715 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,718 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,721 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,724 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,726 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,728 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,730 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,732 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,733 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,734 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,736 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:22,742 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,749 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,756 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,759 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,762 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,764 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,766 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,770 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,770 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,772 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,773 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:22,777 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,781 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,784 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,788 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,791 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,794 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,797 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,800 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,802 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,804 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,807 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,808 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,808 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:22,809 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,810 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152
[2024-11-12 21:45:22,811 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,811 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163
[2024-11-12 21:45:22,812 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,813 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341
[2024-11-12 21:45:22,839 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,873 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,897 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,915 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,943 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,947 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,951 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,957 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,960 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,963 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,968 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,971 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:22,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,973 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:22,987 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:22,999 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,007 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,015 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,022 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,024 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,027 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,030 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,032 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:23,040 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,048 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,056 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,060 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,064 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,067 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,070 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,073 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,075 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,077 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,078 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,079 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,080 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:23,085 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,090 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,095 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,099 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,103 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,106 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,110 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,113 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,116 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,118 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,120 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,122 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,123 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,124 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:23,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,125 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152
[2024-11-12 21:45:23,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,126 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163
[2024-11-12 21:45:23,142 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,159 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,189 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,218 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,223 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,227 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,231 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,235 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,239 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,243 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,246 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,249 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,254 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,257 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:23,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,281 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,285 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,290 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,298 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,301 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,304 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,310 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,314 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,315 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,316 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:23,325 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,333 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,338 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,342 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,347 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,350 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,354 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,357 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,361 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,363 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,365 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,367 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,369 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:23,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,380 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,386 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,390 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,399 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,403 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,406 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,410 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,412 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,414 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,417 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,419 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:23,420 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,420 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152
[2024-11-12 21:45:23,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,422 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163
[2024-11-12 21:45:23,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,423 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 680
[2024-11-12 21:45:23,458 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,505 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,543 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,558 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,574 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,579 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,584 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,589 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,593 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,597 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,600 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,604 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,606 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,609 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,611 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,612 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,613 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:23,628 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,645 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,656 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,665 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,670 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,673 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,680 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,682 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,684 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,685 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,686 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:23,696 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,705 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,711 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,716 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,722 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,726 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,731 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,735 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,739 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,742 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,744 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,747 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,748 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,749 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:23,756 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,762 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,773 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,779 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,783 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,792 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,795 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,799 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,801 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,803 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,806 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:23,807 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,808 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152
[2024-11-12 21:45:23,809 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,810 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163
[2024-11-12 21:45:23,828 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,847 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,864 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,882 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,899 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,916 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,922 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,927 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,933 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,937 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,946 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,950 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,953 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,956 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,958 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,959 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,961 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:23,974 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,987 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:23,993 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:23,998 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:24,027 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,032 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:24,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,040 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:24,044 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,047 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:24,050 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,053 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:24,054 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,056 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:24,067 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,077 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:24,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,089 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:24,095 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,099 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:24,104 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,108 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:24,112 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,115 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:24,118 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,121 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:24,122 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,124 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:24,131 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,137 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:24,143 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,149 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:24,154 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,159 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:24,164 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,169 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:24,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,178 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:24,181 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,184 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-12 21:45:24,186 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,188 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-12 21:45:24,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,191 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152
[2024-11-12 21:45:24,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,195 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163
[2024-11-12 21:45:24,196 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 21:45:24,198 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1019
[2024-11-12 21:45:24,263 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat