crypto/rsa/rsa_crpt.c:146: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_sub`.
Showing all 16 steps of the trace


crypto/rsa/rsa_crpt.c:140:10: Call
138.   
139.       BN_CTX_start(ctx);
140.       r0 = BN_CTX_get(ctx);
                ^
141.       r1 = BN_CTX_get(ctx);
142.       r2 = BN_CTX_get(ctx);

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:520:1: Parameter `*a->d`
    518.   }
    519.   
    520. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    521.   {
    522.       bn_check_top(a);

crypto/rsa/rsa_crpt.c:146:10: Call
144.           goto err;
145.   
146.       if (!BN_sub(r1, p, BN_value_one()))
                ^
147.           goto err;
148.       if (!BN_sub(r2, q, BN_value_one()))

crypto/bn/bn_add.c:233:1: Parameter `*r->d`
  231.   }
  232.   
  233. > int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
  234.   {
  235.       int max;

crypto/bn/bn_add.c:265:14: Call
  263.   
  264.       if (add) {
  265.           if (!BN_uadd(r, a, b))
                      ^
  266.               return (0);
  267.           r->neg = neg;

crypto/bn/bn_add.c:105:1: Parameter `*r->d`
    103.   
    104.   /* unsigned add of b to a */
    105. > int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
    106.   {
    107.       int max, min, dif;

crypto/bn/bn_add.c:124:9: Call
    122.       dif = max - min;
    123.   
    124.       if (bn_wexpand(r, max + 1) == NULL)
                   ^
    125.           return 0;
    126.   

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_sub` 
          340.               a1 = B[1];
          341.               a2 = B[2];
          342.               a3 = B[3];
                                  ^
          343.               A[0] = a0;
          344.               A[1] = a1;
