crypto/bn/bn_kron.c:118: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_rshift`.
Showing all 9 steps of the trace


crypto/bn/bn_kron.c:82:9: Call
80.   
81.       BN_CTX_start(ctx);
82.       A = BN_CTX_get(ctx);
              ^
83.       B = BN_CTX_get(ctx);
84.       if (B == NULL)

crypto/bn/bn_ctx.c:284:5: Call
  282.       }
  283.       /* OK, make sure the returned bignum is "zero" */
  284.       BN_zero(ret);
             ^
  285.       ctx->used++;
  286.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:530:1: Parameter `*a->d`
    528.   }
    529.   
    530. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    531.   {
    532.       bn_check_top(a);

crypto/bn/bn_kron.c:118:12: Call
116.       while (!BN_is_bit_set(B, i))
117.           i++;
118.       err = !BN_rshift(B, B, i);
                  ^
119.       if (err)
120.           goto end;

crypto/bn/bn_shift.c:169:1: <Length trace>
167.   }
168.   
169. > int BN_rshift(BIGNUM *r, const BIGNUM *a, int n)
170.   {
171.       int i, j, nw, lb, rb;

crypto/bn/bn_shift.c:169:1: Parameter `*a->d`
  167.   }
  168.   
  169. > int BN_rshift(BIGNUM *r, const BIGNUM *a, int n)
  170.   {
  171.       int i, j, nw, lb, rb;

crypto/bn/bn_shift.c:200:5: Assignment
  198.       }
  199.   
  200.       f = &(a->d[nw]);
             ^
  201.       t = r->d;
  202.       j = a->top - nw;

crypto/bn/bn_shift.c:209:15: Assignment
  207.               *(t++) = *(f++);
  208.       } else {
  209.           l = *(f++);
                       ^
  210.           for (i = j - 1; i != 0; i--) {
  211.               tmp = (l >> rb) & BN_MASK2;

crypto/bn/bn_shift.c:212:17: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_rshift` 
  210.           for (i = j - 1; i != 0; i--) {
  211.               tmp = (l >> rb) & BN_MASK2;
  212.               l = *(f++);
                         ^
  213.               *(t++) = (tmp | (l << lb)) & BN_MASK2;
  214.           }
