Metrics for Kahan p13 Example 3

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze148.0ms (7.2%)

Memory

3.1MiB live, 51.6MiB allocated

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
0%	0%	100%	0%	0%	0%	0%	1
0%	0%	100%	0%	0%	0%	0%	2
50%	50%	50%	0%	0%	0%	0%	3
50%	50%	50%	0%	0%	0%	0%	4
50%	50%	50%	0%	0%	0%	0%	5
50%	50%	50%	0%	0%	0%	0%	6
50%	50%	50%	0%	0%	0%	0%	7
50%	50%	50%	0%	0%	0%	0%	8
50%	50%	50%	0%	0%	0%	0%	9
50%	50%	50%	0%	0%	0%	0%	10
50%	50%	50%	0%	0%	0%	0%	11
50%	50%	49.9%	0%	0%	0%	0%	12

Compiler

Compiled 31 to 14 computations (54.8% saved)

sample24.0ms (1.2%)

Memory

2.1MiB live, 9.5MiB allocated

Samples

17.0ms

260×

valid

Precisions

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

ival-div: 6.0ms (47.3% of total)

ival-sub: 2.0ms (15.8% of total)

ival-add: 2.0ms (15.8% of total)

ival-mult: 2.0ms (15.8% of total)

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

Bogosity

explain1.7s (81.1%)

Memory

6.9MiB live, 1 264.0MiB allocated

FPErrors

Click to see full error table

Ground Truth	Overpredictions	Example	Example	Subexpression
136	57	(4.312545225791754e+38)	-	`(-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))`
0	0	-	-	`(/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))`
0	0	-	-	`(/.f64 #s(literal 2 binary64) t)`
0	0	-	-	`(/.f64 #s(literal 1 binary64) (+.f64 #s(literal 2 binary64) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))))))`
0	0	-	-	`t`
0	0	-	-	`#s(literal 1 binary64)`
0	256	(8.886421666408698e-271)	-	`(-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (+.f64 #s(literal 2 binary64) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))))))`
0	63	(-2.076359655157428e+124)	-	`(+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))`
0	0	-	-	`#s(literal 2 binary64)`
0	0	-	-	`(+.f64 #s(literal 2 binary64) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))))`
0	0	-	-	`(/.f64 #s(literal 1 binary64) t)`
0	0	-	-	`(*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))))`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`-.f64`	`(-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (+.f64 #s(literal 2 binary64) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))))))`	cancellation	256
`-.f64`	`(-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))`	cancellation	65
`+.f64`	`(+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))`	cancellation	8

Confusion

	Predicted +	Predicted -
+	0	0
-	256	0

Precision

0.0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	256	0	0

Precision?

0.0

Recall?

0/0

Freqs

test

number	freq
1	183
2	73

Total Confusion?

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

Precision?

0.0

Recall?

0/0

Total Time

9.39892578125

Average Time

0.03671455383300781

Samples

184.0ms	996×	1	valid
183.0ms	624×	2	valid
103.0ms	1 452×	0	valid

Compiler

Compiled 5 340 to 600 computations (88.8% saved)

Precisions

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

ival-div: 125.0ms (35.1% of total)

adjust: 98.0ms (27.5% of total)

ival-mult: 45.0ms (12.6% of total)

ival-sub: 42.0ms (11.8% of total)

ival-add: 41.0ms (11.5% of total)

ival-true: 2.0ms (0.6% of total)

exact: 2.0ms (0.6% of total)

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

preprocess190.0ms (9.3%)

Memory

0.4MiB live, 37.3MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	67
1	33	58
2	91	58
3	260	42
4	836	42
5	2865	38
6	5372	38
7	7003	38
8	7972	38
0	12	29
0	21	29
1	31	29
2	60	29
3	153	21
4	494	21
5	2053	19
6	5240	19
7	7918	19
0	8066	18

Stop Event

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

Calls

Call 1

Inputs
(-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (+.f64 #s(literal 2 binary64) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))))))

Inputs

(-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (+.f64 #s(literal 2 binary64) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))))))

Outputs
(-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (+.f64 #s(literal 2 binary64) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))))))
(-.f64 (/.f64 #s(literal -1 binary64) (fma.f64 (/.f64 #s(literal -4 binary64) (-.f64 #s(literal -1 binary64) t)) (-.f64 #s(literal -2 binary64) (/.f64 #s(literal -1 binary64) (-.f64 t #s(literal -1 binary64)))) #s(literal 6 binary64))) #s(literal -1 binary64))

Outputs

(-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (+.f64 #s(literal 2 binary64) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))))))

(-.f64 (/.f64 #s(literal -1 binary64) (fma.f64 (/.f64 #s(literal -4 binary64) (-.f64 #s(literal -1 binary64) t)) (-.f64 #s(literal -2 binary64) (/.f64 #s(literal -1 binary64) (-.f64 t #s(literal -1 binary64)))) #s(literal 6 binary64))) #s(literal -1 binary64))

Compiler

Compiled 29 to 12 computations (58.6% saved)

eval0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune1.0ms (0%)

Memory

0.5MiB live, 0.5MiB allocated

Alt Table

Click to see full alt table

Status	Accuracy	Program
	100.0%	(-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (+.f64 #s(literal 2 binary64) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))))))

Status

Accuracy

Program

100.0%

(-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (+.f64 #s(literal 2 binary64) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))))))

Compiler

Compiled 58 to 24 computations (58.6% saved)

simplify24.0ms (1.2%)

Memory

0.4MiB live, 18.4MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	29
1	21	29
2	36	29
3	58	29
4	90	29
5	137	29
6	225	29
7	270	29
8	312	29
9	341	29
10	365	29

Stop Event

1×

saturated

Calls

Call 1

Inputs
(-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (+.f64 #s(literal 2 binary64) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))))))

Inputs

(-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (+.f64 #s(literal 2 binary64) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))))))

Outputs
(-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (+.f64 #s(literal 2 binary64) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))))))
(-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (+.f64 (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 (/.f64 #s(literal 1 binary64) t) #s(literal 1 binary64)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 (/.f64 #s(literal 1 binary64) t) #s(literal 1 binary64))))) #s(literal 2 binary64))))

Outputs

(-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (+.f64 #s(literal 2 binary64) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))))))

(-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (+.f64 (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 (/.f64 #s(literal 1 binary64) t) #s(literal 1 binary64)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 (/.f64 #s(literal 1 binary64) t) #s(literal 1 binary64))))) #s(literal 2 binary64))))

soundness0.0ms (0%)

Memory

0.2MiB live, 0.2MiB allocated

Stop Event

1×

fuel

Compiler

Compiled 29 to 12 computations (58.6% saved)

preprocess1.0ms (0%)

Memory: 0.4MiB live, 0.4MiB allocated
Compiler: Compiled 116 to 48 computations (58.6% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

Iter	Nodes	Cost
0	12	29
1	21	29
2	36	29
3	58	29
4	90	29
5	137	29
6	225	29
7	270	29
8	312	29
9	341	29
10	365	29

Iter	Nodes	Cost
0	12	29
1	21	29
2	36	29
3	58	29
4	90	29
5	137	29
6	225	29
7	270	29
8	312	29
9	341	29
10	365	29

start0.0ms (0%)

analyze148.0ms (7.2%)

sample24.0ms (1.2%)

explain1.7s (81.1%)

preprocess190.0ms (9.3%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify24.0ms (1.2%)

soundness0.0ms (0%)

preprocess1.0ms (0%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	12	29
1	21	29
2	36	29
3	58	29
4	90	29
5	137	29
6	225	29
7	270	29
8	312	29
9	341	29
10	365	29