crypto/bn/bn_exp.c:476: error: BUFFER_OVERRUN_L3
  Offset: 6 (⇐ 4 + 2) Size: [0, +oo] by call to `BN_mod_mul`.
Showing all 14 steps of the trace


crypto/bn/bn_exp.c:459:7: Call
457.   	BN_init(&(val[0]));
458.   	ts=1;
459.   	if (!BN_mod(&(val[0]),a,m,ctx)) goto err;		/* 1 */
             ^
460.   	if (!BN_mod_mul(d,&(val[0]),&(val[0]),m,ctx))
461.   		goto err;				/* 2 */

crypto/bn/bn_div.c:286:1: Parameter `*rem->d`
  284.   
  285.   /* rem != m */
  286. > int BN_mod(BIGNUM *rem, BIGNUM *m, BIGNUM *d, BN_CTX *ctx)
  287.   	{
  288.   #if 0 /* The old slow way */

crypto/bn/bn_div.c:312:9: Call
  310.   	return(1);
  311.   #else
  312.   	return(BN_div(NULL,rem,m,d,ctx));
                 ^
  313.   #endif
  314.   	}

crypto/bn/bn_div.c:120:1: Parameter `*rm->d`
    118.   #else
    119.   
    120. > int BN_div(BIGNUM *dv, BIGNUM *rm, BIGNUM *num, BIGNUM *divisor,
    121.   	     BN_CTX *ctx)
    122.   	{

crypto/bn/bn_exp.c:476:8: Call
474.   		{
475.   		BN_init(&(val[i]));
476.   		if (!BN_mod_mul(&(val[i]),&(val[i-1]),d,m,ctx))
              ^
477.   			goto err;
478.   		}

crypto/bn/bn_exp.c:66:1: Parameter `*a->d`
  64.   
  65.   /* slow but works */
  66. > int BN_mod_mul(BIGNUM *ret, BIGNUM *a, BIGNUM *b, BIGNUM *m, BN_CTX *ctx)
  67.   	{
  68.   	BIGNUM *t;

crypto/bn/bn_exp.c:79:10: Call
  77.   		{ if (!BN_sqr(t,a,ctx)) goto err; }
  78.   	else
  79.   		{ if (!BN_mul(t,a,b,ctx)) goto err; }
                 ^
  80.   	if (!BN_mod(ret,t,m,ctx)) goto err;
  81.   	r=1;

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:148:3: Call
      146.   		
      147.   		bn_mul_comba4(r,a,b);
      148.   		bn_mul_comba4(&(r[n2]),&(a[n]),&(b[n]));
               ^
      149.   		}
      150.   	else if (n == 8)

crypto/bn/bn_asm.c:598:1: <Length trace>
596.   	}
597.   
598. > void bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
599.   	{
600.   #ifdef BN_LLONG

crypto/bn/bn_asm.c:598:1: Parameter `*a`
        596.   	}
        597.   
        598. > void bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
        599.   	{
        600.   #ifdef BN_LLONG

crypto/bn/bn_asm.c:618:2: Array access: Offset: 6 (⇐ 4 + 2) Size: [0, +oo] by call to `BN_mod_mul` 
        616.   	r[1]=c2;
        617.   	c2=0;
        618.   	mul_add_c(a[2],b[0],c3,c1,c2);
                ^
        619.   	mul_add_c(a[1],b[1],c3,c1,c2);
        620.   	mul_add_c(a[0],b[2],c3,c1,c2);
