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


crypto/rsa/rsa_gen.c:87:1: Parameter `rsa->p->d`
85.   }
86.   
87. > static int rsa_builtin_keygen(RSA *rsa, int bits, BIGNUM *e_value,
88.                                 BN_GENCB *cb)
89.   {

crypto/rsa/rsa_gen.c:130:14: Call
128.       /* generate p and q */
129.       for (;;) {
130.           if (!BN_generate_prime_ex(rsa->p, bitsp, 0, NULL, NULL, cb))
                    ^
131.               goto err;
132.           if (!BN_sub(r2, rsa->p, BN_value_one()))

crypto/bn/bn_prime.c:207:1: Parameter `*ret->d`
  205.   }
  206.   
  207. > int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe,
  208.                            const BIGNUM *add, const BIGNUM *rem, BN_GENCB *cb)
  209.   {

crypto/bn/bn_prime.c:244:18: Call
  242.       } else {
  243.           if (safe) {
  244.               if (!probable_prime_dh_safe(ret, bits, add, rem, ctx))
                          ^
  245.                   goto err;
  246.           } else {

crypto/bn/bn_prime.c:628:1: Parameter `*p->d`
    626.   }
    627.   
    628. > static int probable_prime_dh_safe(BIGNUM *p, int bits, const BIGNUM *padd,
    629.                                     const BIGNUM *rem, BN_CTX *ctx)
    630.   {

crypto/bn/bn_prime.c:664:10: Call
    662.   
    663.       /* we now have a random number 'rand' to test. */
    664.       if (!BN_lshift1(p, q))
                    ^
    665.           goto err;
    666.       if (!BN_add_word(p, 1))

crypto/bn/bn_shift.c:61:1: Parameter `*r->d`
      59.   #include "bn_lcl.h"
      60.   
      61. > int BN_lshift1(BIGNUM *r, const BIGNUM *a)
      62.   {
      63.       register BN_ULONG *ap, *rp, t, c;

crypto/bn/bn_shift.c:75:13: Call
      73.           r->top = a->top;
      74.       } else {
      75.           if (bn_wexpand(r, a->top + 1) == NULL)
                        ^
      76.               return (0);
      77.       }

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_generate_prime_ex` 
            349.               a1 = B[1];
            350.               a2 = B[2];
            351.               a3 = B[3];
                                    ^
            352.               A[0] = a0;
            353.               A[1] = a1;
