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
|
# This file is part of Hypothesis, which may be found at
# https://github.com/HypothesisWorks/hypothesis/
#
# Copyright the Hypothesis Authors.
# Individual contributors are listed in AUTHORS.rst and the git log.
#
# This Source Code Form is subject to the terms of the Mozilla Public License,
# v. 2.0. If a copy of the MPL was not distributed with this file, You can
# obtain one at https://mozilla.org/MPL/2.0/.
import contextlib
import itertools
from random import Random
import pytest
from hypothesis import HealthCheck, Phase, settings, strategies as st
from hypothesis.database import (
InMemoryExampleDatabase,
choices_from_bytes,
choices_to_bytes,
)
from hypothesis.errors import StopTest
from hypothesis.internal.conjecture.data import ConjectureData, Status
from hypothesis.internal.conjecture.engine import ConjectureRunner, RunIsComplete
from hypothesis.internal.conjecture.pareto import ParetoFront
from hypothesis.internal.entropy import deterministic_PRNG
from tests.conjecture.common import interesting_origin
def test_pareto_front_contains_different_interesting_reasons():
with deterministic_PRNG():
def test(data):
data.target_observations[""] = 1
n = data.draw_integer(0, 2**4 - 1)
data.mark_interesting(interesting_origin(n))
runner = ConjectureRunner(
test,
settings=settings(
max_examples=5000,
database=InMemoryExampleDatabase(),
suppress_health_check=list(HealthCheck),
),
database_key=b"stuff",
)
runner.run()
assert len(runner.pareto_front) == 2**4
def test_pareto_front_omits_invalid_examples():
with deterministic_PRNG():
def test(data):
x = data.draw_integer(0, 2**4 - 1)
if x % 2:
data.target_observations[""] = 1
data.mark_invalid()
runner = ConjectureRunner(
test,
settings=settings(
max_examples=5000,
database=InMemoryExampleDatabase(),
suppress_health_check=list(HealthCheck),
),
database_key=b"stuff",
)
runner.run()
assert len(runner.pareto_front) == 0
def test_database_contains_only_pareto_front():
with deterministic_PRNG():
def test(data):
data.target_observations["1"] = data.draw(st.integers(0, 2**4))
data.draw(st.integers(0, 2**64))
data.target_observations["2"] = data.draw(st.integers(0, 2**8))
assert len(set(db.fetch(b"stuff.pareto"))) == len(runner.pareto_front)
db = InMemoryExampleDatabase()
runner = ConjectureRunner(
test,
settings=settings(
max_examples=500, database=db, suppress_health_check=list(HealthCheck)
),
database_key=b"stuff",
)
runner.run()
assert len(runner.pareto_front) <= 500
for v in runner.pareto_front:
assert v.status >= Status.VALID
values = set(db.fetch(b"stuff.pareto"))
assert len(values) == len(runner.pareto_front), {
choices_to_bytes(data.choices) for data in runner.pareto_front
}.symmetric_difference(values)
for data in runner.pareto_front:
assert choices_to_bytes(data.choices) in values
assert data in runner.pareto_front
for b in values:
choices = choices_from_bytes(b)
assert runner.cached_test_function(choices) in runner.pareto_front
def test_clears_defunct_pareto_front():
with deterministic_PRNG():
def test(data):
data.target_observations[""] = 1
data.draw_integer(0, 2**8 - 1)
data.draw_integer(0, 2**8 - 1)
db = InMemoryExampleDatabase()
runner = ConjectureRunner(
test,
settings=settings(
max_examples=10000,
database=db,
suppress_health_check=list(HealthCheck),
phases=[Phase.reuse],
),
database_key=b"stuff",
)
for i in range(256):
db.save(runner.pareto_key, choices_to_bytes((i, 0)))
runner.run()
assert len(list(db.fetch(runner.pareto_key))) == 1
def test_down_samples_the_pareto_front():
with deterministic_PRNG():
def test(data):
data.draw_integer(0, 2**8 - 1)
data.draw_integer(0, 2**8 - 1)
db = InMemoryExampleDatabase()
runner = ConjectureRunner(
test,
settings=settings(
max_examples=1000,
database=db,
suppress_health_check=list(HealthCheck),
phases=[Phase.reuse],
),
database_key=b"stuff",
)
for n1, n2 in itertools.product(range(256), range(256)):
db.save(runner.pareto_key, choices_to_bytes((n1, n2)))
with pytest.raises(RunIsComplete):
runner.reuse_existing_examples()
assert runner.valid_examples == 1000
def test_stops_loading_pareto_front_if_interesting():
with deterministic_PRNG():
def test(data):
data.draw_integer()
data.draw_integer()
data.mark_interesting(interesting_origin())
db = InMemoryExampleDatabase()
runner = ConjectureRunner(
test,
settings=settings(
max_examples=1000,
database=db,
suppress_health_check=list(HealthCheck),
phases=[Phase.reuse],
),
database_key=b"stuff",
)
for n1, n2 in itertools.product(range(256), range(256)):
db.save(runner.pareto_key, choices_to_bytes((n1, n2)))
runner.reuse_existing_examples()
assert runner.call_count == 1
def test_uses_tags_in_calculating_pareto_front():
with deterministic_PRNG():
def test(data):
data.target_observations[""] = 1
if data.draw_boolean():
data.start_span(11)
data.draw_integer(0, 2**8 - 1)
data.stop_span()
runner = ConjectureRunner(
test,
settings=settings(max_examples=10, database=InMemoryExampleDatabase()),
database_key=b"stuff",
)
runner.run()
assert len(runner.pareto_front) == 2
def test_optimises_the_pareto_front():
def test(data):
count = 0
while data.draw_integer(0, 2**8 - 1):
count += 1
data.target_observations[""] = min(count, 5)
runner = ConjectureRunner(
test,
settings=settings(max_examples=10000, database=InMemoryExampleDatabase()),
database_key=b"stuff",
)
runner.cached_test_function([255] * 20 + [0])
runner.pareto_optimise()
assert len(runner.pareto_front) == 6
for i, data in enumerate(runner.pareto_front):
assert data.choices == (1,) * i + (0,)
def test_does_not_optimise_the_pareto_front_if_interesting():
def test(data):
n = data.draw_integer(0, 2**8 - 1)
data.target_observations[""] = n
if n == 255:
data.mark_interesting(interesting_origin())
runner = ConjectureRunner(
test,
settings=settings(max_examples=10000, database=InMemoryExampleDatabase()),
database_key=b"stuff",
)
runner.cached_test_function([0])
runner.pareto_optimise = None
runner.optimise_targets()
assert runner.interesting_examples
def test_stops_optimising_once_interesting():
hi = 2**16 - 1
def test(data):
n = data.draw_integer(0, 2**16 - 1)
data.target_observations[""] = n
if n < hi:
data.mark_interesting(interesting_origin())
runner = ConjectureRunner(
test,
settings=settings(max_examples=10000, database=InMemoryExampleDatabase()),
database_key=b"stuff",
)
data = runner.cached_test_function([hi])
assert data.status == Status.VALID
runner.pareto_optimise()
assert runner.call_count <= 20
assert runner.interesting_examples
def test_pareto_contains():
front = ParetoFront(random=Random())
assert "not a data" not in front
data = ConjectureData.for_choices([])
with contextlib.suppress(StopTest):
data.mark_overrun()
# check a data which turns into an Overrun when .as_result is called
assert data not in front
|
