Average Error: 0.0 → 0.0
Time: 19.2s
Precision: 64
\[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.9807307601812193 \cdot 10^{+165} \right)}^{2}\right)\right)\]
↓
\[\left(\left(\sinh c\right) \bmod \left(c - -2.9807307601812193 \cdot 10^{+165} \cdot -2.9807307601812193 \cdot 10^{+165}\right)\right)\]
\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.9807307601812193 \cdot 10^{+165} \right)}^{2}\right)\right)
↓
\left(\left(\sinh c\right) \bmod \left(c - -2.9807307601812193 \cdot 10^{+165} \cdot -2.9807307601812193 \cdot 10^{+165}\right)\right)
double f(double c) {
        double r509508 = c;
        double r509509 = sinh(r509508);
        double r509510 = -2.9807307601812193e+165;
        double r509511 = 2.0;
        double r509512 = pow(r509510, r509511);
        double r509513 = r509508 - r509512;
        double r509514 = fmod(r509509, r509513);
        return r509514;
}
↓
double f(double c) {
        double r509515 = c;
        double r509516 = sinh(r509515);
        double r509517 = -2.9807307601812193e+165;
        double r509518 = r509517 * r509517;
        double r509519 = r509515 - r509518;
        double r509520 = fmod(r509516, r509519);
        return r509520;
}

Error

Bits error versus c

Derivation

  1. Initial program 0.0

    \[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.9807307601812193 \cdot 10^{+165} \right)}^{2}\right)\right)\]

  2. Simplified0.0

    \[\leadsto \color{blue}{\left(\left(\sinh c\right) \bmod \left(c - -2.9807307601812193 \cdot 10^{+165} \cdot -2.9807307601812193 \cdot 10^{+165}\right)\right)}\]

  3. Final simplification0.0

    \[\leadsto \left(\left(\sinh c\right) \bmod \left(c - -2.9807307601812193 \cdot 10^{+165} \cdot -2.9807307601812193 \cdot 10^{+165}\right)\right)\]

Reproduce

herbie shell --seed 2019144 +o rules:numerics
(FPCore (c)
  :name "Random Jason Timeout Test 014"
  (fmod (sinh c) (- c (pow -2.9807307601812193e+165 2))))