Path tempDir = Files.createTempDirectory("concurrent_test");
        try {
            Path targetFile = tempDir.resolve("target.tmp");
            Files.createFile(targetFile);

            // First delete succeeds
            assertTrue(Files.deleteIfExists(targetFile));

            // Second delete returns false (file already gone)
            assertFalse(Files.deleteIfExists(targetFile));
        } finally {

        // Mock transports
        SmbTransportImpl trans1 = mock(SmbTransportImpl.class);
        SmbTransportImpl trans2 = mock(SmbTransportImpl.class);

        // trans2 fails first (lower fail count, tried first), trans1 succeeds
        when(trans2.unwrap(SmbTransportImpl.class)).thenReturn(trans2);
        when(trans2.ensureConnected()).thenThrow(new IOException("Connection failed"));
        doNothing().when(trans2).close();

 *
 * <ul>
 *   <li><b>collision-resistant:</b> while the definition above requires making at least <i>some</i>
 *       token attempt, one measure of the quality of a hash function is <i>how well</i> it succeeds
 *       at this goal. Important note: it may be easy to achieve the theoretical minimum collision
 *       rate when using completely <i>random</i> sample input. The true test of a hash function is

    }

    @Test
    @DisplayName("verifyMIC delegates to GSS and succeeds")
    void verifyMIC_success() throws Exception {
        byte[] data = new byte[] { 1, 2 };
        byte[] mic = new byte[] { 3 };
        // No exception means success
        doNothing().when(gssContext).verifyMIC(eq(mic), eq(0), eq(1), eq(data), eq(0), eq(2), any());

                            response.writeBytesWireFormat(buffer, 0);
                        }
                        success[index] = true;
                    } catch (Exception e) {
                        success[index] = false;
                    }
                });
            }

            // When
            for (Thread thread : threads) {

      static final int COMPLETED = 2;
      static final int CANCELLED = 4;
      static final int INTERRUPTED = 8;

      private V value;
      private Throwable exception;

      /*
       * Acquisition succeeds if the future is done, otherwise it fails.
       */
      @Override
      protected int tryAcquireShared(int ignored) {
        if (isDone()) {
          return 1;
        }
        return -1;
      }

    }

    @Test
    @DisplayName("getSmbSession creates and then reuses matching session")
    void getSmbSession_createAndReuse() {
        // Arrange: minimal credentials chain so SmbSessionImpl constructor succeeds
        CredentialsInternal creds = mock(CredentialsInternal.class);
        when(ctx.getCredentials()).thenReturn(creds);
        when(creds.unwrap(CredentialsInternal.class)).thenReturn(creds);

                retriesSeen.add(remainingRetries);
                if (remainingRetries <= 0) {
                    return false;
                }
                // Simulate: cleanup succeeds, retry with decremented retries
                return tryStartOperation(operationName, data, remainingRetries - 1);
            }
        };

        helper.tryStartOperation("test_op", null, 3);

#### Key rotation - Basic Operation

The MinIO server supports key rotation for SSE-S3 encrypted objects. The minio server decrypts the OEK using the current encrypted data key and the master key ID of the object metadata. If this succeeds, the server requests a new data key from the KMS using the master key ID of the **current MinIO KMS configuration** and re-wraps the *OEK* with a new *KEK* derived from the new data key / EK:

##### Figure 3 - KMS data key rotation

        response.body.string()
      }
    }

    // The second call succeeds.
    val call2 = client.newCall(Request(server.url("/")))
    call2.execute().use { response ->
      assertThat(
        response.body.string(),
      ).isEqualTo("b")
    }

    // Calls succeed after the degraded pong timeout because the degraded pong was received.