crypto/pem/pvkfmt.c:312: error: BUFFER_OVERRUN_L3
  Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mod_exp`.
Showing all 24 steps of the trace


crypto/pem/pvkfmt.c:304:14: Call
302.               goto memerr;
303.       } else {
304.           if (!read_lebn(&p, 20, &dsa->priv_key))
                    ^
305.               goto memerr;
306.           /* Calculate public key */

crypto/pem/pvkfmt.c:96:10: Call
  94.   static int read_lebn(const unsigned char **in, unsigned int nbyte, BIGNUM **r)
  95.   {
  96.       *r = BN_lebin2bn(*in, nbyte, NULL);
                 ^
  97.       if (*r == NULL)
  98.           return 0;

crypto/bn/bn_lib.c:613:1: Parameter `*ret->d`
    611.   }
    612.   
    613. > BIGNUM *BN_lebin2bn(const unsigned char *s, int len, BIGNUM *ret)
    614.   {
    615.       unsigned int i, m;

crypto/pem/pvkfmt.c:312:14: Call
310.               goto memerr;
311.   
312.           if (!BN_mod_exp(dsa->pub_key, dsa->g, dsa->priv_key, dsa->p, ctx))
                    ^
313.               goto memerr;
314.           BN_CTX_free(ctx);

crypto/bn/bn_exp.c:190:1: Parameter `*a->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:250:19: Call
  248.           } else
  249.   # endif
  250.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                           ^
  251.       } else
  252.   #endif

crypto/bn/bn_exp.c:400:1: Parameter `*a->d`
    398.   }
    399.   
    400. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
    401.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
    402.   {

crypto/bn/bn_exp.c:466:10: Call
    464.           goto err;
    465.       }
    466.       if (!BN_to_montgomery(val[0], aa, mont, ctx))
                    ^
    467.           goto err;               /* 1 */
    468.   

crypto/bn/bn_lib.c:1000:1: Parameter `*a->d`
      998.   }
      999.   
      1000. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
      1001.                        BN_CTX *ctx)
      1002.   {

crypto/bn/bn_lib.c:1003:12: Call
      1001.                        BN_CTX *ctx)
      1002.   {
      1003.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                         ^
      1004.   }
      1005.   

crypto/bn/bn_mont.c:127:1: Parameter `*a->d`
        125.   #endif
        126.   
        127. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
        128.                             BN_MONT_CTX *mont, BN_CTX *ctx)
        129.   {

crypto/bn/bn_mont.c:157:14: Call
        155.               goto err;
        156.       } else {
        157.           if (!BN_mul(tmp, a, b, ctx))
                            ^
        158.               goto err;
        159.       }

crypto/bn/bn_mul.c:882:1: Parameter `*a->d`
          880.   #endif                          /* BN_RECURSION */
          881.   
          882. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
          883.   {
          884.       int ret = 0;

crypto/bn/bn_mul.c:963:17: Call
          961.                   if (bn_wexpand(rr, k * 4) == NULL)
          962.                       goto err;
          963.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                                 ^
          964.                                         j, al - j, bl - j, t->d);
          965.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:533:1: Parameter `n`
            531.    */
            532.   /* tnX may not be negative but less than n */
            533. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
            534.                              int tna, int tnb, BN_ULONG *t)
            535.   {

crypto/bn/bn_mul.c:546:10: Call
            544.   
            545.       /* r=(a[0]-a[1])*(b[1]-b[0]) */
            546.       c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
                            ^
            547.       c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);
            548.       neg = 0;

crypto/bn/bn_lib.c:858:1: Parameter `cl`
              856.    */
              857.   
              858. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
              859.   {
              860.       int n, i;

crypto/bn/bn_lib.c:875:12: Call
              873.           }
              874.       }
              875.       return bn_cmp_words(a, b, cl);
                                ^
              876.   }
              877.   

crypto/bn/bn_lib.c:831:1: <Offset trace>
829.   }
830.   
831. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
832.   {
833.       int i;

crypto/bn/bn_lib.c:831:1: Parameter `n`
                829.   }
                830.   
                831. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
                832.   {
                833.       int i;

crypto/bn/bn_lib.c:840:10: Assignment
                838.       if (aa != bb)
                839.           return ((aa > bb) ? 1 : -1);
                840.       for (i = n - 2; i >= 0; i--) {
                                ^
                841.           aa = a[i];
                842.           bb = b[i];

crypto/bn/bn_lib.c:831:1: <Length trace>
829.   }
830.   
831. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
832.   {
833.       int i;

crypto/bn/bn_lib.c:831:1: Parameter `*b`
                829.   }
                830.   
                831. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
                832.   {
                833.       int i;

crypto/bn/bn_lib.c:842:14: Array access: Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mod_exp` 
                840.       for (i = n - 2; i >= 0; i--) {
                841.           aa = a[i];
                842.           bb = b[i];
                                    ^
                843.           if (aa != bb)
                844.               return ((aa > bb) ? 1 : -1);
