fix(v4.0.0): step 6e review round 2 -- only the message looked at is taken, moved or dropped; the kernel's port has no queue in a fabric; an answer nobody awaits is not a loss

- Engine: a wire keeps whether the message at its mark is the one last
  looked at; a node's take, move and drop of any other answer 3 and write
  nothing (MESH.md 7d.3).  A wire cut and made again between a look and a
  take no longer has a NACK done as text, or 256 cells written where one
  was looked for.
- Engine: v4_fabric_wire_kernel wires a kernel to a port with no queues;
  a message for it is refused at once, error 18, on a mesh as on the
  products.
- The result of a drop is looked at; a take that does not take has the
  message dropped, or gone past: nothing goes round.
- An answer nobody waits for is let go uncounted; (LOST) counts what should
  have been delivered or acted on and was not.  The flood's account is
  exact.
- Error 18 from under a word that was printing empties the data stack, as
  a fault does: that word's own values are not left there.
- Tests: the take and drop windows cut at every step, with and without
  another message put; a refusal owed to a stuck node whose wire is full.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>

v4/tests/test_host_depth.c

@@ -273,6 +273,7 @@ static int one(unsigned path, const char *what, unsigned depth, const char *text
     v4_cell lost11 = pool[mid].n.mem[LOST], refused12 = pool[far].n.mem[REFUSED], ways12;
     int how11, works = 0, clean_error = 0;
     unsigned left;
+    v4_uheat_t clock12;
 
     if (!sixhundred[0]) memset(sixhundred, 'A', 600);
     runs++;
@@ -281,6 +282,7 @@ static int one(unsigned path, const char *what, unsigned depth, const char *text
     ways12 = pool[far].n.mem[ROUTE_COUNT];
     forget();
     saw_room_wait = 0; saw_passed = 0;
+    clock12 = pool[far].es.anticlock;
     if (why) { }
     else if (path == 4) {                            /* node 12 is busy for a long while and sends no answer; node 11 waits; its centre says 12 is gone */
         stuck = 1u << far;
@@ -319,8 +321,8 @@ static int one(unsigned path, const char *what, unsigned depth, const char *text
         switch (path) {
         case 0: works = how11 == V4_TEXT_COMPLETED && strcmp(printed, sixhundred) == 0 && left == values;
                 clean_error = over && is_cut_short(printed, sixhundred, over); break;
-        case 1: works = how11 == V4_TEXT_COMPLETED && printed_len == 0 && left == values && pool[mid].n.mem[LOST] == lost11 + 1;   /* node 12's answer, which it did not wait for */
-                clean_error = over && strcmp(printed, over) == 0 && pool[mid].n.mem[LOST] == lost11; break;
+        case 1: works = how11 == V4_TEXT_COMPLETED && printed_len == 0 && left == values && pool[far].es.anticlock != clock12 && pool[mid].n.mem[LOST] == lost11;   /* node 12 did the text */
+                clean_error = over && strcmp(printed, over) == 0 && pool[far].es.anticlock == clock12; break;                                        /* nothing was sent */
         case 2: works = how11 == V4_TEXT_ERROR && strcmp(printed, "Argument out of range\n") == 0 && left == values;
                 clean_error = over && strcmp(printed, over) == 0; break;
         case 3: works = how11 == V4_TEXT_COMPLETED && printed_len == 0 && left == values && pool[mid].n.mem[LOST] == lost11;