crypto/bn/bn_prime.c:180: error: BUFFER_OVERRUN_L3
  Offset: 7 Size: [0, +oo] by call to `witness`.
Showing all 16 steps of the trace


crypto/bn/bn_prime.c:175:7: Call
173.   
174.   	/* Setup the montgomery structure */
175.   	if (!BN_MONT_CTX_set(mont,a,ctx2)) goto err;
             ^
176.   
177.   	for (i=0; i<checks; i++)

crypto/bn/bn_mont.c:301:1: Parameter `*mont->RR.d`
  299.   	}
  300.   
  301. > int BN_MONT_CTX_set(BN_MONT_CTX *mont, const 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:567:1: Parameter `*a->d`
    565.   	}
    566.   
    567. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    568.   	{
    569.   	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:709:1: Parameter `*a->d`
    707.   	}
    708.   
    709. > int BN_set_bit(BIGNUM *a, int n)
    710.   	{
    711.   	int i,j,k;

crypto/bn/bn_prime.c:180:5: Call
178.   		{
179.   		if (!BN_rand(check,BN_num_bits(a)-1,0,0)) goto err;
180.   		j=witness(check,a,ctx,ctx2,mont);
           ^
181.   		if (j == -1) goto err;
182.   		if (j)

crypto/bn/bn_prime.c:203:1: Parameter `*mont->RR.d`
  201.   #define RECP_MUL_MOD
  202.   
  203. > static int witness(BIGNUM *a, BIGNUM *n, BN_CTX *ctx, BN_CTX *ctx2,
  204.   	     BN_MONT_CTX *mont)
  205.   	{

crypto/bn/bn_prime.c:226:7: Call
  224.   	k=BN_num_bits(n1);
  225.   
  226.   	if (!BN_to_montgomery(mont_one,BN_value_one(),mont,ctx2)) goto err;
               ^
  227.   	if (!BN_to_montgomery(mont_n1,n1,mont,ctx2)) goto err;
  228.   	if (!BN_to_montgomery(mont_a,a,mont,ctx2)) goto err;

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,
    72.   			  BN_MONT_CTX *mont, 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:608:4: Call
      606.   			if (bn_wexpand(rr,16) == NULL) return(0);
      607.   			r->top=16;
      608.   			bn_mul_comba8(rr->d,a->d,b->d);
                ^
      609.   			goto end;
      610.   			}

crypto/bn/bn_asm.c:490:1: <Length trace>
488.   #endif
489.   
490. > void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
491.   	{
492.   #ifdef BN_LLONG

crypto/bn/bn_asm.c:490:1: Parameter `*b`
        488.   #endif
        489.   
        490. > void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
        491.   	{
        492.   #ifdef BN_LLONG

crypto/bn/bn_asm.c:545:2: Array access: Offset: 7 Size: [0, +oo] by call to `witness` 
        543.   	r[6]=c1;
        544.   	c1=0;
        545.   	mul_add_c(a[0],b[7],c2,c3,c1);
                ^
        546.   	mul_add_c(a[1],b[6],c2,c3,c1);
        547.   	mul_add_c(a[2],b[5],c2,c3,c1);
