./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd --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 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:28:09,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:28:09,744 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-13 15:28:09,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:28:09,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:28:09,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:28:09,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:28:09,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:28:09,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:28:09,795 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:28:09,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:28:09,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:28:09,797 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:28:09,797 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-13 15:28:09,798 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-13 15:28:09,798 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-13 15:28:09,798 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-13 15:28:09,799 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-13 15:28:09,799 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-13 15:28:09,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:28:09,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-13 15:28:09,799 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:28:09,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:28:09,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:28:09,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:28:09,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-13 15:28:09,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-13 15:28:09,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-13 15:28:09,800 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:28:09,800 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 15:28:09,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:28:09,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:28:09,801 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-13 15:28:09,801 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:28:09,801 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:28:09,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:28:09,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:28:09,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:28:09,803 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-13 15:28:09,803 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd 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 -> 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 [2024-11-13 15:28:10,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:28:10,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:28:10,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:28:10,160 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:28:10,160 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:28:10,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c Unable to find full path for "g++" [2024-11-13 15:28:12,070 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:28:12,399 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:28:12,401 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2024-11-13 15:28:12,423 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/data/41bd7546e/d000d8e19c2d4f62bb7aa235016a0e06/FLAG29e23af43 [2024-11-13 15:28:12,650 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/data/41bd7546e/d000d8e19c2d4f62bb7aa235016a0e06 [2024-11-13 15:28:12,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:28:12,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:28:12,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:28:12,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:28:12,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:28:12,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:28:12" (1/1) ... [2024-11-13 15:28:12,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1afd6e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:28:12, skipping insertion in model container [2024-11-13 15:28:12,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:28:12" (1/1) ... [2024-11-13 15:28:12,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:28:12,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:28:12,912 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:28:12,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:28:12,966 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:28:12,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:28:12 WrapperNode [2024-11-13 15:28:12,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:28:12,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:28:12,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:28:12,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:28:12,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:28:12" (1/1) ... [2024-11-13 15:28:12,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:28:12" (1/1) ... [2024-11-13 15:28:13,011 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-11-13 15:28:13,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:28:13,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:28:13,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:28:13,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:28:13,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:28:12" (1/1) ... [2024-11-13 15:28:13,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:28:12" (1/1) ... [2024-11-13 15:28:13,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:28:12" (1/1) ... [2024-11-13 15:28:13,056 INFO L175 MemorySlicer]: Split 26 memory accesses to 5 slices as follows [2, 6, 6, 6, 6]. 23 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 8 writes are split as follows [0, 2, 2, 2, 2]. [2024-11-13 15:28:13,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:28:12" (1/1) ... [2024-11-13 15:28:13,057 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:28:12" (1/1) ... [2024-11-13 15:28:13,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:28:12" (1/1) ... [2024-11-13 15:28:13,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:28:12" (1/1) ... [2024-11-13 15:28:13,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:28:12" (1/1) ... [2024-11-13 15:28:13,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:28:12" (1/1) ... [2024-11-13 15:28:13,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:28:13,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:28:13,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:28:13,086 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:28:13,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:28:12" (1/1) ... [2024-11-13 15:28:13,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 15:28:13,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:28:13,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 15:28:13,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-13 15:28:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:28:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:28:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:28:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 15:28:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 15:28:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 15:28:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 15:28:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 15:28:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 15:28:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 15:28:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 15:28:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-13 15:28:13,168 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-11-13 15:28:13,168 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-11-13 15:28:13,168 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-11-13 15:28:13,168 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-11-13 15:28:13,168 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2024-11-13 15:28:13,168 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2024-11-13 15:28:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2024-11-13 15:28:13,169 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2024-11-13 15:28:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:28:13,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:28:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 15:28:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 15:28:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 15:28:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 15:28:13,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-13 15:28:13,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 15:28:13,284 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:28:13,286 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:28:13,653 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-13 15:28:13,653 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:28:13,672 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:28:13,672 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 15:28:13,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:28:13 BoogieIcfgContainer [2024-11-13 15:28:13,675 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:28:13,676 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-13 15:28:13,676 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-13 15:28:13,682 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-13 15:28:13,683 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 15:28:13,683 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 03:28:12" (1/3) ... [2024-11-13 15:28:13,684 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78c764ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 03:28:13, skipping insertion in model container [2024-11-13 15:28:13,684 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 15:28:13,684 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:28:12" (2/3) ... [2024-11-13 15:28:13,685 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78c764ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 03:28:13, skipping insertion in model container [2024-11-13 15:28:13,685 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 15:28:13,685 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:28:13" (3/3) ... [2024-11-13 15:28:13,686 INFO L333 chiAutomizerObserver]: Analyzing ICFG recursified_nested_4.c [2024-11-13 15:28:13,744 INFO L299 stractBuchiCegarLoop]: Interprodecural is true [2024-11-13 15:28:13,744 INFO L300 stractBuchiCegarLoop]: Hoare is None [2024-11-13 15:28:13,745 INFO L301 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-13 15:28:13,745 INFO L302 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-13 15:28:13,745 INFO L303 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-13 15:28:13,745 INFO L304 stractBuchiCegarLoop]: Difference is false [2024-11-13 15:28:13,745 INFO L305 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-13 15:28:13,745 INFO L309 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-13 15:28:13,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 15:28:13,773 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:28:13,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:28:13,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:28:13,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:28:13,782 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:28:13,782 INFO L331 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-13 15:28:13,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 15:28:13,788 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:28:13,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:28:13,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:28:13,789 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:28:13,789 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:28:13,799 INFO L745 eck$LassoCheckResult]: Stem: 37#$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); 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 29#L107true call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 33#$Ultimate##0true [2024-11-13 15:28:13,800 INFO L747 eck$LassoCheckResult]: Loop: 33#$Ultimate##0true ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 10#L81true assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 21#L87true call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20#$Ultimate##0true ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 24#L61true assume !(#t~mem10 < 6);havoc #t~mem10; 6#L61-1true assume true; 9#func_to_recursive_line_23_to_24_0EXITtrue >#88#return; 15#L87-1true call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 7#L92true call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 33#$Ultimate##0true [2024-11-13 15:28:13,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:13,805 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 1 times [2024-11-13 15:28:13,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:13,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553488017] [2024-11-13 15:28:13,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:13,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:28:13,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:28:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:28:14,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:28:14,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:14,049 INFO L85 PathProgramCache]: Analyzing trace with hash -448633028, now seen corresponding path program 1 times [2024-11-13 15:28:14,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:14,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402704371] [2024-11-13 15:28:14,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:14,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:14,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:14,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:28:14,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:28:14,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402704371] [2024-11-13 15:28:14,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402704371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:28:14,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:28:14,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:28:14,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025571676] [2024-11-13 15:28:14,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:28:14,604 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:28:14,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:28:14,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:28:14,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:28:14,638 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 15:28:14,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:28:14,942 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2024-11-13 15:28:14,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 61 transitions. [2024-11-13 15:28:14,947 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:28:14,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 33 states and 41 transitions. [2024-11-13 15:28:14,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-13 15:28:14,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-13 15:28:14,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2024-11-13 15:28:14,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:28:14,967 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-13 15:28:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2024-11-13 15:28:14,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-11-13 15:28:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 20 states have internal predecessors, (20), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-13 15:28:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-13 15:28:15,005 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-13 15:28:15,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:28:15,012 INFO L424 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-13 15:28:15,012 INFO L331 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-13 15:28:15,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2024-11-13 15:28:15,014 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:28:15,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:28:15,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:28:15,017 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:28:15,017 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:28:15,018 INFO L745 eck$LassoCheckResult]: Stem: 136#$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); 124#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 120#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 121#$Ultimate##0 [2024-11-13 15:28:15,018 INFO L747 eck$LassoCheckResult]: Loop: 121#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 123#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 110#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 111#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 131#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 113#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 125#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 112#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 116#L41-1 assume true; 132#func_to_recursive_line_24_to_25_0EXIT >#84#return; 134#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 109#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 111#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 131#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 117#L61-1 assume true; 118#func_to_recursive_line_23_to_24_0EXIT >#86#return; 122#L61-1 assume true; 137#func_to_recursive_line_23_to_24_0EXIT >#88#return; 128#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 119#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 121#$Ultimate##0 [2024-11-13 15:28:15,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:15,019 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 2 times [2024-11-13 15:28:15,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:15,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681739466] [2024-11-13 15:28:15,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:15,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:28:15,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:28:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:28:15,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:28:15,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:15,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1860565822, now seen corresponding path program 1 times [2024-11-13 15:28:15,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:15,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130879328] [2024-11-13 15:28:15,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:15,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:15,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:15,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:15,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 15:28:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:28:15,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:28:15,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130879328] [2024-11-13 15:28:15,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130879328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:28:15,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:28:15,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:28:15,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231180637] [2024-11-13 15:28:15,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:28:15,636 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:28:15,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:28:15,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:28:15,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:28:15,637 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. cyclomatic complexity: 10 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-11-13 15:28:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:28:15,872 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-11-13 15:28:15,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2024-11-13 15:28:15,874 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:28:15,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2024-11-13 15:28:15,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-13 15:28:15,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-13 15:28:15,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2024-11-13 15:28:15,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:28:15,880 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-13 15:28:15,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2024-11-13 15:28:15,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-11-13 15:28:15,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 21 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-13 15:28:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-13 15:28:15,887 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-13 15:28:15,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:28:15,888 INFO L424 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-13 15:28:15,890 INFO L331 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-13 15:28:15,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2024-11-13 15:28:15,891 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:28:15,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:28:15,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:28:15,892 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:28:15,893 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:28:15,893 INFO L745 eck$LassoCheckResult]: Stem: 237#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 223#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 219#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 220#$Ultimate##0 [2024-11-13 15:28:15,894 INFO L747 eck$LassoCheckResult]: Loop: 220#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 222#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 209#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 210#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 230#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 212#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 224#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 211#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 214#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 226#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 235#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 228#L25-1 assume true; 229#func_to_recursive_line_25_to_25_0EXIT >#80#return; 233#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 213#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 224#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 211#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 215#L41-1 assume true; 236#func_to_recursive_line_24_to_25_0EXIT >#82#return; 231#L41-1 assume true; 232#func_to_recursive_line_24_to_25_0EXIT >#84#return; 234#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 208#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 210#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 230#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 216#L61-1 assume true; 217#func_to_recursive_line_23_to_24_0EXIT >#86#return; 221#L61-1 assume true; 238#func_to_recursive_line_23_to_24_0EXIT >#88#return; 227#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 218#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 220#$Ultimate##0 [2024-11-13 15:28:15,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:15,895 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 3 times [2024-11-13 15:28:15,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:15,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347330842] [2024-11-13 15:28:15,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:15,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:28:15,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:28:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:28:15,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:28:15,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:15,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1780666575, now seen corresponding path program 1 times [2024-11-13 15:28:15,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:15,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701167086] [2024-11-13 15:28:15,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:15,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:16,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:16,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:16,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:16,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 15:28:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:16,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-13 15:28:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 15:28:16,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:28:16,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701167086] [2024-11-13 15:28:16,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701167086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:28:16,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:28:16,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:28:16,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882915593] [2024-11-13 15:28:16,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:28:16,645 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:28:16,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:28:16,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:28:16,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:28:16,647 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 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-11-13 15:28:16,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:28:16,840 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-11-13 15:28:16,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2024-11-13 15:28:16,842 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:28:16,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2024-11-13 15:28:16,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-13 15:28:16,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-13 15:28:16,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2024-11-13 15:28:16,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:28:16,848 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-13 15:28:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2024-11-13 15:28:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-13 15:28:16,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 22 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-13 15:28:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-13 15:28:16,855 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-13 15:28:16,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:28:16,857 INFO L424 stractBuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-13 15:28:16,857 INFO L331 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-13 15:28:16,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2024-11-13 15:28:16,859 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:28:16,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:28:16,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:28:16,861 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:28:16,862 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] [2024-11-13 15:28:16,862 INFO L745 eck$LassoCheckResult]: Stem: 369#$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); 355#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 351#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 352#$Ultimate##0 [2024-11-13 15:28:16,863 INFO L747 eck$LassoCheckResult]: Loop: 352#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 354#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 341#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 342#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 362#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 344#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 356#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 343#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 346#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 358#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 367#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 357#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 358#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 367#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 360#L25-1 assume true; 361#func_to_recursive_line_25_to_25_0EXIT >#92#return; 364#L25-1 assume true; 370#func_to_recursive_line_25_to_25_0EXIT >#80#return; 365#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 345#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 356#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 343#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 347#L41-1 assume true; 363#func_to_recursive_line_24_to_25_0EXIT >#82#return; 368#L41-1 assume true; 372#func_to_recursive_line_24_to_25_0EXIT >#84#return; 366#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 340#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 342#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 362#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 348#L61-1 assume true; 349#func_to_recursive_line_23_to_24_0EXIT >#86#return; 353#L61-1 assume true; 371#func_to_recursive_line_23_to_24_0EXIT >#88#return; 359#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 350#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 352#$Ultimate##0 [2024-11-13 15:28:16,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:16,863 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 4 times [2024-11-13 15:28:16,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:16,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469815590] [2024-11-13 15:28:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:16,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:28:16,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:28:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:28:16,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:28:16,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:16,900 INFO L85 PathProgramCache]: Analyzing trace with hash -971158242, now seen corresponding path program 1 times [2024-11-13 15:28:16,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:16,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709039756] [2024-11-13 15:28:16,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:16,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:17,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:17,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:17,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:18,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:18,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:28:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:18,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 15:28:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 15:28:18,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:28:18,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709039756] [2024-11-13 15:28:18,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709039756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:28:18,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086075250] [2024-11-13 15:28:18,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:18,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:28:18,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:28:18,337 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:28:18,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:28:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:18,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 15:28:18,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:28:18,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 15:28:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 15:28:18,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:28:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 15:28:19,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086075250] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:28:19,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:28:19,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2024-11-13 15:28:19,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961732570] [2024-11-13 15:28:19,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:28:19,956 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:28:19,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:28:19,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 15:28:19,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-11-13 15:28:19,957 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. cyclomatic complexity: 10 Second operand has 23 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 7 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-13 15:28:20,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:28:20,452 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-11-13 15:28:20,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2024-11-13 15:28:20,453 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:28:20,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 43 transitions. [2024-11-13 15:28:20,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2024-11-13 15:28:20,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-13 15:28:20,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2024-11-13 15:28:20,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:28:20,455 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-13 15:28:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2024-11-13 15:28:20,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-13 15:28:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-13 15:28:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-11-13 15:28:20,459 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-13 15:28:20,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:28:20,460 INFO L424 stractBuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-13 15:28:20,460 INFO L331 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-13 15:28:20,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 43 transitions. [2024-11-13 15:28:20,461 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:28:20,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:28:20,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:28:20,463 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:28:20,463 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:28:20,463 INFO L745 eck$LassoCheckResult]: Stem: 756#$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); 743#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 739#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 740#$Ultimate##0 [2024-11-13 15:28:20,463 INFO L747 eck$LassoCheckResult]: Loop: 740#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 742#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 729#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 730#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 750#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 732#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 744#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 731#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 734#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 747#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 757#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 746#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 747#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 757#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 746#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 747#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 757#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 746#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 747#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 757#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 748#L25-1 assume true; 749#func_to_recursive_line_25_to_25_0EXIT >#92#return; 752#L25-1 assume true; 763#func_to_recursive_line_25_to_25_0EXIT >#92#return; 762#L25-1 assume true; 761#func_to_recursive_line_25_to_25_0EXIT >#92#return; 760#L25-1 assume true; 759#func_to_recursive_line_25_to_25_0EXIT >#80#return; 753#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 733#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 744#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 731#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 735#L41-1 assume true; 751#func_to_recursive_line_24_to_25_0EXIT >#82#return; 755#L41-1 assume true; 764#func_to_recursive_line_24_to_25_0EXIT >#84#return; 754#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 728#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 730#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 750#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 736#L61-1 assume true; 737#func_to_recursive_line_23_to_24_0EXIT >#86#return; 741#L61-1 assume true; 758#func_to_recursive_line_23_to_24_0EXIT >#88#return; 745#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 738#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 740#$Ultimate##0 [2024-11-13 15:28:20,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:20,464 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 5 times [2024-11-13 15:28:20,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:20,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321582684] [2024-11-13 15:28:20,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:20,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:28:20,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:28:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:28:20,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:28:20,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:20,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2092880572, now seen corresponding path program 2 times [2024-11-13 15:28:20,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:20,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362747745] [2024-11-13 15:28:20,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:20,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:21,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:21,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:21,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:22,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:22,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:22,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:22,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:28:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:22,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 15:28:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:22,585 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 15:28:22,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:28:22,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362747745] [2024-11-13 15:28:22,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362747745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:28:22,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858583957] [2024-11-13 15:28:22,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:28:22,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:28:22,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:28:22,588 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:28:22,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:28:22,745 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:28:22,745 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:28:22,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-13 15:28:22,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:28:22,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 15:28:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 15:28:23,322 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:28:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 15:28:25,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858583957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:28:25,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:28:25,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 18] total 38 [2024-11-13 15:28:25,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669191890] [2024-11-13 15:28:25,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:28:25,601 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:28:25,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:28:25,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-13 15:28:25,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1163, Unknown=0, NotChecked=0, Total=1406 [2024-11-13 15:28:25,602 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. cyclomatic complexity: 10 Second operand has 38 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 31 states have internal predecessors, (53), 12 states have call successors, (21), 9 states have call predecessors, (21), 11 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) [2024-11-13 15:28:26,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:28:26,355 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-13 15:28:26,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2024-11-13 15:28:26,359 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:28:26,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 47 transitions. [2024-11-13 15:28:26,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2024-11-13 15:28:26,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-11-13 15:28:26,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2024-11-13 15:28:26,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:28:26,361 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-13 15:28:26,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2024-11-13 15:28:26,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-13 15:28:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 26 states have internal predecessors, (26), 8 states have call successors, (8), 4 states have call predecessors, (8), 10 states have return successors, (13), 10 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-13 15:28:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-13 15:28:26,368 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-13 15:28:26,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 15:28:26,369 INFO L424 stractBuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-13 15:28:26,369 INFO L331 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-13 15:28:26,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2024-11-13 15:28:26,370 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:28:26,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:28:26,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:28:26,371 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:28:26,371 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:28:26,372 INFO L745 eck$LassoCheckResult]: Stem: 1291#$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); 1277#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1273#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 1274#$Ultimate##0 [2024-11-13 15:28:26,372 INFO L747 eck$LassoCheckResult]: Loop: 1274#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 1276#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 1263#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1264#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 1284#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 1267#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1278#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 1265#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 1268#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1280#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1290#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1279#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1280#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1290#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1279#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1280#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1290#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1279#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1280#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1290#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1279#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1280#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1290#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1279#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1280#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1290#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1282#L25-1 assume true; 1283#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1286#L25-1 assume true; 1302#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1301#L25-1 assume true; 1300#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1299#L25-1 assume true; 1298#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1296#L25-1 assume true; 1295#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1293#L25-1 assume true; 1292#func_to_recursive_line_25_to_25_0EXIT >#80#return; 1287#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 1266#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1278#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 1265#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1269#L41-1 assume true; 1285#func_to_recursive_line_24_to_25_0EXIT >#82#return; 1289#L41-1 assume true; 1297#func_to_recursive_line_24_to_25_0EXIT >#84#return; 1288#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 1262#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1264#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 1284#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1270#L61-1 assume true; 1271#func_to_recursive_line_23_to_24_0EXIT >#86#return; 1275#L61-1 assume true; 1294#func_to_recursive_line_23_to_24_0EXIT >#88#return; 1281#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 1272#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 1274#$Ultimate##0 [2024-11-13 15:28:26,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:26,372 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 6 times [2024-11-13 15:28:26,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:26,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358845041] [2024-11-13 15:28:26,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:26,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:28:26,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:28:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:28:26,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:28:26,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1778629226, now seen corresponding path program 3 times [2024-11-13 15:28:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:26,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451967898] [2024-11-13 15:28:26,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:26,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:27,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:28,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:28,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:29,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:29,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:29,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:29,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:29,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:30,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:28:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:30,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 15:28:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 15:28:30,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:28:30,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451967898] [2024-11-13 15:28:30,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451967898] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:28:30,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537342801] [2024-11-13 15:28:30,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 15:28:30,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:28:30,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:28:30,035 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:28:30,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:28:30,165 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-13 15:28:30,165 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:28:30,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 15:28:30,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:28:30,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:28:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-13 15:28:30,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:28:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-13 15:28:31,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537342801] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:28:31,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:28:31,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 10] total 32 [2024-11-13 15:28:31,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558063530] [2024-11-13 15:28:31,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:28:31,009 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:28:31,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:28:31,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-13 15:28:31,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2024-11-13 15:28:31,012 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. cyclomatic complexity: 10 Second operand has 32 states, 25 states have (on average 2.0) internal successors, (50), 26 states have internal predecessors, (50), 11 states have call successors, (17), 8 states have call predecessors, (17), 12 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-13 15:28:31,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:28:31,900 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-11-13 15:28:31,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2024-11-13 15:28:31,901 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:28:31,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 51 transitions. [2024-11-13 15:28:31,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2024-11-13 15:28:31,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-11-13 15:28:31,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 51 transitions. [2024-11-13 15:28:31,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:28:31,903 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-11-13 15:28:31,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 51 transitions. [2024-11-13 15:28:31,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-13 15:28:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 12 states have return successors, (15), 12 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-13 15:28:31,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-11-13 15:28:31,907 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-11-13 15:28:31,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 15:28:31,909 INFO L424 stractBuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-11-13 15:28:31,909 INFO L331 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-13 15:28:31,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 51 transitions. [2024-11-13 15:28:31,910 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:28:31,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:28:31,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:28:31,913 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:28:31,916 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 12, 12, 12, 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-11-13 15:28:31,916 INFO L745 eck$LassoCheckResult]: Stem: 1968#$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); 1955#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1951#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 1952#$Ultimate##0 [2024-11-13 15:28:31,916 INFO L747 eck$LassoCheckResult]: Loop: 1952#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 1954#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 1941#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1942#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 1962#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 1945#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1956#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 1943#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 1946#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1959#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1969#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1958#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1959#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1969#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1958#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1959#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1969#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1958#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1959#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1969#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1958#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1959#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1969#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1958#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1959#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1969#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1958#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1959#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1969#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1960#L25-1 assume true; 1961#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1964#L25-1 assume true; 1984#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1983#L25-1 assume true; 1982#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1980#L25-1 assume true; 1979#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1978#L25-1 assume true; 1977#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1976#L25-1 assume true; 1975#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1973#L25-1 assume true; 1972#func_to_recursive_line_25_to_25_0EXIT >#80#return; 1965#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 1944#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1956#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 1943#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1947#L41-1 assume true; 1963#func_to_recursive_line_24_to_25_0EXIT >#82#return; 1967#L41-1 assume true; 1981#func_to_recursive_line_24_to_25_0EXIT >#84#return; 1966#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 1940#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1942#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 1962#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 1945#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1956#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 1943#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 1946#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1959#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1969#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1958#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1959#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1969#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1958#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1959#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1969#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1958#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1959#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1969#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1958#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1959#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1969#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1958#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1959#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1969#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1958#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1959#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1969#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1960#L25-1 assume true; 1961#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1964#L25-1 assume true; 1984#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1983#L25-1 assume true; 1982#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1980#L25-1 assume true; 1979#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1978#L25-1 assume true; 1977#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1976#L25-1 assume true; 1975#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1973#L25-1 assume true; 1972#func_to_recursive_line_25_to_25_0EXIT >#80#return; 1965#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 1944#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1956#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 1943#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1947#L41-1 assume true; 1963#func_to_recursive_line_24_to_25_0EXIT >#82#return; 1967#L41-1 assume true; 1981#func_to_recursive_line_24_to_25_0EXIT >#84#return; 1966#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 1940#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1942#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 1962#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1948#L61-1 assume true; 1949#func_to_recursive_line_23_to_24_0EXIT >#86#return; 1953#L61-1 assume true; 1974#func_to_recursive_line_23_to_24_0EXIT >#86#return; 1971#L61-1 assume true; 1970#func_to_recursive_line_23_to_24_0EXIT >#88#return; 1957#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 1950#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 1952#$Ultimate##0 [2024-11-13 15:28:31,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:31,917 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 7 times [2024-11-13 15:28:31,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:31,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533811190] [2024-11-13 15:28:31,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:31,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:28:31,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:28:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:28:31,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:28:31,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:31,942 INFO L85 PathProgramCache]: Analyzing trace with hash -348181174, now seen corresponding path program 4 times [2024-11-13 15:28:31,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:31,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029835545] [2024-11-13 15:28:31,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:31,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:32,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:32,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:28:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:28:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:28:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:28:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-11-13 15:28:33,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:28:33,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029835545] [2024-11-13 15:28:33,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029835545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:28:33,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579580834] [2024-11-13 15:28:33,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 15:28:33,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:28:33,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:28:33,512 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:28:33,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 15:28:33,850 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 15:28:33,851 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:28:33,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-13 15:28:33,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:28:33,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:28:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2024-11-13 15:28:34,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:28:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2024-11-13 15:28:35,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579580834] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:28:35,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:28:35,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 14] total 31 [2024-11-13 15:28:35,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408226180] [2024-11-13 15:28:35,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:28:35,482 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:28:35,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:28:35,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-13 15:28:35,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2024-11-13 15:28:35,484 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. cyclomatic complexity: 10 Second operand has 31 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 13 states have call successors, (22), 9 states have call predecessors, (22), 10 states have return successors, (19), 11 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-13 15:28:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:28:36,191 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-11-13 15:28:36,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 55 transitions. [2024-11-13 15:28:36,192 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:28:36,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 55 transitions. [2024-11-13 15:28:36,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-13 15:28:36,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-11-13 15:28:36,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 55 transitions. [2024-11-13 15:28:36,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:28:36,195 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-13 15:28:36,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 55 transitions. [2024-11-13 15:28:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-13 15:28:36,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 30 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 14 states have return successors, (17), 14 states have call predecessors, (17), 6 states have call successors, (17) [2024-11-13 15:28:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-11-13 15:28:36,200 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-13 15:28:36,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 15:28:36,201 INFO L424 stractBuchiCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-13 15:28:36,201 INFO L331 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-13 15:28:36,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 55 transitions. [2024-11-13 15:28:36,202 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:28:36,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:28:36,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:28:36,207 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:28:36,207 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 42, 36, 36, 36, 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-11-13 15:28:36,208 INFO L745 eck$LassoCheckResult]: Stem: 3321#$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); 3307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 3303#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 3304#$Ultimate##0 [2024-11-13 15:28:36,208 INFO L747 eck$LassoCheckResult]: Loop: 3304#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 3306#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 3293#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3294#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 3314#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 3296#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3308#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 3295#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 3298#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3312#L25-1 assume true; 3313#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3318#L25-1 assume true; 3340#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3339#L25-1 assume true; 3338#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3337#L25-1 assume true; 3334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3333#L25-1 assume true; 3332#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3330#L25-1 assume true; 3328#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3325#L25-1 assume true; 3324#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3319#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3297#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3308#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 3295#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 3298#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3312#L25-1 assume true; 3313#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3318#L25-1 assume true; 3340#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3339#L25-1 assume true; 3338#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3337#L25-1 assume true; 3334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3333#L25-1 assume true; 3332#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3330#L25-1 assume true; 3328#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3325#L25-1 assume true; 3324#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3319#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3297#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3308#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 3295#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3299#L41-1 assume true; 3322#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3315#L41-1 assume true; 3316#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3336#L41-1 assume true; 3335#func_to_recursive_line_24_to_25_0EXIT >#84#return; 3320#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 3292#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3294#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 3314#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 3296#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3308#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 3295#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 3298#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3312#L25-1 assume true; 3313#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3318#L25-1 assume true; 3340#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3339#L25-1 assume true; 3338#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3337#L25-1 assume true; 3334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3333#L25-1 assume true; 3332#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3330#L25-1 assume true; 3328#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3325#L25-1 assume true; 3324#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3319#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3297#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3308#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 3295#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 3298#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3312#L25-1 assume true; 3313#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3318#L25-1 assume true; 3340#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3339#L25-1 assume true; 3338#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3337#L25-1 assume true; 3334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3333#L25-1 assume true; 3332#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3330#L25-1 assume true; 3328#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3325#L25-1 assume true; 3324#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3319#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3297#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3308#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 3295#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3299#L41-1 assume true; 3322#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3315#L41-1 assume true; 3316#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3336#L41-1 assume true; 3335#func_to_recursive_line_24_to_25_0EXIT >#84#return; 3320#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 3292#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3294#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 3314#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 3296#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3308#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 3295#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 3298#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3312#L25-1 assume true; 3313#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3318#L25-1 assume true; 3340#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3339#L25-1 assume true; 3338#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3337#L25-1 assume true; 3334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3333#L25-1 assume true; 3332#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3330#L25-1 assume true; 3328#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3325#L25-1 assume true; 3324#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3319#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3297#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3308#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 3295#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 3298#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3309#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3310#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3323#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3312#L25-1 assume true; 3313#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3318#L25-1 assume true; 3340#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3339#L25-1 assume true; 3338#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3337#L25-1 assume true; 3334#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3333#L25-1 assume true; 3332#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3330#L25-1 assume true; 3328#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3325#L25-1 assume true; 3324#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3319#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3297#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3308#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 3295#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3299#L41-1 assume true; 3322#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3315#L41-1 assume true; 3316#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3336#L41-1 assume true; 3335#func_to_recursive_line_24_to_25_0EXIT >#84#return; 3320#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 3292#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3294#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 3314#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3317#L61-1 assume true; 3305#func_to_recursive_line_23_to_24_0EXIT >#86#return; 3300#L61-1 assume true; 3301#func_to_recursive_line_23_to_24_0EXIT >#86#return; 3331#L61-1 assume true; 3329#func_to_recursive_line_23_to_24_0EXIT >#86#return; 3327#L61-1 assume true; 3326#func_to_recursive_line_23_to_24_0EXIT >#88#return; 3311#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 3302#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 3304#$Ultimate##0 [2024-11-13 15:28:36,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:36,209 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 8 times [2024-11-13 15:28:36,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:36,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404572971] [2024-11-13 15:28:36,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:36,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:28:36,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:28:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:28:36,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:28:36,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:36,228 INFO L85 PathProgramCache]: Analyzing trace with hash 732034000, now seen corresponding path program 5 times [2024-11-13 15:28:36,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:36,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064765474] [2024-11-13 15:28:36,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:36,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:37,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:39,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:39,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:39,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:39,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:39,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:39,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:39,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:39,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:39,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:28:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:28:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 15:28:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:28:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:28:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 15:28:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:28:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:28:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 15:28:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:40,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4296 backedges. 6 proven. 92 refuted. 0 times theorem prover too weak. 4198 trivial. 0 not checked. [2024-11-13 15:28:40,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:28:40,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064765474] [2024-11-13 15:28:40,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064765474] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:28:40,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400263678] [2024-11-13 15:28:40,782 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 15:28:40,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:28:40,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:28:40,786 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:28:40,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 15:28:45,215 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-11-13 15:28:45,215 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:28:45,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 1526 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-13 15:28:45,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:28:45,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:28:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4296 backedges. 1960 proven. 8 refuted. 0 times theorem prover too weak. 2328 trivial. 0 not checked. [2024-11-13 15:28:45,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:28:47,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4296 backedges. 6 proven. 117 refuted. 0 times theorem prover too weak. 4173 trivial. 0 not checked. [2024-11-13 15:28:47,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400263678] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:28:47,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:28:47,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 27 [2024-11-13 15:28:47,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140400845] [2024-11-13 15:28:47,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:28:47,598 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:28:47,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:28:47,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-13 15:28:47,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2024-11-13 15:28:47,599 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. cyclomatic complexity: 10 Second operand has 27 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 11 states have call successors, (31), 9 states have call predecessors, (31), 8 states have return successors, (24), 9 states have call predecessors, (24), 11 states have call successors, (24) [2024-11-13 15:28:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:28:47,972 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-11-13 15:28:47,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 57 transitions. [2024-11-13 15:28:47,973 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:28:47,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 57 transitions. [2024-11-13 15:28:47,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-11-13 15:28:47,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-11-13 15:28:47,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 57 transitions. [2024-11-13 15:28:47,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:28:47,976 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-13 15:28:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 57 transitions. [2024-11-13 15:28:47,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-13 15:28:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 31 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 15 states have return successors, (18), 15 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-13 15:28:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2024-11-13 15:28:47,982 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-13 15:28:47,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:28:47,985 INFO L424 stractBuchiCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-13 15:28:47,988 INFO L331 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-13 15:28:47,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 57 transitions. [2024-11-13 15:28:47,990 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:28:47,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:28:47,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:28:47,999 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:28:47,999 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [63, 63, 54, 54, 54, 12, 12, 9, 9, 9, 9, 9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:28:47,999 INFO L745 eck$LassoCheckResult]: Stem: 6958#$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); 6944#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 6940#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 6941#$Ultimate##0 [2024-11-13 15:28:48,000 INFO L747 eck$LassoCheckResult]: Loop: 6941#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 6943#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 6930#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6931#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 6951#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 6933#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6945#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 6932#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6935#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6960#L25-1 assume true; 6954#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6949#L25-1 assume true; 6950#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6976#L25-1 assume true; 6973#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6972#L25-1 assume true; 6971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6970#L25-1 assume true; 6969#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6968#L25-1 assume true; 6966#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6964#L25-1 assume true; 6963#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6955#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6934#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6945#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 6932#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6935#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6960#L25-1 assume true; 6954#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6949#L25-1 assume true; 6950#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6976#L25-1 assume true; 6973#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6972#L25-1 assume true; 6971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6970#L25-1 assume true; 6969#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6968#L25-1 assume true; 6966#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6964#L25-1 assume true; 6963#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6955#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6934#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6945#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 6932#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6935#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6960#L25-1 assume true; 6954#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6949#L25-1 assume true; 6950#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6976#L25-1 assume true; 6973#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6972#L25-1 assume true; 6971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6970#L25-1 assume true; 6969#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6968#L25-1 assume true; 6966#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6964#L25-1 assume true; 6963#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6955#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6934#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6945#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 6932#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6936#L41-1 assume true; 6952#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6957#L41-1 assume true; 6979#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6978#L41-1 assume true; 6977#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6975#L41-1 assume true; 6974#func_to_recursive_line_24_to_25_0EXIT >#84#return; 6956#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 6929#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6931#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 6951#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 6933#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6945#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 6932#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6935#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6960#L25-1 assume true; 6954#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6949#L25-1 assume true; 6950#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6976#L25-1 assume true; 6973#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6972#L25-1 assume true; 6971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6970#L25-1 assume true; 6969#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6968#L25-1 assume true; 6966#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6964#L25-1 assume true; 6963#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6955#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6934#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6945#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 6932#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6935#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6960#L25-1 assume true; 6954#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6949#L25-1 assume true; 6950#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6976#L25-1 assume true; 6973#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6972#L25-1 assume true; 6971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6970#L25-1 assume true; 6969#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6968#L25-1 assume true; 6966#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6964#L25-1 assume true; 6963#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6955#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6934#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6945#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 6932#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6935#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6960#L25-1 assume true; 6954#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6949#L25-1 assume true; 6950#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6976#L25-1 assume true; 6973#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6972#L25-1 assume true; 6971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6970#L25-1 assume true; 6969#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6968#L25-1 assume true; 6966#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6964#L25-1 assume true; 6963#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6955#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6934#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6945#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 6932#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6936#L41-1 assume true; 6952#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6957#L41-1 assume true; 6979#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6978#L41-1 assume true; 6977#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6975#L41-1 assume true; 6974#func_to_recursive_line_24_to_25_0EXIT >#84#return; 6956#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 6929#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6931#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 6951#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 6933#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6945#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 6932#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6935#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6960#L25-1 assume true; 6954#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6949#L25-1 assume true; 6950#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6976#L25-1 assume true; 6973#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6972#L25-1 assume true; 6971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6970#L25-1 assume true; 6969#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6968#L25-1 assume true; 6966#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6964#L25-1 assume true; 6963#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6955#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6934#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6945#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 6932#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6935#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6960#L25-1 assume true; 6954#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6949#L25-1 assume true; 6950#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6976#L25-1 assume true; 6973#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6972#L25-1 assume true; 6971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6970#L25-1 assume true; 6969#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6968#L25-1 assume true; 6966#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6964#L25-1 assume true; 6963#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6955#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6934#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6945#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 6932#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 6935#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6947#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6948#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 6959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6960#L25-1 assume true; 6954#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6949#L25-1 assume true; 6950#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6976#L25-1 assume true; 6973#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6972#L25-1 assume true; 6971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6970#L25-1 assume true; 6969#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6968#L25-1 assume true; 6966#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6964#L25-1 assume true; 6963#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6955#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6934#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6945#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 6932#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6936#L41-1 assume true; 6952#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6957#L41-1 assume true; 6979#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6978#L41-1 assume true; 6977#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6975#L41-1 assume true; 6974#func_to_recursive_line_24_to_25_0EXIT >#84#return; 6956#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 6929#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6931#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 6951#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6953#L61-1 assume true; 6942#func_to_recursive_line_23_to_24_0EXIT >#86#return; 6937#L61-1 assume true; 6938#func_to_recursive_line_23_to_24_0EXIT >#86#return; 6967#L61-1 assume true; 6965#func_to_recursive_line_23_to_24_0EXIT >#86#return; 6962#L61-1 assume true; 6961#func_to_recursive_line_23_to_24_0EXIT >#88#return; 6946#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 6939#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 6941#$Ultimate##0 [2024-11-13 15:28:48,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:48,001 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 9 times [2024-11-13 15:28:48,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:48,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478744699] [2024-11-13 15:28:48,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:48,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:28:48,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:28:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:28:48,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:28:48,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:48,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1276539711, now seen corresponding path program 6 times [2024-11-13 15:28:48,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:48,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89574726] [2024-11-13 15:28:48,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:48,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:50,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:52,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:28:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:28:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:28:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:54,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 15:28:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:28:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:28:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:28:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 15:28:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:28:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:28:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:28:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:28:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 15:28:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:55,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9648 backedges. 6 proven. 171 refuted. 0 times theorem prover too weak. 9471 trivial. 0 not checked. [2024-11-13 15:28:55,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:28:55,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89574726] [2024-11-13 15:28:55,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89574726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:28:55,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590999680] [2024-11-13 15:28:55,608 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-13 15:28:55,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:28:55,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:28:55,611 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:28:55,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 15:28:56,718 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-13 15:28:56,718 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:28:56,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-13 15:28:56,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:28:56,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:28:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 9648 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9633 trivial. 0 not checked. [2024-11-13 15:28:57,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:29:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9648 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 9615 trivial. 0 not checked. [2024-11-13 15:29:00,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590999680] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:29:00,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:29:00,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 18] total 38 [2024-11-13 15:29:00,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820359851] [2024-11-13 15:29:00,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:29:00,231 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:29:00,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:29:00,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-13 15:29:00,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1206, Unknown=0, NotChecked=0, Total=1406 [2024-11-13 15:29:00,233 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. cyclomatic complexity: 10 Second operand has 38 states, 30 states have (on average 1.9) internal successors, (57), 30 states have internal predecessors, (57), 15 states have call successors, (24), 10 states have call predecessors, (24), 14 states have return successors, (24), 16 states have call predecessors, (24), 15 states have call successors, (24) [2024-11-13 15:29:01,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:29:01,059 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2024-11-13 15:29:01,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 61 transitions. [2024-11-13 15:29:01,061 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:29:01,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 61 transitions. [2024-11-13 15:29:01,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2024-11-13 15:29:01,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2024-11-13 15:29:01,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 61 transitions. [2024-11-13 15:29:01,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:29:01,063 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-13 15:29:01,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 61 transitions. [2024-11-13 15:29:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-13 15:29:01,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.1) internal successors, (33), 33 states have internal predecessors, (33), 8 states have call successors, (8), 4 states have call predecessors, (8), 17 states have return successors, (20), 17 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-13 15:29:01,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2024-11-13 15:29:01,068 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-13 15:29:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 15:29:01,070 INFO L424 stractBuchiCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-13 15:29:01,070 INFO L331 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-13 15:29:01,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 61 transitions. [2024-11-13 15:29:01,071 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:29:01,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:29:01,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:29:01,079 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:29:01,079 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [112, 112, 96, 96, 96, 20, 20, 16, 16, 16, 16, 16, 16, 16, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:29:01,079 INFO L745 eck$LassoCheckResult]: Stem: 12392#$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); 12378#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 12374#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 12375#$Ultimate##0 [2024-11-13 15:29:01,080 INFO L747 eck$LassoCheckResult]: Loop: 12375#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 12377#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 12364#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 12365#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 12385#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 12367#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 12369#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12383#L25-1 assume true; 12384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12387#L25-1 assume true; 12414#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12412#L25-1 assume true; 12411#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12409#L25-1 assume true; 12405#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12403#L25-1 assume true; 12401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12399#L25-1 assume true; 12397#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12394#L25-1 assume true; 12393#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12388#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12368#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 12369#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12383#L25-1 assume true; 12384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12387#L25-1 assume true; 12414#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12412#L25-1 assume true; 12411#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12409#L25-1 assume true; 12405#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12403#L25-1 assume true; 12401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12399#L25-1 assume true; 12397#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12394#L25-1 assume true; 12393#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12388#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12368#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 12369#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12383#L25-1 assume true; 12384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12387#L25-1 assume true; 12414#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12412#L25-1 assume true; 12411#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12409#L25-1 assume true; 12405#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12403#L25-1 assume true; 12401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12399#L25-1 assume true; 12397#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12394#L25-1 assume true; 12393#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12388#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12368#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 12369#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12383#L25-1 assume true; 12384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12387#L25-1 assume true; 12414#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12412#L25-1 assume true; 12411#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12409#L25-1 assume true; 12405#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12403#L25-1 assume true; 12401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12399#L25-1 assume true; 12397#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12394#L25-1 assume true; 12393#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12388#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12368#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12370#L41-1 assume true; 12386#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12390#L41-1 assume true; 12417#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12416#L41-1 assume true; 12415#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12413#L41-1 assume true; 12410#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12408#L41-1 assume true; 12407#func_to_recursive_line_24_to_25_0EXIT >#84#return; 12389#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 12363#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 12365#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 12385#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 12367#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 12369#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12383#L25-1 assume true; 12384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12387#L25-1 assume true; 12414#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12412#L25-1 assume true; 12411#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12409#L25-1 assume true; 12405#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12403#L25-1 assume true; 12401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12399#L25-1 assume true; 12397#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12394#L25-1 assume true; 12393#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12388#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12368#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 12369#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12383#L25-1 assume true; 12384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12387#L25-1 assume true; 12414#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12412#L25-1 assume true; 12411#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12409#L25-1 assume true; 12405#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12403#L25-1 assume true; 12401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12399#L25-1 assume true; 12397#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12394#L25-1 assume true; 12393#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12388#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12368#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 12369#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12383#L25-1 assume true; 12384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12387#L25-1 assume true; 12414#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12412#L25-1 assume true; 12411#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12409#L25-1 assume true; 12405#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12403#L25-1 assume true; 12401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12399#L25-1 assume true; 12397#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12394#L25-1 assume true; 12393#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12388#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12368#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 12369#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12383#L25-1 assume true; 12384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12387#L25-1 assume true; 12414#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12412#L25-1 assume true; 12411#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12409#L25-1 assume true; 12405#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12403#L25-1 assume true; 12401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12399#L25-1 assume true; 12397#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12394#L25-1 assume true; 12393#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12388#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12368#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12370#L41-1 assume true; 12386#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12390#L41-1 assume true; 12417#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12416#L41-1 assume true; 12415#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12413#L41-1 assume true; 12410#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12408#L41-1 assume true; 12407#func_to_recursive_line_24_to_25_0EXIT >#84#return; 12389#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 12363#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 12365#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 12385#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 12367#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 12369#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12383#L25-1 assume true; 12384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12387#L25-1 assume true; 12414#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12412#L25-1 assume true; 12411#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12409#L25-1 assume true; 12405#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12403#L25-1 assume true; 12401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12399#L25-1 assume true; 12397#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12394#L25-1 assume true; 12393#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12388#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12368#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 12369#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12383#L25-1 assume true; 12384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12387#L25-1 assume true; 12414#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12412#L25-1 assume true; 12411#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12409#L25-1 assume true; 12405#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12403#L25-1 assume true; 12401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12399#L25-1 assume true; 12397#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12394#L25-1 assume true; 12393#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12388#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12368#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 12369#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12383#L25-1 assume true; 12384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12387#L25-1 assume true; 12414#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12412#L25-1 assume true; 12411#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12409#L25-1 assume true; 12405#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12403#L25-1 assume true; 12401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12399#L25-1 assume true; 12397#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12394#L25-1 assume true; 12393#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12388#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12368#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 12369#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12383#L25-1 assume true; 12384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12387#L25-1 assume true; 12414#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12412#L25-1 assume true; 12411#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12409#L25-1 assume true; 12405#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12403#L25-1 assume true; 12401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12399#L25-1 assume true; 12397#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12394#L25-1 assume true; 12393#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12388#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12368#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12370#L41-1 assume true; 12386#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12390#L41-1 assume true; 12417#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12416#L41-1 assume true; 12415#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12413#L41-1 assume true; 12410#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12408#L41-1 assume true; 12407#func_to_recursive_line_24_to_25_0EXIT >#84#return; 12389#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 12363#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 12365#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 12385#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 12367#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 12369#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12383#L25-1 assume true; 12384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12387#L25-1 assume true; 12414#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12412#L25-1 assume true; 12411#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12409#L25-1 assume true; 12405#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12403#L25-1 assume true; 12401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12399#L25-1 assume true; 12397#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12394#L25-1 assume true; 12393#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12388#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12368#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 12369#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12383#L25-1 assume true; 12384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12387#L25-1 assume true; 12414#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12412#L25-1 assume true; 12411#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12409#L25-1 assume true; 12405#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12403#L25-1 assume true; 12401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12399#L25-1 assume true; 12397#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12394#L25-1 assume true; 12393#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12388#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12368#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 12369#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12383#L25-1 assume true; 12384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12387#L25-1 assume true; 12414#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12412#L25-1 assume true; 12411#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12409#L25-1 assume true; 12405#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12403#L25-1 assume true; 12401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12399#L25-1 assume true; 12397#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12394#L25-1 assume true; 12393#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12388#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12368#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 12369#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12380#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12381#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 12391#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12383#L25-1 assume true; 12384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12387#L25-1 assume true; 12414#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12412#L25-1 assume true; 12411#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12409#L25-1 assume true; 12405#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12403#L25-1 assume true; 12401#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12399#L25-1 assume true; 12397#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12394#L25-1 assume true; 12393#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12388#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12368#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12379#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 12366#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12370#L41-1 assume true; 12386#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12390#L41-1 assume true; 12417#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12416#L41-1 assume true; 12415#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12413#L41-1 assume true; 12410#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12408#L41-1 assume true; 12407#func_to_recursive_line_24_to_25_0EXIT >#84#return; 12389#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 12363#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 12365#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 12385#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12371#L61-1 assume true; 12372#func_to_recursive_line_23_to_24_0EXIT >#86#return; 12376#L61-1 assume true; 12406#func_to_recursive_line_23_to_24_0EXIT >#86#return; 12404#L61-1 assume true; 12402#func_to_recursive_line_23_to_24_0EXIT >#86#return; 12400#L61-1 assume true; 12398#func_to_recursive_line_23_to_24_0EXIT >#86#return; 12396#L61-1 assume true; 12395#func_to_recursive_line_23_to_24_0EXIT >#88#return; 12382#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 12373#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 12375#$Ultimate##0 [2024-11-13 15:29:01,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:01,082 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 10 times [2024-11-13 15:29:01,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:29:01,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133319121] [2024-11-13 15:29:01,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:01,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:29:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:29:01,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:29:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:29:01,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:29:01,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:01,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1508638848, now seen corresponding path program 7 times [2024-11-13 15:29:01,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:29:01,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40196786] [2024-11-13 15:29:01,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:01,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:29:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:05,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:09,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 15:29:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:12,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:12,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:12,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:12,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:12,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:12,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:12,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:12,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:12,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:13,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 15:29:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:14,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:14,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:14,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 15:29:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:16,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:16,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:16,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:16,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:16,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:16,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:16,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:16,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:16,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 15:29:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,060 INFO L134 CoverageAnalysis]: Checked inductivity of 30602 backedges. 398 proven. 24 refuted. 0 times theorem prover too weak. 30180 trivial. 0 not checked. [2024-11-13 15:29:18,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:29:18,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40196786] [2024-11-13 15:29:18,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40196786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:29:18,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504913414] [2024-11-13 15:29:18,061 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-13 15:29:18,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:29:18,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:29:18,063 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:29:18,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 15:29:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 4056 conjuncts, 121 conjuncts are in the unsatisfiable core [2024-11-13 15:29:19,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:29:19,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:29:19,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-13 15:29:19,876 INFO L134 CoverageAnalysis]: Checked inductivity of 30602 backedges. 11591 proven. 24 refuted. 0 times theorem prover too weak. 18987 trivial. 0 not checked. [2024-11-13 15:29:19,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:29:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 30602 backedges. 8 proven. 511 refuted. 0 times theorem prover too weak. 30083 trivial. 0 not checked. [2024-11-13 15:29:26,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504913414] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:29:26,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:29:26,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 22] total 41 [2024-11-13 15:29:26,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034154474] [2024-11-13 15:29:26,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:29:26,462 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:29:26,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:29:26,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-13 15:29:26,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2024-11-13 15:29:26,464 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. cyclomatic complexity: 10 Second operand has 41 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 32 states have internal predecessors, (74), 18 states have call successors, (37), 11 states have call predecessors, (37), 13 states have return successors, (34), 17 states have call predecessors, (34), 18 states have call successors, (34) [2024-11-13 15:29:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:29:27,163 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2024-11-13 15:29:27,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 65 transitions. [2024-11-13 15:29:27,164 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:29:27,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 65 transitions. [2024-11-13 15:29:27,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-11-13 15:29:27,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-11-13 15:29:27,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 65 transitions. [2024-11-13 15:29:27,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:29:27,167 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-13 15:29:27,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 65 transitions. [2024-11-13 15:29:27,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-13 15:29:27,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.09375) internal successors, (35), 35 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 19 states have return successors, (22), 19 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-13 15:29:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-11-13 15:29:27,173 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-13 15:29:27,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:29:27,176 INFO L424 stractBuchiCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-13 15:29:27,176 INFO L331 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-13 15:29:27,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 65 transitions. [2024-11-13 15:29:27,178 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:29:27,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:29:27,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:29:27,185 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:29:27,185 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [168, 168, 144, 144, 144, 28, 28, 24, 24, 24, 24, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:29:27,186 INFO L745 eck$LassoCheckResult]: Stem: 22431#$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); 22418#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 22414#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 22415#$Ultimate##0 [2024-11-13 15:29:27,187 INFO L747 eck$LassoCheckResult]: Loop: 22415#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 22417#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 22404#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 22405#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 22425#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 22408#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 22410#L41-1 assume true; 22432#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22426#L41-1 assume true; 22427#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22461#L41-1 assume true; 22460#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22459#L41-1 assume true; 22458#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22457#L41-1 assume true; 22456#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22455#L41-1 assume true; 22454#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22453#L41-1 assume true; 22452#func_to_recursive_line_24_to_25_0EXIT >#84#return; 22430#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 22403#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 22405#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 22425#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 22408#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 22410#L41-1 assume true; 22432#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22426#L41-1 assume true; 22427#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22461#L41-1 assume true; 22460#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22459#L41-1 assume true; 22458#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22457#L41-1 assume true; 22456#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22455#L41-1 assume true; 22454#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22453#L41-1 assume true; 22452#func_to_recursive_line_24_to_25_0EXIT >#84#return; 22430#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 22403#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 22405#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 22425#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 22408#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 22410#L41-1 assume true; 22432#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22426#L41-1 assume true; 22427#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22461#L41-1 assume true; 22460#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22459#L41-1 assume true; 22458#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22457#L41-1 assume true; 22456#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22455#L41-1 assume true; 22454#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22453#L41-1 assume true; 22452#func_to_recursive_line_24_to_25_0EXIT >#84#return; 22430#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 22403#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 22405#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 22425#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 22408#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 22409#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22421#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22422#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 22433#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22423#L25-1 assume true; 22424#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22428#L25-1 assume true; 22451#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22450#L25-1 assume true; 22449#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22448#L25-1 assume true; 22447#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22445#L25-1 assume true; 22443#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22441#L25-1 assume true; 22439#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22437#L25-1 assume true; 22436#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22429#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22407#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22419#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 22406#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 22410#L41-1 assume true; 22432#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22426#L41-1 assume true; 22427#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22461#L41-1 assume true; 22460#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22459#L41-1 assume true; 22458#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22457#L41-1 assume true; 22456#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22455#L41-1 assume true; 22454#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22453#L41-1 assume true; 22452#func_to_recursive_line_24_to_25_0EXIT >#84#return; 22430#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 22403#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 22405#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 22425#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 22411#L61-1 assume true; 22412#func_to_recursive_line_23_to_24_0EXIT >#86#return; 22416#L61-1 assume true; 22446#func_to_recursive_line_23_to_24_0EXIT >#86#return; 22444#L61-1 assume true; 22442#func_to_recursive_line_23_to_24_0EXIT >#86#return; 22440#L61-1 assume true; 22438#func_to_recursive_line_23_to_24_0EXIT >#86#return; 22435#L61-1 assume true; 22434#func_to_recursive_line_23_to_24_0EXIT >#88#return; 22420#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 22413#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 22415#$Ultimate##0 [2024-11-13 15:29:27,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:27,189 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 11 times [2024-11-13 15:29:27,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:29:27,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630508457] [2024-11-13 15:29:27,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:27,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:29:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:29:27,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:29:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:29:27,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:29:27,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:27,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1880621056, now seen corresponding path program 8 times [2024-11-13 15:29:27,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:29:27,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860598713] [2024-11-13 15:29:27,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:27,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:29:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:32,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:38,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:39,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:29:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:51,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:52,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:29:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:29:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:29:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:29:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 68806 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 68779 trivial. 0 not checked. [2024-11-13 15:29:56,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:29:56,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860598713] [2024-11-13 15:29:56,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860598713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:29:56,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836165118] [2024-11-13 15:29:56,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:29:56,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:29:56,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:29:56,823 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:29:56,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 15:29:58,748 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:29:58,748 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:29:58,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 5864 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-13 15:29:58,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:29:58,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:29:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 68806 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 68782 trivial. 0 not checked. [2024-11-13 15:29:59,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:30:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 68806 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 68748 trivial. 0 not checked. [2024-11-13 15:30:06,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836165118] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:30:06,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:30:06,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 22] total 39 [2024-11-13 15:30:06,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551361264] [2024-11-13 15:30:06,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:30:06,187 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 15:30:06,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:30:06,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-13 15:30:06,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1203, Unknown=0, NotChecked=0, Total=1482 [2024-11-13 15:30:06,189 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. cyclomatic complexity: 10 Second operand has 39 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 16 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (23), 15 states have call predecessors, (23), 15 states have call successors, (23) [2024-11-13 15:30:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:06,898 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2024-11-13 15:30:06,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 67 transitions. [2024-11-13 15:30:06,899 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:30:06,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 67 transitions. [2024-11-13 15:30:06,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2024-11-13 15:30:06,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2024-11-13 15:30:06,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 67 transitions. [2024-11-13 15:30:06,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 15:30:06,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-11-13 15:30:06,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 67 transitions. [2024-11-13 15:30:06,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-13 15:30:06,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 36 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 20 states have return successors, (23), 20 states have call predecessors, (23), 6 states have call successors, (23) [2024-11-13 15:30:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2024-11-13 15:30:06,908 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-11-13 15:30:06,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:30:06,912 INFO L424 stractBuchiCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-11-13 15:30:06,912 INFO L331 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-13 15:30:06,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 67 transitions. [2024-11-13 15:30:06,913 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-13 15:30:06,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 15:30:06,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 15:30:06,920 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-13 15:30:06,921 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [210, 210, 180, 180, 180, 35, 35, 30, 30, 30, 30, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:30:06,921 INFO L745 eck$LassoCheckResult]: Stem: 38160#$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); 38146#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 38142#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 38143#$Ultimate##0 [2024-11-13 15:30:06,923 INFO L747 eck$LassoCheckResult]: Loop: 38143#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#1(~a.base, ~a.offset, 4); 38145#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 38132#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38133#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 38153#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 38136#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 38138#L41-1 assume true; 38161#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38154#L41-1 assume true; 38155#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38191#L41-1 assume true; 38190#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38189#L41-1 assume true; 38188#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38187#L41-1 assume true; 38186#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38185#L41-1 assume true; 38182#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38179#L41-1 assume true; 38178#func_to_recursive_line_24_to_25_0EXIT >#84#return; 38159#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 38131#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38133#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 38153#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 38136#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 38138#L41-1 assume true; 38161#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38154#L41-1 assume true; 38155#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38191#L41-1 assume true; 38190#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38189#L41-1 assume true; 38188#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38187#L41-1 assume true; 38186#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38185#L41-1 assume true; 38182#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38179#L41-1 assume true; 38178#func_to_recursive_line_24_to_25_0EXIT >#84#return; 38159#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 38131#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38133#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 38153#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 38136#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 38138#L41-1 assume true; 38161#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38154#L41-1 assume true; 38155#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38191#L41-1 assume true; 38190#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38189#L41-1 assume true; 38188#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38187#L41-1 assume true; 38186#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38185#L41-1 assume true; 38182#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38179#L41-1 assume true; 38178#func_to_recursive_line_24_to_25_0EXIT >#84#return; 38159#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 38131#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38133#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 38153#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 38136#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 38138#L41-1 assume true; 38161#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38154#L41-1 assume true; 38155#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38191#L41-1 assume true; 38190#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38189#L41-1 assume true; 38188#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38187#L41-1 assume true; 38186#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38185#L41-1 assume true; 38182#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38179#L41-1 assume true; 38178#func_to_recursive_line_24_to_25_0EXIT >#84#return; 38159#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 38131#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38133#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 38153#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 38136#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 38137#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38148#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38149#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 38162#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38163#L25-1 assume true; 38157#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38151#L25-1 assume true; 38152#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38184#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38176#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38174#L25-1 assume true; 38172#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38170#L25-1 assume true; 38168#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38165#L25-1 assume true; 38164#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38158#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38135#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38147#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 38134#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 38138#L41-1 assume true; 38161#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38154#L41-1 assume true; 38155#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38191#L41-1 assume true; 38190#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38189#L41-1 assume true; 38188#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38187#L41-1 assume true; 38186#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38185#L41-1 assume true; 38182#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38179#L41-1 assume true; 38178#func_to_recursive_line_24_to_25_0EXIT >#84#return; 38159#L67-1 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 38131#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38133#$Ultimate##0 ~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~mem10 := read~int#4(~b.base, ~b.offset, 4); 38153#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 38156#L61-1 assume true; 38144#func_to_recursive_line_23_to_24_0EXIT >#86#return; 38139#L61-1 assume true; 38140#func_to_recursive_line_23_to_24_0EXIT >#86#return; 38180#L61-1 assume true; 38177#func_to_recursive_line_23_to_24_0EXIT >#86#return; 38175#L61-1 assume true; 38173#func_to_recursive_line_23_to_24_0EXIT >#86#return; 38171#L61-1 assume true; 38169#func_to_recursive_line_23_to_24_0EXIT >#86#return; 38167#L61-1 assume true; 38166#func_to_recursive_line_23_to_24_0EXIT >#88#return; 38150#L87-1 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 38141#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 38143#$Ultimate##0 [2024-11-13 15:30:06,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:06,925 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 12 times [2024-11-13 15:30:06,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:06,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122655421] [2024-11-13 15:30:06,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:06,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:30:06,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:30:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:30:06,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:30:06,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:06,957 INFO L85 PathProgramCache]: Analyzing trace with hash 729449042, now seen corresponding path program 9 times [2024-11-13 15:30:06,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:30:06,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871932990] [2024-11-13 15:30:06,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:06,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:30:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:17,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:28,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:30:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:37,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:30:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:49,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:50,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:50,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:50,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:50,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:50,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:50,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:30:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:52,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:30:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:53,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:30:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:30:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-13 15:30:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:54,467 INFO L134 CoverageAnalysis]: Checked inductivity of 107665 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 107626 trivial. 0 not checked. [2024-11-13 15:30:54,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:30:54,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871932990] [2024-11-13 15:30:54,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871932990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:30:54,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950846161] [2024-11-13 15:30:54,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 15:30:54,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:30:54,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:30:54,470 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:30:54,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db51c65c-319b-41a1-892a-9debbcac7246/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process