### CI Link

https://gradle-enterprise.elastic.co/s/ym6b3yayxtusy/tests/:x-pack:plugin:async-search:internalClusterTest/org.elasticsearch.xpack.search.AsyncSearchActionIT/testCCSCheckCompatibility

### Repro line

./gradlew ':x-pack:plugin:async-search:internalClusterTest' --tests "org.elasticsearch.xpack.search.AsyncSearchActionIT.testCCSCheckCompatibility"

### Does it reproduce?

Yes

### Applicable branches

main

### Failure history

_No response_

### Failure excerpt

In `AsyncSearchActionIT.testCCSCheckCompatibility` and `TransportTermsEnumActionTests.TransportTermsEnumActionTests` the code assumes that it can send a request that uses the current transport version (see `DummyQueryBuilder` / `VersionedNamedWriteable` ) and that will always be incompatible with the `MINIMUM_CCS_VERSION`

However since the move to `TransportVersion` it is no longer the case that a node on the next node version will be incompatible with the previous node version (which is what `MINIMUM_CCS_VERSION` tracks). In fact, immediately after a version number they will be identical - that is, `TransportVersion.current()` will be the same version as `TransportVersion.MINIMUM_CCS_VERSION`

This causes these tests to fail until the transport version is bumped.

- https://github.com/elastic/elasticsearch/blob/6420924e314c9e154617055f1c91fa9d5f084049/x-pack/plugin/async-search/src/internalClusterTest/java/org/elasticsearch/xpack/search/AsyncSearchActionIT.java#L534
- https://github.com/elastic/elasticsearch/blob/4d3fb8d9938236dd7d6de2cae614fa8a34f66862/server/src/main/java/org/elasticsearch/TransportVersion.java#L224
 
For the test to work within the current assumptions it would need to get a `TransportVersion` that is after `MINIMUM_CCS_VERSION`, but `TransportVersionUtils` doesn't offer a way to create such a version on the fly (it has to already exist).

server/src/test/java/org/elasticsearch/action/search/TransportSearchActionTests.java
if (randomBoolean() && i > 0) {
                Index existingIndex = indices[randomIntBetween(0, i - 1)];
                indices[i] = new Index(existingIndex.getName(), randomAlphaOfLength(10));
            } else {
                indices[i] = new Index(randomAlphaOfLengthBetween(5, 10), randomAlphaOfLength(10));
            }
        }
        Arrays.sort(indices, (o1, o2) -> {
            int nameCompareTo = o1.getName().compareTo(o2.getName());
            if (nameCompareTo == 0) {
                return o1.getUUID().compareTo(o2.getUUID());
            }
            return nameCompareTo;
        });
        String[] remoteClusters = new String[randomIntBetween(1, 3)];
        for (int i = 0; i < remoteClusters.length; i++) {
            remoteClusters[i] = randomAlphaOfLengthBetween(5, 10);
        }
        Arrays.sort(remoteClusters);
        List<SearchShardIterator> expected = new ArrayList<>();
        String localClusterAlias = randomAlphaOfLengthBetween(5, 10);
        OriginalIndices localIndices = OriginalIndicesTests.randomOriginalIndices();
        List<SearchShardIterator> localShardIterators = new ArrayList<>();
        List<SearchShardIterator> remoteShardIterators = new ArrayList<>();
        int numShards = randomIntBetween(0, 10);
        for (int i = 0; i < numShards; i++) {
            int numIndices = randomIntBetween(0, indices.length);
            for (int j = 0; j < numIndices; j++) {
                Index index = indices[j];
                boolean localIndex = randomBoolean();