crypto/bn/bntest.c:644: error: BUFFER_OVERRUN_L3
  Offset: [7, +oo] (⇐ [0, +oo] + 7) Size: [0, +oo] by call to `BN_mod_exp`.
Showing all 22 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:343:3: Call
    341.   	if (BN_ucmp(a,m) >= 0)
    342.   		{
    343.   		BN_mod(&(val[0]),a,m,ctx);
             ^
    344.   		aa= &(val[0]);
    345.   		}

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:419:8: Call
    417.   		
    418.   		/* wvalue will be an odd number < 2^window */
    419.   		if (!BN_mod_mul_montgomery(r,r,&(val[wvalue>>1]),mont,ctx))
                  ^
    420.   			goto err;
    421.   

crypto/bn/bn_mont.c:71:1: Parameter `*b->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: Parameter `*b->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:640:4: Call
        638.   		if ((i ==  1) && !BN_get_flags(b,BN_FLG_STATIC_DATA))
        639.   			{
        640.   			bn_wexpand(b,al);
                  ^
        641.   			b->d[bl]=0;
        642.   			bl++;

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 `*b->d`
          342.   	}
          343.   
          344. > BIGNUM *bn_expand2(BIGNUM *b, int words)
          345.   	{
          346.   	BN_ULONG *A,*B,*a;

crypto/bn/bn_lib.c:367:3: Assignment
          365.   memset(A,0x5c,sizeof(BN_ULONG)*(words+1));
          366.   #if 1
          367.   		B=b->d;
                   ^
          368.   		/* Check if the previous number needs to be copied */
          369.   		if (B != NULL)

crypto/bn/bn_lib.c:377:43: Array access: Offset: [7, +oo] (⇐ [0, +oo] + 7) Size: [0, +oo] by call to `BN_mod_exp` 
          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;
