crypto/bn/bntest.c:644: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] Size: [0, +oo] by call to `BN_mod_exp`.
Showing all 20 steps of the trace


crypto/bn/bntest.c:638:2: Call
636.   	e=BN_new();
637.   
638.   	BN_rand(c,30,0,1); /* must be odd for montgomery */
        ^
639.   	for (i=0; i<6; i++)
640.   		{

crypto/bn/bn_rand.c:65:1: Parameter `*rnd->d`
  63.   #include <openssl/rand.h>
  64.   
  65. > int BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
  66.   	{
  67.   	unsigned char *buf=NULL;

crypto/bn/bntest.c:641:3: Call
639.   	for (i=0; i<6; i++)
640.   		{
641.   		BN_rand(a,20+i*5,0,0); /**/
         ^
642.   		BN_rand(b,2+i,0,0); /**/
643.   

crypto/bn/bn_rand.c:65:1: Parameter `*rnd->d`
  63.   #include <openssl/rand.h>
  64.   
  65. > int BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
  66.   	{
  67.   	unsigned char *buf=NULL;

crypto/bn/bntest.c:642:3: Call
640.   		{
641.   		BN_rand(a,20+i*5,0,0); /**/
642.   		BN_rand(b,2+i,0,0); /**/
         ^
643.   
644.   		if (!BN_mod_exp(d,a,b,c,ctx))

crypto/bn/bn_rand.c:65:1: Parameter `*rnd->d`
  63.   #include <openssl/rand.h>
  64.   
  65. > int BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
  66.   	{
  67.   	unsigned char *buf=NULL;

crypto/bn/bntest.c:644:8: Call
642.   		BN_rand(b,2+i,0,0); /**/
643.   
644.   		if (!BN_mod_exp(d,a,b,c,ctx))
              ^
645.   			return(00);
646.   

crypto/bn/bn_exp.c:157:1: Parameter `*a->d`
  155.   	}
  156.   
  157. > int BN_mod_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p, BIGNUM *m, BN_CTX *ctx)
  158.   	{
  159.   	int ret;

crypto/bn/bn_exp.c:173:9: Call
  171.   
  172.   	if (BN_is_odd(m))
  173.   		{ ret=BN_mod_exp_mont(r,a,p,m,ctx,NULL); }
                 ^
  174.   	else
  175.   #endif

crypto/bn/bn_exp.c:348:7: Call
    346.   	else
    347.   		aa=a;
    348.   	if (!BN_to_montgomery(&(val[0]),aa,mont,ctx)) goto err; /* 1 */
                 ^
    349.   	if (!BN_mod_mul_montgomery(d,&(val[0]),&(val[0]),mont,ctx)) goto err; /* 2 */
    350.   

crypto/bn/bn_mont.c:71:1: Parameter `r->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_exp.c:364:8: Call
    362.   		{
    363.   		BN_init(&(val[i]));
    364.   		if (!BN_mod_mul_montgomery(&(val[i]),&(val[i-1]),d,mont,ctx))
                  ^
    365.   			goto err;
    366.   		}

crypto/bn/bn_mont.c:71:1: Parameter `*a->d`
      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:98:8: Call
      96.   	else
      97.   		{
      98.   		if (!BN_mul(tmp,a,b,ctx)) goto err;
                    ^
      99.   		}
      100.   	/* reduce from aRR to aR */

crypto/bn/bn_mul.c:560:1: <Offset trace>
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:560:1: Parameter `a->top`
        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:577:2: Assignment
        575.   	bn_check_top(r);
        576.   
        577.   	al=a->top;
                ^
        578.   	bl=b->top;
        579.   	r->neg=a->neg^b->neg;

crypto/bn/bn_mul.c:560:1: <Length trace>
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: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:648:4: Array access: Offset: [16, +oo] Size: [0, +oo] by call to `BN_mod_exp` 
        646.   			{
        647.   			bn_wexpand(a,bl);
        648.   			a->d[al]=0;
                  ^
        649.   			al++;
        650.   			goto symetric;
