./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-25 00:37:46,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-25 00:37:47,055 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-25 00:37:47,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-25 00:37:47,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-25 00:37:47,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-25 00:37:47,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-25 00:37:47,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-25 00:37:47,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-25 00:37:47,109 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-25 00:37:47,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-25 00:37:47,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-25 00:37:47,111 INFO L153 SettingsManager]: * Use SBE=true [2024-10-25 00:37:47,111 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-25 00:37:47,113 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-25 00:37:47,114 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-25 00:37:47,114 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-25 00:37:47,114 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-25 00:37:47,115 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-25 00:37:47,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-25 00:37:47,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-25 00:37:47,119 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-25 00:37:47,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-25 00:37:47,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-25 00:37:47,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-25 00:37:47,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-25 00:37:47,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-25 00:37:47,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-25 00:37:47,122 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-25 00:37:47,122 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-25 00:37:47,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-25 00:37:47,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-25 00:37:47,124 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-25 00:37:47,124 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-25 00:37:47,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-25 00:37:47,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-25 00:37:47,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-25 00:37:47,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-25 00:37:47,126 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-25 00:37:47,126 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2024-10-25 00:37:47,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-25 00:37:47,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-25 00:37:47,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-25 00:37:47,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-25 00:37:47,437 INFO L274 PluginConnector]: CDTParser initialized [2024-10-25 00:37:47,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-10-25 00:37:49,062 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-25 00:37:49,259 INFO L384 CDTParser]: Found 1 translation units. [2024-10-25 00:37:49,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-10-25 00:37:49,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9feee684f/0ea1ce2d13264eb593fd24445276c4ca/FLAG996c89e01 [2024-10-25 00:37:49,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9feee684f/0ea1ce2d13264eb593fd24445276c4ca [2024-10-25 00:37:49,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-25 00:37:49,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-25 00:37:49,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-25 00:37:49,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-25 00:37:49,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-25 00:37:49,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:37:49" (1/1) ... [2024-10-25 00:37:49,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e6ed0a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:49, skipping insertion in model container [2024-10-25 00:37:49,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:37:49" (1/1) ... [2024-10-25 00:37:49,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-25 00:37:49,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:37:49,545 INFO L200 MainTranslator]: Completed pre-run [2024-10-25 00:37:49,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:37:49,596 INFO L204 MainTranslator]: Completed translation [2024-10-25 00:37:49,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:49 WrapperNode [2024-10-25 00:37:49,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-25 00:37:49,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-25 00:37:49,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-25 00:37:49,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-25 00:37:49,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:49" (1/1) ... [2024-10-25 00:37:49,613 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:49" (1/1) ... [2024-10-25 00:37:49,633 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-10-25 00:37:49,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-25 00:37:49,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-25 00:37:49,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-25 00:37:49,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-25 00:37:49,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:49" (1/1) ... [2024-10-25 00:37:49,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:49" (1/1) ... [2024-10-25 00:37:49,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:49" (1/1) ... [2024-10-25 00:37:49,688 INFO L175 MemorySlicer]: Split 32 memory accesses to 6 slices as follows [2, 6, 6, 6, 6, 6]. 19 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 1, 1, 1, 1, 1]. The 10 writes are split as follows [0, 2, 2, 2, 2, 2]. [2024-10-25 00:37:49,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:49" (1/1) ... [2024-10-25 00:37:49,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:49" (1/1) ... [2024-10-25 00:37:49,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:49" (1/1) ... [2024-10-25 00:37:49,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:49" (1/1) ... [2024-10-25 00:37:49,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:49" (1/1) ... [2024-10-25 00:37:49,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:49" (1/1) ... [2024-10-25 00:37:49,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-25 00:37:49,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-25 00:37:49,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-25 00:37:49,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-25 00:37:49,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:49" (1/1) ... [2024-10-25 00:37:49,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:37:49,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:37:49,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:37:49,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-25 00:37:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-25 00:37:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-25 00:37:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-25 00:37:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-25 00:37:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-25 00:37:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-25 00:37:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-25 00:37:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-25 00:37:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-25 00:37:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-25 00:37:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-25 00:37:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-25 00:37:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-25 00:37:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-25 00:37:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-10-25 00:37:49,829 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-10-25 00:37:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-10-25 00:37:49,829 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-10-25 00:37:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-10-25 00:37:49,829 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-10-25 00:37:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-25 00:37:49,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-25 00:37:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-25 00:37:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-25 00:37:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-25 00:37:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-25 00:37:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-25 00:37:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-25 00:37:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2024-10-25 00:37:49,830 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2024-10-25 00:37:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-10-25 00:37:49,830 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-10-25 00:37:49,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-25 00:37:49,968 INFO L238 CfgBuilder]: Building ICFG [2024-10-25 00:37:49,971 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-25 00:37:50,289 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-25 00:37:50,290 INFO L287 CfgBuilder]: Performing block encoding [2024-10-25 00:37:50,309 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-25 00:37:50,310 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-25 00:37:50,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:37:50 BoogieIcfgContainer [2024-10-25 00:37:50,311 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-25 00:37:50,333 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-25 00:37:50,333 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-25 00:37:50,336 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-25 00:37:50,337 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:37:50,337 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.10 12:37:49" (1/3) ... [2024-10-25 00:37:50,338 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6990a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:37:50, skipping insertion in model container [2024-10-25 00:37:50,338 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:37:50,339 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:49" (2/3) ... [2024-10-25 00:37:50,339 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6990a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:37:50, skipping insertion in model container [2024-10-25 00:37:50,339 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:37:50,339 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:37:50" (3/3) ... [2024-10-25 00:37:50,340 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_5.c [2024-10-25 00:37:50,400 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-25 00:37:50,400 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-25 00:37:50,401 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-25 00:37:50,401 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-25 00:37:50,401 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-25 00:37:50,401 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-25 00:37:50,401 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-25 00:37:50,401 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-25 00:37:50,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-25 00:37:50,430 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:37:50,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:50,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:50,439 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:50,439 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:50,440 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-25 00:37:50,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-25 00:37:50,445 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:37:50,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:50,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:50,447 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:50,447 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:50,455 INFO L745 eck$LassoCheckResult]: Stem: 19#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 26#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 39#L128true call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 29#$Ultimate##0true [2024-10-25 00:37:50,456 INFO L747 eck$LassoCheckResult]: Loop: 29#$Ultimate##0true ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 5#L101true assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 6#L107true call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 42#$Ultimate##0true ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 25#L81true assume !(#t~mem13 < 6);havoc #t~mem13; 21#L81-1true assume true; 20#func_to_recursive_line_24_to_25_0EXITtrue >#112#return; 3#L107-1true call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 34#L112true call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 29#$Ultimate##0true [2024-10-25 00:37:50,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:50,462 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 1 times [2024-10-25 00:37:50,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:50,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417019292] [2024-10-25 00:37:50,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:50,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:50,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:50,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:50,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:50,728 INFO L85 PathProgramCache]: Analyzing trace with hash 2053320187, now seen corresponding path program 1 times [2024-10-25 00:37:50,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:50,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691623610] [2024-10-25 00:37:50,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:50,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:51,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:37:51,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:51,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691623610] [2024-10-25 00:37:51,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691623610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:37:51,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:37:51,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-25 00:37:51,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209633710] [2024-10-25 00:37:51,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:37:51,222 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:51,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:51,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-25 00:37:51,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-25 00:37:51,256 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-25 00:37:51,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:51,579 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2024-10-25 00:37:51,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2024-10-25 00:37:51,587 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:37:51,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 42 states and 53 transitions. [2024-10-25 00:37:51,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-25 00:37:51,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-25 00:37:51,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2024-10-25 00:37:51,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:51,599 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-10-25 00:37:51,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2024-10-25 00:37:51,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-10-25 00:37:51,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 25 states have internal predecessors, (25), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-25 00:37:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-10-25 00:37:51,638 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-10-25 00:37:51,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 00:37:51,643 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-10-25 00:37:51,644 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-25 00:37:51,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2024-10-25 00:37:51,646 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:37:51,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:51,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:51,648 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:51,649 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:51,649 INFO L745 eck$LassoCheckResult]: Stem: 161#$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); 145#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 134#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 158#$Ultimate##0 [2024-10-25 00:37:51,650 INFO L747 eck$LassoCheckResult]: Loop: 158#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 143#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 139#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 138#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 141#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 159#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 160#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 149#L61-1 assume true; 146#func_to_recursive_line_25_to_26_0EXIT >#98#return; 148#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 140#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 138#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 142#L81-1 assume true; 162#func_to_recursive_line_24_to_25_0EXIT >#100#return; 163#L81-1 assume true; 164#func_to_recursive_line_24_to_25_0EXIT >#112#return; 133#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 135#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 158#$Ultimate##0 [2024-10-25 00:37:51,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:51,651 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 2 times [2024-10-25 00:37:51,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:51,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436860991] [2024-10-25 00:37:51,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:51,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:51,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:51,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:51,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:51,705 INFO L85 PathProgramCache]: Analyzing trace with hash 54735792, now seen corresponding path program 1 times [2024-10-25 00:37:51,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:51,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111488783] [2024-10-25 00:37:51,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:51,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:51,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:51,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:52,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-25 00:37:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-25 00:37:52,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:52,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111488783] [2024-10-25 00:37:52,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111488783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:37:52,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:37:52,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-25 00:37:52,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050807479] [2024-10-25 00:37:52,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:37:52,062 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:52,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:52,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 00:37:52,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-25 00:37:52,064 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. cyclomatic complexity: 13 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-25 00:37:52,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:52,296 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-10-25 00:37:52,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2024-10-25 00:37:52,299 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:37:52,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2024-10-25 00:37:52,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-25 00:37:52,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-25 00:37:52,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2024-10-25 00:37:52,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:52,306 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-10-25 00:37:52,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2024-10-25 00:37:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-10-25 00:37:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 26 states have internal predecessors, (26), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-25 00:37:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-10-25 00:37:52,316 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-10-25 00:37:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-25 00:37:52,317 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-10-25 00:37:52,317 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-25 00:37:52,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2024-10-25 00:37:52,319 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:37:52,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:52,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:52,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:52,323 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:52,323 INFO L745 eck$LassoCheckResult]: Stem: 278#$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); 260#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 249#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 272#$Ultimate##0 [2024-10-25 00:37:52,324 INFO L747 eck$LassoCheckResult]: Loop: 272#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 258#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 255#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 259#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 253#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 256#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 273#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 276#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 267#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 265#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 268#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 270#L41-1 assume true; 269#func_to_recursive_line_26_to_27_0EXIT >#102#return; 271#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 262#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 273#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 276#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 277#L61-1 assume true; 261#func_to_recursive_line_25_to_26_0EXIT >#104#return; 263#L61-1 assume true; 275#func_to_recursive_line_25_to_26_0EXIT >#98#return; 274#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 254#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 259#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 253#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 257#L81-1 assume true; 279#func_to_recursive_line_24_to_25_0EXIT >#100#return; 280#L81-1 assume true; 281#func_to_recursive_line_24_to_25_0EXIT >#112#return; 248#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 250#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 272#$Ultimate##0 [2024-10-25 00:37:52,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:52,324 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 3 times [2024-10-25 00:37:52,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:52,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460707928] [2024-10-25 00:37:52,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:52,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:52,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:52,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:52,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:52,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1525796123, now seen corresponding path program 1 times [2024-10-25 00:37:52,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:52,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677610685] [2024-10-25 00:37:52,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:52,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:52,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:52,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:52,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:52,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-25 00:37:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:52,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-25 00:37:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:52,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-25 00:37:52,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:52,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677610685] [2024-10-25 00:37:52,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677610685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:37:52,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:37:52,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-25 00:37:52,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284759425] [2024-10-25 00:37:52,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:37:52,861 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:52,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:52,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-25 00:37:52,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-25 00:37:52,862 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. cyclomatic complexity: 13 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-25 00:37:53,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:53,055 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-10-25 00:37:53,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2024-10-25 00:37:53,059 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:37:53,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2024-10-25 00:37:53,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-25 00:37:53,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-25 00:37:53,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2024-10-25 00:37:53,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:53,065 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-10-25 00:37:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2024-10-25 00:37:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-10-25 00:37:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.173913043478261) internal successors, (27), 27 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-10-25 00:37:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-10-25 00:37:53,075 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-10-25 00:37:53,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-25 00:37:53,076 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-10-25 00:37:53,077 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-25 00:37:53,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2024-10-25 00:37:53,078 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:37:53,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:53,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:53,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:53,082 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:53,082 INFO L745 eck$LassoCheckResult]: Stem: 429#$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); 408#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 393#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 419#$Ultimate##0 [2024-10-25 00:37:53,083 INFO L747 eck$LassoCheckResult]: Loop: 419#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 406#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 402#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 407#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 401#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 404#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 421#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 425#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 414#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 413#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 416#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 397#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 399#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 400#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 395#L25-1 assume true; 398#func_to_recursive_line_27_to_27_0EXIT >#108#return; 412#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 415#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 413#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 416#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 420#L41-1 assume true; 417#func_to_recursive_line_26_to_27_0EXIT >#110#return; 418#L41-1 assume true; 431#func_to_recursive_line_26_to_27_0EXIT >#102#return; 423#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 410#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 421#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 425#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 426#L61-1 assume true; 409#func_to_recursive_line_25_to_26_0EXIT >#104#return; 411#L61-1 assume true; 424#func_to_recursive_line_25_to_26_0EXIT >#98#return; 422#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 403#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 407#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 401#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 405#L81-1 assume true; 427#func_to_recursive_line_24_to_25_0EXIT >#100#return; 428#L81-1 assume true; 430#func_to_recursive_line_24_to_25_0EXIT >#112#return; 392#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 394#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 419#$Ultimate##0 [2024-10-25 00:37:53,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:53,084 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 4 times [2024-10-25 00:37:53,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:53,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306314197] [2024-10-25 00:37:53,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:53,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:53,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:53,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:53,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:53,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1439872263, now seen corresponding path program 1 times [2024-10-25 00:37:53,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:53,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500349106] [2024-10-25 00:37:53,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:53,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-25 00:37:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-25 00:37:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-25 00:37:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-25 00:37:53,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:53,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500349106] [2024-10-25 00:37:53,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500349106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:37:53,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:37:53,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-25 00:37:53,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559333772] [2024-10-25 00:37:53,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:37:53,627 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:53,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:53,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-25 00:37:53,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-25 00:37:53,629 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 13 Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-25 00:37:53,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:53,815 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-10-25 00:37:53,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2024-10-25 00:37:53,817 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:37:53,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 50 transitions. [2024-10-25 00:37:53,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-25 00:37:53,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-25 00:37:53,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 50 transitions. [2024-10-25 00:37:53,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:53,818 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-10-25 00:37:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 50 transitions. [2024-10-25 00:37:53,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-25 00:37:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 28 states have internal predecessors, (28), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-10-25 00:37:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2024-10-25 00:37:53,822 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-10-25 00:37:53,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 00:37:53,823 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-10-25 00:37:53,823 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-25 00:37:53,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2024-10-25 00:37:53,824 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:37:53,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:53,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:53,825 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:53,825 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:53,826 INFO L745 eck$LassoCheckResult]: Stem: 621#$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); 600#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 585#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 611#$Ultimate##0 [2024-10-25 00:37:53,826 INFO L747 eck$LassoCheckResult]: Loop: 611#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 598#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 594#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 599#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 593#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 596#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 613#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 617#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 606#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 605#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 608#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 588#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 591#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 592#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 589#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 591#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 592#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 587#L25-1 assume true; 590#func_to_recursive_line_27_to_27_0EXIT >#106#return; 604#L25-1 assume true; 624#func_to_recursive_line_27_to_27_0EXIT >#108#return; 622#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 607#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 605#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 608#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 612#L41-1 assume true; 609#func_to_recursive_line_26_to_27_0EXIT >#110#return; 610#L41-1 assume true; 625#func_to_recursive_line_26_to_27_0EXIT >#102#return; 615#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 602#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 613#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 617#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 618#L61-1 assume true; 601#func_to_recursive_line_25_to_26_0EXIT >#104#return; 603#L61-1 assume true; 616#func_to_recursive_line_25_to_26_0EXIT >#98#return; 614#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 595#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 599#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 593#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 597#L81-1 assume true; 619#func_to_recursive_line_24_to_25_0EXIT >#100#return; 620#L81-1 assume true; 623#func_to_recursive_line_24_to_25_0EXIT >#112#return; 584#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 586#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 611#$Ultimate##0 [2024-10-25 00:37:53,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:53,826 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 5 times [2024-10-25 00:37:53,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:53,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093487864] [2024-10-25 00:37:53,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:53,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:53,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:53,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:53,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:53,859 INFO L85 PathProgramCache]: Analyzing trace with hash 405682375, now seen corresponding path program 1 times [2024-10-25 00:37:53,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:53,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348114356] [2024-10-25 00:37:53,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:53,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:37:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-25 00:37:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-25 00:37:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-25 00:37:54,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:54,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348114356] [2024-10-25 00:37:54,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348114356] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:37:54,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282399902] [2024-10-25 00:37:54,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:54,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:37:54,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:37:54,905 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:37:54,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-25 00:37:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-25 00:37:55,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:37:55,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-25 00:37:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-25 00:37:55,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:37:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-25 00:37:56,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282399902] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:37:56,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:37:56,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 29 [2024-10-25 00:37:56,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204865449] [2024-10-25 00:37:56,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:37:56,215 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:56,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:56,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-25 00:37:56,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2024-10-25 00:37:56,216 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. cyclomatic complexity: 13 Second operand has 29 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 22 states have internal predecessors, (56), 11 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-25 00:37:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:56,876 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-10-25 00:37:56,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2024-10-25 00:37:56,878 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:37:56,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 54 transitions. [2024-10-25 00:37:56,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-10-25 00:37:56,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-10-25 00:37:56,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 54 transitions. [2024-10-25 00:37:56,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:56,881 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-25 00:37:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 54 transitions. [2024-10-25 00:37:56,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-25 00:37:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 30 states have internal predecessors, (30), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2024-10-25 00:37:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-10-25 00:37:56,888 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-25 00:37:56,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-25 00:37:56,891 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-25 00:37:56,891 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-25 00:37:56,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2024-10-25 00:37:56,892 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:37:56,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:56,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:56,894 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:56,894 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:56,894 INFO L745 eck$LassoCheckResult]: Stem: 1157#$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); 1139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1128#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 1150#$Ultimate##0 [2024-10-25 00:37:56,895 INFO L747 eck$LassoCheckResult]: Loop: 1150#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 1137#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 1133#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1138#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 1132#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 1135#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1152#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 1156#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 1146#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 1147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 1125#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1131#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1124#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1131#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1124#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1131#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1123#L25-1 assume true; 1126#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1140#L25-1 assume true; 1167#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1164#L25-1 assume true; 1163#func_to_recursive_line_27_to_27_0EXIT >#108#return; 1160#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1145#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 1147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 1125#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1131#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1124#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1131#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1124#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1131#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1123#L25-1 assume true; 1126#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1140#L25-1 assume true; 1167#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1164#L25-1 assume true; 1163#func_to_recursive_line_27_to_27_0EXIT >#108#return; 1160#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1145#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 1147#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1151#L41-1 assume true; 1148#func_to_recursive_line_26_to_27_0EXIT >#110#return; 1149#L41-1 assume true; 1168#func_to_recursive_line_26_to_27_0EXIT >#110#return; 1166#L41-1 assume true; 1165#func_to_recursive_line_26_to_27_0EXIT >#102#return; 1154#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 1142#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1152#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 1156#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1155#L61-1 assume true; 1141#func_to_recursive_line_25_to_26_0EXIT >#104#return; 1143#L61-1 assume true; 1162#func_to_recursive_line_25_to_26_0EXIT >#98#return; 1153#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 1134#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1138#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 1132#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1136#L81-1 assume true; 1158#func_to_recursive_line_24_to_25_0EXIT >#100#return; 1159#L81-1 assume true; 1161#func_to_recursive_line_24_to_25_0EXIT >#112#return; 1127#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 1129#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1150#$Ultimate##0 [2024-10-25 00:37:56,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:56,897 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 6 times [2024-10-25 00:37:56,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:56,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353135387] [2024-10-25 00:37:56,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:56,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:56,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:56,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:56,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:56,921 INFO L85 PathProgramCache]: Analyzing trace with hash 688040901, now seen corresponding path program 2 times [2024-10-25 00:37:56,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:56,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121095345] [2024-10-25 00:37:56,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:56,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:57,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:37:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:37:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-25 00:37:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-25 00:37:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 8 proven. 42 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-25 00:37:58,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:58,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121095345] [2024-10-25 00:37:58,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121095345] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:37:58,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456827957] [2024-10-25 00:37:58,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 00:37:58,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:37:58,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:37:58,745 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:37:58,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-25 00:37:58,910 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 00:37:58,910 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:37:58,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-25 00:37:58,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:37:58,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-25 00:37:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-25 00:37:59,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:38:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-25 00:38:00,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456827957] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:38:00,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:38:00,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 35 [2024-10-25 00:38:00,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742285906] [2024-10-25 00:38:00,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:38:00,513 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:38:00,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:38:00,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-25 00:38:00,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1033, Unknown=0, NotChecked=0, Total=1190 [2024-10-25 00:38:00,515 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 13 Second operand has 35 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 27 states have internal predecessors, (65), 13 states have call successors, (28), 10 states have call predecessors, (28), 11 states have return successors, (24), 11 states have call predecessors, (24), 13 states have call successors, (24) [2024-10-25 00:38:01,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:38:01,220 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-10-25 00:38:01,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2024-10-25 00:38:01,221 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:38:01,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 58 transitions. [2024-10-25 00:38:01,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-10-25 00:38:01,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-10-25 00:38:01,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2024-10-25 00:38:01,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:38:01,224 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-10-25 00:38:01,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2024-10-25 00:38:01,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-25 00:38:01,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 32 states have internal predecessors, (32), 10 states have call successors, (10), 5 states have call predecessors, (10), 12 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2024-10-25 00:38:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-10-25 00:38:01,229 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-10-25 00:38:01,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-25 00:38:01,231 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-10-25 00:38:01,231 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-25 00:38:01,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 58 transitions. [2024-10-25 00:38:01,232 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:38:01,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:38:01,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:38:01,235 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:38:01,235 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:38:01,235 INFO L745 eck$LassoCheckResult]: Stem: 2014#$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); 1993#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1983#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 2005#$Ultimate##0 [2024-10-25 00:38:01,236 INFO L747 eck$LassoCheckResult]: Loop: 2005#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 1991#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 1988#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1992#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 1986#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 1989#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2006#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 2011#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 1999#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1998#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2001#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 1979#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2009#L25-1 assume true; 1997#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1977#L25-1 assume true; 1980#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2023#L25-1 assume true; 2022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2019#L25-1 assume true; 2018#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2015#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2000#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1998#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2001#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 1979#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2009#L25-1 assume true; 1997#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1977#L25-1 assume true; 1980#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2023#L25-1 assume true; 2022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2019#L25-1 assume true; 2018#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2015#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2000#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1998#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2001#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 1979#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1985#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2009#L25-1 assume true; 1997#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1977#L25-1 assume true; 1980#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2023#L25-1 assume true; 2022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2019#L25-1 assume true; 2018#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2015#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2000#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1998#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2001#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2004#L41-1 assume true; 2002#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2003#L41-1 assume true; 2026#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2025#L41-1 assume true; 2024#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2021#L41-1 assume true; 2020#func_to_recursive_line_26_to_27_0EXIT >#102#return; 2008#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 1995#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2006#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 2011#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2010#L61-1 assume true; 1994#func_to_recursive_line_25_to_26_0EXIT >#104#return; 1996#L61-1 assume true; 2017#func_to_recursive_line_25_to_26_0EXIT >#98#return; 2007#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 1987#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1992#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 1986#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1990#L81-1 assume true; 2012#func_to_recursive_line_24_to_25_0EXIT >#100#return; 2013#L81-1 assume true; 2016#func_to_recursive_line_24_to_25_0EXIT >#112#return; 1981#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 1982#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 2005#$Ultimate##0 [2024-10-25 00:38:01,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:01,237 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 7 times [2024-10-25 00:38:01,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:01,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445689971] [2024-10-25 00:38:01,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:01,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:01,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:01,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:01,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:01,267 INFO L85 PathProgramCache]: Analyzing trace with hash -12329689, now seen corresponding path program 3 times [2024-10-25 00:38:01,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:01,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540318947] [2024-10-25 00:38:01,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:01,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:02,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:02,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:03,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:03,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:04,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:04,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:04,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:04,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-25 00:38:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:04,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:04,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:04,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:04,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:04,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-25 00:38:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:04,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:04,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:04,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:04,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:04,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-25 00:38:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:04,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-25 00:38:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:04,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-25 00:38:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:04,441 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 10 proven. 135 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-10-25 00:38:04,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:38:04,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540318947] [2024-10-25 00:38:04,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540318947] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:38:04,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110836886] [2024-10-25 00:38:04,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-25 00:38:04,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:38:04,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:04,445 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:38:04,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-25 00:38:04,596 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-25 00:38:04,596 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:38:04,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-25 00:38:04,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:04,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-25 00:38:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-10-25 00:38:04,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:38:05,400 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-10-25 00:38:05,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110836886] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:38:05,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:38:05,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 10] total 29 [2024-10-25 00:38:05,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014083374] [2024-10-25 00:38:05,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:38:05,402 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:38:05,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:38:05,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-25 00:38:05,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2024-10-25 00:38:05,403 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. cyclomatic complexity: 13 Second operand has 29 states, 23 states have (on average 2.391304347826087) internal successors, (55), 22 states have internal predecessors, (55), 10 states have call successors, (23), 9 states have call predecessors, (23), 10 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) [2024-10-25 00:38:05,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:38:05,991 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2024-10-25 00:38:05,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 62 transitions. [2024-10-25 00:38:05,992 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:38:05,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 62 transitions. [2024-10-25 00:38:05,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2024-10-25 00:38:05,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2024-10-25 00:38:05,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 62 transitions. [2024-10-25 00:38:05,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:38:05,994 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-10-25 00:38:05,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 62 transitions. [2024-10-25 00:38:05,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-25 00:38:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 34 states have internal predecessors, (34), 10 states have call successors, (10), 5 states have call predecessors, (10), 14 states have return successors, (18), 14 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-25 00:38:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-10-25 00:38:06,003 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-10-25 00:38:06,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-25 00:38:06,004 INFO L425 stractBuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-10-25 00:38:06,004 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-25 00:38:06,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2024-10-25 00:38:06,005 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:38:06,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:38:06,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:38:06,012 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:38:06,012 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 24, 24, 24, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:38:06,012 INFO L745 eck$LassoCheckResult]: Stem: 3339#$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); 3319#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 3308#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 3330#$Ultimate##0 [2024-10-25 00:38:06,013 INFO L747 eck$LassoCheckResult]: Loop: 3330#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 3317#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 3313#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3318#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 3312#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 3315#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3332#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 3337#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 3326#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 3327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 3304#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3335#L25-1 assume true; 3323#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3303#L25-1 assume true; 3306#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3353#L25-1 assume true; 3352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3346#L25-1 assume true; 3345#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3342#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3325#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 3327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 3304#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3335#L25-1 assume true; 3323#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3303#L25-1 assume true; 3306#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3353#L25-1 assume true; 3352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3346#L25-1 assume true; 3345#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3342#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3325#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 3327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 3304#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3335#L25-1 assume true; 3323#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3303#L25-1 assume true; 3306#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3353#L25-1 assume true; 3352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3346#L25-1 assume true; 3345#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3342#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3325#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 3327#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3331#L41-1 assume true; 3328#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3329#L41-1 assume true; 3356#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3355#L41-1 assume true; 3354#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3351#L41-1 assume true; 3350#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3334#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3321#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3332#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 3337#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3338#L61-1 assume true; 3320#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3322#L61-1 assume true; 3336#func_to_recursive_line_25_to_26_0EXIT >#98#return; 3333#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 3314#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3318#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 3312#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 3315#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3332#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 3337#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 3326#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 3327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 3304#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3335#L25-1 assume true; 3323#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3303#L25-1 assume true; 3306#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3353#L25-1 assume true; 3352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3346#L25-1 assume true; 3345#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3342#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3325#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 3327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 3304#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3335#L25-1 assume true; 3323#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3303#L25-1 assume true; 3306#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3353#L25-1 assume true; 3352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3346#L25-1 assume true; 3345#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3342#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3325#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 3327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 3304#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 3311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3335#L25-1 assume true; 3323#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3303#L25-1 assume true; 3306#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3353#L25-1 assume true; 3352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3346#L25-1 assume true; 3345#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3342#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3325#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 3327#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3331#L41-1 assume true; 3328#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3329#L41-1 assume true; 3356#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3355#L41-1 assume true; 3354#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3351#L41-1 assume true; 3350#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3334#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3321#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3332#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 3337#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3338#L61-1 assume true; 3320#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3322#L61-1 assume true; 3336#func_to_recursive_line_25_to_26_0EXIT >#98#return; 3333#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 3314#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3318#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 3312#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3316#L81-1 assume true; 3340#func_to_recursive_line_24_to_25_0EXIT >#100#return; 3341#L81-1 assume true; 3347#func_to_recursive_line_24_to_25_0EXIT >#100#return; 3344#L81-1 assume true; 3343#func_to_recursive_line_24_to_25_0EXIT >#112#return; 3307#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 3309#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 3330#$Ultimate##0 [2024-10-25 00:38:06,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:06,013 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 8 times [2024-10-25 00:38:06,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:06,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131498189] [2024-10-25 00:38:06,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:06,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:06,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:06,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:06,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:06,040 INFO L85 PathProgramCache]: Analyzing trace with hash -501444433, now seen corresponding path program 4 times [2024-10-25 00:38:06,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:06,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722182078] [2024-10-25 00:38:06,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:06,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:07,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-25 00:38:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-25 00:38:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-25 00:38:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-25 00:38:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2215 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 2190 trivial. 0 not checked. [2024-10-25 00:38:09,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:38:09,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722182078] [2024-10-25 00:38:09,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722182078] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:38:09,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826906225] [2024-10-25 00:38:09,200 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-25 00:38:09,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:38:09,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:09,202 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:38:09,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-25 00:38:09,606 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-25 00:38:09,606 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:38:09,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 1532 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-25 00:38:09,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:09,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-25 00:38:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2215 backedges. 114 proven. 15 refuted. 0 times theorem prover too weak. 2086 trivial. 0 not checked. [2024-10-25 00:38:09,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:38:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2215 backedges. 106 proven. 33 refuted. 0 times theorem prover too weak. 2076 trivial. 0 not checked. [2024-10-25 00:38:11,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826906225] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:38:11,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:38:11,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 18] total 37 [2024-10-25 00:38:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432355758] [2024-10-25 00:38:11,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:38:11,922 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:38:11,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:38:11,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-25 00:38:11,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2024-10-25 00:38:11,924 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 13 Second operand has 37 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 15 states have call successors, (35), 11 states have call predecessors, (35), 12 states have return successors, (29), 14 states have call predecessors, (29), 15 states have call successors, (29) [2024-10-25 00:38:12,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:38:12,483 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2024-10-25 00:38:12,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 66 transitions. [2024-10-25 00:38:12,484 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:38:12,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 66 transitions. [2024-10-25 00:38:12,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2024-10-25 00:38:12,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2024-10-25 00:38:12,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 66 transitions. [2024-10-25 00:38:12,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:38:12,486 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-10-25 00:38:12,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 66 transitions. [2024-10-25 00:38:12,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-25 00:38:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 10 states have call successors, (10), 5 states have call predecessors, (10), 16 states have return successors, (20), 16 states have call predecessors, (20), 8 states have call successors, (20) [2024-10-25 00:38:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2024-10-25 00:38:12,499 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-10-25 00:38:12,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-25 00:38:12,500 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-10-25 00:38:12,500 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-25 00:38:12,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 66 transitions. [2024-10-25 00:38:12,501 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:38:12,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:38:12,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:38:12,510 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:38:12,510 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [80, 80, 64, 64, 64, 20, 20, 16, 16, 16, 16, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:38:12,510 INFO L745 eck$LassoCheckResult]: Stem: 6340#$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); 6320#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 6309#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 6331#$Ultimate##0 [2024-10-25 00:38:12,511 INFO L747 eck$LassoCheckResult]: Loop: 6331#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 6318#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 6315#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6319#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 6313#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 6316#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6333#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 6337#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 6327#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6332#L41-1 assume true; 6329#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6330#L41-1 assume true; 6361#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6360#L41-1 assume true; 6359#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6358#L41-1 assume true; 6357#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6356#L41-1 assume true; 6355#func_to_recursive_line_26_to_27_0EXIT >#102#return; 6335#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 6323#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6333#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 6337#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 6327#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6332#L41-1 assume true; 6329#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6330#L41-1 assume true; 6361#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6360#L41-1 assume true; 6359#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6358#L41-1 assume true; 6357#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6356#L41-1 assume true; 6355#func_to_recursive_line_26_to_27_0EXIT >#102#return; 6335#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 6323#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6333#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 6337#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6336#L61-1 assume true; 6322#func_to_recursive_line_25_to_26_0EXIT >#104#return; 6324#L61-1 assume true; 6349#func_to_recursive_line_25_to_26_0EXIT >#104#return; 6345#L61-1 assume true; 6344#func_to_recursive_line_25_to_26_0EXIT >#98#return; 6334#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 6314#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6319#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 6313#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 6316#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6333#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 6337#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 6327#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6332#L41-1 assume true; 6329#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6330#L41-1 assume true; 6361#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6360#L41-1 assume true; 6359#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6358#L41-1 assume true; 6357#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6356#L41-1 assume true; 6355#func_to_recursive_line_26_to_27_0EXIT >#102#return; 6335#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 6323#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6333#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 6337#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 6327#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 6328#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6332#L41-1 assume true; 6329#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6330#L41-1 assume true; 6361#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6360#L41-1 assume true; 6359#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6358#L41-1 assume true; 6357#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6356#L41-1 assume true; 6355#func_to_recursive_line_26_to_27_0EXIT >#102#return; 6335#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 6323#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6333#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 6337#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6336#L61-1 assume true; 6322#func_to_recursive_line_25_to_26_0EXIT >#104#return; 6324#L61-1 assume true; 6349#func_to_recursive_line_25_to_26_0EXIT >#104#return; 6345#L61-1 assume true; 6344#func_to_recursive_line_25_to_26_0EXIT >#98#return; 6334#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 6314#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6319#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 6313#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 6317#L81-1 assume true; 6338#func_to_recursive_line_24_to_25_0EXIT >#100#return; 6339#L81-1 assume true; 6348#func_to_recursive_line_24_to_25_0EXIT >#100#return; 6343#L81-1 assume true; 6342#func_to_recursive_line_24_to_25_0EXIT >#112#return; 6308#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 6310#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 6331#$Ultimate##0 [2024-10-25 00:38:12,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:12,512 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 9 times [2024-10-25 00:38:12,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:12,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515596285] [2024-10-25 00:38:12,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:12,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:12,529 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:12,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:12,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:12,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1995563505, now seen corresponding path program 5 times [2024-10-25 00:38:12,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:12,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804156869] [2024-10-25 00:38:12,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:12,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:15,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:18,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:19,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:19,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-25 00:38:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-25 00:38:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-25 00:38:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-25 00:38:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-25 00:38:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-25 00:38:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 15869 backedges. 16 proven. 1478 refuted. 0 times theorem prover too weak. 14375 trivial. 0 not checked. [2024-10-25 00:38:21,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:38:21,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804156869] [2024-10-25 00:38:21,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804156869] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:38:21,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544464516] [2024-10-25 00:38:21,368 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-25 00:38:21,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:38:21,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:21,371 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:38:21,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-25 00:38:31,443 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-10-25 00:38:31,444 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:38:31,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 1697 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-25 00:38:31,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:31,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-25 00:38:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 15869 backedges. 3513 proven. 24 refuted. 0 times theorem prover too weak. 12332 trivial. 0 not checked. [2024-10-25 00:38:31,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:38:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 15869 backedges. 139 proven. 1786 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2024-10-25 00:38:35,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544464516] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:38:35,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:38:35,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 22] total 37 [2024-10-25 00:38:35,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282885863] [2024-10-25 00:38:35,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:38:35,770 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:38:35,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:38:35,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-25 00:38:35,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2024-10-25 00:38:35,773 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. cyclomatic complexity: 13 Second operand has 37 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 28 states have internal predecessors, (74), 10 states have call successors, (38), 11 states have call predecessors, (38), 12 states have return successors, (36), 10 states have call predecessors, (36), 10 states have call successors, (36) [2024-10-25 00:38:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:38:36,187 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2024-10-25 00:38:36,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 68 transitions. [2024-10-25 00:38:36,188 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:38:36,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 68 transitions. [2024-10-25 00:38:36,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2024-10-25 00:38:36,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2024-10-25 00:38:36,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 68 transitions. [2024-10-25 00:38:36,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:38:36,195 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 68 transitions. [2024-10-25 00:38:36,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 68 transitions. [2024-10-25 00:38:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-25 00:38:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.121212121212121) internal successors, (37), 37 states have internal predecessors, (37), 10 states have call successors, (10), 5 states have call predecessors, (10), 17 states have return successors, (21), 17 states have call predecessors, (21), 8 states have call successors, (21) [2024-10-25 00:38:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2024-10-25 00:38:36,204 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 68 transitions. [2024-10-25 00:38:36,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-25 00:38:36,205 INFO L425 stractBuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2024-10-25 00:38:36,206 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-25 00:38:36,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 68 transitions. [2024-10-25 00:38:36,207 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:38:36,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:38:36,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:38:36,216 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:38:36,216 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [96, 96, 80, 80, 80, 20, 20, 16, 16, 16, 16, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:38:36,216 INFO L745 eck$LassoCheckResult]: Stem: 14055#$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); 14035#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 14024#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 14046#$Ultimate##0 [2024-10-25 00:38:36,218 INFO L747 eck$LassoCheckResult]: Loop: 14046#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 14033#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 14029#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14034#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 14028#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 14031#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14048#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 14052#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 14042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14047#L41-1 assume true; 14044#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14045#L41-1 assume true; 14078#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14077#L41-1 assume true; 14076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14075#L41-1 assume true; 14074#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14073#L41-1 assume true; 14072#func_to_recursive_line_26_to_27_0EXIT >#102#return; 14050#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 14037#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14048#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 14052#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 14042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14047#L41-1 assume true; 14044#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14045#L41-1 assume true; 14078#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14077#L41-1 assume true; 14076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14075#L41-1 assume true; 14074#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14073#L41-1 assume true; 14072#func_to_recursive_line_26_to_27_0EXIT >#102#return; 14050#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 14037#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14048#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 14052#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 14051#L61-1 assume true; 14036#func_to_recursive_line_25_to_26_0EXIT >#104#return; 14038#L61-1 assume true; 14064#func_to_recursive_line_25_to_26_0EXIT >#104#return; 14060#L61-1 assume true; 14059#func_to_recursive_line_25_to_26_0EXIT >#98#return; 14049#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 14030#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14034#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 14028#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 14031#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14048#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 14052#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 14042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14047#L41-1 assume true; 14044#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14045#L41-1 assume true; 14078#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14077#L41-1 assume true; 14076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14075#L41-1 assume true; 14074#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14073#L41-1 assume true; 14072#func_to_recursive_line_26_to_27_0EXIT >#102#return; 14050#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 14037#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14048#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 14052#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 14042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 14021#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14020#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14026#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 14027#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14019#L25-1 assume true; 14022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14039#L25-1 assume true; 14071#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14070#L25-1 assume true; 14069#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14068#L25-1 assume true; 14067#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14066#L25-1 assume true; 14065#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14062#L25-1 assume true; 14061#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14056#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 14041#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 14043#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14047#L41-1 assume true; 14044#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14045#L41-1 assume true; 14078#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14077#L41-1 assume true; 14076#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14075#L41-1 assume true; 14074#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14073#L41-1 assume true; 14072#func_to_recursive_line_26_to_27_0EXIT >#102#return; 14050#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 14037#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14048#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 14052#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 14051#L61-1 assume true; 14036#func_to_recursive_line_25_to_26_0EXIT >#104#return; 14038#L61-1 assume true; 14064#func_to_recursive_line_25_to_26_0EXIT >#104#return; 14060#L61-1 assume true; 14059#func_to_recursive_line_25_to_26_0EXIT >#98#return; 14049#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 14030#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14034#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 14028#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 14032#L81-1 assume true; 14053#func_to_recursive_line_24_to_25_0EXIT >#100#return; 14054#L81-1 assume true; 14063#func_to_recursive_line_24_to_25_0EXIT >#100#return; 14058#L81-1 assume true; 14057#func_to_recursive_line_24_to_25_0EXIT >#112#return; 14023#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 14025#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 14046#$Ultimate##0 [2024-10-25 00:38:36,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:36,221 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 10 times [2024-10-25 00:38:36,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:36,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704979571] [2024-10-25 00:38:36,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:36,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:36,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:36,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:36,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:36,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1679139599, now seen corresponding path program 6 times [2024-10-25 00:38:36,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:36,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084703862] [2024-10-25 00:38:36,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:36,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:39,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:43,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:45,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:45,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:45,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:38:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:38:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:38:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:38:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-25 00:38:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:38:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:38:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:38:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:38:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-25 00:38:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2024-10-25 00:38:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:38:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:38:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:38:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:38:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-25 00:38:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:38:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:38:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:38:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:38:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-25 00:38:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2024-10-25 00:38:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 22613 backedges. 24 proven. 2119 refuted. 0 times theorem prover too weak. 20470 trivial. 0 not checked. [2024-10-25 00:38:47,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:38:47,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084703862] [2024-10-25 00:38:47,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084703862] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:38:47,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767027866] [2024-10-25 00:38:47,590 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-25 00:38:47,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:38:47,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:47,594 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:38:47,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-25 00:38:48,066 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-10-25 00:38:48,066 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:38:48,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-25 00:38:48,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:48,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-25 00:38:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 22613 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22605 trivial. 0 not checked. [2024-10-25 00:38:48,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:38:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 22613 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 22598 trivial. 0 not checked. [2024-10-25 00:38:50,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767027866] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:38:50,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:38:50,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 14] total 38 [2024-10-25 00:38:50,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547671333] [2024-10-25 00:38:50,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:38:50,879 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:38:50,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:38:50,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-25 00:38:50,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2024-10-25 00:38:50,881 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. cyclomatic complexity: 13 Second operand has 38 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 13 states have call successors, (28), 10 states have call predecessors, (28), 14 states have return successors, (28), 14 states have call predecessors, (28), 13 states have call successors, (28) [2024-10-25 00:38:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:38:51,627 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2024-10-25 00:38:51,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 72 transitions. [2024-10-25 00:38:51,629 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:38:51,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 72 transitions. [2024-10-25 00:38:51,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2024-10-25 00:38:51,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2024-10-25 00:38:51,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 72 transitions. [2024-10-25 00:38:51,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:38:51,630 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-10-25 00:38:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 72 transitions. [2024-10-25 00:38:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-25 00:38:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 39 states have internal predecessors, (39), 10 states have call successors, (10), 5 states have call predecessors, (10), 19 states have return successors, (23), 19 states have call predecessors, (23), 8 states have call successors, (23) [2024-10-25 00:38:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-10-25 00:38:51,635 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-10-25 00:38:51,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-25 00:38:51,639 INFO L425 stractBuchiCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-10-25 00:38:51,639 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-25 00:38:51,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 72 transitions. [2024-10-25 00:38:51,640 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:38:51,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:38:51,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:38:51,646 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:38:51,646 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [168, 168, 144, 144, 144, 30, 30, 24, 24, 24, 24, 24, 24, 24, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:38:51,646 INFO L745 eck$LassoCheckResult]: Stem: 23182#$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); 23163#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 23153#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 23174#$Ultimate##0 [2024-10-25 00:38:51,647 INFO L747 eck$LassoCheckResult]: Loop: 23174#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 23161#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 23157#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 23156#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 23159#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 23180#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 23170#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 23175#L41-1 assume true; 23172#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23173#L41-1 assume true; 23210#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23209#L41-1 assume true; 23208#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23207#L41-1 assume true; 23206#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23205#L41-1 assume true; 23204#func_to_recursive_line_26_to_27_0EXIT >#102#return; 23178#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 23165#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 23180#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 23170#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 23175#L41-1 assume true; 23172#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23173#L41-1 assume true; 23210#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23209#L41-1 assume true; 23208#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23207#L41-1 assume true; 23206#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23205#L41-1 assume true; 23204#func_to_recursive_line_26_to_27_0EXIT >#102#return; 23178#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 23165#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 23180#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 23181#L61-1 assume true; 23164#func_to_recursive_line_25_to_26_0EXIT >#104#return; 23166#L61-1 assume true; 23179#func_to_recursive_line_25_to_26_0EXIT >#104#return; 23190#L61-1 assume true; 23189#func_to_recursive_line_25_to_26_0EXIT >#98#return; 23177#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 23158#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 23156#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 23159#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 23180#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 23170#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 23175#L41-1 assume true; 23172#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23173#L41-1 assume true; 23210#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23209#L41-1 assume true; 23208#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23207#L41-1 assume true; 23206#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23205#L41-1 assume true; 23204#func_to_recursive_line_26_to_27_0EXIT >#102#return; 23178#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 23165#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 23180#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 23170#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 23175#L41-1 assume true; 23172#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23173#L41-1 assume true; 23210#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23209#L41-1 assume true; 23208#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23207#L41-1 assume true; 23206#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23205#L41-1 assume true; 23204#func_to_recursive_line_26_to_27_0EXIT >#102#return; 23178#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 23165#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 23180#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 23181#L61-1 assume true; 23164#func_to_recursive_line_25_to_26_0EXIT >#104#return; 23166#L61-1 assume true; 23179#func_to_recursive_line_25_to_26_0EXIT >#104#return; 23190#L61-1 assume true; 23189#func_to_recursive_line_25_to_26_0EXIT >#98#return; 23177#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 23158#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 23156#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4); 23159#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 23180#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 23170#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 23175#L41-1 assume true; 23172#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23173#L41-1 assume true; 23210#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23209#L41-1 assume true; 23208#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23207#L41-1 assume true; 23206#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23205#L41-1 assume true; 23204#func_to_recursive_line_26_to_27_0EXIT >#102#return; 23178#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 23165#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 23180#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 23170#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 23149#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 23148#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 23154#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 23155#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 23147#L25-1 assume true; 23150#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23167#L25-1 assume true; 23203#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23202#L25-1 assume true; 23201#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23200#L25-1 assume true; 23199#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23198#L25-1 assume true; 23197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23196#L25-1 assume true; 23194#func_to_recursive_line_27_to_27_0EXIT >#106#return; 23192#L25-1 assume true; 23191#func_to_recursive_line_27_to_27_0EXIT >#108#return; 23185#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 23169#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 23168#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 23171#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 23175#L41-1 assume true; 23172#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23173#L41-1 assume true; 23210#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23209#L41-1 assume true; 23208#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23207#L41-1 assume true; 23206#func_to_recursive_line_26_to_27_0EXIT >#110#return; 23205#L41-1 assume true; 23204#func_to_recursive_line_26_to_27_0EXIT >#102#return; 23178#L67-1 call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 23165#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4); 23180#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 23181#L61-1 assume true; 23164#func_to_recursive_line_25_to_26_0EXIT >#104#return; 23166#L61-1 assume true; 23179#func_to_recursive_line_25_to_26_0EXIT >#104#return; 23190#L61-1 assume true; 23189#func_to_recursive_line_25_to_26_0EXIT >#98#return; 23177#L87-1 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 23158#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 23162#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 23156#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 23160#L81-1 assume true; 23183#func_to_recursive_line_24_to_25_0EXIT >#100#return; 23184#L81-1 assume true; 23186#func_to_recursive_line_24_to_25_0EXIT >#100#return; 23195#L81-1 assume true; 23193#func_to_recursive_line_24_to_25_0EXIT >#100#return; 23188#L81-1 assume true; 23187#func_to_recursive_line_24_to_25_0EXIT >#112#return; 23151#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 23152#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 23174#$Ultimate##0 [2024-10-25 00:38:51,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:51,649 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 11 times [2024-10-25 00:38:51,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:51,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090606581] [2024-10-25 00:38:51,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:51,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:51,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:51,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:51,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:51,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1878559914, now seen corresponding path program 7 times [2024-10-25 00:38:51,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:51,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971913036] [2024-10-25 00:38:51,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:51,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:56,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:01,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:02,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:02,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:02,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:02,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:02,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:02,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:02,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:02,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:02,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:03,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-25 00:39:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat