Metrics for Development.Shake.Profile:generateTrace from shake-0.15.5

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze0.0ms (0%)

Memory

0.4MiB live, 0.4MiB allocated

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
100%	100%	0%	0%	0%	0%	0%	1

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample769.0ms (66.9%)

Memory

0.4MiB live, 598.0MiB allocated

Samples

493.0ms

8 256×

valid

Precisions

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

ival-sub: 38.0ms (43% of total)

ival-mult: 37.0ms (41.9% of total)

ival-true: 5.0ms (5.7% of total)

exact: 5.0ms (5.7% of total)

ival-assert: 3.0ms (3.4% of total)

Bogosity

explain142.0ms (12.4%)

Memory

-4.9MiB live, 77.9MiB allocated

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(-.f64 x x)`
-	-	`(*.f64 #s(literal 1000000 binary64) (-.f64 x x))`
-	-	`#s(literal 1000000 binary64)`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

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

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

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

Precision?

0/0

Recall?

0/0

Samples

120.0ms

512×

valid

Compiler

Compiled 30 to 16 computations (46.7% saved)

Precisions

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

ival-sub: 7.0ms (74.5% of total)

ival-mult: 1.0ms (10.6% of total)

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

exact: 0.0ms (0% of total)

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

preprocess17.0ms (1.5%)

Memory

-3.9MiB live, 32.5MiB allocated

Algorithm

1×	egg-herbie

Rules

8×	`lower-+.f64`
8×	`sub-neg`
8×	`lower-+.f32`
8×	`distribute-lft-neg-in`
6×	`lower--.f64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	2
1	22	2
2	30	2
3	45	2
4	52	2
5	54	2
0	4	5
0	6	1
1	10	1
2	13	1
3	15	1
4	17	1
5	19	1
6	23	1
7	28	1
0	28	1

Stop Event

1×	iter limit
1×	saturated
1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))

Outputs
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))
#s(literal 0 binary64)

Compiler

Compiled 6 to 4 computations (33.3% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

1.6MiB live, 1.7MiB allocated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 #s(literal 1000000 binary64) (-.f64 x x))

Compiler

Compiled 6 to 4 computations (33.3% saved)

simplify4.0ms (0.4%)

Memory

10.2MiB live, 10.2MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	192	(-.f64 x x)
cost-diff	320	(*.f64 #s(literal 1000000 binary64) (-.f64 x x))

Rules

8×	`lower-+.f64`
8×	`sub-neg`
8×	`lower-+.f32`
6×	`lower--.f64`
6×	`lower--.f32`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	4
1	10	4
2	13	4
3	15	4
4	17	4
5	19	4
6	23	4
7	28	4
0	28	4

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

Inputs
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))
#s(literal 1000000 binary64)
(-.f64 x x)
x

Outputs
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))
#s(literal 0 binary64)
#s(literal 1000000 binary64)
(-.f64 x x)
#s(literal 0 binary64)
x

localize14.0ms (1.2%)

Memory

-8.9MiB live, 28.4MiB allocated

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0	(-.f64 x x)
accuracy	0	(*.f64 #s(literal 1000000 binary64) (-.f64 x x))

Samples

9.0ms

256×

valid

Compiler

Compiled 12 to 6 computations (50% saved)

Precisions

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

ival-sub: 1.0ms (43.8% of total)

ival-mult: 1.0ms (43.8% of total)

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

exact: 0.0ms (0% of total)

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

series1.0ms (0.1%)

Memory

1.4MiB live, 1.4MiB allocated

Counts

2 → 24

Calls

Call 1

Inputs
#s(alt (.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())
#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())

Inputs

#s(alt (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())

#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())

Outputs
#s(alt 0 (taylor 0 x) (#s(alt (.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt (.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt (.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt (.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())

Calls

6 calls:

Time	Variable		Point	Expression
0.0ms	x	@	0	(* 1000000 (- x x))
0.0ms	x	@	inf	(* 1000000 (- x x))
0.0ms	x	@	-inf	(* 1000000 (- x x))
0.0ms	x	@	-inf	(- x x)
0.0ms	x	@	inf	(- x x)

simplify3.0ms (0.3%)

Memory

6.3MiB live, 6.3MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	24
0	1	24

Stop Event

1×	saturated
1×	saturated

Counts

24 → 24

Calls

Call 1

Inputs
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0

Outputs
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)

rewrite30.0ms (2.6%)

Memory

13.5MiB live, 50.2MiB allocated

Rules

28×	`lower-*.f64`
28×	`lower-*.f32`
28×	`lower-fma.f64`
28×	`lower-+.f64`
28×	`lower-fma.f32`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	8
0	6	2
1	20	2
0	84	2

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

2 → 2

Calls

Call 1

Inputs
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))
(-.f64 x x)

Outputs
#s(literal 0 binary64)
#s(literal 0 binary64)

eval2.0ms (0.2%)

Memory: 5.3MiB live, 5.3MiB allocated
Compiler: Compiled 77 to 4 computations (94.8% saved)

prune1.0ms (0.1%)

Memory

3.9MiB live, 4.0MiB allocated

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	25	1	26
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	26	1	27

Accuracy

100.0%

Counts

27 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))

Compiler

Compiled 3 to 2 computations (33.3% saved)

simplify15.0ms (1.3%)

Memory

-27.3MiB live, 12.6MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
cost-diff	0	#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))

Rules

8×	`lower-+.f64`
8×	`sub-neg`
8×	`lower-+.f32`
6×	`lower--.f64`
6×	`lower--.f32`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	8
0	6	4
1	10	4
2	13	4
3	15	4
4	17	4
5	19	4
6	23	4
7	28	4
0	28	4

Stop Event

1×	iter limit
1×	saturated
1×	saturated

Calls

Call 1

Inputs
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))
#s(literal 0 binary64)

Outputs
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))
#s(literal 0 binary64)

localize10.0ms (0.9%)

Memory

23.0MiB live, 23.0MiB allocated

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
accuracy	0	#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))

Samples

6.0ms

256×

valid

Compiler

Compiled 8 to 7 computations (12.5% saved)

Precisions

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

ival-sub: 1.0ms (43.8% of total)

ival-mult: 1.0ms (43.8% of total)

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

exact: 0.0ms (0% of total)

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

series0.0ms (0%)

Memory

0.7MiB live, 0.7MiB allocated

Counts

1 → 12

Calls

Call 1

Inputs
#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())

Outputs
#s(alt 0 (taylor 0 x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	0	(* 1000000 (- x x))
0.0ms	x	@	inf	(* 1000000 (- x x))
0.0ms	x	@	-inf	(* 1000000 (- x x))

simplify6.0ms (0.5%)

Memory

-29.8MiB live, 6.7MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	12
0	1	12

Stop Event

1×	saturated
1×	saturated

Counts

12 → 12

Calls

Call 1

Inputs
0
0
0
0
0
0
0
0
0
0
0
0

Outputs
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)

rewrite53.0ms (4.6%)

Memory

11.0MiB live, 46.7MiB allocated

Rules

28×	`lower-*.f64`
28×	`lower-*.f32`
28×	`lower-fma.f64`
28×	`lower-+.f64`
28×	`lower-fma.f32`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	7
0	6	3
1	20	3
0	84	3

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	saturated

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))

Outputs
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))

eval1.0ms (0.1%)

Memory: 2.9MiB live, 2.9MiB allocated
Compiler: Compiled 27 to 2 computations (92.6% saved)

prune1.0ms (0.1%)

Memory

2.6MiB live, 2.6MiB allocated

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	13	0	13
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	13	1	14

Accuracy

100.0%

Counts

14 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))

Compiler

Compiled 11 to 7 computations (36.4% saved)

regimes4.0ms (0.3%)

Memory

9.9MiB live, 9.9MiB allocated

Accuracy

Total 0b remaining (0%)

Threshold costs 0b (0%)

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))

Outputs
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))

Calls

3 calls:

1.0ms	x
1.0ms	(-.f64 x x)
1.0ms	(*.f64 #s(literal 1000000 binary64) (-.f64 x x))

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`(*.f64 #s(literal 1000000 binary64) (-.f64 x x))`
100.0%	1	`(-.f64 x x)`

Compiler

Compiled 12 to 7 computations (41.7% saved)

simplify6.0ms (0.5%)

Memory

13.2MiB live, 13.2MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	7

Stop Event

1×

saturated

Calls

Call 1

Inputs
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))

Outputs
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))

soundness30.0ms (2.6%)

Memory

-31.4MiB live, 4.9MiB allocated

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	24
0	1	24

Stop Event

1×	done
1×	saturated
1×	saturated

Compiler

Compiled 5 to 4 computations (20% saved)

preprocess38.0ms (3.3%)

Memory: 10.7MiB live, 61.6MiB allocated
Compiler: Compiled 22 to 16 computations (27.3% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

Iter	Nodes	Cost
0	6	2
1	22	2
2	30	2
3	45	2
4	52	2
5	54	2
0	4	5
0	6	1
1	10	1
2	13	1
3	15	1
4	17	1
5	19	1
6	23	1
7	28	1
0	28	1

Iter	Nodes	Cost
0	6	2
1	22	2
2	30	2
3	45	2
4	52	2
5	54	2
0	4	5
0	6	1
1	10	1
2	13	1
3	15	1
4	17	1
5	19	1
6	23	1
7	28	1
0	28	1

start0.0ms (0%)

analyze0.0ms (0%)

sample769.0ms (66.9%)

explain142.0ms (12.4%)

preprocess17.0ms (1.5%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify4.0ms (0.4%)

localize14.0ms (1.2%)

series1.0ms (0.1%)

simplify3.0ms (0.3%)

rewrite30.0ms (2.6%)

eval2.0ms (0.2%)

prune1.0ms (0.1%)

simplify15.0ms (1.3%)

localize10.0ms (0.9%)

series0.0ms (0%)

simplify6.0ms (0.5%)

rewrite53.0ms (4.6%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

regimes4.0ms (0.3%)

simplify6.0ms (0.5%)

soundness30.0ms (2.6%)

preprocess38.0ms (3.3%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	6	2
1	22	2
2	30	2
3	45	2
4	52	2
5	54	2
0	4	5
0	6	1
1	10	1
2	13	1
3	15	1
4	17	1
5	19	1
6	23	1
7	28	1
0	28	1