Program: 49754
Project: 49754
Buggy source:
public int quiescentSearch(int qsdepth,int alpha,int beta) throws SearchFinishedException {
  if (System.currentTimeMillis() > thinkTo && foundOneMove) {
    throw new SearchFinishedException();
  }
  qsPositionCounter++;
  if (board.isDraw()) {
    return evaluateDraw();
  }
  int eval=-Evaluator.VICTORY;
  int score;
  boolean pv=beta - alpha > 1;
  ttProbe++;
  boolean foundTT=tt.search(board,false);
  if (foundTT) {
    if (!pv && canUseTT(0,alpha,beta)) {
      return tt.getScore();
    }
  }
  if (!board.getCheck()) {
    eval=eval(foundTT,true);
    if (eval >= beta) {
      return eval;
    }
    if (eval > alpha) {
      alpha=eval;
    }
  }
  if (board.getMoveNumber() - initialPly >= MAX_DEPTH) {
    System.out.println("String_Node_Str" + qsdepth);
    System.out.println(board.toString());
    for (int i=0; i < board.getMoveNumber(); i++) {
      System.out.println(Move.toStringExt(board.moveHistory[i]));
    }
    return eval;
  }
  boolean validOperations=false;
  boolean checkEvasion=board.getCheck();
  boolean generateChecks=pv && (qsdepth == 0);
  MoveIterator moveIterator=moveIterators[board.getMoveNumber() - initialPly];
  moveIterator.genMoves(0,true,generateChecks);
  int move;
  while ((move=moveIterator.next()) != 0) {
    if (board.doMove(move,false)) {
      validOperations=true;
      if (!board.getCheck() && !checkEvasion && !Move.isPromotion(move)&& !Move.isPawnPush(move)&& !pv&& (((board.queens | board.rooks) & board.getMines()) != 0 || (BitboardUtils.popCount(board.bishops | board.knights) & board.getMines()) > 1)) {
        int futilityValue=eval + lastCapturedPieceValue(board) + config.getFutilityMarginQS();
        if (futilityValue < alpha) {
          board.undoMove();
          continue;
        }
      }
      if (!checkEvasion && !(board.getCheck() && generateChecks) && moveIterator.getPhase() > MoveIterator.PHASE_GOOD_CAPTURES_AND_PROMOS) {
        board.undoMove();
        continue;
      }
      score=-quiescentSearch(qsdepth + 1,-beta,-alpha);
      board.undoMove();
      if (score > alpha) {
        alpha=score;
        if (score >= beta) {
          break;
        }
      }
    }
  }
  if (board.getCheck() && !validOperations) {
    return valueMatedIn(board.getMoveNumber() - initialPly);
  }
  return alpha;
}

Fixed version (ground truth):
public int quiescentSearch(int qsdepth,int alpha,int beta) throws SearchFinishedException {
  if (System.currentTimeMillis() > thinkTo && foundOneMove) {
    throw new SearchFinishedException();
  }
  qsPositionCounter++;
  if (board.isDraw()) {
    return evaluateDraw();
  }
  int eval=-Evaluator.VICTORY;
  int score;
  boolean pv=beta - alpha > 1;
  ttProbe++;
  boolean foundTT=tt.search(board,false);
  if (foundTT) {
    if (!pv && canUseTT(0,alpha,beta)) {
      return tt.getScore();
    }
  }
  if (!board.getCheck()) {
    eval=eval(foundTT,true);
    if (eval >= beta) {
      return eval;
    }
    if (eval > alpha) {
      alpha=eval;
    }
  }
  if (board.getMoveNumber() - initialPly >= MAX_DEPTH) {
    System.out.println("String_Node_Str" + qsdepth);
    System.out.println(board.toString());
    for (int i=0; i < board.getMoveNumber(); i++) {
      System.out.print(Move.toStringExt(board.moveHistory[i]));
      System.out.print("String_Node_Str");
    }
    System.out.println();
    return eval;
  }
  boolean validOperations=false;
  boolean checkEvasion=board.getCheck();
  boolean generateChecks=pv && (qsdepth == 0);
  MoveIterator moveIterator=moveIterators[board.getMoveNumber() - initialPly];
  moveIterator.genMoves(0,true,generateChecks);
  int move;
  while ((move=moveIterator.next()) != 0) {
    if (board.doMove(move,false)) {
      validOperations=true;
      if (!board.getCheck() && !checkEvasion && !Move.isPromotion(move)&& !Move.isPawnPush(move)&& !pv&& (((board.queens | board.rooks) & board.getMines()) != 0 || (BitboardUtils.popCount(board.bishops | board.knights) & board.getMines()) > 1)) {
        int futilityValue=eval + lastCapturedPieceValue(board) + config.getFutilityMarginQS();
        if (futilityValue < alpha) {
          board.undoMove();
          continue;
        }
      }
      if (!checkEvasion && !(board.getCheck() && generateChecks) && moveIterator.getPhase() > MoveIterator.PHASE_GOOD_CAPTURES_AND_PROMOS) {
        board.undoMove();
        continue;
      }
      score=-quiescentSearch(qsdepth + 1,-beta,-alpha);
      board.undoMove();
      if (score > alpha) {
        alpha=score;
        if (score >= beta) {
          break;
        }
      }
    }
  }
  if (board.getCheck() && !validOperations) {
    return valueMatedIn(board.getMoveNumber() - initialPly);
  }
  return alpha;
}