Metrics for Toniolo and Linder, Equation (7)

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage

analyze319.0ms (9.2%)

Memory

-10.9MiB live, 407.2MiB allocated; 50ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
0%	0%	99.9%	0.1%	0%	0%	0%	1
0%	0%	99.9%	0.1%	0%	0%	0%	2
0%	0%	99.9%	0.1%	0%	0%	0%	3
0%	0%	99.9%	0.1%	0%	0%	0%	4
0%	0%	99.9%	0.1%	0%	0%	0%	5
0%	0%	99.9%	0.1%	0%	0%	0%	6
0%	0%	99.9%	0.1%	0%	0%	0%	7
0%	0%	74.9%	0.1%	0%	25%	0%	8
4.2%	3.1%	71.8%	0.1%	0%	25%	0%	9
6.3%	4.7%	70.2%	0.1%	0%	25%	0%	10
11.3%	7%	55.4%	0.1%	0%	37.4%	0%	11
16.9%	10.5%	51.9%	0.1%	0%	37.4%	0%	12

Compiler

Compiled 29 to 20 computations (31% saved)

sample2.8s (80.5%)

Memory

102.3MiB live, 3 337.5MiB allocated; 579ms collecting garbage

Samples

663.0ms	5 359×	0	valid
626.0ms	2 682×	1	valid
441.0ms	1 725×	1	invalid
301.0ms	2 858×	0	invalid
73.0ms	215×	2	valid
36.0ms	108×	2	invalid

Precisions

Click to see histograms. Total time spent on operations: 1.6s

ival-mult: 506.0ms (30.8% of total)

adjust: 273.0ms (16.6% of total)

ival-sqrt: 249.0ms (15.2% of total)

ival-div: 223.0ms (13.6% of total)

ival-add: 204.0ms (12.4% of total)

ival-sub: 166.0ms (10.1% of total)

exact: 16.0ms (1% of total)

ival-assert: 5.0ms (0.3% of total)

Bogosity

explain260.0ms (7.5%)

Memory

-8.0MiB live, 371.7MiB allocated; 56ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Overpredictions	Example	Underpredictions	Example	Subexpression
132	0	-	3	(7.285054253211948e+213 1.18291277329482e-129 -2.485765610491263e-162)	`(sqrt.f64 (-.f64 (.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (.f64 l l) (.f64 #s(literal 2 binary64) (.f64 t t)))) (*.f64 l l)))`
99	1	(7.285054253211948e+213 1.18291277329482e-129 -2.485765610491263e-162)	0	-	`(-.f64 (.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (.f64 l l) (.f64 #s(literal 2 binary64) (.f64 t t)))) (*.f64 l l))`
0	0	-	0	-	`(/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64)))`
0	0	-	0	-	`(.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (.f64 l l) (.f64 #s(literal 2 binary64) (.f64 t t))))`
0	0	-	0	-	`#s(literal 1 binary64)`
0	0	-	0	-	`t`
0	0	-	0	-	`(.f64 #s(literal 2 binary64) (.f64 t t))`
0	0	-	0	-	`(*.f64 (sqrt.f64 #s(literal 2 binary64)) t)`
0	0	-	0	-	`(+.f64 x #s(literal 1 binary64))`
0	0	-	0	-	`(*.f64 l l)`
0	0	-	0	-	`(sqrt.f64 #s(literal 2 binary64))`
0	0	-	0	-	`(/.f64 (.f64 (sqrt.f64 #s(literal 2 binary64)) t) (sqrt.f64 (-.f64 (.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (.f64 l l) (.f64 #s(literal 2 binary64) (.f64 t t)))) (.f64 l l))))`
0	0	-	0	-	`(*.f64 t t)`
0	0	-	0	-	`#s(literal 2 binary64)`
0	0	-	0	-	`(-.f64 x #s(literal 1 binary64))`
0	0	-	0	-	`l`
0	0	-	0	-	`(+.f64 (.f64 l l) (.f64 #s(literal 2 binary64) (*.f64 t t)))`
0	0	-	0	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`sqrt.f64`	`(sqrt.f64 (-.f64 (.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (.f64 l l) (.f64 #s(literal 2 binary64) (.f64 t t)))) (*.f64 l l)))`	oflow-rescue	113	0
↳	`(-.f64 (.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (.f64 l l) (.f64 #s(literal 2 binary64) (.f64 t t)))) (*.f64 l l))`	overflow	113
↳	`(.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (.f64 l l) (.f64 #s(literal 2 binary64) (.f64 t t))))`	overflow	133
↳	`(.f64 #s(literal 2 binary64) (.f64 t t))`	overflow	96
↳	`(+.f64 (.f64 l l) (.f64 #s(literal 2 binary64) (*.f64 t t)))`	overflow	133
↳	`(*.f64 t t)`	overflow	96
↳	`(*.f64 l l)`	overflow	112
`-.f64`	`(-.f64 (.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (.f64 l l) (.f64 #s(literal 2 binary64) (.f64 t t)))) (*.f64 l l))`	nan-rescue	56	0
↳	`(.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (.f64 l l) (.f64 #s(literal 2 binary64) (.f64 t t))))`	overflow	133
↳	`(.f64 #s(literal 2 binary64) (.f64 t t))`	overflow	96
↳	`(+.f64 (.f64 l l) (.f64 #s(literal 2 binary64) (*.f64 t t)))`	overflow	133
↳	`(*.f64 t t)`	overflow	96
↳	`(*.f64 l l)`	overflow	56
↳	`(*.f64 l l)`	overflow	56
`-.f64`	`(-.f64 (.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (.f64 l l) (.f64 #s(literal 2 binary64) (.f64 t t)))) (*.f64 l l))`	cancellation	44	0
`sqrt.f64`	`(sqrt.f64 (-.f64 (.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (.f64 l l) (.f64 #s(literal 2 binary64) (.f64 t t)))) (*.f64 l l)))`	uflow-rescue	16	0
↳	`(-.f64 (.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (.f64 l l) (.f64 #s(literal 2 binary64) (.f64 t t)))) (*.f64 l l))`	underflow	16
↳	`(.f64 (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (+.f64 (.f64 l l) (.f64 #s(literal 2 binary64) (.f64 t t))))`	underflow	13
↳	`(.f64 #s(literal 2 binary64) (.f64 t t))`	underflow	52
↳	`(+.f64 (.f64 l l) (.f64 #s(literal 2 binary64) (*.f64 t t)))`	underflow	13
↳	`(*.f64 t t)`	underflow	52
↳	`(*.f64 l l)`	underflow	122

Confusion

	Predicted +	Predicted -
+	193	0
-	0	63

Precision

1.0

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	193	0	0
-	0	0	63

Precision?

1.0

Recall?

1.0

Freqs

test

number	freq
0	63
1	157
2	36

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	1	0	0
-	0	0	0

Precision?

1.0

Recall?

1.0

Samples

48.0ms	176×	1	valid
41.0ms	320×	0	valid
6.0ms	16×	2	valid

Compiler

Compiled 293 to 58 computations (80.2% saved)

Precisions

Click to see histograms. Total time spent on operations: 68.0ms

ival-mult: 24.0ms (35.4% of total)

ival-sqrt: 12.0ms (17.7% of total)

adjust: 10.0ms (14.8% of total)

ival-div: 8.0ms (11.8% of total)

ival-add: 7.0ms (10.3% of total)

ival-sub: 6.0ms (8.9% of total)

exact: 1.0ms (1.5% of total)

ival-assert: 0.0ms (0% of total)

ival-true: 0.0ms (0% of total)

preprocess98.0ms (2.8%)

Memory

-3.3MiB live, 92.7MiB allocated; 27ms collecting garbage

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	71	277
1	240	277
2	1005	277
3	5590	277
0	18	27
0	31	27
1	69	27
2	243	27
3	1253	27
4	6639	27
0	8479	27

Stop Event

1×	iter limit
1×	node limit
1×	iter limit
1×	node limit

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze319.0ms (9.2%)

sample2.8s (80.5%)

explain260.0ms (7.5%)

preprocess98.0ms (2.8%)

end0.0ms (0%)

Profiling