crypto/dsa/dsa_gen.c:283: error: BUFFER_OVERRUN_L3
  Offset: [12, +oo] (⇐ [8, +oo] + 4) Size: [0, +oo] by call to `BN_mod_mul_montgomery`.
Showing all 16 steps of the trace


crypto/dsa/dsa_gen.c:282:2: Call
280.   	if (!BN_rshift(m,w_1,a)) goto err;
281.   
282.   	BN_MONT_CTX_set(mont,w,ctx);
        ^
283.   	BN_to_montgomery(mont_1,BN_value_one(),mont,ctx);
284.   	BN_to_montgomery(w_1,w_1,mont,ctx);

crypto/bn/bn_mont.c:301:1: Parameter `*mont->RR.d`
  299.   	}
  300.   
  301. > int BN_MONT_CTX_set(BN_MONT_CTX *mont, BIGNUM *mod, BN_CTX *ctx)
  302.   	{
  303.   	BIGNUM Ri,*R;

crypto/bn/bn_mont.c:319:3: Call
  317.   
  318.   		mont->ri=(BN_num_bits(mod)+(BN_BITS2-1))/BN_BITS2*BN_BITS2;
  319.   		BN_zero(R);
           ^
  320.   		BN_set_bit(R,BN_BITS2);
  321.   		/* I was bad, this modification of a passed variable was

crypto/bn/bn_lib.c:548:1: Parameter `*a->d`
    546.   	}
    547.   
    548. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    549.   	{
    550.   	int i,n;

crypto/bn/bn_mont.c:320:3: Call
  318.   		mont->ri=(BN_num_bits(mod)+(BN_BITS2-1))/BN_BITS2*BN_BITS2;
  319.   		BN_zero(R);
  320.   		BN_set_bit(R,BN_BITS2);
           ^
  321.   		/* I was bad, this modification of a passed variable was
  322.   		 * breaking the multithreaded stuff :-(

crypto/bn/bn_lib.c:688:1: Parameter `*a->d`
    686.   	}
    687.   
    688. > int BN_set_bit(BIGNUM *a, int n)
    689.   	{
    690.   	int i,j,k;

crypto/dsa/dsa_gen.c:283:2: Call
281.   
282.   	BN_MONT_CTX_set(mont,w,ctx);
283.   	BN_to_montgomery(mont_1,BN_value_one(),mont,ctx);
        ^
284.   	BN_to_montgomery(w_1,w_1,mont,ctx);
285.   	for (i=1; i < n; i++)

crypto/bn/bn_mont.c:71:1: Parameter `*b->d`
  69.   #define MONT_WORD
  70.   
  71. > int BN_mod_mul_montgomery(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_MONT_CTX *mont,
  72.   	     BN_CTX *ctx)
  73.   	{

crypto/bn/bn_mont.c:98:8: Call
  96.   	else
  97.   		{
  98.   		if (!BN_mul(tmp,a,b,ctx)) goto err;
                ^
  99.   		}
  100.   	/* reduce from aRR to aR */

crypto/bn/bn_mul.c:560:1: Parameter `*b->d`
    558.   #endif
    559.   
    560. > int BN_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_CTX *ctx)
    561.   	{
    562.   	int top,al,bl;

crypto/bn/bn_mul.c:686:4: Call
    684.   			for (i=b->top; i<k; i++)
    685.   				b->d[i]=0;
    686.   			bn_mul_part_recursive(rr->d,a->d,b->d,al-j,j,t->d);
              ^
    687.   			}
    688.   		rr->top=top;

crypto/bn/bn_mul.c:218:1: Parameter `n`
      216.   /* n+tn is the word length
      217.    * t needs to be n*4 is size, as does r */
      218. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int tn,
      219.   	     int n, BN_ULONG *t)
      220.   	{

crypto/bn/bn_mul.c:250:3: Call
      248.   		bn_mul_comba8(&(t[n2]),t,&(t[n]));
      249.   		bn_mul_comba8(r,a,b);
      250.   		bn_mul_normal(&(r[n2]),&(a[n]),tn,&(b[n]),tn);
               ^
      251.   		memset(&(r[n2+tn*2]),0,sizeof(BN_ULONG)*(n2-tn*2));
      252.   		}

crypto/bn/bn_mul.c:699:1: <Length trace>
697.   	}
698.   
699. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
700.   	{
701.   	BN_ULONG *rr;

crypto/bn/bn_mul.c:699:1: Parameter `*b`
        697.   	}
        698.   
        699. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
        700.   	{
        701.   	BN_ULONG *rr;

crypto/bn/bn_mul.c:728:39: Array access: Offset: [12, +oo] (⇐ [8, +oo] + 4) Size: [0, +oo] by call to `BN_mod_mul_montgomery` 
        726.   		rr[3]=bn_mul_add_words(&(r[3]),a,na,b[3]);
        727.   		if (--nb <= 0) return;
        728.   		rr[4]=bn_mul_add_words(&(r[4]),a,na,b[4]);
                                                     ^
        729.   		rr+=4;
        730.   		r+=4;
