./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/tree-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/tree-4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93cf6e13715dcd5309cb599b4358d41a64464f02c52b3716bc554a9d0e833f5e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:23:01,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:23:01,861 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-23 23:23:01,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:23:01,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:23:01,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:23:01,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:23:01,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:23:01,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:23:01,907 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:23:01,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:23:01,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:23:01,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:23:01,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:23:01,909 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:23:01,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:23:01,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 23:23:01,910 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:23:01,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:23:01,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:23:01,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:23:01,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 23:23:01,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:23:01,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 23:23:01,911 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:23:01,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 23:23:01,911 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:23:01,911 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:23:01,912 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:23:01,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:23:01,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:23:01,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:23:01,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:23:01,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:23:01,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:23:01,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:23:01,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:23:01,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:23:01,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:23:01,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:23:01,914 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 23:23:01,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 23:23:01,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 23:23:01,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 23:23:01,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:23:01,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:23:01,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:23:01,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:23:01,916 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/bin/uautomizer-verify-LYvppIcaGC 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(G ! call(reach_error())) ) 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 -> 93cf6e13715dcd5309cb599b4358d41a64464f02c52b3716bc554a9d0e833f5e [2024-11-23 23:23:02,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:23:02,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:23:02,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:23:02,280 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:23:02,280 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:23:02,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/heap-manipulation/tree-4.i [2024-11-23 23:23:05,454 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/bin/uautomizer-verify-LYvppIcaGC/data/cb12d2466/039f49a8a5c5401ebcdaf3324750e04e/FLAGbc9adbe06 [2024-11-23 23:23:05,822 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:23:05,822 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/sv-benchmarks/c/heap-manipulation/tree-4.i [2024-11-23 23:23:05,834 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/bin/uautomizer-verify-LYvppIcaGC/data/cb12d2466/039f49a8a5c5401ebcdaf3324750e04e/FLAGbc9adbe06 [2024-11-23 23:23:06,040 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/bin/uautomizer-verify-LYvppIcaGC/data/cb12d2466/039f49a8a5c5401ebcdaf3324750e04e [2024-11-23 23:23:06,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:23:06,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:23:06,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:23:06,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:23:06,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:23:06,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:23:06" (1/1) ... [2024-11-23 23:23:06,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@512c765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:06, skipping insertion in model container [2024-11-23 23:23:06,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:23:06" (1/1) ... [2024-11-23 23:23:06,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:23:06,381 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/sv-benchmarks/c/heap-manipulation/tree-4.i[22626,22639] [2024-11-23 23:23:06,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:23:06,419 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:23:06,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/sv-benchmarks/c/heap-manipulation/tree-4.i[22626,22639] [2024-11-23 23:23:06,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:23:06,518 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:23:06,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:06 WrapperNode [2024-11-23 23:23:06,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:23:06,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:23:06,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:23:06,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:23:06,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:06" (1/1) ... [2024-11-23 23:23:06,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:06" (1/1) ... [2024-11-23 23:23:06,560 INFO L138 Inliner]: procedures = 122, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2024-11-23 23:23:06,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:23:06,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:23:06,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:23:06,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:23:06,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:06" (1/1) ... [2024-11-23 23:23:06,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:06" (1/1) ... [2024-11-23 23:23:06,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:06" (1/1) ... [2024-11-23 23:23:06,592 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2024-11-23 23:23:06,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:06" (1/1) ... [2024-11-23 23:23:06,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:06" (1/1) ... [2024-11-23 23:23:06,601 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:06" (1/1) ... [2024-11-23 23:23:06,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:06" (1/1) ... [2024-11-23 23:23:06,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:06" (1/1) ... [2024-11-23 23:23:06,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:06" (1/1) ... [2024-11-23 23:23:06,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:06" (1/1) ... [2024-11-23 23:23:06,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:23:06,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:23:06,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:23:06,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:23:06,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:06" (1/1) ... [2024-11-23 23:23:06,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:23:06,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:23:06,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:23:06,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:23:06,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 23:23:06,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 23:23:06,687 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-23 23:23:06,687 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-23 23:23:06,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 23:23:06,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 23:23:06,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-23 23:23:06,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:23:06,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-23 23:23:06,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-23 23:23:06,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-23 23:23:06,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-23 23:23:06,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 23:23:06,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 23:23:06,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 23:23:06,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:23:06,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:23:06,849 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:23:06,852 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:23:07,239 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-23 23:23:07,239 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:23:07,250 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:23:07,250 INFO L312 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-23 23:23:07,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:23:07 BoogieIcfgContainer [2024-11-23 23:23:07,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:23:07,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:23:07,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:23:07,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:23:07,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:23:06" (1/3) ... [2024-11-23 23:23:07,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40290248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:23:07, skipping insertion in model container [2024-11-23 23:23:07,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:06" (2/3) ... [2024-11-23 23:23:07,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40290248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:23:07, skipping insertion in model container [2024-11-23 23:23:07,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:23:07" (3/3) ... [2024-11-23 23:23:07,268 INFO L128 eAbstractionObserver]: Analyzing ICFG tree-4.i [2024-11-23 23:23:07,286 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:23:07,289 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree-4.i that has 2 procedures, 50 locations, 1 initial locations, 8 loop locations, and 1 error locations. [2024-11-23 23:23:07,375 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:23:07,394 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@274494a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:23:07,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-23 23:23:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 48 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-23 23:23:07,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-23 23:23:07,409 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:23:07,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:23:07,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:23:07,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:23:07,417 INFO L85 PathProgramCache]: Analyzing trace with hash -546111272, now seen corresponding path program 1 times [2024-11-23 23:23:07,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:23:07,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718894583] [2024-11-23 23:23:07,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:23:07,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:23:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:23:07,601 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-23 23:23:07,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:23:07,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718894583] [2024-11-23 23:23:07,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718894583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:23:07,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:23:07,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:23:07,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413506551] [2024-11-23 23:23:07,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:23:07,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-23 23:23:07,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:23:07,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 23:23:07,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 23:23:07,666 INFO L87 Difference]: Start difference. First operand has 50 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 48 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:23:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:23:07,691 INFO L93 Difference]: Finished difference Result 96 states and 155 transitions. [2024-11-23 23:23:07,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 23:23:07,693 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-23 23:23:07,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:23:07,699 INFO L225 Difference]: With dead ends: 96 [2024-11-23 23:23:07,700 INFO L226 Difference]: Without dead ends: 34 [2024-11-23 23:23:07,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 23:23:07,706 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:23:07,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:23:07,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-23 23:23:07,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-23 23:23:07,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:23:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-23 23:23:07,738 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 11 [2024-11-23 23:23:07,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:23:07,739 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-23 23:23:07,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:23:07,740 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-23 23:23:07,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-23 23:23:07,740 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:23:07,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:23:07,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 23:23:07,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:23:07,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:23:07,742 INFO L85 PathProgramCache]: Analyzing trace with hash 630465080, now seen corresponding path program 1 times [2024-11-23 23:23:07,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:23:07,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081257177] [2024-11-23 23:23:07,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:23:07,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:23:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:23:07,855 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-23 23:23:07,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:23:07,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081257177] [2024-11-23 23:23:07,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081257177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:23:07,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:23:07,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:23:07,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623697557] [2024-11-23 23:23:07,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:23:07,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:23:07,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:23:07,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:23:07,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:23:07,859 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:23:07,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:23:07,921 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2024-11-23 23:23:07,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:23:07,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-23 23:23:07,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:23:07,924 INFO L225 Difference]: With dead ends: 63 [2024-11-23 23:23:07,924 INFO L226 Difference]: Without dead ends: 39 [2024-11-23 23:23:07,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:23:07,926 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:23:07,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:23:07,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-23 23:23:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-11-23 23:23:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 36 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:23:07,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-11-23 23:23:07,932 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 12 [2024-11-23 23:23:07,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:23:07,932 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-23 23:23:07,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:23:07,933 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2024-11-23 23:23:07,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-23 23:23:07,933 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:23:07,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:23:07,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 23:23:07,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:23:07,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:23:07,935 INFO L85 PathProgramCache]: Analyzing trace with hash -178881546, now seen corresponding path program 1 times [2024-11-23 23:23:07,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:23:07,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533038310] [2024-11-23 23:23:07,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:23:07,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:23:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:23:08,142 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-23 23:23:08,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:23:08,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533038310] [2024-11-23 23:23:08,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533038310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:23:08,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:23:08,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:23:08,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893982559] [2024-11-23 23:23:08,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:23:08,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:23:08,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:23:08,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:23:08,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:23:08,145 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:23:08,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:23:08,207 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2024-11-23 23:23:08,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:23:08,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-23 23:23:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:23:08,208 INFO L225 Difference]: With dead ends: 79 [2024-11-23 23:23:08,208 INFO L226 Difference]: Without dead ends: 41 [2024-11-23 23:23:08,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:23:08,209 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:23:08,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 142 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:23:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-23 23:23:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-23 23:23:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:23:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-11-23 23:23:08,215 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 12 [2024-11-23 23:23:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:23:08,215 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-11-23 23:23:08,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:23:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-11-23 23:23:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-23 23:23:08,216 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:23:08,216 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:23:08,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 23:23:08,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:23:08,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:23:08,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1531505341, now seen corresponding path program 1 times [2024-11-23 23:23:08,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:23:08,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884708519] [2024-11-23 23:23:08,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:23:08,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:23:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:23:08,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:23:08,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:23:08,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884708519] [2024-11-23 23:23:08,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884708519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:23:08,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:23:08,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:23:08,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214984540] [2024-11-23 23:23:08,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:23:08,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:23:08,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:23:08,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:23:08,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:23:08,294 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:23:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:23:08,380 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2024-11-23 23:23:08,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:23:08,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-23 23:23:08,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:23:08,381 INFO L225 Difference]: With dead ends: 65 [2024-11-23 23:23:08,381 INFO L226 Difference]: Without dead ends: 44 [2024-11-23 23:23:08,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:23:08,382 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 5 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:23:08,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:23:08,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-23 23:23:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2024-11-23 23:23:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:23:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-23 23:23:08,388 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 19 [2024-11-23 23:23:08,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:23:08,388 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-23 23:23:08,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:23:08,389 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-23 23:23:08,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-23 23:23:08,389 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:23:08,389 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:23:08,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 23:23:08,390 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:23:08,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:23:08,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1731357731, now seen corresponding path program 1 times [2024-11-23 23:23:08,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:23:08,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453554526] [2024-11-23 23:23:08,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:23:08,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:23:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:23:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:23:08,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:23:08,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453554526] [2024-11-23 23:23:08,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453554526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:23:08,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:23:08,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 23:23:08,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342065635] [2024-11-23 23:23:08,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:23:08,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:23:08,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:23:08,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:23:08,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:23:08,768 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:23:09,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:23:09,080 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2024-11-23 23:23:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:23:09,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-23 23:23:09,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:23:09,081 INFO L225 Difference]: With dead ends: 88 [2024-11-23 23:23:09,081 INFO L226 Difference]: Without dead ends: 55 [2024-11-23 23:23:09,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-23 23:23:09,083 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 56 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:23:09,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 111 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:23:09,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-23 23:23:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2024-11-23 23:23:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.135135135135135) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:23:09,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-11-23 23:23:09,097 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 23 [2024-11-23 23:23:09,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:23:09,097 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-11-23 23:23:09,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:23:09,098 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-11-23 23:23:09,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-23 23:23:09,099 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:23:09,100 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:23:09,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 23:23:09,100 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:23:09,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:23:09,102 INFO L85 PathProgramCache]: Analyzing trace with hash 186369901, now seen corresponding path program 1 times [2024-11-23 23:23:09,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:23:09,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857446283] [2024-11-23 23:23:09,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:23:09,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:23:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:23:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:23:11,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:23:11,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857446283] [2024-11-23 23:23:11,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857446283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:23:11,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547647823] [2024-11-23 23:23:11,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:23:11,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:23:11,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:23:11,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:23:11,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2d20d8-0f87-4845-8901-78dd4d33b0d1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 23:23:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:23:11,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-23 23:23:11,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:23:11,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-23 23:23:11,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-23 23:23:11,923 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-23 23:23:11,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-23 23:23:11,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-23 23:23:12,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:23:12,281 INFO L349 Elim1Store]: treesize reduction 128, result has 22.9 percent of original size [2024-11-23 23:23:12,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 6116 treesize of output 3914 [2024-11-23 23:23:12,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:23:12,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2024-11-23 23:23:12,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2024-11-23 23:23:12,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-23 23:23:12,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:23:12,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 133 [2024-11-23 23:23:12,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 17 [2024-11-23 23:23:12,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 140 [2024-11-23 23:23:12,717 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:23:12,725 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-23 23:23:12,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2024-11-23 23:23:12,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:23:12,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2024-11-23 23:23:12,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-23 23:23:12,842 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:23:12,848 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-23 23:23:12,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:23:12,904 INFO L349 Elim1Store]: treesize reduction 391, result has 0.3 percent of original size [2024-11-23 23:23:12,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 6643 treesize of output 4514 [2024-11-23 23:23:12,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:23:12,957 INFO L349 Elim1Store]: treesize reduction 391, result has 0.3 percent of original size [2024-11-23 23:23:12,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 6703 treesize of output 4562 [2024-11-23 23:23:15,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:23:15,349 INFO L349 Elim1Store]: treesize reduction 28, result has 68.5 percent of original size [2024-11-23 23:23:15,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 4271 treesize of output 3804 [2024-11-23 23:23:15,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1280 treesize of output 1164 [2024-11-23 23:23:15,789 INFO L349 Elim1Store]: treesize reduction 89, result has 35.0 percent of original size [2024-11-23 23:23:15,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1198 treesize of output 1197 [2024-11-23 23:23:15,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 1146 treesize of output 1144 [2024-11-23 23:23:15,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1144 treesize of output 1132 [2024-11-23 23:23:16,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 1132 treesize of output 1130 [2024-11-23 23:23:16,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 1130 treesize of output 1128 [2024-11-23 23:23:16,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 25 treesize of output 21 [2024-11-23 23:23:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:23:16,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:23:17,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:23:17,041 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 2850 treesize of output 2336 [2024-11-23 23:23:17,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:23:17,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4143 treesize of output 5055 [2024-11-23 23:23:17,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 134 treesize of output 4 [2024-11-23 23:23:17,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:23:17,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3634 treesize of output 3634 [2024-11-23 23:23:17,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:23:17,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2597 treesize of output 2598 [2024-11-23 23:23:18,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 2073 treesize of output 1556 [2024-11-23 23:23:18,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:23:18,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3249 treesize of output 3896 [2024-11-23 23:23:20,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:23:20,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7894 treesize of output 10739 [2024-11-23 23:24:15,813 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse335 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse336 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse331 (store |c_#memory_$Pointer$#1.offset| .cse335 (store (select |c_#memory_$Pointer$#1.offset| .cse335) .cse336 0))) (.cse334 (store |c_#memory_$Pointer$#1.base| .cse335 (store (select |c_#memory_$Pointer$#1.base| .cse335) .cse336 0)))) (let ((.cse332 (select (select .cse334 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse333 (+ (select (select .cse331 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) 4))) (let ((.cse6 (store .cse334 .cse332 (store (select .cse334 .cse332) .cse333 0))) (.cse4 (store .cse331 .cse332 (store (select .cse331 .cse332) .cse333 0)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (and (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse1 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse0 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse3) (forall ((v_prenex_50 (Array Int Int)) (v_prenex_49 (Array Int Int))) (= (select (select (store (store .cse4 .cse5 v_prenex_49) .cse0 v_prenex_50) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse3))))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse8 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse7 (select (select (store .cse8 .cse7 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse10 (store .cse4 .cse5 v_prenex_99))) (let ((.cse9 (select (select (store .cse10 .cse7 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse9 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse7 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (not (= (select (select .cse10 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse9 4))))))) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse7 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse12 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_211 (Array Int Int))) (not (= .cse11 (select (select (store .cse12 .cse11 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse13 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse11 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse14 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse11 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse13) (= .cse14 .cse13) (= .cse14 .cse2)))) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse11 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse16 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse15 (select (select (store .cse16 .cse15 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse15 .cse5) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int))) (let ((.cse18 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse15 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse17 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse15 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse17 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse15 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (= .cse17 .cse18)))) (= .cse18 .cse2)))))))) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse22 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse19 (select (select .cse22 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse20 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse19 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse19 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse20)) (= .cse19 .cse5) (forall ((v_ArrVal_211 (Array Int Int))) (let ((.cse21 (select (select (store .cse22 .cse19 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse19 .cse21) (= .cse5 .cse21)))) (= .cse20 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse19 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse24 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse23 (select (select .cse24 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse23 (select (select (store .cse24 .cse23 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse25 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse23 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse25 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse23 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (= .cse25 .cse2) (= .cse25 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse23 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse27 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (= .cse26 (select (select (store .cse27 .cse26 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse26 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse28 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse26 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse28) (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse29 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse26 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse29 .cse28) (= .cse29 .cse2))))))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse32 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse30 (select (select .cse32 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (= .cse30 .cse5) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse30 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse31 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse30 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse31) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse30 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse31)))) (forall ((v_ArrVal_211 (Array Int Int))) (= .cse5 (select (select (store .cse32 .cse30 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse34 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse33 (select (select .cse34 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse33 (select (select (store .cse34 .cse33 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse33 .cse5) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse36 (store .cse4 .cse5 v_prenex_99))) (let ((.cse35 (select (select (store .cse36 .cse33 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse35 .cse2) (= .cse35 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse33 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (not (= (select (select .cse36 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse35 4))))))))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse41 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse39 (select (select .cse41 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int))) (let ((.cse37 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse39 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse37 .cse2) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse40 (store .cse4 .cse5 v_prenex_99))) (let ((.cse38 (select (select (store .cse40 .cse39 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse38 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse39 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (= .cse38 .cse37) (not (= (select (select .cse40 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse38 4)))))))))) (not (= .cse39 (select (select (store .cse41 .cse39 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse43 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse42 (select (select .cse43 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (= .cse42 .cse5) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse42 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) (select (select (store (store .cse4 .cse5 v_prenex_97) .cse42 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (forall ((v_ArrVal_211 (Array Int Int))) (= .cse5 (select (select (store .cse43 .cse42 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse45 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse44 (select (select .cse45 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse48 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse44 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_211 (Array Int Int))) (= .cse44 (select (select (store .cse45 .cse44 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse46 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse44 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse47 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse44 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse46 .cse47) (= .cse46 .cse2) (= .cse48 .cse47)))) (= .cse48 .cse2)))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse50 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse49 (select (select .cse50 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (= .cse49 (select (select (store .cse50 .cse49 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse49 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2)) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse52 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse49 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse51 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse49 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse51) (= .cse52 .cse2) (= .cse52 .cse51)))))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse54 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse53 (select (select .cse54 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse53 (select (select (store .cse54 .cse53 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse53 .cse5) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse58 (store .cse4 .cse5 v_prenex_99))) (let ((.cse55 (select (select (store .cse58 .cse53 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse57 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse53 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse56 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse53 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse55 .cse56) (= .cse55 .cse57) (not (= (select (select .cse58 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse55 4))) (= .cse57 .cse56))))))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse63 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse61 (select (select .cse63 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int))) (let ((.cse62 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse61 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse59 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse61 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse59) (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse60 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse61 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse60 .cse59) (= .cse60 .cse2)))) (= .cse62 .cse59)))) (= .cse62 .cse2)))) (= .cse61 (select (select (store .cse63 .cse61 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse68 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse66 (select (select .cse68 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int))) (let ((.cse64 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse66 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse64 .cse2) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse67 (store .cse4 .cse5 v_prenex_99))) (let ((.cse65 (select (select (store .cse67 .cse66 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse65 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse66 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (= .cse65 .cse64) (not (= (select (select .cse67 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse65 4)))))))))) (not (= .cse66 (select (select (store .cse68 .cse66 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse66 .cse5))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse70 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse69 (select (select .cse70 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (= .cse69 .cse5) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse69 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2) (forall ((v_ArrVal_211 (Array Int Int))) (= .cse5 (select (select (store .cse70 .cse69 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse72 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse71 (select (select .cse72 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_211 (Array Int Int))) (not (= .cse71 (select (select (store .cse72 .cse71 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (= .cse2 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse71 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse71 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2)) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse71 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse75 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse73 (select (select .cse75 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (= .cse73 .cse5) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse73 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse74 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse73 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse74 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse73 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (= .cse74 .cse2)))) (= .cse5 (select (select (store .cse75 .cse73 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse77 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse76 (select (select .cse77 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse78 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse76 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_211 (Array Int Int))) (not (= .cse76 (select (select (store .cse77 .cse76 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (= .cse78 .cse2) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse79 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse76 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse80 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse76 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse79) (= .cse80 .cse79) (= .cse80 .cse2) (= .cse80 .cse78))))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse82 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse81 (select (select .cse82 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse81 (select (select (store .cse82 .cse81 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse84 (store .cse4 .cse5 v_prenex_99))) (let ((.cse83 (select (select (store .cse84 .cse81 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse83 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse81 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (= .cse83 .cse2) (not (= (select (select .cse84 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse83 4))))))) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse81 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse86 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse85 (select (select .cse86 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (= .cse2 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse85 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse85 (select (select (store .cse86 .cse85 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse85 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2)) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse85 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse87 (select (select (store .cse6 .cse5 v_ArrVal_214) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse88 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse87 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (= .cse2 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse87 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse88 .cse2) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse87 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse88))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse93 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse91 (select (select .cse93 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int))) (let ((.cse92 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse91 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse90 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse91 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse89 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse91 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse89 .cse90) (= .cse89 .cse2)))) (= .cse92 .cse90)))) (= .cse92 .cse2)))) (= .cse91 .cse5) (= .cse5 (select (select (store .cse93 .cse91 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse95 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse94 (select (select .cse95 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse94 (select (select (store .cse95 .cse94 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse96 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse94 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse98 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse94 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse97 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse94 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse96 .cse97) (= .cse96 .cse2) (= .cse96 .cse98) (= .cse98 .cse97)))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse101 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse99 (select (select .cse101 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse99 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) (select (select (store (store .cse4 .cse5 v_prenex_97) .cse99 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse99 .cse5) (forall ((v_ArrVal_211 (Array Int Int))) (let ((.cse100 (select (select (store .cse101 .cse99 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse99 .cse100) (= .cse5 .cse100)))))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse103 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse102 (select (select .cse103 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse102 (select (select (store .cse103 .cse102 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse102 .cse5) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse104 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse102 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse104 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse102 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (= .cse104 .cse2) (= .cse104 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse102 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))))))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse106 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse105 (select (select .cse106 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse105 (select (select (store .cse106 .cse105 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse105 .cse5) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int))) (let ((.cse108 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse105 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse107 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse105 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse107 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse105 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (= .cse107 .cse2) (= .cse107 .cse108)))) (= .cse108 .cse2)))))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse110 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse109 (select (select .cse110 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse109 (select (select (store .cse110 .cse109 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse112 (store .cse4 .cse5 v_prenex_99))) (let ((.cse111 (select (select (store .cse112 .cse109 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse111 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse109 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (= .cse111 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse109 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (not (= (select (select .cse112 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse111 4))))))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse117 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse116 (select (select .cse117 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse115 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse116 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse113 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse116 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse114 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse116 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse113 .cse114) (= .cse113 .cse2) (= .cse115 .cse114)))) (forall ((v_ArrVal_211 (Array Int Int))) (not (= .cse116 (select (select (store .cse117 .cse116 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (= .cse115 .cse2)))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse119 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse118 (select (select .cse119 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (= .cse118 (select (select (store .cse119 .cse118 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (forall ((v_prenex_50 (Array Int Int)) (v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_49 (Array Int Int))) (let ((.cse120 (select (select (store (store .cse4 .cse5 v_prenex_49) .cse118 v_prenex_50) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse120 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse118 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (= .cse120 .cse2)))))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse122 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse121 (select (select .cse122 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse121 (select (select (store .cse122 .cse121 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse121 .cse5) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse125 (store .cse4 .cse5 v_prenex_99))) (let ((.cse123 (select (select (store .cse125 .cse121 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse124 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse121 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse123 .cse2) (= .cse123 .cse124) (not (= (select (select .cse125 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse123 4))) (= .cse124 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse121 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse128 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse126 (select (select .cse128 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse127 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse126 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse126 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse127)) (forall ((v_ArrVal_211 (Array Int Int))) (not (= .cse126 (select (select (store .cse128 .cse126 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (= .cse126 .cse5) (= .cse127 .cse2)))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse130 (select (select (store .cse6 .cse5 v_ArrVal_214) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse131 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse130 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse129 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse130 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse129) (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse130 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse129)) (= .cse131 .cse129)))) (= .cse131 .cse2))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse132 (select (select (store .cse6 .cse5 v_ArrVal_214) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse132 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse133 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse132 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse133) (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse134 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse132 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse134 .cse133) (= .cse134 .cse2)))))))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse136 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse135 (select (select .cse136 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse135 (select (select (store .cse136 .cse135 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse135 .cse5) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse137 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse135 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse138 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse135 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse137 .cse2) (= .cse137 .cse138) (= .cse138 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse135 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse141 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse139 (select (select .cse141 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse140 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse139 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse139 .cse5) (= .cse140 .cse2) (forall ((v_ArrVal_211 (Array Int Int))) (= .cse5 (select (select (store .cse141 .cse139 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (= .cse140 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse139 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse143 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse142 (select (select .cse143 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse144 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse142 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_211 (Array Int Int))) (= .cse142 (select (select (store .cse143 .cse142 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse144 .cse2) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse145 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse142 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse146 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse142 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse145) (= .cse146 .cse145) (= .cse146 .cse144))))))))) (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int)) (v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse148 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse147 (select (select .cse148 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse147 (select (select (store .cse148 .cse147 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (not (let ((.cse149 (store .cse4 .cse5 v_prenex_99))) (= (select (select .cse149 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ (select (select (store .cse149 .cse147 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) 4)))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse151 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse150 (select (select .cse151 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_211 (Array Int Int))) (not (= .cse150 (select (select (store .cse151 .cse150 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse150 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse154 (store .cse4 .cse5 v_prenex_99))) (let ((.cse152 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse150 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse153 (select (select (store .cse154 .cse150 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse152) (= .cse153 .cse152) (not (= (select (select .cse154 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse153 4))))))))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse156 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse155 (select (select .cse156 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse155 (select (select (store .cse156 .cse155 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse157 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse155 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse157 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse155 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (= .cse157 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse155 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))))) (= .cse155 .cse5))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse159 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse158 (select (select .cse159 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_211 (Array Int Int))) (not (= .cse158 (select (select (store .cse159 .cse158 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse158 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse158 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse158 .cse5) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse158 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse161 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse160 (select (select .cse161 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse160 (select (select (store .cse161 .cse160 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse163 (store .cse4 .cse5 v_prenex_99))) (let ((.cse162 (select (select (store .cse163 .cse160 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse162 .cse2) (= .cse162 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse160 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (not (= (select (select .cse163 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse162 4))))))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse165 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse164 (select (select .cse165 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse166 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse164 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_211 (Array Int Int))) (= .cse164 (select (select (store .cse165 .cse164 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse164 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse166)) (= .cse166 .cse2) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (= .cse166 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse164 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse168 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse167 (select (select .cse168 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse167 (select (select (store .cse168 .cse167 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse167 .cse5) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse170 (store .cse4 .cse5 v_prenex_99))) (let ((.cse169 (select (select (store .cse170 .cse167 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse169 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse167 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (not (= (select (select .cse170 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse169 4))))))))))) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse172 (select (select (store .cse6 .cse5 v_ArrVal_214) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse171 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse172 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse171) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse172 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse171) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse172 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse171))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse174 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse173 (select (select .cse174 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse173 (select (select (store .cse174 .cse173 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse173 .cse5) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse175 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse173 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse177 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse173 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse176 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse173 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse175 .cse176) (= .cse175 .cse177) (= .cse177 .cse176)))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse179 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse178 (select (select .cse179 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse180 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse178 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_211 (Array Int Int))) (not (= .cse178 (select (select (store .cse179 .cse178 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (= .cse2 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse178 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse180 .cse2) (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse182 (store .cse4 .cse5 v_prenex_99))) (let ((.cse181 (select (select (store .cse182 .cse178 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse181 .cse2) (= .cse181 .cse180) (not (= (select (select .cse182 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse181 4)))))))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse185 (select (select (store .cse6 .cse5 v_ArrVal_214) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse186 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse185 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse183 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse185 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse183) (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse184 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse185 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse184 .cse183) (= .cse184 .cse2)))) (= .cse186 .cse183)))) (= .cse186 .cse2))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse188 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse187 (select (select .cse188 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse187 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse187 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse187 .cse5) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse187 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2) (= .cse5 (select (select (store .cse188 .cse187 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse190 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse189 (select (select .cse190 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse189 (select (select (store .cse190 .cse189 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse189 .cse5) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse192 (store .cse4 .cse5 v_prenex_99))) (let ((.cse191 (select (select (store .cse192 .cse189 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse191 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse189 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (= .cse191 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse189 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (not (= (select (select .cse192 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse191 4))))))))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse196 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse193 (select (select .cse196 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (= .cse193 .cse5) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int))) (let ((.cse194 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse193 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse194 .cse2) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse195 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse193 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse193 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse195)) (= .cse194 .cse195))))))) (= .cse5 (select (select (store .cse196 .cse193 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse198 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse197 (select (select .cse198 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse197 (select (select (store .cse198 .cse197 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int))) (let ((.cse200 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse197 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse199 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse197 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse199 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse197 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (= .cse199 .cse2) (= .cse199 .cse200)))) (= .cse200 .cse2)))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse201 (select (select (store .cse6 .cse5 v_ArrVal_214) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (= .cse2 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse201 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse201 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2)) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse201 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2)))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse206 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse205 (select (select .cse206 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse203 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse205 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse204 (store .cse4 .cse5 v_prenex_99))) (let ((.cse202 (select (select (store .cse204 .cse205 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse202 .cse203) (not (= (select (select .cse204 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse202 4))))))) (forall ((v_ArrVal_211 (Array Int Int))) (not (= .cse205 (select (select (store .cse206 .cse205 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (= .cse203 .cse2)))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse208 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse207 (select (select .cse208 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse207 (select (select (store .cse208 .cse207 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse207 .cse5))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse210 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse209 (select (select .cse210 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse209 (select (select (store .cse210 .cse209 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse209 .cse5) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse212 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse209 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse213 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse209 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse211 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse209 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse211) (= .cse212 .cse2) (= .cse212 .cse213) (= .cse213 .cse211)))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse215 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse214 (select (select .cse215 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse217 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse214 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_211 (Array Int Int))) (not (= .cse214 (select (select (store .cse215 .cse214 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (= .cse2 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse214 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse216 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse214 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse216 .cse2) (= .cse216 .cse217)))) (= .cse217 .cse2)))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse222 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse221 (select (select .cse222 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse220 (store .cse4 .cse5 v_prenex_99))) (let ((.cse218 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse221 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse219 (select (select (store .cse220 .cse221 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse218) (= .cse219 .cse218) (= .cse219 .cse2) (not (= (select (select .cse220 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse219 4))))))) (forall ((v_ArrVal_211 (Array Int Int))) (not (= .cse221 (select (select (store .cse222 .cse221 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse221 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse224 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse223 (select (select .cse224 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (= .cse223 (select (select (store .cse224 .cse223 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int))) (let ((.cse227 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse223 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse225 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse223 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse225) (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse226 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse223 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse226 .cse225) (= .cse226 .cse227)))) (= .cse227 .cse225)))) (= .cse227 .cse2)))))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse229 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse228 (select (select .cse229 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (= .cse228 .cse5) (= .cse5 (select (select (store .cse229 .cse228 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse234 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse233 (select (select .cse234 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse231 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse233 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse232 (store .cse4 .cse5 v_prenex_99))) (let ((.cse230 (select (select (store .cse232 .cse233 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse230 .cse231) (not (= (select (select .cse232 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse230 4))))))) (forall ((v_ArrVal_211 (Array Int Int))) (not (= .cse233 (select (select (store .cse234 .cse233 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (= .cse233 .cse5) (= .cse231 .cse2)))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse236 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse235 (select (select .cse236 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_211 (Array Int Int))) (not (= .cse235 (select (select (store .cse236 .cse235 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (= .cse235 .cse5) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse235 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse237 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse235 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse237) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse235 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse237)))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse239 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse238 (select (select .cse239 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_211 (Array Int Int))) (not (= .cse238 (select (select (store .cse239 .cse238 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (= .cse238 .cse5) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse238 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse242 (store .cse4 .cse5 v_prenex_99))) (let ((.cse240 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse238 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse241 (select (select (store .cse242 .cse238 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse240) (= .cse241 .cse240) (not (= (select (select .cse242 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse241 4))))))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse245 (select (select (store .cse6 .cse5 v_ArrVal_214) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse244 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse245 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse243 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse245 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse243) (= .cse244 .cse243)))) (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse245 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2)) (= .cse244 .cse2))))) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse248 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse246 (select (select .cse248 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (= .cse246 .cse5) (forall ((v_ArrVal_211 (Array Int Int))) (let ((.cse247 (select (select (store .cse248 .cse246 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse246 .cse247) (= .cse5 .cse247)))) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse246 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse246 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse250 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse249 (select (select .cse250 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_211 (Array Int Int))) (not (= .cse249 (select (select (store .cse250 .cse249 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (= .cse249 .cse5) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse249 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse251 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse249 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse251 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse249 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (= .cse251 .cse2)))))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse253 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse252 (select (select .cse253 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (= .cse2 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse252 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse252 (select (select (store .cse253 .cse252 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (forall ((v_prenex_50 (Array Int Int)) (v_prenex_49 (Array Int Int))) (= (select (select (store (store .cse4 .cse5 v_prenex_49) .cse252 v_prenex_50) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2)))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse255 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse254 (select (select .cse255 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse257 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse254 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_211 (Array Int Int))) (= .cse254 (select (select (store .cse255 .cse254 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (= .cse2 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse254 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse256 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse254 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse256 .cse2) (= .cse256 .cse257)))) (= .cse257 .cse2)))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse259 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse258 (select (select .cse259 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse258 (select (select (store .cse259 .cse258 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse258 .cse5) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse260 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse258 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse262 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse258 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse261 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse258 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse260 .cse261) (= .cse260 .cse2) (= .cse260 .cse262) (= .cse262 .cse261)))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse264 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse263 (select (select .cse264 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse265 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse263 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_211 (Array Int Int))) (not (= .cse263 (select (select (store .cse264 .cse263 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (= .cse265 .cse2) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse268 (store .cse4 .cse5 v_prenex_99))) (let ((.cse266 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse263 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse267 (select (select (store .cse268 .cse263 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse266) (= .cse267 .cse266) (= .cse267 .cse265) (not (= (select (select .cse268 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse267 4)))))))))))) (forall ((v_ArrVal_214 (Array Int Int))) (let ((.cse271 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse269 (select (select .cse271 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (= .cse269 .cse5) (forall ((v_ArrVal_211 (Array Int Int))) (let ((.cse270 (select (select (store .cse271 .cse269 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse269 .cse270) (= .cse5 .cse270)))))))) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int)) (v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse273 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse272 (select (select .cse273 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse272 (select (select (store .cse273 .cse272 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse272 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse272 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (= .cse272 .cse5))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse277 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse274 (select (select .cse277 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int))) (let ((.cse275 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse274 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse274 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse275)) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse276 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse274 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse276) (= .cse275 .cse276)))) (= .cse275 .cse2)))) (= .cse274 (select (select (store .cse277 .cse274 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse280 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse278 (select (select .cse280 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse279 (select (select (store .cse280 .cse278 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse278 .cse279) (= .cse5 .cse279)))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse282 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse281 (select (select .cse282 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse281 (select (select (store .cse282 .cse281 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse281 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) (select (select (store (store .cse4 .cse5 v_prenex_97) .cse281 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse281 .cse5))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse284 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse283 (select (select .cse284 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (= .cse283 (select (select (store .cse284 .cse283 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse285 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse283 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse285) (forall ((v_prenex_50 (Array Int Int)) (v_prenex_49 (Array Int Int))) (let ((.cse286 (select (select (store (store .cse4 .cse5 v_prenex_49) .cse283 v_prenex_50) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse286 .cse285) (= .cse286 .cse2))))))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse288 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse287 (select (select .cse288 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse290 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse287 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_211 (Array Int Int))) (= .cse287 (select (select (store .cse288 .cse287 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse289 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse287 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse289) (= .cse290 .cse289)))) (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse291 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse287 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse291 .cse2) (= .cse291 .cse290)))) (= .cse290 .cse2)))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse293 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse292 (select (select .cse293 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse292 (select (select (store .cse293 .cse292 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse297 (store .cse4 .cse5 v_prenex_99))) (let ((.cse294 (select (select (store .cse297 .cse292 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse296 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse292 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse295 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse292 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse294 .cse295) (= .cse294 .cse296) (not (= (select (select .cse297 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse294 4))) (= .cse296 .cse295))))))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse299 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse298 (select (select .cse299 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse298 (select (select (store .cse299 .cse298 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse301 (store .cse4 .cse5 v_prenex_99))) (let ((.cse300 (select (select (store .cse301 .cse298 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse300 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse298 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (not (= (select (select .cse301 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse300 4))))))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse303 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse302 (select (select .cse303 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse304 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse302 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_211 (Array Int Int))) (not (= .cse302 (select (select (store .cse303 .cse302 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (= .cse302 .cse5) (= .cse304 .cse2) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse305 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse302 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse306 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse302 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse305) (= .cse306 .cse305) (= .cse306 .cse304))))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse310 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse309 (select (select .cse310 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse308 (store .cse4 .cse5 v_prenex_99))) (let ((.cse307 (select (select (store .cse308 .cse309 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse307 .cse2) (not (= (select (select .cse308 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse307 4))))))) (forall ((v_ArrVal_211 (Array Int Int))) (not (= .cse309 (select (select (store .cse310 .cse309 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (= .cse2 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse309 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= (select (select (store (store .cse4 .cse5 v_prenex_97) .cse309 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2))))) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int)) (v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse312 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse314 (store .cse4 .cse5 v_prenex_99)) (.cse311 (select (select .cse312 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse313 (select (select (store .cse314 .cse311 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (not (= .cse311 (select (select (store .cse312 .cse311 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse313 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse311 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (not (= (select (select .cse314 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse313 4)))))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse316 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse315 (select (select .cse316 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse315 (select (select (store .cse316 .cse315 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse318 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse315 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse319 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse315 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse317 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse315 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse317) (= .cse318 .cse2) (= .cse318 .cse319) (= .cse319 .cse317)))))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse321 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse320 (select (select .cse321 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse320 (select (select (store .cse321 .cse320 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_ArrVal_218 (Array Int Int)) (v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse324 (store .cse4 .cse5 v_prenex_99))) (let ((.cse322 (select (select (store .cse324 .cse320 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (.cse323 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse320 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse322 .cse2) (= .cse322 .cse323) (not (= (select (select .cse324 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse322 4))) (= .cse323 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse320 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))))))))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse327 (select (select (store .cse6 .cse5 v_ArrVal_214) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse326 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse327 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse325 (select (select (store (store .cse4 .cse5 v_ArrVal_218) .cse327 v_ArrVal_210) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse325) (= .cse326 .cse325)))) (= (select (select (store (store .cse4 .cse5 v_prenex_99) .cse327 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse326))))) (forall ((v_ArrVal_211 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse329 (store .cse6 .cse5 v_ArrVal_214))) (let ((.cse328 (select (select .cse329 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse328 (select (select (store .cse329 .cse328 v_ArrVal_211) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse330 (select (select (store (store .cse4 .cse5 v_prenex_99) .cse328 v_prenex_100) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse330 .cse2) (= .cse330 (select (select (store (store .cse4 .cse5 v_prenex_97) .cse328 v_prenex_98) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))))) (= .cse328 .cse5))))))))))) is different from false [2024-11-23 23:26:59,372 WARN L286 SmtUtils]: Spent 2.36m on a formula simplification. DAG size of input: 41 DAG size of output: 28 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-23 23:26:59,373 INFO L349 Elim1Store]: treesize reduction 142, result has 27.2 percent of original size [2024-11-23 23:26:59,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 261688 treesize of output 215597 [2024-11-23 23:32:17,972 WARN L286 SmtUtils]: Spent 5.30m on a formula simplification. DAG size of input: 49 DAG size of output: 42 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-23 23:32:17,972 INFO L349 Elim1Store]: treesize reduction 54, result has 59.1 percent of original size [2024-11-23 23:32:18,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 297871 treesize of output 169838 [2024-11-23 23:32:23,175 WARN L286 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 13148 DAG size of output: 10921 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)