TF_NewShapeAndTypeList(input_shapes_vec.size());
    for (size_t i = 0; i < input_shapes_vec.size(); ++i) {
      const auto& input_shape = input_shapes_vec[i];
      if (input_shape.has_value()) {
        TF_ShapeAndTypeListSetShape(input_shapes, i, input_shape->data(),
                                    input_shape->size());
      } else {
        TF_ShapeAndTypeListSetUnknownShape(input_shapes, i);

        // Trigger integer overflow prevention
        try {
            validator.safeAdd(Integer.MAX_VALUE, Integer.MAX_VALUE);
        } catch (SmbException e) {
            // Expected
        }

        try {
            validator.safeMultiply(Integer.MAX_VALUE, 2);
        } catch (SmbException e) {
            // Expected
        }

        when(negotiationResponse.getSendBufferSize()).thenReturn(Integer.MAX_VALUE);
        when(negotiationResponse.getReceiveBufferSize()).thenReturn(Integer.MAX_VALUE);
        when(negotiationResponse.getTransactionBufferSize()).thenReturn(Integer.MAX_VALUE);

        assertEquals(Integer.MAX_VALUE, negotiationResponse.getSendBufferSize());
        assertEquals(Integer.MAX_VALUE, negotiationResponse.getReceiveBufferSize());

        assertEquals("EndOfFileInformation[endOfFile=0]", info2.toString());

        // Test max value
        FileEndOfFileInformation info3 = new FileEndOfFileInformation(Long.MAX_VALUE);
        assertEquals("EndOfFileInformation[endOfFile=" + Long.MAX_VALUE + "]", info3.toString());
    }

    @Test
    @DisplayName("Test multiple encode operations")
    void testMultipleEncodeOperations() {

            // Given
            byte[] maxKey = new byte[SOURCE_KEY_SIZE];
            Arrays.fill(maxKey, (byte) 0xFF);
            SrvCopychunk chunk = new SrvCopychunk(Long.MAX_VALUE, Long.MAX_VALUE, Integer.MAX_VALUE);
            SrvCopychunkCopy copy = new SrvCopychunkCopy(maxKey, chunk);
            byte[] buffer = new byte[100];

            // When
            int bytesWritten = copy.encode(buffer, 0);

  }

  /*
   * binomial(biggestBinomials[k], k) fits in a long, but not binomial(biggestBinomials[k] + 1, k).
   */
  static final int[] biggestBinomials = {
    Integer.MAX_VALUE,
    Integer.MAX_VALUE,
    Integer.MAX_VALUE,
    3810779,
    121977,
    16175,
    4337,
    1733,
    887,
    534,
    361,
    265,
    206,
    169,
    143,
    125,
    111,

        String value = null;
        boolean haveValue = false;
        if (encoding != null) {
            try {
                value = item.getString(encoding);
                haveValue = true;
            } catch (final Exception e) {}
        }
        if (!haveValue) {
            try {
                value = item.getString(Charset.forName("ISO-8859-1"));

        when(sidResolver.getGroupMemberSids(any(CIFSContext.class), anyString(), any(SID.class), eq(Integer.MAX_VALUE), anyInt()))
                .thenReturn(new SID[0]);

        SID[] result = sidResolver.getGroupMemberSids(mockContext, testServerName, mockDomainSid, Integer.MAX_VALUE, 0);

        assertNotNull(result);
    }

    @Test
    void testGetGroupMemberSids_ZeroRid() throws CIFSException {

        // The comparator b2 - b1 with MAX_VALUE and MIN_VALUE causes overflow
        List<Integer> executionOrder = PriorityTrackingBooster.getExecutionOrder();
        assertEquals(3, executionOrder.size());
        assertEquals(Integer.valueOf(Integer.MIN_VALUE), executionOrder.get(0));
        assertEquals(Integer.valueOf(Integer.MAX_VALUE), executionOrder.get(1));

        ContiguousSet.closed(Integer.MIN_VALUE, Integer.MAX_VALUE),
        ContiguousSet.create(Range.<Integer>all(), integers()));
    assertEquals(
        ContiguousSet.closed(Integer.MIN_VALUE, Integer.MAX_VALUE),
        ContiguousSet.create(Range.atLeast(Integer.MIN_VALUE), integers()));
    assertEquals(
        ContiguousSet.closed(Integer.MIN_VALUE, Integer.MAX_VALUE),