crypto/rsa/rsa_chk.c:98: error: BUFFER_OVERRUN_L3
  Offset: [-1, +oo] Size: [1, +oo] by call to `BN_mod_mul`.
Showing all 25 steps of the trace


crypto/rsa/rsa_chk.c:54:9: Call
52.   
53.       /* p prime? */
54.       if (BN_is_prime_ex(key->p, BN_prime_checks, NULL, cb) != 1) {
              ^
55.           ret = 0;
56.           RSAerr(RSA_F_RSA_CHECK_KEY_EX, RSA_R_P_NOT_PRIME);

crypto/bn/bn_prime.c:194:1: Parameter `ctx_passed->stack.depth`
  192.   }
  193.   
  194. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
  195.                      BN_GENCB *cb)
  196.   {

crypto/bn/bn_prime.c:197:12: Call
  195.                      BN_GENCB *cb)
  196.   {
  197.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  198.   }
  199.   

crypto/bn/bn_prime.c:200:1: Parameter `ctx_passed->stack.depth`
    198.   }
    199.   
    200. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    201.                               int do_trial_division, BN_GENCB *cb)
    202.   {

crypto/rsa/rsa_chk.c:60:9: Call
58.   
59.       /* q prime? */
60.       if (BN_is_prime_ex(key->q, BN_prime_checks, NULL, cb) != 1) {
              ^
61.           ret = 0;
62.           RSAerr(RSA_F_RSA_CHECK_KEY_EX, RSA_R_Q_NOT_PRIME);

crypto/bn/bn_prime.c:194:1: Parameter `ctx_passed->stack.depth`
  192.   }
  193.   
  194. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
  195.                      BN_GENCB *cb)
  196.   {

crypto/bn/bn_prime.c:197:12: Call
  195.                      BN_GENCB *cb)
  196.   {
  197.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  198.   }
  199.   

crypto/bn/bn_prime.c:200:1: Parameter `ctx_passed->stack.depth`
    198.   }
    199.   
    200. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    201.                               int do_trial_division, BN_GENCB *cb)
    202.   {

crypto/rsa/rsa_chk.c:66:10: Call
64.   
65.       /* n = p*q? */
66.       if (!BN_mul(i, key->p, key->q, ctx)) {
               ^
67.           ret = -1;
68.           goto err;

crypto/bn/bn_mul.c:829:1: Parameter `ctx->stack.depth`
  827.   #endif                          /* BN_RECURSION */
  828.   
  829. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  830.   {
  831.       int ret = 0;

crypto/rsa/rsa_chk.c:98:10: Call
96.           goto err;
97.       }
98.       if (!BN_mod_mul(i, key->d, key->e, k, ctx)) {
                ^
99.           ret = -1;
100.           goto err;

crypto/bn/bn_mod.c:73:1: Parameter `ctx->stack.depth`
  71.   
  72.   /* slow but works */
  73. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  74.                  BN_CTX *ctx)
  75.   {

crypto/bn/bn_mod.c:83:5: Call
  81.       bn_check_top(m);
  82.   
  83.       BN_CTX_start(ctx);
            ^
  84.       if ((t = BN_CTX_get(ctx)) == NULL)
  85.           goto err;

crypto/bn/bn_ctx.c:181:1: Parameter `ctx->stack.depth`
    179.   }
    180.   
    181. > void BN_CTX_start(BN_CTX *ctx)
    182.   {
    183.       CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_mod.c:90:14: Call
  88.               goto err;
  89.       } else {
  90.           if (!BN_mul(t, a, b, ctx))
                     ^
  91.               goto err;
  92.       }

crypto/bn/bn_mul.c:855:5: Call
    853.       top = al + bl;
    854.   
    855.       BN_CTX_start(ctx);
               ^
    856.       if ((r == a) || (r == b)) {
    857.           if ((rr = BN_CTX_get(ctx)) == NULL)

crypto/bn/bn_ctx.c:181:1: Parameter `*ctx->stack.indexes`
      179.   }
      180.   
      181. > void BN_CTX_start(BN_CTX *ctx)
      182.   {
      183.       CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_mul.c:979:5: Call
    977.    err:
    978.       bn_check_top(r);
    979.       BN_CTX_end(ctx);
               ^
    980.       return (ret);
    981.   }

crypto/bn/bn_ctx.c:195:1: Parameter `*ctx->stack.indexes`
      193.   }
      194.   
      195. > void BN_CTX_end(BN_CTX *ctx)
      196.   {
      197.       CTXDBG_ENTRY("BN_CTX_end", ctx);

crypto/bn/bn_ctx.c:201:27: Call
      199.           ctx->err_stack--;
      200.       else {
      201.           unsigned int fp = BN_STACK_pop(&ctx->stack);
                                       ^
      202.           /* Does this stack frame have anything to release? */
      203.           if (fp < ctx->used)

crypto/bn/bn_ctx.c:271:1: <Offset trace>
269.   }
270.   
271. > static unsigned int BN_STACK_pop(BN_STACK *st)
272.   {
273.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:271:1: Parameter `st->depth`
        269.   }
        270.   
        271. > static unsigned int BN_STACK_pop(BN_STACK *st)
        272.   {
        273.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:271:1: <Length trace>
269.   }
270.   
271. > static unsigned int BN_STACK_pop(BN_STACK *st)
272.   {
273.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:271:1: Parameter `*st->indexes`
        269.   }
        270.   
        271. > static unsigned int BN_STACK_pop(BN_STACK *st)
        272.   {
        273.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:273:12: Array access: Offset: [-1, +oo] Size: [1, +oo] by call to `BN_mod_mul` 
        271.   static unsigned int BN_STACK_pop(BN_STACK *st)
        272.   {
        273.       return st->indexes[--(st->depth)];
                          ^
        274.   }
        275.   
