2026-03-30 13:01:33 +02:00
// DESCRIPTION: Verilator: Verilog Test module
//
// This file ONLY is placed under the Creative Commons Public Domain.
// SPDX-FileCopyrightText: 2026 PlanV GmbH
// SPDX-License-Identifier: CC0-1.0
// verilog_format: off
`define stop $stop
`define checkh(gotv,expv) do if ((gotv) !== (expv)) begin $write("%%Error: %s:%0d: got=%0x exp=%0x (%s !== %s)\n", `__FILE__,`__LINE__, (gotv), (expv), `"gotv`", `"expv`"); `stop; end while(0);
`define checkd(gotv,expv) do if ((gotv) !== (expv)) begin $write("%%Error: %s:%0d: got=%0d exp=%0d\n", `__FILE__,`__LINE__, (gotv), (expv)); `stop; end while(0);
// verilog_format: on
module t (
input clk
) ;
int cyc ;
reg [ 63 : 0 ] crc ;
// Derive signals from non-adjacent CRC bits
wire a = crc [ 0 ] ;
wire b = crc [ 4 ] ;
wire c = crc [ 8 ] ;
wire d = crc [ 12 ] ;
int count_fail1 = 0 ;
int count_fail2 = 0 ;
int count_fail3 = 0 ;
int count_fail4 = 0 ;
int count_fail5 = 0 ;
2026-04-08 16:26:03 +02:00
int count_fail6 = 0 ;
int count_fail7 = 0 ;
int count_fail8 = 0 ;
int count_fail9 = 0 ;
int count_fail10 = 0 ;
int count_fail11 = 0 ;
2026-03-30 13:01:33 +02:00
2026-04-08 16:26:03 +02:00
// Test 1: a[*3] |-> b
2026-03-30 23:34:10 +02:00
assert property ( @ ( posedge clk ) a [ * 3 ] | - > b )
else count_fail1 < = count_fail1 + 1 ;
2026-03-30 13:01:33 +02:00
2026-04-08 16:26:03 +02:00
// Test 2: a[*1] |-> c
2026-03-30 23:34:10 +02:00
assert property ( @ ( posedge clk ) a [ * 1 ] | - > c )
else count_fail2 < = count_fail2 + 1 ;
2026-03-30 13:01:33 +02:00
2026-04-08 16:26:03 +02:00
// Test 3: a[*2] |=> d
2026-03-30 23:34:10 +02:00
assert property ( @ ( posedge clk ) a [ * 2 ] | = > d )
else count_fail3 < = count_fail3 + 1 ;
2026-03-30 13:01:33 +02:00
2026-04-08 16:26:03 +02:00
// Test 4: b[*2] standalone
2026-03-30 23:34:10 +02:00
assert property ( @ ( posedge clk ) b [ * 2 ] )
else count_fail4 < = count_fail4 + 1 ;
2026-03-30 13:01:33 +02:00
2026-04-08 16:26:03 +02:00
// Test 5: a[*10000] large count
2026-04-20 07:43:18 +02:00
assert property ( @ ( posedge clk ) a [ * 100 ] | - > b )
2026-03-30 23:34:10 +02:00
else count_fail5 < = count_fail5 + 1 ;
2026-03-30 13:01:33 +02:00
2026-04-08 16:26:03 +02:00
// Test 6: a[*1:3] ##1 b -- bounded range in SExpr
assert property ( @ ( posedge clk ) a [ * 1 : 3 ] # # 1 b )
else count_fail6 < = count_fail6 + 1 ;
// Test 7: a[+] ##1 b -- one-or-more in SExpr
assert property ( @ ( posedge clk ) a [ + ] # # 1 b )
else count_fail7 < = count_fail7 + 1 ;
2026-04-20 07:43:18 +02:00
// Test 8: a[+] |-> b -- standalone [+]
2026-04-08 16:26:03 +02:00
assert property ( @ ( posedge clk ) a [ + ] | - > b )
else count_fail8 < = count_fail8 + 1 ;
2026-04-20 07:43:18 +02:00
// Test 9: a[*] |-> b -- standalone [*]
2026-04-08 16:26:03 +02:00
assert property ( @ ( posedge clk ) a [ * ] | - > b )
else count_fail9 < = count_fail9 + 1 ;
// Test 10: a[*1] ##1 b -- trivial [*1] in SExpr (restored to plain SExpr)
assert property ( @ ( posedge clk ) a [ * 1 ] # # 1 b )
else count_fail10 < = count_fail10 + 1 ;
// Test 11: a[*] ##1 b -- zero-or-more in SExpr (minN==0 path)
assert property ( @ ( posedge clk ) a [ * ] # # 1 b )
else count_fail11 < = count_fail11 + 1 ;
2026-04-20 07:43:18 +02:00
// Counter FSM with M>0: range > kChainLimit (256) forces counter vertex
// creation; min>0 exercises the Gte/active gating path in resolveLinks and
// emitNbaLogic. Cover-only so count_fail values above are undisturbed.
cover property ( @ ( posedge clk ) # # [ 10 : 300 ] b ) ;
2026-03-30 13:01:33 +02:00
always @ ( posedge clk ) begin
`ifdef TEST_VERBOSE
2026-03-30 23:34:10 +02:00
$write ( " [%0t] cyc==%0d crc=%x a=%b b=%b c=%b d=%b \n " , $time , cyc , crc , a , b , c , d ) ;
2026-03-30 13:01:33 +02:00
`endif
cyc < = cyc + 1 ;
crc < = { crc [ 62 : 0 ] , crc [ 63 ] ^ crc [ 2 ] ^ crc [ 0 ] } ;
if ( cyc = = 0 ) begin
crc < = 64 'h5aef0c8d _d70a4497 ;
end
else if ( cyc = = 99 ) begin
`checkh ( crc , 64 'hc77bb9b3784ea091 ) ;
2026-04-20 07:43:18 +02:00
`checkd ( count_fail1 , 5 ) ; // Questa: 5
`checkd ( count_fail2 , 25 ) ; // Questa: 25
`checkd ( count_fail3 , 9 ) ; // Questa: 9
`checkd ( count_fail4 , 49 ) ; // Questa: 49
`checkd ( count_fail5 , 0 ) ; // Questa: 0
// NFA merge-node range [*M:N] over-counts rejects (Questa: 51); match
// detection is correct, only reject counting is imprecise
`checkd ( count_fail6 , 59 ) ;
`checkd ( count_fail7 , 51 ) ; // Questa: 51
`checkd ( count_fail8 , 20 ) ; // Questa: 20
// IEEE 1800-2023 16.9.2 permits empty match of [*0]; NFA reports
// rejects on each tick while Questa suppresses (Questa: 20)
`checkd ( count_fail9 , 49 ) ;
`checkd ( count_fail10 , 59 ) ; // Questa: 59
// a[*] ##1 b: NFA treats unbounded [*] as liveness (no reject);
// Questa treats as definite antecedent (Questa: 29)
`checkd ( count_fail11 , 0 ) ;
2026-03-30 13:01:33 +02:00
$write ( " *-* All Finished *-* \n " ) ;
$finish ;
end
end
endmodule