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


crypto/bn/bn_gf2m.c:995:14: Call
993.   
994.       BN_CTX_start(ctx);
995.       if ((u = BN_CTX_get(ctx)) == NULL)
                    ^
996.           goto err;
997.   

crypto/bn/bn_ctx.c:275:5: Call
  273.       }
  274.       /* OK, make sure the returned bignum is "zero" */
  275.       BN_zero(ret);
             ^
  276.       ctx->used++;
  277.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:520:1: Parameter `*a->d`
    518.   }
    519.   
    520. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    521.   {
    522.       bn_check_top(a);

crypto/bn/bn_lib.c:523:9: Call
    521.   {
    522.       bn_check_top(a);
    523.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    524.           return (0);
    525.       a->neg = 0;

crypto/bn/bn_lcl.h:777:1: Parameter `*a->d`
      775.   int bn_probable_prime_dh_coprime(BIGNUM *rnd, int bits, BN_CTX *ctx);
      776.   
      777. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      778.   {
      779.       if (bits > (INT_MAX - BN_BITS2 + 1))

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

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

crypto/bn/bn_gf2m.c:499:16: Call
  497.   
  498.       if (a == b) {
  499.           return BN_GF2m_mod_sqr_arr(r, a, p, ctx);
                        ^
  500.       }
  501.   

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

crypto/bn/bn_gf2m.c:587:10: Call
    585.       s->top = 2 * a->top;
    586.       bn_correct_top(s);
    587.       if (!BN_GF2m_mod_arr(r, s, p))
                    ^
    588.           goto err;
    589.       bn_check_top(r);

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

crypto/bn/bn_gf2m.c:389:14: Call
      387.        */
      388.       if (a != r) {
      389.           if (!bn_wexpand(r, a->top))
                          ^
      390.               return 0;
      391.           for (j = 0; j < a->top; j++) {

crypto/bn/bn_lib.c:1071:1: Parameter `*a->d`
        1069.   }
        1070.   
        1071. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
        1072.   {
        1073.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:1073:37: Call
        1071.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
        1072.   {
        1073.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                    ^
        1074.   }
        1075.   

crypto/bn/bn_lib.c:380:1: Parameter `*b->d`
          378.    */
          379.   
          380. > BIGNUM *bn_expand2(BIGNUM *b, int words)
          381.   {
          382.       bn_check_top(b);

crypto/bn/bn_lib.c:385:23: Call
          383.   
          384.       if (words > b->dmax) {
          385.           BN_ULONG *a = bn_expand_internal(b, words);
                                       ^
          386.           if (!a)
          387.               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:325:5: Assignment
            323.   
            324.   #if 1
            325.       B = b->d;
                       ^
            326.       /* Check if the previous number needs to be copied */
            327.       if (B != NULL) {

crypto/bn/bn_lib.c:342:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_GF2m_mod_mul_arr` 
            340.               a1 = B[1];
            341.               a2 = B[2];
            342.               a3 = B[3];
                                    ^
            343.               A[0] = a0;
            344.               A[1] = a1;
