crypto/sm2/sm2_sign.c:202: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_add`.
Showing all 26 steps of the trace


crypto/sm2/sm2_sign.c:192:9: Call
190.       ECDSA_SIG_get0(sig, &r, &s);
191.   
192.       if (BN_cmp(r, BN_value_one()) < 0)
               ^
193.           goto done;
194.       if (BN_cmp(s, BN_value_one()) < 0)

crypto/bn/bn_lib.c:539:1: Parameter `a->top`
  537.   }
  538.   
  539. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
  540.   {
  541.       int i;

crypto/sm2/sm2_sign.c:194:9: Call
192.       if (BN_cmp(r, BN_value_one()) < 0)
193.           goto done;
194.       if (BN_cmp(s, BN_value_one()) < 0)
               ^
195.           goto done;
196.   

crypto/bn/bn_lib.c:539:1: Parameter `a->top`
  537.   }
  538.   
  539. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
  540.   {
  541.       int i;

crypto/sm2/sm2_sign.c:197:9: Call
195.           goto done;
196.   
197.       if (BN_cmp(order, r) <= 0)
               ^
198.           goto done;
199.       if (BN_cmp(order, s) <= 0)

crypto/bn/bn_lib.c:539:1: Parameter `a->top`
  537.   }
  538.   
  539. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
  540.   {
  541.       int i;

crypto/sm2/sm2_sign.c:199:9: Call
197.       if (BN_cmp(order, r) <= 0)
198.           goto done;
199.       if (BN_cmp(order, s) <= 0)
               ^
200.           goto done;
201.   

crypto/bn/bn_lib.c:539:1: Parameter `a->top`
  537.   }
  538.   
  539. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
  540.   {
  541.       int i;

crypto/sm2/sm2_sign.c:202:9: Call
200.           goto done;
201.   
202.       if (BN_mod_add(t, r, s, order, ctx) == 0)
               ^
203.           goto done;
204.   

crypto/bn/bn_mod.c:28:1: Parameter `m->top`
  26.   }
  27.   
  28. > int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  29.                  BN_CTX *ctx)
  30.   {

crypto/bn/bn_mod.c:33:12: Call
  31.       if (!BN_add(r, a, b))
  32.           return 0;
  33.       return BN_nnmod(r, r, m, ctx);
                   ^
  34.   }
  35.   

crypto/bn/bn_mod.c:13:1: Parameter `d->top`
    11.   #include "bn_lcl.h"
    12.   
    13. > int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
    14.   {
    15.       /*

crypto/bn/bn_mod.c:20:11: Call
    18.        */
    19.   
    20.       if (!(BN_mod(r, m, d, ctx)))
                    ^
    21.           return 0;
    22.       if (!r->neg)

crypto/bn/bn_div.c:199:31: Call
      197.   
      198.       /* First we normalise the numbers */
      199.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                                           ^
      200.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
      201.           goto err;

crypto/bn/bn_lib.c:140:9: Assignment
        138.   
        139.       if (BN_is_zero(a))
        140.           return 0;
                       ^
        141.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
        142.   }

crypto/bn/bn_div.c:199:5: Assignment
      197.   
      198.       /* First we normalise the numbers */
      199.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                 ^
      200.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
      201.           goto err;

crypto/bn/bn_div.c:200:11: Call
      198.       /* First we normalise the numbers */
      199.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
      200.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
                       ^
      201.           goto err;
      202.       sdiv->neg = 0;

crypto/bn/bn_shift.c:83:1: <Offset trace>
81.   }
82.   
83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
84.   {
85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:83:1: Parameter `n`
        81.   }
        82.   
        83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
        84.   {
        85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:97:5: Assignment
        95.       }
        96.   
        97.       nw = n / BN_BITS2;
                   ^
        98.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
        99.           return 0;

crypto/bn/bn_shift.c:83:1: <Length trace>
81.   }
82.   
83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
84.   {
85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:83:1: Parameter `*r->d`
        81.   }
        82.   
        83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
        84.   {
        85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:98:9: Call
        96.   
        97.       nw = n / BN_BITS2;
        98.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                       ^
        99.           return 0;
        100.       r->neg = a->neg;

crypto/bn/bn_lib.c:910:1: Parameter `*a->d`
          908.   }
          909.   
          910. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          911.   {
          912.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:104:5: Assignment
        102.       rb = BN_BITS2 - lb;
        103.       f = a->d;
        104.       t = r->d;
                   ^
        105.       t[a->top + nw] = 0;
        106.       if (lb == 0)

crypto/bn/bn_shift.c:112:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_add` 
        110.           for (i = a->top - 1; i >= 0; i--) {
        111.               l = f[i];
        112.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                           ^
        113.               t[nw + i] = (l << lb) & BN_MASK2;
        114.           }
