public static void test(String label, BigInteger a, BigInteger b) {
        long t1 = currentTimeMillis();
        int cnt = 0;
        while(a.compareTo(b) < 0) {
            a = a.nextProbablePrime();
            cnt++;
        }
        long t2 = currentTimeMillis();
        long elapedTimeS = (t2 - t1) / 1000;
        long avgSpeed = elapedTimeS != 0 ? cnt / elapedTimeS : 0;
        printf("%s;;%d;;%d;%d\n", label, cnt, elapedTimeS, avgSpeed);
    }

    public static void main(String[] args) {
        printf("[CSV=;]Range; Primes Found(Usoff) ; Primes Found(JDK::BigInteger) ; Primes (theoretical) ; Elapsed time(s) ; Average Speed (primes/sec)\n");
        test("2^200 +1 - 2^200 + 1 + 1 000 000", TWO.pow(200).add(ONE),  TWO.pow(200).add(ONE).add(BigInteger.valueOf(1_000_000)));
        test("2^500 +1 - 2^500 + 1 + 200 000",   TWO.pow(500).add(ONE),  TWO.pow(500).add(ONE).add(BigInteger.valueOf(200_000)));
        test("2^1024 +1 - 2^1024 + 1 + 200 000", TWO.pow(1024).add(ONE), TWO.pow(1024).add(ONE).add(BigInteger.valueOf(200_000)));
        test("2^2048 +1 - 2^2048 + 1 + 100 000", TWO.pow(2048).add(ONE), TWO.pow(2048).add(ONE).add(BigInteger.valueOf(100_000)));
        printf("[/CSV]");
    }

while(a.compareTo(b) < 0) {
            a = a.nextProbablePrime();
            cnt++;
        }