crypto/bn/bn_mont.c:294: error: BUFFER_OVERRUN_L1
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: 2 by call to `BN_mod_inverse`.
Showing all 9 steps of the trace


crypto/bn/bn_mont.c:270:1: Array declaration
268.   	}
269.   
270. > int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx)
271.   	{
272.   	BIGNUM Ri,*R;

crypto/bn/bn_mont.c:289:3: Assignment
287.   		buf[0]=mod->d[0]; /* tmod = N mod word size */
288.   		buf[1]=0;
289.   		tmod.d=buf;
         ^
290.   		tmod.top=1;
291.   		tmod.dmax=2;

crypto/bn/bn_mont.c:294:8: Call
292.   		tmod.neg=mod->neg;
293.   							/* Ri = R^-1 mod N*/
294.   		if ((BN_mod_inverse(&Ri,R,&tmod,ctx)) == NULL)
              ^
295.   			goto err;
296.   		BN_lshift(&Ri,&Ri,BN_BITS2);		/* R*Ri */

crypto/bn/bn_gcd.c:204:1: Parameter `*n->d`
  202.   
  203.   /* solves ax == 1 (mod n) */
  204. > BIGNUM *BN_mod_inverse(BIGNUM *in,
  205.   	const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
  206.   	{

crypto/bn/bn_gcd.c:232:6: Call
  230.   	BN_zero(Y);
  231.   	if (BN_copy(B,a) == NULL) goto err;
  232.   	if (BN_copy(A,n) == NULL) goto err;
              ^
  233.   	A->neg = 0;
  234.   	if (B->neg || (BN_ucmp(B, A) >= 0))

crypto/bn/bn_lib.c:525:1: <Length trace>
523.   	}
524.   
525. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
526.   	{
527.   	int i;

crypto/bn/bn_lib.c:525:1: Parameter `*b->d`
    523.   	}
    524.   
    525. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
    526.   	{
    527.   	int i;

crypto/bn/bn_lib.c:538:2: Assignment
    536.   #if 1
    537.   	A=a->d;
    538.   	B=b->d;
            ^
    539.   	for (i=b->top>>2; i>0; i--,A+=4,B+=4)
    540.   		{

crypto/bn/bn_lib.c:542:33: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: 2 by call to `BN_mod_inverse` 
    540.   		{
    541.   		BN_ULONG a0,a1,a2,a3;
    542.   		a0=B[0]; a1=B[1]; a2=B[2]; a3=B[3];
                                           ^
    543.   		A[0]=a0; A[1]=a1; A[2]=a2; A[3]=a3;
    544.   		}
