Revert 3rd noop, test with only 10k iterations + 2 noops

Previous run (3 noops + 10k) was 20/20 green. Testing whether the
iteration count alone is sufficient without the extra noop.

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>

Author: andreaTP

runtime/src/main/java/run/endive/runtime/MemCopyWorkaround.java

@@ -45,26 +45,20 @@ public static boolean shouldUseMemWorkaround(String version) {
         if (shouldUseMemWorkaround()) {
             MemoryCopyFunc noop1 = (destination, offset, size, memory) -> {};
             MemoryCopyFunc noop2 = (destination, offset, size, memory) -> {};
-            MemoryCopyFunc noop3 = (destination, offset, size, memory) -> {};
 
-            I32GEUFunc noop4 = (a, b) -> a;
-            I32GEUFunc noop5 = (a, b) -> b;
-            I32GEUFunc noop6 = (a, b) -> a + b;
+            I32GEUFunc noop3 = (a, b) -> a;
+            I32GEUFunc noop4 = (a, b) -> b;
 
             // Warm up the JIT... to make it see memoryCopyFunc.apply is megamorphic
             for (int i = 0; i < 10_000; i++) {
                 memoryCopyFunc = noop1;
                 MemCopyWorkaround.memoryCopy(0, 0, 0, null);
                 memoryCopyFunc = noop2;
                 MemCopyWorkaround.memoryCopy(0, 0, 0, null);
-                memoryCopyFunc = noop3;
-                MemCopyWorkaround.memoryCopy(0, 0, 0, null);
 
-                i32geuFunc = noop4;
+                i32geuFunc = noop3;
                 MemCopyWorkaround.i32_ge_u(0, 0);
-                i32geuFunc = noop5;
-                MemCopyWorkaround.i32_ge_u(0, 0);
-                i32geuFunc = noop6;
+                i32geuFunc = noop4;
                 MemCopyWorkaround.i32_ge_u(0, 0);
             }