crypto/dh/dh_check.c:99: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_mod_exp`.
Showing all 16 steps of the trace


crypto/dh/dh_check.c:85:10: Call
83.           goto err;
84.       BN_CTX_start(ctx);
85.       t1 = BN_CTX_get(ctx);
               ^
86.       if (t1 == NULL)
87.           goto err;

crypto/bn/bn_ctx.c:283:5: Call
  281.       }
  282.       /* OK, make sure the returned bignum is "zero" */
  283.       BN_zero(ret);
             ^
  284.       ctx->used++;
  285.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:529:1: Parameter `*a->d`
    527.   }
    528.   
    529. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    530.   {
    531.       bn_check_top(a);

crypto/dh/dh_check.c:99:18: Call
97.           else {
98.               /* Check g^q == 1 mod p */
99.               if (!BN_mod_exp(t1, dh->g, dh->q, dh->p, ctx))
                        ^
100.                   goto err;
101.               if (!BN_is_one(t1))

crypto/bn/bn_exp.c:190:1: Parameter `*r->d`
  188.   }
  189.   
  190. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
  191.                  BN_CTX *ctx)
  192.   {

crypto/bn/bn_exp.c:247:19: Call
  245.               && (BN_get_flags(p, BN_FLG_CONSTTIME) == 0)) {
  246.               BN_ULONG A = a->d[0];
  247.               ret = BN_mod_exp_mont_word(r, A, p, m, ctx, NULL);
                           ^
  248.           } else
  249.   # endif

crypto/bn/bn_exp.c:1151:1: Parameter `*rr->d`
    1149.   }
    1150.   
    1151. > int BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p,
    1152.                            const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
    1153.   {

crypto/bn/bn_exp.c:1198:13: Call
    1196.           if (BN_is_one(m)) {
    1197.               ret = 1;
    1198.               BN_zero(rr);
                        ^
    1199.           } else {
    1200.               ret = BN_one(rr);

crypto/bn/bn_lib.c:529:1: Parameter `*a->d`
      527.   }
      528.   
      529. > int BN_set_word(BIGNUM *a, BN_ULONG w)
      530.   {
      531.       bn_check_top(a);

crypto/bn/bn_lib.c:532:9: Call
      530.   {
      531.       bn_check_top(a);
      532.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                     ^
      533.           return (0);
      534.       a->neg = 0;

crypto/bn/bn_lib.c:389:1: Parameter `*b->d`
        387.    */
        388.   
        389. > BIGNUM *bn_expand2(BIGNUM *b, int words)
        390.   {
        391.       bn_check_top(b);

crypto/bn/bn_lib.c:394:23: Call
        392.   
        393.       if (words > b->dmax) {
        394.           BN_ULONG *a = bn_expand_internal(b, words);
                                     ^
        395.           if (!a)
        396.               return NULL;

crypto/bn/bn_lib.c:299:1: <Length trace>
297.   /* This is used by bn_expand2() */
298.   /* The caller MUST check that words > b->dmax before calling this */
299. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
300.   {
301.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:299:1: Parameter `*b->d`
          297.   /* This is used by bn_expand2() */
          298.   /* The caller MUST check that words > b->dmax before calling this */
          299. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
          300.   {
          301.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:334:5: Assignment
          332.   
          333.   #if 1
          334.       B = b->d;
                     ^
          335.       /* Check if the previous number needs to be copied */
          336.       if (B != NULL) {

crypto/bn/bn_lib.c:351:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_mod_exp` 
          349.               a1 = B[1];
          350.               a2 = B[2];
          351.               a3 = B[3];
                                  ^
          352.               A[0] = a0;
          353.               A[1] = a1;
