crypto/bn/bn_gf2m.c:1042: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_GF2m_mod_sqr_arr`.
Showing all 16 steps of the trace


crypto/bn/bn_gf2m.c:1039:18: Call
1037.                   goto err;
1038.               BN_zero(z);
1039.               if (!BN_copy(w, rho))
                         ^
1040.                   goto err;
1041.               for (j = 1; j <= p[0] - 1; j++) {

crypto/bn/bn_lib.c:280:1: Parameter `a->top`
  278.   }
  279.   
  280. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
  281.   {
  282.       bn_check_top(b);

crypto/bn/bn_gf2m.c:1042:22: Call
1040.                   goto err;
1041.               for (j = 1; j <= p[0] - 1; j++) {
1042.                   if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx))
                             ^
1043.                       goto err;
1044.                   if (!BN_GF2m_mod_sqr_arr(w2, w, p, ctx))

crypto/bn/bn_gf2m.c:489:1: Parameter `*r->d`
  487.   
  488.   /* Square a, reduce the result mod p, and store it in a.  r could be a. */
  489. > int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[],
  490.                           BN_CTX *ctx)
  491.   {

crypto/bn/bn_gf2m.c:509:10: Call
  507.       s->top = 2 * a->top;
  508.       bn_correct_top(s);
  509.       if (!BN_GF2m_mod_arr(r, s, p))
                  ^
  510.           goto err;
  511.       bn_check_top(r);

crypto/bn/bn_gf2m.c:292:1: Parameter `*r->d`
    290.   
    291.   /* Performs modular reduction of a and store result in r.  r could be a. */
    292. > int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[])
    293.   {
    294.       int j, k;

crypto/bn/bn_gf2m.c:311:14: Call
    309.        */
    310.       if (a != r) {
    311.           if (!bn_wexpand(r, a->top))
                        ^
    312.               return 0;
    313.           for (j = 0; j < a->top; j++) {

crypto/bn/bn_lib.c:942:1: Parameter `*a->d`
      940.   }
      941.   
      942. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      943.   {
      944.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:944:37: Call
      942.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
      943.   {
      944.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                 ^
      945.   }
      946.   

crypto/bn/bn_lib.c:244:1: Parameter `*b->d`
        242.    */
        243.   
        244. > BIGNUM *bn_expand2(BIGNUM *b, int words)
        245.   {
        246.       if (words > b->dmax) {

crypto/bn/bn_lib.c:247:23: Call
        245.   {
        246.       if (words > b->dmax) {
        247.           BN_ULONG *a = bn_expand_internal(b, words);
                                     ^
        248.           if (!a)
        249.               return NULL;

crypto/bn/bn_lib.c:208:1: <Offset trace>
206.   /* This is used by bn_expand2() */
207.   /* The caller MUST check that words > b->dmax before calling this */
208. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
209.   {
210.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:208:1: Parameter `b->top`
          206.   /* This is used by bn_expand2() */
          207.   /* The caller MUST check that words > b->dmax before calling this */
          208. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
          209.   {
          210.       BN_ULONG *a = NULL;

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

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

crypto/bn/bn_lib.c:231:9: Array access: Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_GF2m_mod_sqr_arr` 
          229.       assert(b->top <= words);
          230.       if (b->top > 0)
          231.           memcpy(a, b->d, sizeof(*a) * b->top);
                         ^
          232.   
          233.       return a;
