crypto/bn/bn_exp.c:211: error: BUFFER_OVERRUN_L3
  Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, +oo] by call to `BN_mod_mul_reciprocal`.
Showing all 22 steps of the trace


crypto/bn/bn_exp.c:187:1: Parameter `m->top`
185.   
186.   /* #ifdef RECP_MUL_MOD */
187. > int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
188.   		    const BIGNUM *m, BN_CTX *ctx)
189.   	{

crypto/bn/bn_exp.c:205:6: Call
203.   		}
204.   	BN_RECP_CTX_init(&recp);
205.   	if (BN_RECP_CTX_set(&recp,m,ctx) <= 0) goto err;
            ^
206.   
207.   	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, const 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, const 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, const BIGNUM *b)
    500.   	{
    501.   	int i;

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

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:686:4: Call
      684.   			for (i=b->top; i<k; i++)
      685.   				b->d[i]=0;
      686.   			bn_mul_part_recursive(rr->d,a->d,b->d,al-j,j,t->d);
                ^
      687.   			}
      688.   		rr->top=top;

crypto/bn/bn_mul.c:218:1: Parameter `n`
        216.   /* n+tn is the word length
        217.    * t needs to be n*4 is size, as does r */
        218. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int tn,
        219.   	     int n, BN_ULONG *t)
        220.   	{

crypto/bn/bn_mul.c:264:4: Call
        262.   		if (j == 0)
        263.   			{
        264.   			bn_mul_recursive(&(r[n2]),&(a[n]),&(b[n]),i,p);
                  ^
        265.   			memset(&(r[n2+i*2]),0,sizeof(BN_ULONG)*(n2-i*2));
        266.   			}

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:103:5: Call
          101.   		}
          102.   	/* r=(a[0]-a[1])*(b[1]-b[0]) */
          103.   	c1=bn_cmp_words(a,&(a[n]),n);
                     ^
          104.   	c2=bn_cmp_words(&(b[n]),b,n);
          105.   	zero=neg=0;

crypto/bn/bn_lib.c:769:1: <Offset trace>
767.   	}
768.   
769. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
770.   	{
771.   	int i;

crypto/bn/bn_lib.c:769:1: Parameter `n`
            767.   	}
            768.   
            769. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
            770.   	{
            771.   	int i;

crypto/bn/bn_lib.c:777:7: Assignment
            775.   	bb=b[n-1];
            776.   	if (aa != bb) return((aa > bb)?1:-1);
            777.   	for (i=n-2; i>=0; i--)
                         ^
            778.   		{
            779.   		aa=a[i];

crypto/bn/bn_lib.c:769:1: <Length trace>
767.   	}
768.   
769. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
770.   	{
771.   	int i;

crypto/bn/bn_lib.c:769:1: Parameter `*a`
            767.   	}
            768.   
            769. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
            770.   	{
            771.   	int i;

crypto/bn/bn_lib.c:779:6: Array access: Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, +oo] by call to `BN_mod_mul_reciprocal` 
            777.   	for (i=n-2; i>=0; i--)
            778.   		{
            779.   		aa=a[i];
                        ^
            780.   		bb=b[i];
            781.   		if (aa != bb) return((aa > bb)?1:-1);
