crypto/bn/bn_exp2.c:128: error: BUFFER_OVERRUN_L1
  Offset: [7, +oo] (⇐ [0, +oo] + 7) Size: [0, 4] by call to `BN_mod_mul_montgomery`.
Showing all 12 steps of the trace


crypto/bn/bn_exp2.c:128:14: Call
126.   	wend=0;		/* The bottom bit of the window */
127.   
128.           if (!BN_to_montgomery(r,BN_value_one(),mont,ctx)) goto err;
                    ^
129.   	for (;;)
130.   		{

crypto/bn/bn_lib.c:127:26: Assignment
  125.   	{
  126.   	static BN_ULONG data_one=1L;
  127.   	static BIGNUM const_one={&data_one,1,1,0};
                                  ^
  128.   
  129.   	return(&const_one);

crypto/bn/bn_exp2.c:128:14: Call
126.   	wend=0;		/* The bottom bit of the window */
127.   
128.           if (!BN_to_montgomery(r,BN_value_one(),mont,ctx)) goto err;
                    ^
129.   	for (;;)
130.   		{

crypto/bn/bn_mont.c:71:1: Parameter `a->top`
  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:93:8: Call
  91.   			tmp->top--;
  92.   #else
  93.   		if (!BN_sqr(tmp,a,ctx)) goto err;
               ^
  94.   #endif
  95.   		}

crypto/bn/bn_sqr.c:65:1: Parameter `r->max`
    63.   /* r must not be a */
    64.   /* I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96 */
    65. > int BN_sqr(BIGNUM *r, BIGNUM *a, BN_CTX *ctx)
    66.   	{
    67.   	int max,al;

crypto/bn/bn_sqr.c:85:6: Call
    83.   
    84.   	max=(al+al);
    85.   	if (bn_wexpand(rr,max+1) == NULL) return(0);
               ^
    86.   
    87.   	r->neg=0;

crypto/bn/bn_lib.c:344:1: <Length trace>
342.   	}
343.   
344. > BIGNUM *bn_expand2(BIGNUM *b, int words)
345.   	{
346.   	BN_ULONG *A,*B,*a;

crypto/bn/bn_lib.c:344:1: Parameter `words`
      342.   	}
      343.   
      344. > BIGNUM *bn_expand2(BIGNUM *b, int words)
      345.   	{
      346.   	BN_ULONG *A,*B,*a;

crypto/bn/bn_lib.c:359:19: Array declaration
      357.   			return(NULL);
      358.   			}
      359.   		a=A=(BN_ULONG *)Malloc(sizeof(BN_ULONG)*(words+1));
                               ^
      360.   		if (A == NULL)
      361.   			{

crypto/bn/bn_lib.c:359:5: Assignment
      357.   			return(NULL);
      358.   			}
      359.   		a=A=(BN_ULONG *)Malloc(sizeof(BN_ULONG)*(words+1));
                 ^
      360.   		if (A == NULL)
      361.   			{

crypto/bn/bn_lib.c:377:38: Array access: Offset: [7, +oo] (⇐ [0, +oo] + 7) Size: [0, 4] by call to `BN_mod_mul_montgomery` 
      375.   				{
      376.   				A[0]=B[0]; A[1]=B[1]; A[2]=B[2]; A[3]=B[3];
      377.   				A[4]=B[4]; A[5]=B[5]; A[6]=B[6]; A[7]=B[7];
                                                  ^
      378.   				A+=8;
      379.   				B+=8;
