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


crypto/rsa/rsa_ossl.c:845:10: Call
843.       }
844.   
845.       if (!BN_sub(r0, r0, m1))
                ^
846.           goto err;
847.       /*

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

crypto/bn/bn_add.c:275:9: Call
  273.   
  274.       max = (a->top > b->top) ? a->top : b->top;
  275.       if (bn_wexpand(r, max) == NULL)
                 ^
  276.           return (0);
  277.       if (BN_ucmp(a, b) < 0) {

crypto/bn/bn_lib.c:995:1: Parameter `*a->d`
    993.   }
    994.   
    995. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
    996.   {
    997.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/rsa/rsa_ossl.c:852:14: Call
850.        */
851.       if (BN_is_negative(r0))
852.           if (!BN_add(r0, r0, rsa->p))
                    ^
853.               goto err;
854.   

crypto/bn/bn_add.c:63:1: Parameter `*r->d`
  61.   
  62.   /* r can == a or b */
  63. > int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
  64.   {
  65.       const BIGNUM *tmp;

crypto/bn/bn_add.c:88:18: Call
  86.   
  87.           if (BN_ucmp(a, b) < 0) {
  88.               if (!BN_usub(r, b, a))
                         ^
  89.                   return (0);
  90.               r->neg = 1;

crypto/bn/bn_add.c:166:1: Parameter `*r->d`
    164.   
    165.   /* unsigned subtraction of b from a, a must be larger than b. */
    166. > int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
    167.   {
    168.       int max, min, dif;

crypto/bn/bn_add.c:185:9: Call
    183.       }
    184.   
    185.       if (bn_wexpand(r, max) == NULL)
                   ^
    186.           return (0);
    187.   

crypto/bn/bn_lib.c:995:1: Parameter `*a->d`
      993.   }
      994.   
      995. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      996.   {
      997.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:997:37: Call
      995.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
      996.   {
      997.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                  ^
      998.   }
      999.   

crypto/bn/bn_lib.c:390:1: Parameter `*b->d`
        388.    */
        389.   
        390. > BIGNUM *bn_expand2(BIGNUM *b, int words)
        391.   {
        392.       bn_check_top(b);

crypto/bn/bn_lib.c:395:23: Call
        393.   
        394.       if (words > b->dmax) {
        395.           BN_ULONG *a = bn_expand_internal(b, words);
                                     ^
        396.           if (!a)
        397.               return NULL;

crypto/bn/bn_lib.c:300:1: <Length trace>
298.   /* This is used by bn_expand2() */
299.   /* The caller MUST check that words > b->dmax before calling this */
300. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
301.   {
302.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:300:1: Parameter `*b->d`
          298.   /* This is used by bn_expand2() */
          299.   /* The caller MUST check that words > b->dmax before calling this */
          300. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
          301.   {
          302.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:335:5: Assignment
          333.   
          334.   #if 1
          335.       B = b->d;
                     ^
          336.       /* Check if the previous number needs to be copied */
          337.       if (B != NULL) {

crypto/bn/bn_lib.c:352:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_add` 
          350.               a1 = B[1];
          351.               a2 = B[2];
          352.               a3 = B[3];
                                  ^
          353.               A[0] = a0;
          354.               A[1] = a1;
