./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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme --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.4-dev-0e0057c [2023-11-26 10:49:39,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:49:40,034 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-26 10:49:40,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:49:40,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:49:40,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:49:40,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:49:40,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:49:40,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:49:40,091 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:49:40,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:49:40,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:49:40,094 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:49:40,096 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-26 10:49:40,096 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-26 10:49:40,097 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-26 10:49:40,097 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-26 10:49:40,098 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-26 10:49:40,099 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-26 10:49:40,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:49:40,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-26 10:49:40,100 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:49:40,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:49:40,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:49:40,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:49:40,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-26 10:49:40,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-26 10:49:40,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-26 10:49:40,104 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:49:40,104 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:49:40,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:49:40,106 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-26 10:49:40,107 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:49:40,107 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:49:40,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:49:40,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:49:40,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:49:40,109 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-26 10:49:40,109 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme 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 [2023-11-26 10:49:40,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:49:40,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:49:40,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:49:40,469 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:49:40,470 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:49:40,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2023-11-26 10:49:43,574 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:49:43,851 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:49:43,851 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2023-11-26 10:49:43,861 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/data/fe37ea1b6/19ae6022bc2845f8913f8080a3a18f41/FLAG6300a4030 [2023-11-26 10:49:43,878 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/data/fe37ea1b6/19ae6022bc2845f8913f8080a3a18f41 [2023-11-26 10:49:43,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:49:43,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:49:43,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:49:43,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:49:43,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:49:43,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37f36e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43, skipping insertion in model container [2023-11-26 10:49:43,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,929 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:49:44,146 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:49:44,158 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:49:44,196 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:49:44,221 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:49:44,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:44 WrapperNode [2023-11-26 10:49:44,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:49:44,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:49:44,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:49:44,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:49:44,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:44" (1/1) ... [2023-11-26 10:49:44,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:44" (1/1) ... [2023-11-26 10:49:44,282 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2023-11-26 10:49:44,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:49:44,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:49:44,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:49:44,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:49:44,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:44" (1/1) ... [2023-11-26 10:49:44,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:44" (1/1) ... [2023-11-26 10:49:44,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:44" (1/1) ... [2023-11-26 10:49:44,341 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]. [2023-11-26 10:49:44,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:44" (1/1) ... [2023-11-26 10:49:44,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:44" (1/1) ... [2023-11-26 10:49:44,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:44" (1/1) ... [2023-11-26 10:49:44,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:44" (1/1) ... [2023-11-26 10:49:44,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:44" (1/1) ... [2023-11-26 10:49:44,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:44" (1/1) ... [2023-11-26 10:49:44,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:49:44,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:49:44,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:49:44,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:49:44,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:44" (1/1) ... [2023-11-26 10:49:44,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 10:49:44,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:44,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 10:49:44,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-26 10:49:44,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:49:44,482 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_28_0 [2023-11-26 10:49:44,482 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_28_0 [2023-11-26 10:49:44,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:49:44,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 10:49:44,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 10:49:44,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 10:49:44,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-26 10:49:44,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:49:44,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 10:49:44,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 10:49:44,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 10:49:44,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 10:49:44,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-26 10:49:44,484 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2023-11-26 10:49:44,485 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2023-11-26 10:49:44,485 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_28_0 [2023-11-26 10:49:44,485 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_28_0 [2023-11-26 10:49:44,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:49:44,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:49:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 10:49:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 10:49:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-26 10:49:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-26 10:49:44,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-26 10:49:44,487 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2023-11-26 10:49:44,487 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2023-11-26 10:49:44,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:49:44,616 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:49:44,619 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:49:44,931 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:49:44,947 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:49:44,947 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-26 10:49:44,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:49:44 BoogieIcfgContainer [2023-11-26 10:49:44,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:49:44,953 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-26 10:49:44,953 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-26 10:49:44,957 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-26 10:49:44,958 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 10:49:44,958 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.11 10:49:43" (1/3) ... [2023-11-26 10:49:44,959 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21c9c963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 10:49:44, skipping insertion in model container [2023-11-26 10:49:44,959 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 10:49:44,960 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:44" (2/3) ... [2023-11-26 10:49:44,962 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21c9c963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 10:49:44, skipping insertion in model container [2023-11-26 10:49:44,962 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 10:49:44,962 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:49:44" (3/3) ... [2023-11-26 10:49:44,963 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_6.c [2023-11-26 10:49:45,024 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-26 10:49:45,024 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-26 10:49:45,024 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-26 10:49:45,024 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-26 10:49:45,024 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-26 10:49:45,025 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-26 10:49:45,025 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-26 10:49:45,025 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-26 10:49:45,030 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) [2023-11-26 10:49:45,060 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 10:49:45,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 10:49:45,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 10:49:45,066 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 10:49:45,067 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-26 10:49:45,067 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-26 10:49:45,068 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) [2023-11-26 10:49:45,079 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 10:49:45,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 10:49:45,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 10:49:45,079 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 10:49:45,080 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-26 10:49:45,088 INFO L748 eck$LassoCheckResult]: Stem: 44#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 34#L109-2true [2023-11-26 10:49:45,088 INFO L750 eck$LassoCheckResult]: Loop: 34#L109-2true assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 11#L114-2true assume !(main_~b~0#1 < 6); 5#L114-3true main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 34#L109-2true [2023-11-26 10:49:45,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:45,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2023-11-26 10:49:45,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:45,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235004478] [2023-11-26 10:49:45,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:45,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:45,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:49:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:45,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:49:45,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:45,317 INFO L85 PathProgramCache]: Analyzing trace with hash 71729, now seen corresponding path program 1 times [2023-11-26 10:49:45,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:45,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624904332] [2023-11-26 10:49:45,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:45,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:49:45,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:45,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624904332] [2023-11-26 10:49:45,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624904332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:45,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:45,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:49:45,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857719544] [2023-11-26 10:49:45,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:45,428 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 10:49:45,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:45,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:49:45,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:49:45,481 INFO L87 Difference]: Start difference. First operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:45,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:45,545 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2023-11-26 10:49:45,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. [2023-11-26 10:49:45,556 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2023-11-26 10:49:45,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 36 states and 46 transitions. [2023-11-26 10:49:45,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2023-11-26 10:49:45,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2023-11-26 10:49:45,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2023-11-26 10:49:45,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:45,571 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2023-11-26 10:49:45,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2023-11-26 10:49:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2023-11-26 10:49:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-26 10:49:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2023-11-26 10:49:45,617 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2023-11-26 10:49:45,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:49:45,622 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2023-11-26 10:49:45,622 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-26 10:49:45,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2023-11-26 10:49:45,624 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-26 10:49:45,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 10:49:45,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 10:49:45,625 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 10:49:45,625 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:45,626 INFO L748 eck$LassoCheckResult]: Stem: 138#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 120#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 109#L109-2 [2023-11-26 10:49:45,626 INFO L750 eck$LassoCheckResult]: Loop: 109#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 118#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 119#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 135#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 134#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 124#L81-1 assume true; 121#func_to_recursive_line_25_to_26_0EXIT >#123#return; 123#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 136#L114-2 assume !(main_~b~0#1 < 6); 108#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 109#L109-2 [2023-11-26 10:49:45,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:45,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2023-11-26 10:49:45,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:45,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105565978] [2023-11-26 10:49:45,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:45,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:45,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:49:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:45,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:49:45,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1371427203, now seen corresponding path program 1 times [2023-11-26 10:49:45,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:45,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600301505] [2023-11-26 10:49:45,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:45,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:45,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:49:46,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:46,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600301505] [2023-11-26 10:49:46,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600301505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:46,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:46,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:49:46,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282629158] [2023-11-26 10:49:46,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:46,095 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 10:49:46,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:46,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:49:46,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:49:46,097 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 10:49:46,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:46,373 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2023-11-26 10:49:46,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2023-11-26 10:49:46,377 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-26 10:49:46,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 54 transitions. [2023-11-26 10:49:46,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-26 10:49:46,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-26 10:49:46,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2023-11-26 10:49:46,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:46,386 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 54 transitions. [2023-11-26 10:49:46,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2023-11-26 10:49:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2023-11-26 10:49:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 26 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-26 10:49:46,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2023-11-26 10:49:46,402 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2023-11-26 10:49:46,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:49:46,404 INFO L428 stractBuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2023-11-26 10:49:46,405 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-26 10:49:46,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2023-11-26 10:49:46,408 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-26 10:49:46,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 10:49:46,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 10:49:46,412 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 10:49:46,412 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:46,413 INFO L748 eck$LassoCheckResult]: Stem: 232#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 205#L109-2 [2023-11-26 10:49:46,414 INFO L750 eck$LassoCheckResult]: Loop: 205#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 212#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 213#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 228#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 227#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 202#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 203#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 220#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 223#L61-1 assume true; 224#func_to_recursive_line_26_to_27_0EXIT >#115#return; 225#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 215#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 228#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 227#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 222#L81-1 assume true; 214#func_to_recursive_line_25_to_26_0EXIT >#117#return; 216#L81-1 assume true; 233#func_to_recursive_line_25_to_26_0EXIT >#123#return; 229#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 230#L114-2 assume !(main_~b~0#1 < 6); 204#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 205#L109-2 [2023-11-26 10:49:46,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:46,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 3 times [2023-11-26 10:49:46,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:46,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422165618] [2023-11-26 10:49:46,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:46,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:46,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:49:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:46,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:49:46,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:46,467 INFO L85 PathProgramCache]: Analyzing trace with hash 182328154, now seen corresponding path program 1 times [2023-11-26 10:49:46,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:46,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692985238] [2023-11-26 10:49:46,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:46,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:49:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-26 10:49:46,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:46,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692985238] [2023-11-26 10:49:46,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692985238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:46,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:46,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:49:46,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43837851] [2023-11-26 10:49:46,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:46,960 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 10:49:46,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:46,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:49:46,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:49:46,962 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:49:47,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:47,235 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2023-11-26 10:49:47,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2023-11-26 10:49:47,242 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-26 10:49:47,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 53 transitions. [2023-11-26 10:49:47,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-26 10:49:47,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-26 10:49:47,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2023-11-26 10:49:47,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:47,249 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2023-11-26 10:49:47,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2023-11-26 10:49:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2023-11-26 10:49:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-11-26 10:49:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2023-11-26 10:49:47,260 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2023-11-26 10:49:47,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:49:47,262 INFO L428 stractBuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2023-11-26 10:49:47,263 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-26 10:49:47,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2023-11-26 10:49:47,264 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-26 10:49:47,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 10:49:47,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 10:49:47,267 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 10:49:47,267 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:47,267 INFO L748 eck$LassoCheckResult]: Stem: 348#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 326#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 320#L109-2 [2023-11-26 10:49:47,267 INFO L750 eck$LassoCheckResult]: Loop: 320#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 327#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 328#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 344#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 342#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 317#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 335#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 314#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 332#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 333#L41-1 assume true; 334#func_to_recursive_line_27_to_28_0EXIT >#125#return; 341#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 316#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 335#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 338#L61-1 assume true; 339#func_to_recursive_line_26_to_27_0EXIT >#127#return; 340#L61-1 assume true; 349#func_to_recursive_line_26_to_27_0EXIT >#115#return; 343#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 330#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 344#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 342#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 337#L81-1 assume true; 329#func_to_recursive_line_25_to_26_0EXIT >#117#return; 331#L81-1 assume true; 350#func_to_recursive_line_25_to_26_0EXIT >#123#return; 345#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 346#L114-2 assume !(main_~b~0#1 < 6); 319#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 320#L109-2 [2023-11-26 10:49:47,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:47,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 4 times [2023-11-26 10:49:47,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:47,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850215233] [2023-11-26 10:49:47,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:47,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:47,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:49:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:47,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:49:47,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:47,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2098832724, now seen corresponding path program 1 times [2023-11-26 10:49:47,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:47,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85712866] [2023-11-26 10:49:47,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:47,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:47,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:47,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:47,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:47,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:49:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:47,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-26 10:49:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-26 10:49:47,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:47,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85712866] [2023-11-26 10:49:47,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85712866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:47,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:47,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:49:47,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255887750] [2023-11-26 10:49:47,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:47,827 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 10:49:47,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:47,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:49:47,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:49:47,828 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 14 Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-26 10:49:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:48,045 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2023-11-26 10:49:48,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2023-11-26 10:49:48,048 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-26 10:49:48,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2023-11-26 10:49:48,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-26 10:49:48,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-26 10:49:48,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2023-11-26 10:49:48,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:48,062 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2023-11-26 10:49:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2023-11-26 10:49:48,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2023-11-26 10:49:48,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2023-11-26 10:49:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2023-11-26 10:49:48,067 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2023-11-26 10:49:48,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 10:49:48,070 INFO L428 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2023-11-26 10:49:48,070 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-26 10:49:48,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2023-11-26 10:49:48,073 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-26 10:49:48,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 10:49:48,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 10:49:48,075 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 10:49:48,075 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:48,075 INFO L748 eck$LassoCheckResult]: Stem: 497#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 476#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 468#L109-2 [2023-11-26 10:49:48,076 INFO L750 eck$LassoCheckResult]: Loop: 468#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 474#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 475#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 492#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 490#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 465#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 466#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 483#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 463#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 473#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 480#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 470#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 469#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 472#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 484#L25-1 assume true; 496#func_to_recursive_line_28_to_28_0EXIT >#119#return; 461#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 462#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 473#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 480#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 481#L41-1 assume true; 482#func_to_recursive_line_27_to_28_0EXIT >#121#return; 489#L41-1 assume true; 498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 493#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 464#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 466#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 483#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 486#L61-1 assume true; 487#func_to_recursive_line_26_to_27_0EXIT >#127#return; 488#L61-1 assume true; 499#func_to_recursive_line_26_to_27_0EXIT >#115#return; 491#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 478#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 492#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 490#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 485#L81-1 assume true; 477#func_to_recursive_line_25_to_26_0EXIT >#117#return; 479#L81-1 assume true; 500#func_to_recursive_line_25_to_26_0EXIT >#123#return; 494#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 495#L114-2 assume !(main_~b~0#1 < 6); 467#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 468#L109-2 [2023-11-26 10:49:48,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:48,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 5 times [2023-11-26 10:49:48,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:48,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015293894] [2023-11-26 10:49:48,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:48,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:48,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:49:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:48,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:49:48,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:48,095 INFO L85 PathProgramCache]: Analyzing trace with hash 500602406, now seen corresponding path program 1 times [2023-11-26 10:49:48,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:48,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675621162] [2023-11-26 10:49:48,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:48,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:48,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:48,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:48,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:48,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:48,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:49:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:48,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-26 10:49:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:48,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-26 10:49:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:48,725 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-26 10:49:48,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:48,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675621162] [2023-11-26 10:49:48,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675621162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:48,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:48,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 10:49:48,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320783784] [2023-11-26 10:49:48,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:48,731 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 10:49:48,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:48,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 10:49:48,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:49:48,732 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-26 10:49:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:48,939 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2023-11-26 10:49:48,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2023-11-26 10:49:48,940 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-26 10:49:48,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2023-11-26 10:49:48,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-26 10:49:48,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-26 10:49:48,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2023-11-26 10:49:48,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:48,943 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-11-26 10:49:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2023-11-26 10:49:48,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-26 10:49:48,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-26 10:49:48,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2023-11-26 10:49:48,947 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-11-26 10:49:48,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:49:48,949 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-11-26 10:49:48,949 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-26 10:49:48,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 51 transitions. [2023-11-26 10:49:48,950 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-26 10:49:48,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 10:49:48,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 10:49:48,951 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 10:49:48,951 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:48,952 INFO L748 eck$LassoCheckResult]: Stem: 691#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 668#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 660#L109-2 [2023-11-26 10:49:48,952 INFO L750 eck$LassoCheckResult]: Loop: 660#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 666#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 667#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 684#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 682#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 657#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 658#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 675#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 654#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 665#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 672#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 662#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 661#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 664#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 663#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 661#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 664#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 676#L25-1 assume true; 690#func_to_recursive_line_28_to_28_0EXIT >#113#return; 688#L25-1 assume true; 689#func_to_recursive_line_28_to_28_0EXIT >#119#return; 653#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 655#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 665#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 672#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 673#L41-1 assume true; 674#func_to_recursive_line_27_to_28_0EXIT >#121#return; 681#L41-1 assume true; 692#func_to_recursive_line_27_to_28_0EXIT >#125#return; 685#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 656#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 658#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 675#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 678#L61-1 assume true; 679#func_to_recursive_line_26_to_27_0EXIT >#127#return; 680#L61-1 assume true; 693#func_to_recursive_line_26_to_27_0EXIT >#115#return; 683#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 670#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 684#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 682#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 677#L81-1 assume true; 669#func_to_recursive_line_25_to_26_0EXIT >#117#return; 671#L81-1 assume true; 694#func_to_recursive_line_25_to_26_0EXIT >#123#return; 686#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 687#L114-2 assume !(main_~b~0#1 < 6); 659#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 660#L109-2 [2023-11-26 10:49:48,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:48,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 6 times [2023-11-26 10:49:48,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:48,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835436372] [2023-11-26 10:49:48,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:48,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:48,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:49:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:48,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:49:48,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1994055486, now seen corresponding path program 1 times [2023-11-26 10:49:48,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:48,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054527209] [2023-11-26 10:49:48,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:48,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:49:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:49:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:49:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-26 10:49:49,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:49,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054527209] [2023-11-26 10:49:49,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054527209] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:49:49,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303539530] [2023-11-26 10:49:49,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:49,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:49,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:49,200 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:49:49,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 10:49:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 10:49:49,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:49:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-26 10:49:49,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:49:49,544 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-26 10:49:49,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303539530] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:49:49,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:49:49,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2023-11-26 10:49:49,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378293051] [2023-11-26 10:49:49,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:49:49,546 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 10:49:49,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:49,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 10:49:49,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-26 10:49:49,548 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. cyclomatic complexity: 14 Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-26 10:49:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:49,739 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2023-11-26 10:49:49,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2023-11-26 10:49:49,741 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2023-11-26 10:49:49,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 63 transitions. [2023-11-26 10:49:49,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2023-11-26 10:49:49,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2023-11-26 10:49:49,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2023-11-26 10:49:49,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:49,744 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-11-26 10:49:49,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2023-11-26 10:49:49,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-26 10:49:49,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.15625) internal successors, (37), 35 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2023-11-26 10:49:49,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2023-11-26 10:49:49,749 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-11-26 10:49:49,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:49:49,750 INFO L428 stractBuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-11-26 10:49:49,750 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-26 10:49:49,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 63 transitions. [2023-11-26 10:49:49,751 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2023-11-26 10:49:49,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 10:49:49,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 10:49:49,756 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 10:49:49,756 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2023-11-26 10:49:49,756 INFO L748 eck$LassoCheckResult]: Stem: 1200#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1174#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 1163#L109-2 [2023-11-26 10:49:49,757 INFO L750 eck$LassoCheckResult]: Loop: 1163#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1172#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1173#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 1191#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 1165#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 1184#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 1160#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 1181#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 1168#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 1170#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1169#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 1170#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1185#L25-1 assume true; 1199#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1197#L25-1 assume true; 1198#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1159#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1161#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 1181#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1182#L41-1 assume true; 1183#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1190#L41-1 assume true; 1208#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1194#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1164#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 1184#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1187#L61-1 assume true; 1188#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1189#L61-1 assume true; 1209#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1192#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1176#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 1191#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1186#L81-1 assume true; 1175#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1180#L81-1 assume true; 1203#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1195#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1196#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1179#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 1191#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 1165#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 1184#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 1160#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 1181#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 1168#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 1170#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1169#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 1170#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1185#L25-1 assume true; 1199#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1197#L25-1 assume true; 1198#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1159#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1161#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 1181#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1182#L41-1 assume true; 1183#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1190#L41-1 assume true; 1208#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1194#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1164#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 1184#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1187#L61-1 assume true; 1188#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1189#L61-1 assume true; 1209#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1192#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1176#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 1191#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1186#L81-1 assume true; 1175#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1180#L81-1 assume true; 1203#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1205#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1207#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1177#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 1191#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 1165#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 1184#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 1160#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 1181#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 1168#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 1170#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1169#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 1170#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1185#L25-1 assume true; 1199#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1197#L25-1 assume true; 1198#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1159#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1161#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 1181#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1182#L41-1 assume true; 1183#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1190#L41-1 assume true; 1208#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1194#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1164#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 1184#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1187#L61-1 assume true; 1188#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1189#L61-1 assume true; 1209#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1192#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1176#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 1191#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1186#L81-1 assume true; 1175#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1180#L81-1 assume true; 1203#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1204#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1206#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1178#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 1191#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 1165#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 1184#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 1160#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 1181#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 1168#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 1170#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1169#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 1170#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1185#L25-1 assume true; 1199#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1197#L25-1 assume true; 1198#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1159#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1161#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 1181#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1182#L41-1 assume true; 1183#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1190#L41-1 assume true; 1208#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1194#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1164#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 1184#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1187#L61-1 assume true; 1188#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1189#L61-1 assume true; 1209#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1192#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1176#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 1191#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1186#L81-1 assume true; 1175#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1180#L81-1 assume true; 1203#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1202#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1201#L114-2 assume !(main_~b~0#1 < 6); 1162#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 1163#L109-2 [2023-11-26 10:49:49,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:49,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 7 times [2023-11-26 10:49:49,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:49,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106172685] [2023-11-26 10:49:49,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:49,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:49,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:49:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:49,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:49:49,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:49,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2143273103, now seen corresponding path program 2 times [2023-11-26 10:49:49,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:49,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904804480] [2023-11-26 10:49:49,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:49,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:49:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:49:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:49:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 10:49:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:49:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:49:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:49:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 10:49:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:49:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:49:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:49:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-26 10:49:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:49:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:49:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:49:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 51 proven. 67 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2023-11-26 10:49:51,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:51,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904804480] [2023-11-26 10:49:51,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904804480] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:49:51,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581014920] [2023-11-26 10:49:51,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 10:49:51,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:51,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:51,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:49:51,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 10:49:52,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 10:49:52,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 10:49:52,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-26 10:49:52,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:49:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2023-11-26 10:49:52,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:49:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2023-11-26 10:49:52,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581014920] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:49:52,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:49:52,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2023-11-26 10:49:52,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408310487] [2023-11-26 10:49:52,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:49:52,893 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 10:49:52,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:52,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-26 10:49:52,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-11-26 10:49:52,894 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. cyclomatic complexity: 17 Second operand has 18 states, 16 states have (on average 3.5625) internal successors, (57), 14 states have internal predecessors, (57), 9 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22) [2023-11-26 10:49:53,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:53,361 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2023-11-26 10:49:53,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 73 transitions. [2023-11-26 10:49:53,363 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2023-11-26 10:49:53,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 73 transitions. [2023-11-26 10:49:53,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2023-11-26 10:49:53,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2023-11-26 10:49:53,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 73 transitions. [2023-11-26 10:49:53,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:53,366 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 73 transitions. [2023-11-26 10:49:53,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 73 transitions. [2023-11-26 10:49:53,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-26 10:49:53,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 13 states have call successors, (13), 4 states have call predecessors, (13), 9 states have return successors, (18), 14 states have call predecessors, (18), 13 states have call successors, (18) [2023-11-26 10:49:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2023-11-26 10:49:53,378 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 73 transitions. [2023-11-26 10:49:53,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-26 10:49:53,381 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 73 transitions. [2023-11-26 10:49:53,381 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-26 10:49:53,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 73 transitions. [2023-11-26 10:49:53,382 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2023-11-26 10:49:53,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 10:49:53,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 10:49:53,393 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 10:49:53,395 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1] [2023-11-26 10:49:53,395 INFO L748 eck$LassoCheckResult]: Stem: 2902#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 2875#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 2867#L109-2 [2023-11-26 10:49:53,396 INFO L750 eck$LassoCheckResult]: Loop: 2867#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 2873#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2874#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 2864#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 2861#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 2870#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2887#L25-1 assume true; 2900#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2901#L25-1 assume true; 2909#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2904#L25-1 assume true; 2903#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2860#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2862#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2885#L41-1 assume true; 2886#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2893#L41-1 assume true; 2905#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2897#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2863#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2890#L61-1 assume true; 2891#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2892#L61-1 assume true; 2906#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2895#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2879#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2889#L81-1 assume true; 2876#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2883#L81-1 assume true; 2910#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2898#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 2899#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2881#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 2864#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 2861#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 2870#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2887#L25-1 assume true; 2900#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2901#L25-1 assume true; 2909#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2904#L25-1 assume true; 2903#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2860#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2862#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2885#L41-1 assume true; 2886#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2893#L41-1 assume true; 2905#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2897#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2863#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2890#L61-1 assume true; 2891#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2892#L61-1 assume true; 2906#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2895#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2879#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2889#L81-1 assume true; 2876#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2883#L81-1 assume true; 2910#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2913#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 2918#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2882#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 2864#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 2861#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 2870#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2887#L25-1 assume true; 2900#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2901#L25-1 assume true; 2909#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2904#L25-1 assume true; 2903#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2860#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2862#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2885#L41-1 assume true; 2886#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2893#L41-1 assume true; 2905#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2897#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2863#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2890#L61-1 assume true; 2891#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2892#L61-1 assume true; 2906#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2895#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2879#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2889#L81-1 assume true; 2876#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2883#L81-1 assume true; 2910#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2914#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 2917#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2877#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 2864#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 2861#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 2870#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2887#L25-1 assume true; 2900#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2901#L25-1 assume true; 2909#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2904#L25-1 assume true; 2903#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2860#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2862#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2885#L41-1 assume true; 2886#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2893#L41-1 assume true; 2905#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2897#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2863#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2890#L61-1 assume true; 2891#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2892#L61-1 assume true; 2906#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2895#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2879#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2889#L81-1 assume true; 2876#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2883#L81-1 assume true; 2910#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2911#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 2916#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2878#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 2864#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 2861#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 2870#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2887#L25-1 assume true; 2900#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2901#L25-1 assume true; 2909#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2904#L25-1 assume true; 2903#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2860#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2862#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2885#L41-1 assume true; 2886#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2893#L41-1 assume true; 2905#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2897#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2863#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2890#L61-1 assume true; 2891#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2892#L61-1 assume true; 2906#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2895#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2879#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2889#L81-1 assume true; 2876#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2883#L81-1 assume true; 2910#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2912#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 2915#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2880#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 2864#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 2861#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 2870#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2887#L25-1 assume true; 2900#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2901#L25-1 assume true; 2909#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2904#L25-1 assume true; 2903#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2860#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2862#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2885#L41-1 assume true; 2886#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2893#L41-1 assume true; 2905#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2897#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2863#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2890#L61-1 assume true; 2891#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2892#L61-1 assume true; 2906#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2895#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2879#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2889#L81-1 assume true; 2876#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2883#L81-1 assume true; 2910#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2908#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 2907#L114-2 assume !(main_~b~0#1 < 6); 2866#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 2867#L109-2 [2023-11-26 10:49:53,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 8 times [2023-11-26 10:49:53,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:53,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111367514] [2023-11-26 10:49:53,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:53,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:53,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:49:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:53,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:49:53,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:53,442 INFO L85 PathProgramCache]: Analyzing trace with hash -889787645, now seen corresponding path program 3 times [2023-11-26 10:49:53,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:53,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209019630] [2023-11-26 10:49:53,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:53,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 10:49:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 10:49:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 10:49:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-26 10:49:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 10:49:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 10:49:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 10:49:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-26 10:49:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 10:49:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 10:49:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 10:49:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-26 10:49:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 10:49:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 10:49:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 10:49:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-11-26 10:49:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 10:49:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 10:49:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 10:49:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-11-26 10:49:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 10:49:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 10:49:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 10:49:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 81 proven. 208 refuted. 0 times theorem prover too weak. 1367 trivial. 0 not checked. [2023-11-26 10:49:57,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:57,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209019630] [2023-11-26 10:49:57,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209019630] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:49:57,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248956980] [2023-11-26 10:49:57,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-26 10:49:57,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:57,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:57,119 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:49:57,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-26 10:49:57,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-26 10:49:57,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 10:49:57,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-26 10:49:57,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:49:57,512 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 [2023-11-26 10:49:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 111 proven. 3 refuted. 0 times theorem prover too weak. 1542 trivial. 0 not checked. [2023-11-26 10:49:57,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:49:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 1541 trivial. 0 not checked. [2023-11-26 10:49:58,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248956980] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:49:58,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:49:58,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 10] total 30 [2023-11-26 10:49:58,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265985013] [2023-11-26 10:49:58,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:49:58,775 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 10:49:58,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:58,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-26 10:49:58,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2023-11-26 10:49:58,777 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. cyclomatic complexity: 19 Second operand has 30 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 11 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (24), 8 states have call predecessors, (24), 11 states have call successors, (24) [2023-11-26 10:49:59,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:59,698 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2023-11-26 10:49:59,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2023-11-26 10:49:59,700 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2023-11-26 10:49:59,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 63 states and 77 transitions. [2023-11-26 10:49:59,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2023-11-26 10:49:59,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2023-11-26 10:49:59,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 77 transitions. [2023-11-26 10:49:59,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:59,703 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 77 transitions. [2023-11-26 10:49:59,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 77 transitions. [2023-11-26 10:49:59,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-26 10:49:59,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 42 states have internal predecessors, (44), 13 states have call successors, (13), 4 states have call predecessors, (13), 11 states have return successors, (20), 16 states have call predecessors, (20), 13 states have call successors, (20) [2023-11-26 10:49:59,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2023-11-26 10:49:59,720 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 77 transitions. [2023-11-26 10:49:59,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-26 10:49:59,721 INFO L428 stractBuchiCegarLoop]: Abstraction has 63 states and 77 transitions. [2023-11-26 10:49:59,723 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-26 10:49:59,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 77 transitions. [2023-11-26 10:49:59,724 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2023-11-26 10:49:59,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 10:49:59,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 10:49:59,735 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 10:49:59,736 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [48, 48, 36, 36, 36, 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, 6, 6, 6, 6, 6, 1, 1, 1] [2023-11-26 10:49:59,736 INFO L748 eck$LassoCheckResult]: Stem: 5773#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 5744#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 5738#L109-2 [2023-11-26 10:49:59,737 INFO L750 eck$LassoCheckResult]: Loop: 5738#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 5745#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 5746#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 5760#L81-1 assume true; 5747#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5754#L81-1 assume true; 5790#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5787#L81-1 assume true; 5783#func_to_recursive_line_25_to_26_0EXIT >#123#return; 5769#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 5770#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 5748#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 5760#L81-1 assume true; 5747#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5754#L81-1 assume true; 5790#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5787#L81-1 assume true; 5783#func_to_recursive_line_25_to_26_0EXIT >#123#return; 5784#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 5793#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 5749#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 5760#L81-1 assume true; 5747#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5754#L81-1 assume true; 5790#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5787#L81-1 assume true; 5783#func_to_recursive_line_25_to_26_0EXIT >#123#return; 5785#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 5792#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 5750#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 5760#L81-1 assume true; 5747#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5754#L81-1 assume true; 5790#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5787#L81-1 assume true; 5783#func_to_recursive_line_25_to_26_0EXIT >#123#return; 5786#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 5791#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 5752#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 5760#L81-1 assume true; 5747#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5754#L81-1 assume true; 5790#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5787#L81-1 assume true; 5783#func_to_recursive_line_25_to_26_0EXIT >#123#return; 5788#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 5789#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 5753#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 5760#L81-1 assume true; 5747#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5754#L81-1 assume true; 5790#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5787#L81-1 assume true; 5783#func_to_recursive_line_25_to_26_0EXIT >#123#return; 5782#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 5781#L114-2 assume !(main_~b~0#1 < 6); 5737#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 5738#L109-2 [2023-11-26 10:49:59,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:59,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 9 times [2023-11-26 10:49:59,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:59,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556649387] [2023-11-26 10:49:59,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:59,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:59,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:49:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:59,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:49:59,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:59,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2093812593, now seen corresponding path program 4 times [2023-11-26 10:49:59,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:59,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548808231] [2023-11-26 10:49:59,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:59,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:02,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 10:50:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 10:50:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-26 10:50:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 10:50:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 10:50:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2023-11-26 10:50:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 10:50:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 10:50:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2023-11-26 10:50:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 10:50:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 10:50:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2023-11-26 10:50:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 10:50:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 10:50:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 517 [2023-11-26 10:50:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 10:50:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 10:50:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 8607 backedges. 17 proven. 297 refuted. 0 times theorem prover too weak. 8293 trivial. 0 not checked. [2023-11-26 10:50:04,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:04,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548808231] [2023-11-26 10:50:04,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548808231] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:50:04,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267414165] [2023-11-26 10:50:04,899 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-26 10:50:04,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:50:04,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:50:04,904 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:50:04,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc422a24-e3d8-4a9a-bb90-ebfa50d57b38/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-26 10:50:06,055 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-26 10:50:06,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 10:50:06,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 4364 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-26 10:50:06,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:50:06,127 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 [2023-11-26 10:50:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8607 backedges. 1277 proven. 3 refuted. 0 times theorem prover too weak. 7327 trivial. 0 not checked. [2023-11-26 10:50:06,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:50:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8607 backedges. 15 proven. 276 refuted. 0 times theorem prover too weak. 8316 trivial. 0 not checked. [2023-11-26 10:50:08,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267414165] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:50:08,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:50:08,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2023-11-26 10:50:08,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368242903] [2023-11-26 10:50:08,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:50:08,634 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 10:50:08,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:08,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-26 10:50:08,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2023-11-26 10:50:08,636 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. cyclomatic complexity: 19 Second operand has 28 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 21 states have internal predecessors, (73), 11 states have call successors, (38), 9 states have call predecessors, (38), 8 states have return successors, (29), 8 states have call predecessors, (29), 11 states have call successors, (29) [2023-11-26 10:50:09,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:09,387 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2023-11-26 10:50:09,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 81 transitions. [2023-11-26 10:50:09,388 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2023-11-26 10:50:09,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 81 transitions. [2023-11-26 10:50:09,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2023-11-26 10:50:09,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2023-11-26 10:50:09,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 81 transitions. [2023-11-26 10:50:09,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:50:09,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 81 transitions. [2023-11-26 10:50:09,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 81 transitions. [2023-11-26 10:50:09,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-26 10:50:09,402 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) [2023-11-26 10:50:09,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2023-11-26 10:50:09,405 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 81 transitions. [2023-11-26 10:50:09,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-26 10:50:09,407 INFO L428 stractBuchiCegarLoop]: Abstraction has 67 states and 81 transitions. [2023-11-26 10:50:09,408 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-26 10:50:09,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 81 transitions. [2023-11-26 10:50:09,409 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2023-11-26 10:50:09,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 10:50:09,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 10:50:09,423 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 10:50:09,427 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [192, 192, 144, 144, 144, 72, 72, 48, 48, 48, 48, 48, 48, 48, 36, 36, 24, 24, 24, 24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1] [2023-11-26 10:50:09,427 INFO L748 eck$LassoCheckResult]: Stem: 12112#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 12085#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 12077#L109-2 [2023-11-26 10:50:09,431 INFO L750 eck$LassoCheckResult]: Loop: 12077#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 12083#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 12084#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 12106#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12104#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12074#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12100#L61-1 assume true; 12101#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12102#L61-1 assume true; 12120#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12118#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12105#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12091#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12106#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12104#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12074#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12100#L61-1 assume true; 12101#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12102#L61-1 assume true; 12120#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12118#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12105#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12091#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12106#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12104#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 12099#L81-1 assume true; 12086#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12093#L81-1 assume true; 12131#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12128#L81-1 assume true; 12124#func_to_recursive_line_25_to_26_0EXIT >#123#return; 12108#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 12109#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 12088#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 12106#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12104#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12074#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12100#L61-1 assume true; 12101#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12102#L61-1 assume true; 12120#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12118#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12105#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12091#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12106#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12104#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12074#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12100#L61-1 assume true; 12101#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12102#L61-1 assume true; 12120#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12118#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12105#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12091#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12106#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12104#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 12099#L81-1 assume true; 12086#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12093#L81-1 assume true; 12131#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12128#L81-1 assume true; 12124#func_to_recursive_line_25_to_26_0EXIT >#123#return; 12125#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 12136#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 12089#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 12106#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12104#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12074#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12100#L61-1 assume true; 12101#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12102#L61-1 assume true; 12120#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12118#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12105#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12091#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12106#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12104#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12074#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12100#L61-1 assume true; 12101#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12102#L61-1 assume true; 12120#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12118#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12105#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12091#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12106#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12104#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 12099#L81-1 assume true; 12086#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12093#L81-1 assume true; 12131#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12128#L81-1 assume true; 12124#func_to_recursive_line_25_to_26_0EXIT >#123#return; 12126#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 12135#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 12090#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 12106#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12104#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12074#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12100#L61-1 assume true; 12101#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12102#L61-1 assume true; 12120#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12118#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12105#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12091#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12106#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12104#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12074#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12100#L61-1 assume true; 12101#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12102#L61-1 assume true; 12120#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12118#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12105#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12091#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12106#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12104#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 12099#L81-1 assume true; 12086#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12093#L81-1 assume true; 12131#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12128#L81-1 assume true; 12124#func_to_recursive_line_25_to_26_0EXIT >#123#return; 12127#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 12132#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 12092#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 12106#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12104#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12074#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12100#L61-1 assume true; 12101#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12102#L61-1 assume true; 12120#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12118#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12105#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12091#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12106#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12104#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12074#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12100#L61-1 assume true; 12101#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12102#L61-1 assume true; 12120#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12118#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12105#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12091#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12106#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12104#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 12099#L81-1 assume true; 12086#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12093#L81-1 assume true; 12131#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12128#L81-1 assume true; 12124#func_to_recursive_line_25_to_26_0EXIT >#123#return; 12129#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 12130#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 12087#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 12106#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12104#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12074#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12100#L61-1 assume true; 12101#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12102#L61-1 assume true; 12120#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12118#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12105#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12091#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12106#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12104#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12074#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12071#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12080#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12079#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12078#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12081#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12098#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12134#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12133#L25-1 assume true; 12123#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12114#L25-1 assume true; 12113#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12070#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12072#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12082#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12094#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12095#L41-1 assume true; 12096#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12103#L41-1 assume true; 12119#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12116#L41-1 assume true; 12115#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12107#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12073#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12075#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12097#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12100#L61-1 assume true; 12101#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12102#L61-1 assume true; 12120#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12118#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12105#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12091#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12106#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12104#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 12099#L81-1 assume true; 12086#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12093#L81-1 assume true; 12131#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12128#L81-1 assume true; 12124#func_to_recursive_line_25_to_26_0EXIT >#123#return; 12122#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 12121#L114-2 assume !(main_~b~0#1 < 6); 12076#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 12077#L109-2 [2023-11-26 10:50:09,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:09,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 10 times [2023-11-26 10:50:09,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:09,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62147005] [2023-11-26 10:50:09,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:09,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:50:09,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:50:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:50:09,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:50:09,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:09,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1891899185, now seen corresponding path program 5 times [2023-11-26 10:50:09,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:09,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56470261] [2023-11-26 10:50:09,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:09,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:18,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 10:50:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 10:50:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 10:50:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 10:50:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 10:50:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 10:50:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2023-11-26 10:50:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:21,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:22,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:22,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:22,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:22,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:22,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:22,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:22,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:22,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 10:50:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 10:50:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 10:50:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 10:50:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 10:50:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 10:50:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 564 [2023-11-26 10:50:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 10:50:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 10:50:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 10:50:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 10:50:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:50:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat