crypto/rsa/rsa_ossl.c:800: error: BUFFER_OVERRUN_L3
  Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mul`.
Showing all 17 steps of the trace


crypto/rsa/rsa_ossl.c:790:10: Call
788.       }
789.   
790.       if (!BN_sub(r0, r0, m1))
                ^
791.           goto err;
792.       /*

crypto/bn/bn_add.c:45:1: Parameter `*r->d`
  43.   
  44.   /* signed sub of b from a. */
  45. > int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
  46.   {
  47.       int ret, r_neg, cmp_res;

crypto/bn/bn_add.c:59:19: Call
  57.           if (cmp_res > 0) {
  58.               r_neg = a->neg;
  59.               ret = BN_usub(r, a, b);
                          ^
  60.           } else if (cmp_res < 0) {
  61.               r_neg = !b->neg;

crypto/bn/bn_add.c:125:1: Parameter `*r->d`
    123.   
    124.   /* unsigned subtraction of b from a, a must be larger than b. */
    125. > int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
    126.   {
    127.       int max, min, dif;

crypto/rsa/rsa_ossl.c:800:10: Call
798.               goto err;
799.   
800.       if (!BN_mul(r1, r0, rsa->iqmp, ctx))
                ^
801.           goto err;
802.   

crypto/bn/bn_mul.c:497:1: Parameter `*a->d`
  495.   #endif                          /* BN_RECURSION */
  496.   
  497. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  498.   {
  499.       int ret = 0;

crypto/bn/bn_mul.c:577:17: Call
  575.                   if (bn_wexpand(rr, k * 4) == NULL)
  576.                       goto err;
  577.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                         ^
  578.                                         j, al - j, bl - j, t->d);
  579.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:322:1: Parameter `n`
    320.    */
    321.   /* tnX may not be negative but less than n */
    322. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
    323.                              int tna, int tnb, BN_ULONG *t)
    324.   {

crypto/bn/bn_mul.c:335:10: Call
    333.   
    334.       /* r=(a[0]-a[1])*(b[1]-b[0]) */
    335.       c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
                    ^
    336.       c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);
    337.       neg = 0;

crypto/bn/bn_lib.c:697:1: Parameter `cl`
      695.    */
      696.   
      697. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
      698.   {
      699.       int n, i;

crypto/bn/bn_lib.c:714:12: Call
      712.           }
      713.       }
      714.       return bn_cmp_words(a, b, cl);
                        ^
      715.   }
      716.   

crypto/bn/bn_lib.c:670:1: <Offset trace>
668.   }
669.   
670. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
671.   {
672.       int i;

crypto/bn/bn_lib.c:670:1: Parameter `n`
        668.   }
        669.   
        670. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
        671.   {
        672.       int i;

crypto/bn/bn_lib.c:679:10: Assignment
        677.       if (aa != bb)
        678.           return ((aa > bb) ? 1 : -1);
        679.       for (i = n - 2; i >= 0; i--) {
                        ^
        680.           aa = a[i];
        681.           bb = b[i];

crypto/bn/bn_lib.c:670:1: <Length trace>
668.   }
669.   
670. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
671.   {
672.       int i;

crypto/bn/bn_lib.c:670:1: Parameter `*b`
        668.   }
        669.   
        670. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
        671.   {
        672.       int i;

crypto/bn/bn_lib.c:681:14: Array access: Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mul` 
        679.       for (i = n - 2; i >= 0; i--) {
        680.           aa = a[i];
        681.           bb = b[i];
                            ^
        682.           if (aa != bb)
        683.               return ((aa > bb) ? 1 : -1);
