test/bntest.c:1508: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_GF2m_mod_exp`.
Showing all 12 steps of the trace


test/bntest.c:1508:13: Call
1506.           BN_bntest_rand(d, 512, 0, 0);
1507.           for (j = 0; j < 2; j++) {
1508.               BN_GF2m_mod_exp(e, a, c, b[j], ctx);
                    ^
1509.               BN_GF2m_mod_exp(f, a, d, b[j], ctx);
1510.               BN_GF2m_mod_mul(e, e, f, b[j], ctx);

crypto/bn/bn_gf2m.c:1026:1: Parameter `r->top`
  1024.    * for best performance, use the BN_GF2m_mod_exp_arr function.
  1025.    */
  1026. > int BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  1027.                       const BIGNUM *p, BN_CTX *ctx)
  1028.   {

test/bntest.c:1508:13: Call
1506.           BN_bntest_rand(d, 512, 0, 0);
1507.           for (j = 0; j < 2; j++) {
1508.               BN_GF2m_mod_exp(e, a, c, b[j], ctx);
                    ^
1509.               BN_GF2m_mod_exp(f, a, d, b[j], ctx);
1510.               BN_GF2m_mod_mul(e, e, f, b[j], ctx);

crypto/bn/bn_gf2m.c:1026:1: Parameter `*a->d`
  1024.    * for best performance, use the BN_GF2m_mod_exp_arr function.
  1025.    */
  1026. > int BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  1027.                       const BIGNUM *p, BN_CTX *ctx)
  1028.   {

crypto/bn/bn_gf2m.c:1042:11: Call
  1040.           goto err;
  1041.       }
  1042.       ret = BN_GF2m_mod_exp_arr(r, a, b, arr, ctx);
                    ^
  1043.       bn_check_top(r);
  1044.    err:

crypto/bn/bn_gf2m.c:980:1: Parameter `*a->d`
    978.    * P1363.
    979.    */
    980. > int BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
    981.                           const int p[], BN_CTX *ctx)
    982.   {

crypto/bn/bn_gf2m.c:1007:18: Call
    1005.               goto err;
    1006.           if (BN_is_bit_set(b, i)) {
    1007.               if (!BN_GF2m_mod_mul_arr(u, u, a, p, ctx))
                             ^
    1008.                   goto err;
    1009.           }

crypto/bn/bn_gf2m.c:489:1: <Offset trace>
487.    * the result in r.  r could be a or b; a could be b.
488.    */
489. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
490.                           const int p[], BN_CTX *ctx)
491.   {

crypto/bn/bn_gf2m.c:489:1: Parameter `b->top`
      487.    * the result in r.  r could be a or b; a could be b.
      488.    */
      489. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
      490.                           const int p[], BN_CTX *ctx)
      491.   {

crypto/bn/bn_gf2m.c:489:1: <Length trace>
487.    * the result in r.  r could be a or b; a could be b.
488.    */
489. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
490.                           const int p[], BN_CTX *ctx)
491.   {

crypto/bn/bn_gf2m.c:489:1: Parameter `*b->d`
      487.    * the result in r.  r could be a or b; a could be b.
      488.    */
      489. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
      490.                           const int p[], BN_CTX *ctx)
      491.   {

crypto/bn/bn_gf2m.c:517:40: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_GF2m_mod_exp` 
      515.       for (j = 0; j < b->top; j += 2) {
      516.           y0 = b->d[j];
      517.           y1 = ((j + 1) == b->top) ? 0 : b->d[j + 1];
                                                    ^
      518.           for (i = 0; i < a->top; i += 2) {
      519.               x0 = a->d[i];
