tests: Add reproduce etcd-io#13766 scenario

Signed-off-by: Marek Siarkowicz <siarkowicz@google.com>
serathius · Jan 17, 2023 · 287e1b6 · 287e1b6
1 parent 09b5663
commit 287e1b6
Show file tree

Hide file tree

Showing 4 changed files with 20 additions and 11 deletions.
diff --git a/.github/workflows/linearizability-nightly.yaml b/.github/workflows/linearizability-nightly.yaml
@@ -10,17 +10,17 @@ jobs:
     uses: ./.github/workflows/linearizability-template.yaml
     with:
       ref: main
-      count: 300
-      testTimeout: 170m
+      count: 100
+      testTimeout: 200m
   test-35:
     uses: ./.github/workflows/linearizability-template.yaml
     with:
       ref: release-3.5
-      count: 300
-      testTimeout: 170m
+      count: 100
+      testTimeout: 200m
   test-34:
     uses: ./.github/workflows/linearizability-template.yaml
     with:
       ref: release-3.4
-      count: 300
-      testTimeout: 170m
+      count: 100
+      testTimeout: 200m
diff --git a/.github/workflows/linearizability-template.yaml b/.github/workflows/linearizability-template.yaml
@@ -15,7 +15,7 @@ on:
 permissions: read-all
 jobs:
   test:
-    timeout-minutes: 180
+    timeout-minutes: 210
     runs-on: ubuntu-latest
     steps:
     - uses: actions/checkout@ac593985615ec2ede58e132d2e21d2b1cbd6127c # v3.3.0

diff --git a/.github/workflows/linearizability.yaml b/.github/workflows/linearizability.yaml
@@ -6,5 +6,5 @@ jobs:
     uses: ./.github/workflows/linearizability-template.yaml
     with:
       ref: ${{ github.ref }}
-      count: 60
+      count: 15
       testTimeout: 30m
diff --git a/tests/linearizability/linearizability_test.go b/tests/linearizability/linearizability_test.go
@@ -37,9 +37,9 @@ import (
 
 const (
 	// minimalQPS is used to validate if enough traffic is send to make tests accurate.
-	minimalQPS = 100.0
+	minimalQPS = 200.0
 	// maximalQPS limits number of requests send to etcd to avoid linearizability analysis taking too long.
-	maximalQPS = 200.0
+	maximalQPS = 1000.0
 	// waitBetweenFailpointTriggers
 	waitBetweenFailpointTriggers = time.Second
 )
@@ -56,6 +56,7 @@ func TestLinearizability(t *testing.T) {
 			failpoint: RandomFailpoint,
 			config: *e2e.NewConfig(
 				e2e.WithClusterSize(1),
+				e2e.WithSnapshotCount(100),
 				e2e.WithPeerProxy(true),
 				e2e.WithGoFailEnabled(true),
 				e2e.WithCompactionBatchLimit(100), // required for compactBeforeCommitBatch and compactAfterCommitBatch failpoints
@@ -65,6 +66,7 @@ func TestLinearizability(t *testing.T) {
 			name:      "ClusterOfSize3",
 			failpoint: RandomFailpoint,
 			config: *e2e.NewConfig(
+				e2e.WithSnapshotCount(100),
 				e2e.WithPeerProxy(true),
 				e2e.WithGoFailEnabled(true),
 				e2e.WithCompactionBatchLimit(100), // required for compactBeforeCommitBatch and compactAfterCommitBatch failpoints
@@ -86,6 +88,13 @@ func TestLinearizability(t *testing.T) {
 				e2e.WithGoFailEnabled(true),
 			),
 		},
+		{
+			name:      "Issue13766",
+			failpoint: KillFailpoint,
+			config: *e2e.NewConfig(
+				e2e.WithSnapshotCount(100),
+			),
+		},
 	}
 	for _, tc := range tcs {
 		t.Run(tc.name, func(t *testing.T) {
@@ -103,7 +112,7 @@ func TestLinearizability(t *testing.T) {
 			}, trafficConfig{
 				minimalQPS:  minimalQPS,
 				maximalQPS:  maximalQPS,
-				clientCount: 8,
+				clientCount: 12,
 				traffic:     DefaultTraffic,
 			})
 			longestHistory, remainingEvents := pickLongestHistory(events)