crypto/bn/bn_exp.c:209: error: BUFFER_OVERRUN_L3
  Offset: 15 (⇐ 8 + 7) Size: [0, +oo] by call to `BN_mod_mul_reciprocal`.
Showing all 17 steps of the trace


crypto/bn/bn_exp.c:186:1: Parameter `m->top`
184.   
185.   /* #ifdef RECP_MUL_MOD */
186. > int BN_mod_exp_recp(BIGNUM *r, BIGNUM *a, BIGNUM *p, BIGNUM *m, BN_CTX *ctx)
187.   	{
188.   	int i,j,bits,ret=0,wstart,wend,window,wvalue;

crypto/bn/bn_exp.c:203:6: Call
201.   		}
202.   	BN_RECP_CTX_init(&recp);
203.   	if (BN_RECP_CTX_set(&recp,m,ctx) <= 0) goto err;
            ^
204.   
205.   	BN_init(&(val[0]));

crypto/bn/bn_recp.c:94:1: Parameter `*recp->N.d`
  92.   	}
  93.   
  94. > int BN_RECP_CTX_set(BN_RECP_CTX *recp, BIGNUM *d, BN_CTX *ctx)
  95.   	{
  96.   	BN_copy(&(recp->N),d);

crypto/bn/bn_recp.c:96:2: Call
  94.   int BN_RECP_CTX_set(BN_RECP_CTX *recp, BIGNUM *d, BN_CTX *ctx)
  95.   	{
  96.   	BN_copy(&(recp->N),d);
         ^
  97.   	BN_zero(&(recp->Nr));
  98.   	recp->num_bits=BN_num_bits(d);

crypto/bn/bn_lib.c:499:1: Parameter `*a->d`
    497.   	}
    498.   
    499. > BIGNUM *BN_copy(BIGNUM *a, BIGNUM *b)
    500.   	{
    501.   	int i;

crypto/bn/bn_exp.c:209:7: Call
207.   
208.   	if (!BN_mod(&(val[0]),a,m,ctx)) goto err;		/* 1 */
209.   	if (!BN_mod_mul_reciprocal(aa,&(val[0]),&(val[0]),&recp,ctx))
             ^
210.   		goto err;				/* 2 */
211.   

crypto/bn/bn_recp.c:103:1: Parameter `*recp->N.d`
  101.   	}
  102.   
  103. > int BN_mod_mul_reciprocal(BIGNUM *r, BIGNUM *x, BIGNUM *y, BN_RECP_CTX *recp,
  104.   	     BN_CTX *ctx)
  105.   	{

crypto/bn/bn_recp.c:120:2: Call
  118.   		a=x; /* Just do the mod */
  119.   
  120.   	BN_div_recp(NULL,r,a,recp,ctx);
          ^
  121.   	ret=1;
  122.   err:

crypto/bn/bn_recp.c:127:1: Parameter `*recp->N.d`
    125.   	}
    126.   
    127. > int BN_div_recp(BIGNUM *dv, BIGNUM *rem, BIGNUM *m, BN_RECP_CTX *recp,
    128.   	     BN_CTX *ctx)
    129.   	{

crypto/bn/bn_recp.c:181:7: Call
    179.   	if (!BN_rshift(d,b,j+ex)) goto err;
    180.   	d->neg=0;
    181.   	if (!BN_mul(b,&(recp->N),d,ctx)) goto err;
                 ^
    182.   	if (!BN_usub(r,m,b)) goto err;
    183.   	r->neg=0;

crypto/bn/bn_mul.c:560:1: Parameter `*a->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:674:4: Call
      672.   			bn_wexpand(t,k*2);
      673.   			bn_wexpand(rr,k*2);
      674.   			bn_mul_recursive(rr->d,a->d,b->d,al,t->d);
                ^
      675.   			}
      676.   		else

crypto/bn/bn_mul.c:74:1: Parameter `*a`
        72.    * a[1]*b[1]
        73.    */
        74. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
        75.   	     BN_ULONG *t)
        76.   	{

crypto/bn/bn_mul.c:158:3: Call
        156.   		
        157.   		bn_mul_comba8(r,a,b);
        158.   		bn_mul_comba8(&(r[n2]),&(a[n]),&(b[n]));
                 ^
        159.   		}
        160.   	else

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

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

crypto/bn/bn_asm.c:551:2: Array access: Offset: 15 (⇐ 8 + 7) Size: [0, +oo] by call to `BN_mod_mul_reciprocal` 
          549.   	mul_add_c(a[5],b[2],c2,c3,c1);
          550.   	mul_add_c(a[6],b[1],c2,c3,c1);
          551.   	mul_add_c(a[7],b[0],c2,c3,c1);
                  ^
          552.   	r[7]=c2;
          553.   	c2=0;
