# Seeds for failure cases proptest has generated in the past. It is
# automatically read and these particular cases re-run before any
# novel cases are generated.
#
# It is recommended to check this file in to source control so that
# everyone who runs the test benefits from these saved cases.
cc 240d506f2ff2e41688a3eb5beff2971bbdf960653df4149e0d40e32c09c1d1ef # a meet of two tuples asked as the one tuple of its items' meets
cc 022a89daf3486413aae3d56211d79df65b905a65a0a5de55dfd0fd72ff924dfc # a meet of two lists asked as the one list of its items' meets
cc 7dfa290bbfc5d88de62f01b5b01c5a1a9129332fb01172ddbf916d7af822be13 # shrinks to sub = Seq { container: List, shape: SeqShape { prefix: [Seq { container: Tuple, shape: SeqShape { prefix: [], tail: Some(Seq { container: List, shape: SeqShape { prefix: [], tail: Some(Seq { container: Tuple, shape: SeqShape { prefix: [Anything(Top), Nothing], tail: None } }) } }) } }, Ref(DefIx(1))], tail: None } }, sup = Complement(Refine { base: Anything(Any), constraints: [Lt(OperandIx(0))] }), defs = [Union([Coll { container: FrozenSet, element: Coll { container: FrozenSet, element: Nothing } }, Seq { container: List, shape: SeqShape { prefix: [], tail: Some(Complement(Ref(DefIx(0)))) } }]), Union([KeyedMap { fields: [], defaults: [MapClause { key: Literal(ConstIx(3)), value: Literal(ConstIx(4)) }, MapClause { key: Str, value: Bytes }] }, Seq { container: List, shape: SeqShape { prefix: [], tail: Some(Complement(Ref(DefIx(0)))) } }])]
