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


crypto/bn/bn_gf2m.c:875:14: Call
873.       n = BN_num_bits(b) - 1;
874.       for (i = n - 1; i >= 0; i--) {
875.           if (!BN_GF2m_mod_sqr_arr(u, u, p, ctx))
                    ^
876.               goto err;
877.           if (BN_is_bit_set(b, i)) {

crypto/bn/bn_gf2m.c:489:1: Parameter `r->top`
  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:878:18: Call
876.               goto err;
877.           if (BN_is_bit_set(b, i)) {
878.               if (!BN_GF2m_mod_mul_arr(u, u, a, p, ctx))
                        ^
879.                   goto err;
880.           }

crypto/bn/bn_gf2m.c:410:1: Parameter `*r->d`
  408.    * the result in r.  r could be a or b; a could be b.
  409.    */
  410. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  411.                           const int p[], BN_CTX *ctx)
  412.   {

crypto/bn/bn_gf2m.c:421:16: Call
  419.   
  420.       if (a == b) {
  421.           return BN_GF2m_mod_sqr_arr(r, a, p, ctx);
                        ^
  422.       }
  423.   

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:949:1: Parameter `*a->d`
        947.   }
        948.   
        949. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
        950.   {
        951.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:951:37: Call
        949.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
        950.   {
        951.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                   ^
        952.   }
        953.   

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

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

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

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

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

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

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