Incorrect results for Fibonacci sequences about java-algorithms-implementation HOT 5 CLOSED

@Test
public void fibonacciBenchmarks() {
    // display benchmarks (output format: markdown):
    System.out.println("# Fibonacci sequence tests");
    final long time_out = 30000;
    final float k = 1000f;
    final Fibonacci[] instances = { FibonacciSequenceUsingLoop.INSTANCE,
                                    FibonacciSequenceUsingRecursion.INSTANCE,
                                    FibonacciSequenceUsingMatrixMultiplication.INSTANCE,
                                    FibonacciSequenceUsingBinetsFormula.INSTANCE };
    for (final Fibonacci f : instances) {
        System.out.println("\n### algorithm: **" + f.getClass().getSimpleName() + "**\n```");
        for (int n = 25; n < 96; n++)
            if (n < 28 || n >= 90 || f == FibonacciSequenceUsingRecursion.INSTANCE)
                try {
                    if (n == 90)
                        System.out.println("...");
                    System.out.print("f(" + n + ") = ");
                    final long t0 = System.nanoTime();
                    final long r = f.fibonacciSequence(n);
                    final float dt = (System.nanoTime() - t0) / k;
                    if (dt <= time_out) {
                        if (dt < k)
                            System.out.print(String.format("%20d [%9.3f µs]", r, dt));
                        else
                            System.out.print(String.format("%20d [%9.3f ms]", r, dt / k));
                        if (n <= 92)
                            System.out.println();
                        else
                            System.out.println(" KO");
                    }
                    else {
                        System.out.println(String.format("%20d %12s", r, "time out"));
                        break;
                    }
                }
                catch (final Throwable t) {
                    System.out.println("?");
                    break; // try next algorithm
                }
        System.out.println("```");
    }
}

@Test
public void fibonacciBenchmarks_ref() throws NoSuchMethodException, SecurityException {
    // display benchmarks (output format: markdown):
    System.out.println("# Fibonacci sequence tests");
    final long time_out = 30000;
    final float k = 1000f;
    final Method[] instances = FibonacciSequence.class.getDeclaredMethods();
    for (final Method f : instances) {
        System.out.println("\n### algorithm: **" + f.getName() + "**\n```");
        for (int n = 25; n < 96; n++)
            if (n < 28 || n >= 90 || "fibonacciSequenceUsingRecursion".equals(f.getName()))
                try {
                    if (n == 90)
                        System.out.println("...");
                    System.out.print("f(" + n + ") = ");
                    final long t0 = System.nanoTime();
                    final long r =(Long) f.invoke(null, n);
                    final float dt = (System.nanoTime() - t0) / k;
                    if (dt <= time_out) {
                        if (dt < k)
                            System.out.print(String.format("%20d [%9.3f µs]", r, dt));
                        else
                            System.out.print(String.format("%20d [%9.3f ms]", r, dt / k));
                        if (n <= 92)
                            System.out.println();
                        else
                            System.out.println(" KO");
                    }
                    else {
                        System.out.println(String.format("%20d %12s", r, "time out"));
                        break;
                    }
                }
                catch (final Throwable t) {
                    System.out.println("?");
                    break; // try next algorithm
                }
        System.out.println("```");
    }
}