Introduction date: July 7, 2023
Introduction PR: https://github.com/mozilla/pdf.js/commit/5c5f9af803187d616703c19987eca5d7d39d9420 (/cc @calixteman)
Type: intermittent (sometimes it works, indicating a possible timing/waiting issue)
OS: Windows
Logs: http://54.193.163.58:8877/86bd72072bc402b/output.txt
Traceback:

```
Failures:
1) FreeText Editor FreeText (edit existing in double clicking on it) must move an annotation
  Message:
[31m    In firefox: Expected '' to equal 'pdfjs_internal_editor_0-editor'.[0m
  Stack:
        at <Jasmine>
        at C:\pdfjs\botio-files-pdfjs\private\86bd72072bc402b\test\integration\freetext_editor_spec.js:1187:14
        at process.processTicksAndRejections (node:internal/process/task_queues:95:5)
        at async Promise.all (index 0)
        at async UserContext.<anonymous> (C:\pdfjs\botio-files-pdfjs\private\86bd72072bc402b\test\integration\freetext_editor_spec.js:1176:7)
  Message:
[31m    In firefox: Expected 'inherit' to equal 'true'.[0m
  Stack:
        at <Jasmine>
        at C:\pdfjs\botio-files-pdfjs\private\86bd72072bc402b\test\integration\freetext_editor_spec.js:1188:61
        at process.processTicksAndRejections (node:internal/process/task_queues:95:5)
        at async Promise.all (index 0)
        at async UserContext.<anonymous> (C:\pdfjs\botio-files-pdfjs\private\86bd72072bc402b\test\integration\freetext_editor_spec.js:1176:7)
```
break;
              case "BL":
                for (let i = height - 1; i >= 0; i--) {
                  for (let j = 0; j < width; j++) {
                    const idx = (width * i + j) << 2;
                    if (buf[idx] === 0) {
                      firsts.push([j, i]);
                      stats[j] = (stats[j] || 0) + 1;
                      break;
                    }
                  }
                }
                break;
            }
            let maxValue = -Infinity;
            let maxJ = 0;
            for (const [j, count] of Object.entries(stats)) {
              if (count > maxValue) {
                maxValue = count;
                maxJ = j;
              }
            }
            maxJ = parseInt(maxJ, 10);
            for (const [j, i] of firsts) {
              if (j === maxJ) {
                return [j, i];
              }
            }
            return null;
          };