crypto/dsa/dsa_vrf.c:89: error: BUFFER_OVERRUN_L3
  Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, +oo] by call to `BN_mod_mul`.
Showing all 17 steps of the trace


crypto/dsa/dsa_vrf.c:86:6: Call
84.   
85.   	/* save M in u1 */
86.   	if (BN_bin2bn(dgst,dgst_len,&u1) == NULL) goto err;
           ^
87.   
88.   	/* u1 = M * w mod q */

crypto/bn/bn_lib.c:574:1: Parameter `*ret->d`
  572.   
  573.   /* ignore negative */
  574. > BIGNUM *BN_bin2bn(unsigned char *s, int len, BIGNUM *ret)
  575.   	{
  576.   	unsigned int i,m;

crypto/dsa/dsa_vrf.c:89:7: Call
87.   
88.   	/* u1 = M * w mod q */
89.   	if (!BN_mod_mul(&u1,&u1,&u2,dsa->q,ctx)) goto err;
            ^
90.   
91.   	/* u2 = r * w mod q */

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: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:748:1: <Offset trace>
746.   	}
747.   
748. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
749.   	{
750.   	int i;

crypto/bn/bn_lib.c:748:1: Parameter `n`
          746.   	}
          747.   
          748. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
          749.   	{
          750.   	int i;

crypto/bn/bn_lib.c:756:7: Assignment
          754.   	bb=b[n-1];
          755.   	if (aa != bb) return((aa > bb)?1:-1);
          756.   	for (i=n-2; i>=0; i--)
                       ^
          757.   		{
          758.   		aa=a[i];

crypto/bn/bn_lib.c:748:1: <Length trace>
746.   	}
747.   
748. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
749.   	{
750.   	int i;

crypto/bn/bn_lib.c:748:1: Parameter `*a`
          746.   	}
          747.   
          748. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
          749.   	{
          750.   	int i;

crypto/bn/bn_lib.c:758:6: Array access: Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, +oo] by call to `BN_mod_mul` 
          756.   	for (i=n-2; i>=0; i--)
          757.   		{
          758.   		aa=a[i];
                      ^
          759.   		bb=b[i];
          760.   		if (aa != bb) return((aa > bb)?1:-1);
