If we can prove (statically or with a runtime-check) that two arrays are different, then this removes edges from the dependency graph, and may allow vectorization that would otherwise not be possible.

As discussed in JDK-8323582 / https://github.com/openjdk/jdk/pull/22016#issuecomment-2680894298, we should write some benchmarks to prove that we need the slow and fast loop, and so that the complexity of the slow_loop is really justified.

Also: add a Flag to disable the predicate for Auto Vectorization.