Average Error: 64.0 → 64.0
Time: 3.9s
Precision: 64
\[1.899999999999999911182158029987476766109 \le t \le 2.100000000000000088817841970012523233891\]
\[1.699999999999999938830795788659981743333 \cdot 10^{308} \cdot t - 1.699999999999999938830795788659981743333 \cdot 10^{308}\]
↓
\[1.699999999999999938830795788659981743333 \cdot 10^{308} \cdot t - 1.699999999999999938830795788659981743333 \cdot 10^{308}\]
1.699999999999999938830795788659981743333 \cdot 10^{308} \cdot t - 1.699999999999999938830795788659981743333 \cdot 10^{308}
↓
1.699999999999999938830795788659981743333 \cdot 10^{308} \cdot t - 1.699999999999999938830795788659981743333 \cdot 10^{308}
double f(double t) {
        double r37017 = 1.7e+308;
        double r37018 = t;
        double r37019 = r37017 * r37018;
        double r37020 = r37019 - r37017;
        return r37020;
}
↓
double f(double t) {
        double r37021 = 1.7e+308;
        double r37022 = t;
        double r37023 = r37021 * r37022;
        double r37024 = r37023 - r37021;
        return r37024;
}

Error

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original64.0
Target0
Herbie64.0
\[\mathsf{fma}\left(1.699999999999999938830795788659981743333 \cdot 10^{308}, t, -1.699999999999999938830795788659981743333 \cdot 10^{308}\right)\]

Derivation

  1. Initial program 64.0

    \[1.699999999999999938830795788659981743333 \cdot 10^{308} \cdot t - 1.699999999999999938830795788659981743333 \cdot 10^{308}\]

  2. Final simplification64.0

    \[\leadsto 1.699999999999999938830795788659981743333 \cdot 10^{308} \cdot t - 1.699999999999999938830795788659981743333 \cdot 10^{308}\]

Reproduce

herbie shell --seed 2019291 
(FPCore (t)
  :name "fma_test2"
  :precision binary64
  :pre (<= 1.8999999999999999 t 2.10000000000000009)

  :herbie-target
  (fma 1.6999999999999999e308 t (- 1.6999999999999999e308))

  (- (* 1.6999999999999999e308 t) 1.6999999999999999e308))