crypto/rsa/rsa_ossl.c:869: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_div`.
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: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:274:9: Call
  272.   
  273.       max = (a->top > b->top) ? a->top : b->top;
  274.       if (bn_wexpand(r, max) == NULL)
                 ^
  275.           return (0);
  276.       if (BN_ucmp(a, b) < 0) {

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

crypto/rsa/rsa_ossl.c:869:14: Call
867.               pr1 = r1;
868.           }
869.           if (!BN_mod(r0, pr1, rsa->p, ctx)) {
                    ^
870.               BN_free(local_r1);
871.               goto err;

crypto/bn/bn_div.c:188:1: Parameter `*rm->d`
  186.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
  187.    */
  188. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
  189.              BN_CTX *ctx)
  190.   {

crypto/bn/bn_div.c:233:17: Call
  231.       if (!no_branch && BN_ucmp(num, divisor) < 0) {
  232.           if (rm != NULL) {
  233.               if (BN_copy(rm, num) == NULL)
                         ^
  234.                   return (0);
  235.           }

crypto/bn/bn_lib.c:428:1: Parameter `*a->d`
    426.   }
    427.   
    428. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
    429.   {
    430.       int i;

crypto/bn/bn_lib.c:438:9: Call
    436.       if (a == b)
    437.           return (a);
    438.       if (bn_wexpand(a, b->top) == NULL)
                   ^
    439.           return (NULL);
    440.   

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

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

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

crypto/bn/bn_lib.c:394:23: Call
        392.   
        393.       if (words > b->dmax) {
        394.           BN_ULONG *a = bn_expand_internal(b, words);
                                     ^
        395.           if (!a)
        396.               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:334:5: Assignment
          332.   
          333.   #if 1
          334.       B = b->d;
                     ^
          335.       /* Check if the previous number needs to be copied */
          336.       if (B != NULL) {

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