crypto/bn/bn_gf2m.c:814: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_GF2m_arr2poly`.
Showing all 18 steps of the trace


crypto/bn/bn_gf2m.c:812:18: Call
810.       bn_check_top(xx);
811.       BN_CTX_start(ctx);
812.       if ((field = BN_CTX_get(ctx)) == NULL)
                        ^
813.           goto err;
814.       if (!BN_GF2m_arr2poly(p, field))

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/bn/bn_gf2m.c:814:10: Call
812.       if ((field = BN_CTX_get(ctx)) == NULL)
813.           goto err;
814.       if (!BN_GF2m_arr2poly(p, field))
                ^
815.           goto err;
816.   

crypto/bn/bn_gf2m.c:1279:1: Parameter `*a->d`
  1277.    * bit-string.  The array must be terminated by -1.
  1278.    */
  1279. > int BN_GF2m_arr2poly(const int p[], BIGNUM *a)
  1280.   {
  1281.       int i;

crypto/bn/bn_gf2m.c:1284:5: Call
  1282.   
  1283.       bn_check_top(a);
  1284.       BN_zero(a);
              ^
  1285.       for (i = 0; p[i] != -1; i++) {
  1286.           if (BN_set_bit(a, p[i]) == 0)

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_gf2m.c:1286:13: Call
  1284.       BN_zero(a);
  1285.       for (i = 0; p[i] != -1; i++) {
  1286.           if (BN_set_bit(a, p[i]) == 0)
                      ^
  1287.               return 0;
  1288.       }

crypto/bn/bn_lib.c:670:1: Parameter `*a->d`
    668.   }
    669.   
    670. > int BN_set_bit(BIGNUM *a, int n)
    671.   {
    672.       int i, j, k;

crypto/bn/bn_lib.c:680:13: Call
    678.       j = n % BN_BITS2;
    679.       if (a->top <= i) {
    680.           if (bn_wexpand(a, i + 1) == NULL)
                       ^
    681.               return (0);
    682.           for (k = a->top; k < i + 1; k++)

crypto/bn/bn_lib.c:994:1: Parameter `*a->d`
      992.   }
      993.   
      994. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      995.   {
      996.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:996:37: Call
      994.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
      995.   {
      996.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                 ^
      997.   }
      998.   

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_GF2m_arr2poly` 
          349.               a1 = B[1];
          350.               a2 = B[2];
          351.               a3 = B[3];
                                  ^
          352.               A[0] = a0;
          353.               A[1] = a1;
