crypto/x509v3/v3_utl.c:158: error: BUFFER_OVERRUN_L3
  Offset: [7, +oo] (⇐ [0, +oo] + 7) Size: [2, +oo] by call to `BN_dec2bn`.
Showing all 9 steps of the trace


crypto/x509v3/v3_utl.c:153:7: Call
151.   	BIGNUM *bn = NULL;
152.   	ASN1_INTEGER *aint;
153.   	bn = BN_new();
             ^
154.   	if(!value) {
155.   		X509V3err(X509V3_F_S2I_ASN1_INTEGER,X509V3_R_INVALID_NULL_VALUE);

crypto/bn/bn_lib.c:300:2: Assignment
  298.   		}
  299.   	ret->flags=BN_FLG_MALLOCED;
  300.   	ret->top=0;
          ^
  301.   	ret->neg=0;
  302.   	ret->max=0;

crypto/x509v3/v3_utl.c:158:6: Call
156.   		return 0;
157.   	}
158.   	if(!BN_dec2bn(&bn, value)) {
            ^
159.   		X509V3err(X509V3_F_S2I_ASN1_INTEGER,X509V3_R_BN_DEC2BN_ERROR);
160.   		return 0;

crypto/bn/bn_print.c:223:1: Parameter `(*bn)->top`
  221.   	}
  222.   
  223. > int BN_dec2bn(BIGNUM **bn, const char *a)
  224.   	{
  225.   	BIGNUM *ret=NULL;

crypto/bn/bn_print.c:252:6: Call
  250.   
  251.   	/* i is the number of digests, a bit of an over expand; */
  252.   	if (bn_expand(ret,i*4) == NULL) goto err;
              ^
  253.   
  254.   	j=BN_DEC_NUM-(i%BN_DEC_NUM);

crypto/bn/bn_lib.c:344:1: <Length trace>
342.   	}
343.   
344. > BIGNUM *bn_expand2(BIGNUM *b, int words)
345.   	{
346.   	BN_ULONG *A,*a;

crypto/bn/bn_lib.c:344:1: Parameter `b->top`
    342.   	}
    343.   
    344. > BIGNUM *bn_expand2(BIGNUM *b, int words)
    345.   	{
    346.   	BN_ULONG *A,*a;

crypto/bn/bn_lib.c:466:3: Assignment
    464.   		/* Now need to zero any data between b->top and b->max */
    465.   
    466.   		A= &(b->d[b->top]);
             ^
    467.   		for (i=(b->max - b->top)>>3; i>0; i--,A+=8)
    468.   			{

crypto/bn/bn_lib.c:470:28: Array access: Offset: [7, +oo] (⇐ [0, +oo] + 7) Size: [2, +oo] by call to `BN_dec2bn` 
    468.   			{
    469.   			A[0]=0; A[1]=0; A[2]=0; A[3]=0;
    470.   			A[4]=0; A[5]=0; A[6]=0; A[7]=0;
                                      ^
    471.   			}
    472.   		for (i=(b->max - b->top)&7; i>0; i--,A++)
