dive-core 0.1.0

The dive execution core for TLA+: value store, plan compiler, interpreter and successor generation
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
//! Bounded worker-local indexes over immutable, materialized set elements.

use std::sync::{Arc, Weak};

use crate::Error;
use crate::handle::{Handle, mix64};
use crate::heap::Heap;
use crate::node::Kind;
use crate::store::Store;

const RECORDS: usize = 64;
const MIN_MEMBERS: usize = 16;

#[derive(Debug)]
struct Record {
    set: Handle,
    revision: (u64, u64),
    slots: Vec<Handle>,
}

impl Default for Record {
    fn default() -> Self {
        Self {
            set: Handle::EMPTY,
            revision: (0, 0),
            slots: Vec::new(),
        }
    }
}

/// An index supplies only an extensional hit or miss, never history authority.
#[derive(Debug, Default)]
pub(crate) struct MemberIndex {
    pub(crate) cap: usize,
    records: Vec<Record>,
    store: Option<Weak<Store>>,
    arena: Option<Weak<()>>,
}

impl MemberIndex {
    pub(crate) fn clear(&mut self) {
        self.records = Vec::new();
        self.store = None;
        self.arena = None;
    }

    pub(crate) fn bytes(&self) -> usize {
        self.records.capacity() * std::mem::size_of::<Record>()
            + self
                .records
                .iter()
                .map(|r| r.slots.capacity() * 8)
                .sum::<usize>()
    }

    fn bind(&mut self, heap: &Heap) {
        if self
            .store
            .as_ref()
            .is_some_and(|s| std::ptr::eq(s.as_ptr(), Arc::as_ptr(&heap.store)))
            && self
                .arena
                .as_ref()
                .is_some_and(|a| std::ptr::eq(a.as_ptr(), Arc::as_ptr(&heap.arena.cache_owner)))
        {
            return;
        }
        self.clear();
        self.store = Some(Arc::downgrade(&heap.store));
        self.arena = Some(Arc::downgrade(&heap.arena.cache_owner));
    }

    // Only closed eager values whose existing hash agrees with canonical
    // comparison are admitted. This neither normalizes nor interns a query.
    fn eligible(heap: &Heap, value: Handle, depth: u8) -> Result<bool, Error> {
        crate::compare::materialized(heap, value, depth)
    }

    fn bucket(hash: u64, slots: usize) -> usize {
        #[allow(
            clippy::cast_possible_truncation,
            reason = "masked to allocated table length"
        )]
        let bucket = mix64(hash) as usize & (slots - 1);
        bucket
    }

    /// Indexed values are materialized at construction, and every query is
    /// checked. `None` retains the caller's full admission; misses retain its
    /// class/error checks. The caller must reject a lazy set root.
    pub(crate) fn search(
        &mut self,
        heap: &Heap,
        set: Handle,
        query: Handle,
        values: &[Handle],
    ) -> Result<Option<bool>, Error> {
        if self.cap == 0
            || !query.is_compound()
            || values.len() < MIN_MEMBERS
            || heap.store.semantics().tlc_comparisons
            || heap.view(query).kind == Kind::BigInt
        {
            return Ok(None);
        }
        if !Self::eligible(heap, query, 0)? {
            return Ok(None);
        }
        self.bind(heap);
        let metadata = RECORDS * std::mem::size_of::<Record>();
        if self.records.is_empty() {
            if metadata > self.cap || self.records.try_reserve_exact(RECORDS).is_err() {
                return Ok(None);
            }
            if self.records.capacity() * std::mem::size_of::<Record>() > self.cap {
                self.records = Vec::new();
                return Ok(None);
            }
            self.records.resize_with(RECORDS, Record::default);
        }
        let bucket = Self::bucket(set.bits(), RECORDS);
        let revision = if set.is_transient() {
            heap.arena.cache_revision()
        } else {
            (0, 0)
        };
        let record = &mut self.records[bucket];
        if record.set != set || record.revision != revision {
            *record = Record {
                set,
                revision,
                slots: Vec::new(),
            };
            return Ok(None); // First eligible lookup never builds an index.
        }
        if record.slots.is_empty() {
            let Some(size) = values
                .len()
                .checked_mul(2)
                .and_then(usize::checked_next_power_of_two)
            else {
                return Ok(None);
            };
            let Some(bytes) = size.checked_mul(8) else {
                return Ok(None);
            };
            if bytes > self.cap.saturating_sub(self.bytes()) {
                return Ok(None);
            }
            let mut slots = Vec::new();
            if slots.try_reserve_exact(size).is_err() {
                return Ok(None);
            }
            if slots.capacity() * 8 > self.cap.saturating_sub(self.bytes()) {
                return Ok(None);
            }
            slots.resize(size, Handle::EMPTY);
            for &value in values {
                if !Self::eligible(heap, value, 1)? {
                    return Ok(None);
                }
                let mut pos = Self::bucket(heap.hash(value), size);
                while !slots[pos].is_empty() {
                    heap.work_poll()?;
                    pos = (pos + 1) & (size - 1);
                }
                slots[pos] = value;
            }
            self.records[bucket].slots = slots;
        }
        let slots = &self.records[bucket].slots;
        let mut pos = Self::bucket(heap.hash(query), slots.len());
        while !slots[pos].is_empty() {
            heap.work_poll()?;
            // Equal hashes and equal persistent coordinates alone prove
            // nothing about independently represented construction values.
            if heap.cmp(slots[pos], query).is_eq() {
                return Ok(Some(true));
            }
            pos = (pos + 1) & (slots.len() - 1);
        }
        Ok(Some(false))
    }
}

#[cfg(test)]
#[allow(
    clippy::unwrap_used,
    reason = "bounded exact fixture construction and expected successful calls"
)]
mod tests {
    use super::*;
    use crate::memo::Memo;
    use crate::{Machine, Opts, Semantics};

    fn machine(tlc: bool, hashcons: bool) -> Machine {
        let semantics = if tlc {
            Semantics::tlc()
        } else {
            Semantics::default()
        };
        Machine::new(
            Arc::new(Store::with_semantics(hashcons, semantics)),
            0,
            Opts::default(),
            Memo::default(),
        )
    }

    fn tuple_set(m: &mut Machine) -> Handle {
        let values: Vec<_> = (0..32)
            .map(|i| {
                let x = Handle::int(i).unwrap();
                m.heap.tuple_literal(&[x, x])
            })
            .collect();
        let set = m.heap.canonical_test_set(&values).unwrap();
        m.heap.norm(set).unwrap()
    }

    fn indexed(m: &Machine) -> usize {
        m.memo
            .member_index
            .records
            .iter()
            .filter(|r| !r.slots.is_empty())
            .count()
    }

    #[test]
    fn second_normalized_lookup_builds_and_preserves_all_hits_and_errors() {
        for tlc in [false, true] {
            for hashcons in [false, true] {
                let mut m = machine(tlc, hashcons);
                let set = tuple_set(&mut m);
                let query = m.heap.tuple_literal(&[Handle::int(4).unwrap(); 2]);
                assert_eq!(m.member(query, set), Ok(true));
                assert_eq!(indexed(&m), 0);
                assert_eq!(m.member(query, set), Ok(true));
                assert_eq!(indexed(&m), usize::from(!tlc));
                for i in -2..35 {
                    let query = m.heap.tuple_literal(&[Handle::int(i).unwrap(); 2]);
                    let old = Ok((0..32).contains(&i));
                    assert_eq!(m.member(query, set), old);
                }
                for query in [Handle::TRUE, Handle::int(4).unwrap()] {
                    // Compare indexed lookup with a fresh uncached receiver.
                    let candidate = tuple_set(&mut m);
                    let reference = tuple_set(&mut m);
                    let hit = m.heap.view(candidate).data[0];
                    for _ in 0..2 {
                        assert_eq!(m.member(hit, candidate), Ok(true));
                    }
                    let old = m.member(query, reference);
                    assert_eq!(m.member(query, candidate), old);
                }
                assert!(!m.heap.poisoned());
            }
        }
    }

    #[test]
    fn empty_small_and_disabled_paths_never_allocate_indexes() {
        for disabled in [false, true] {
            let mut m = machine(false, true);
            if disabled {
                m.memo.reserve_member_index(false);
            }
            let values: Vec<_> = (0..32).map(|i| Handle::int(i).unwrap()).collect();
            let empty = m.heap.canonical_test_set(&[]).unwrap();
            for _ in 0..4 {
                assert_eq!(m.member(Handle::TRUE, empty), Ok(false));
            }
            let small = m.heap.canonical_test_set(&values[..15]).unwrap();
            let small = m.heap.norm(small).unwrap();
            for _ in 0..4 {
                assert_eq!(m.member(values[0], small), Ok(true));
            }
            if disabled {
                let norm = m.heap.canonical_test_set(&values).unwrap();
                for _ in 0..4 {
                    assert_eq!(m.member(values[0], norm), Ok(true));
                }
            }
            assert_eq!(m.memo.member_index.bytes(), 0);
            assert!(!m.heap.poisoned());
        }
        assert!(!Opts::parse("-member-index").unwrap().member_index);
        assert_eq!(
            Opts::parse("-member-index").unwrap().describe(),
            "-member-index"
        );
    }

    #[test]
    fn equal_hashes_require_original_structural_comparison() {
        let mut m = machine(false, true);
        let mut values: Vec<_> = (0..32)
            .map(|i| {
                m.heap
                    .arena
                    .alloc(Kind::IntFcn, 0, 1, 7, 0, &[Handle::int(i).unwrap()])
            })
            .collect();
        let set = m.heap.set_from(&mut values);
        for i in -1..33 {
            let query = m
                .heap
                .arena
                .alloc(Kind::IntFcn, 0, 1, 7, 0, &[Handle::int(i).unwrap()]);
            for _ in 0..2 {
                assert_eq!(m.member(query, set), Ok((0..32).contains(&i)));
            }
        }
        assert_eq!(indexed(&m), 1);
        assert!(!m.heap.poisoned());
    }

    #[test]
    fn local_indexes_do_not_survive_rollback_reset_or_replaced_arena() {
        let mut m = machine(false, true);
        let set = tuple_set(&mut m);
        let query = m.heap.view(set).data[0];
        let mark = m.heap.mark();
        for _ in 0..2 {
            assert_eq!(m.member(query, set), Ok(true));
        }
        assert_eq!(indexed(&m), 1);
        let _temporary = m.heap.tuple(&[Handle::TRUE]);
        m.heap.rollback(mark);
        assert_eq!(m.member(query, set), Ok(true));
        assert_eq!(indexed(&m), 0);
        assert_eq!(m.member(query, set), Ok(true));
        assert_eq!(indexed(&m), 1);
        m.heap.reset();
        let replacement = tuple_set(&mut m);
        let query = m.heap.view(replacement).data[0];
        assert_eq!(m.member(query, replacement), Ok(true));
        assert!(!m.heap.poisoned());
        m.heap = Heap::new(Arc::clone(m.heap.store()), false, false);
        let replacement = tuple_set(&mut m);
        let query = m.heap.view(replacement).data[0];
        assert_eq!(m.member(query, replacement), Ok(true));
        assert_eq!(indexed(&m), 0);
        assert_eq!(m.member(query, replacement), Ok(true));
        assert_eq!(indexed(&m), 1);
    }

    #[test]
    fn persistent_indexes_rebind_store_and_obey_cap_shrink_and_eviction() {
        for cap in [0, 2048, 1 << 16, 1 << 20] {
            let mut m = machine(false, true);
            m.memo.set_cap(cap);
            let set = tuple_set(&mut m);
            let set = m.heap.intern_exact(set).unwrap();
            m.heap.reset();
            for i in 0..4 {
                let query = m.heap.tuple_literal(&[Handle::int(i).unwrap(); 2]);
                assert_eq!(m.member(query, set), Ok(true));
            }
            assert!(m.memo.bytes() <= cap);
            assert!(m.memo.member_index.bytes() <= m.memo.member_index.cap);
            m.memo.set_cap(0);
            assert_eq!(m.memo.member_index.bytes(), 0);
            let mut moved = machine(false, true);
            moved.memo = std::mem::take(&mut m.memo);
            moved.memo.set_cap(1 << 20);
            let set = tuple_set(&mut moved);
            let set = moved.heap.intern_exact(set).unwrap();
            let query = moved.heap.tuple_literal(&[Handle::int(3).unwrap(); 2]);
            assert_eq!(moved.member(query, set), Ok(true));
            assert!(!moved.heap.poisoned());
        }
    }

    #[test]
    fn independent_canonical_values_keep_extensional_collision_verification() {
        let mut m = machine(false, false);
        let mut values = Vec::new();
        for i in 0..32 {
            let inner = m
                .heap
                .canonical_test_set(&[Handle::int(i).unwrap()])
                .unwrap();
            let inner = m.heap.norm(inner).unwrap();
            let tuple = m.heap.tuple_literal(&[inner]);
            values.push(m.heap.intern_exact(tuple).unwrap());
        }
        let set = m.heap.set_from(&mut values);
        let set = m.heap.intern_exact(set).unwrap();
        let inner = m
            .heap
            .canonical_test_set(&[Handle::int(5).unwrap()])
            .unwrap();
        let inner = m.heap.norm(inner).unwrap();
        let query = m.heap.tuple_literal(&[inner]);
        let query = m.heap.intern_exact(query).unwrap();
        let actual = values
            .iter()
            .find(|&&h| m.heap.cmp(h, query).is_eq())
            .copied()
            .unwrap();
        assert_ne!(actual, query);
        assert!(m.heap.cmp(actual, query).is_eq());
        for _ in 0..3 {
            assert_eq!(m.member(query, set), Ok(true));
        }
        assert_eq!(indexed(&m), 1);
        assert!(!m.heap.poisoned());
    }

    #[test]
    fn tuple_and_generic_integer_function_compare_equal_without_handle_equality() {
        let mut m = machine(false, true);
        let mut values: Vec<_> = (0..32)
            .map(|i| {
                let tuple = m.heap.tuple(&[Handle::int(i).unwrap()]);
                m.heap.intern(tuple).unwrap()
            })
            .collect();
        let actual = values[5];
        let set = m.heap.set_from(&mut values);
        let set = m.heap.intern(set).unwrap();
        // The ordinary builder canonicalizes integer domains to IntFcn.
        // Build the equally valid generic representation directly instead.
        let view = m.heap.view(actual);
        let query = m.heap.store.intern(
            &mut crate::store::InternCache::default(),
            Kind::Fcn,
            0,
            0,
            view.hash,
            view.sum,
            &[Handle::int(1).unwrap(), Handle::int(5).unwrap()],
        );
        assert!(m.heap.cmp(actual, query).is_eq());
        assert!(!m.heap.eq(actual, query));
        for _ in 0..3 {
            assert_eq!(m.member(query, set), Ok(true));
        }
        assert_eq!(indexed(&m), 1);
        assert!(!m.heap.poisoned());
    }

    #[test]
    fn warm_cache_rebinds_to_a_different_store_without_using_old_handles() {
        let mut m = machine(false, true);
        let set = tuple_set(&mut m);
        let set = m.heap.intern_exact(set).unwrap();
        let query = m.heap.view(set).data[0];
        for _ in 0..2 {
            assert_eq!(m.member(query, set), Ok(true));
        }
        assert_eq!(indexed(&m), 1);
        let old = Arc::downgrade(m.heap.store());
        m.heap = Heap::new(Arc::new(Store::default()), false, false);
        let mut values: Vec<_> = (100..132)
            .map(|i| m.heap.tuple(&[Handle::int(i).unwrap()]))
            .collect();
        let new = m.heap.set_from(&mut values);
        let new = m.heap.intern_exact(new).unwrap();
        let miss = m.heap.tuple(&[Handle::int(0).unwrap()]);
        assert_eq!(m.member(miss, new), Ok(false));
        assert_eq!(indexed(&m), 0);
        assert!(old.upgrade().is_none());
        let hit = m.heap.tuple(&[Handle::int(100).unwrap()]);
        assert_eq!(m.member(hit, new), Ok(true));
        assert_eq!(indexed(&m), 1);
        assert!(!m.heap.poisoned());
    }

    #[test]
    fn body_tables_share_the_reserved_total_and_replacement_only_drops_indexes() {
        let mut m = machine(false, true);
        m.memo = Memo::new(&[1]);
        m.memo.set_cap(1 << 20);
        m.memo.reserve_member_index(true);
        for i in 0..10000 {
            let key = Handle::int(i).unwrap();
            m.memo.put(0, &[key], Handle::TRUE);
        }
        let mut sets = Vec::new();
        for i in 0..256 {
            let mut values: Vec<_> = (0..32)
                .map(|v| m.heap.tuple(&[Handle::int(i * 32 + v).unwrap()]))
                .collect();
            let set = m.heap.set_from(&mut values);
            sets.push((set, values[0]));
            for _ in 0..2 {
                assert_eq!(m.member(values[0], set), Ok(true));
            }
            assert!(m.memo.bytes() <= 1 << 20);
        }
        assert!(indexed(&m) > 0);
        // More set keys than slots force replacement. Recompute every answer.
        for (set, query) in sets {
            assert_eq!(m.member(query, set), Ok(true));
            let miss = m.heap.tuple(&[Handle::int(-1).unwrap()]);
            assert_eq!(m.member(miss, set), Ok(false));
        }
        assert!(m.memo.bytes() <= 1 << 20);
        m.memo.clear();
        assert_eq!(m.memo.bytes(), 0);
        assert!(!m.heap.poisoned());
    }

    #[test]
    fn scalar_queries_keep_the_original_search_without_index_allocation() {
        let mut m = machine(false, true);
        let values: Vec<_> = (0..32).map(|i| Handle::int(i).unwrap()).collect();
        let set = m.heap.canonical_test_set(&values).unwrap();
        let set = m.heap.norm(set).unwrap();
        for i in -1..33 {
            let query = Handle::int(i).unwrap();
            for _ in 0..3 {
                assert_eq!(m.member(query, set), Ok((0..32).contains(&i)));
            }
        }
        assert_eq!(m.memo.member_index.bytes(), 0);
    }

    #[test]
    fn big_integer_scalars_skip_indexing_but_nested_big_integer_leaves_remain_eligible() {
        for hashcons in [false, true] {
            for enabled in [false, true] {
                for nested in [false, true] {
                    let mut m = machine(false, hashcons);
                    m.memo.reserve_member_index(enabled);
                    let mut values: Vec<_> = (0..32)
                        .map(|i| {
                            let value = m.heap.int_from_i64(i64::MAX - 100 + i);
                            if nested {
                                m.heap.tuple(&[value])
                            } else {
                                value
                            }
                        })
                        .collect();
                    let set = m.heap.set_from(&mut values);
                    for (integer, expected) in [(i64::MAX - 95, true), (i64::MAX - 200, false)] {
                        let scalar = m.heap.int_from_i64(integer);
                        assert!(scalar.is_compound());
                        assert!(m.heap.is_int(scalar));
                        let query = if nested {
                            m.heap.tuple(&[scalar])
                        } else {
                            scalar
                        };
                        for _ in 0..3 {
                            assert_eq!(m.member(query, set), Ok(expected));
                        }
                        if nested && enabled {
                            assert_eq!(indexed(&m), 1);
                        } else {
                            assert_eq!(m.memo.member_index.bytes(), 0);
                            assert_eq!(m.memo.bytes(), 0);
                        }
                    }
                    assert!(!m.heap.poisoned());
                }
            }
        }
    }

    #[test]
    fn finite_fuel_retains_positive_and_exhausted_old_paths_without_reservation() {
        for enabled in [false, true] {
            let mut m = machine(false, true);
            m.opts.member_index = enabled;
            let set = tuple_set(&mut m);
            let query = m.heap.view(set).data[0];
            m.set_fuel(10000);
            for _ in 0..3 {
                assert_eq!(m.member(query, set), Ok(true));
            }
            assert_eq!(m.memo.member_index.cap, 0);
            assert_eq!(m.memo.member_index.bytes(), 0);
            let values: Vec<_> = (0..32).map(|i| Handle::int(i).unwrap()).collect();
            let raw = m.heap.canonical_test_set(&values).unwrap();
            m.set_fuel(0);
            let error = m.work_elements(raw).unwrap_err();
            assert_eq!(error.kind(), crate::ErrorKind::Unsupported);
            assert_eq!(error.message(), "the constant-folding budget");
            assert!(!m.heap.work_interrupted());
            assert_eq!(m.memo.member_index.cap, 0);
            m.set_fuel(u64::MAX);
            assert_eq!(m.memo.member_index.cap != 0, enabled);
            assert_eq!(m.charge(1_000_000), Ok(()));
            assert_eq!(m.fuel, u64::MAX);
            for _ in 0..2 {
                assert_eq!(m.member(query, set), Ok(true));
            }
            assert_eq!(indexed(&m), usize::from(enabled));
        }
    }

    #[test]
    fn warm_indexes_keep_unknown_children_and_lazy_roots_refused() {
        for tlc in [false, true] {
            let mut m = machine(tlc, true);
            let set = tuple_set(&mut m);
            let query = m.heap.view(set).data[0];
            for _ in 0..3 {
                assert_eq!(m.member(query, set), Ok(true));
            }
            let interval = m.heap.interval(0, 1);
            let symbolic = m.heap.symbolic(Kind::SeqSet, 0, &[interval]);
            let unknown = m.heap.tuple_literal(&[symbolic]);
            let view = m.heap.view(set);
            let (hash, sum, mut children) = (view.hash, view.sum, view.data.to_vec());
            let lazy =
                m.heap
                    .arena
                    .alloc(Kind::Set, crate::node::flags::LAZY, 0, hash, sum, &children);
            children.push(unknown);
            let unknown_set = m.heap.set_from(&mut children);
            for (query, set) in [(unknown, set), (query, lazy), (query, unknown_set)] {
                for _ in 0..3 {
                    let error = m.member(query, set).unwrap_err();
                    assert_eq!(error.kind(), crate::ErrorKind::Unsupported);
                    assert!(error.message().contains("mathematical identity"));
                    assert_eq!(error.tlc(), None);
                }
            }
            assert!(!m.heap.poisoned());
        }
    }

    // Builders prove deep eager values concrete bottom-up (`flags::CONCRETE`),
    // so the guard's 64-level recursion bound no longer refuses them. The
    // index and the full admission must still agree, and answer correctly.
    #[test]
    fn index_elements_agree_with_whole_set_admission_beyond_recursion_bound() {
        for tlc in [false, true] {
            let mut m = machine(tlc, true);
            let mut elements = Vec::new();
            for i in 0..16 {
                let mut value = Handle::int(i).unwrap();
                for _ in 0..63 {
                    value = m.heap.tuple_literal(&[value]);
                }
                elements.push(value);
            }
            let set = m.heap.set_from(&mut elements);
            let query = elements[0];
            let mut absent = Handle::int(99).unwrap();
            for _ in 0..63 {
                absent = m.heap.tuple_literal(&[absent]);
            }
            assert!(crate::compare::materialized(&m.heap, query, 0).unwrap());
            assert!(crate::compare::materialized(&m.heap, set, 0).unwrap());
            for _ in 0..3 {
                assert!(m.member(query, set).unwrap());
                assert!(!m.member(absent, set).unwrap());
            }
            assert!(!m.heap.poisoned());
        }
    }

    #[derive(Debug)]
    struct Stop;
    impl crate::eval::WorkControl for Stop {
        fn proceed(&self) -> bool {
            false
        }
    }

    #[test]
    fn warm_index_hits_and_misses_keep_actual_work_interruption() {
        for hit in [false, true] {
            let mut m = machine(false, true);
            let set = tuple_set(&mut m);
            let present = m.heap.view(set).data[0];
            for _ in 0..3 {
                assert_eq!(m.member(present, set), Ok(true));
            }
            assert_eq!(indexed(&m), 1);
            let query = if hit {
                present
            } else {
                m.heap.tuple_literal(&[Handle::int(-1).unwrap(); 2])
            };
            m.set_work_control(Some(Arc::new(Stop)));
            // Work polling is amortized; even repeated warm lookups must
            // reach the installed owner instead of returning indefinitely.
            let mut stopped = false;
            for _ in 0..128 {
                let result = m.member(query, set);
                if matches!(result, Err(ref error) if error.kind() == crate::ErrorKind::Stop) {
                    stopped = true;
                    break;
                }
                assert_eq!(result, Ok(hit));
            }
            assert!(stopped);
            assert!(m.heap.work_interrupted());
            assert_eq!(indexed(&m), 1);
        }
    }

    #[test]
    fn index_build_uses_the_actual_work_owner() {
        let mut m = machine(false, true);
        let set = tuple_set(&mut m);
        let query = m.heap.view(set).data[0];
        assert_eq!(m.member(query, set), Ok(true));
        m.set_work_control(Some(Arc::new(Stop)));
        let result = m.member(query, set);
        assert!(matches!(result, Err(e) if e.kind() == crate::ErrorKind::Stop));
        assert!(m.heap.work_interrupted());
        assert_eq!(indexed(&m), 0);
    }
}