4 context: '[n] -> { : n <= 2147483647 and n >= -2147483648 }'
5 schedule: '{ domain: "[n] -> { S1[x1] : x1 >= 0 and x1 <= -1 + n; S_1[x1, x2] : exists
6 (e0 = floor((x2)/3): 3e0 = x2 and x1 >= 0 and x1 <= -1 + n and x2 <= 9); R[x1] :
7 x1 >= 0 and x1 <= -1 + n; S2[x1, x2, x3] : exists (e0 = floor((x2)/256), e1 = floor((x2)/3):
8 3e1 = x2 and x1 >= 0 and x1 <= -1 + n and x2 <= 9 and x3 >= 0 and 256e0 >= -255
9 + x2 and 256e0 <= x2 - x3) }", child: { schedule: "[n] -> L_0[{ S1[x1] -> [(x1)];
10 R[x1] -> [(x1)]; S_1[x1, x2] -> [(x1)]; S2[x1, x2, x3] -> [(x1)] }]", child: { sequence:
11 [ { filter: "[n] -> { S1[x1] }" }, { filter: "[n] -> { S_1[x1, x2]; S2[x1, x2, x3]
12 }", child: { schedule: "[n] -> L_1[{ S_1[x1, x2] -> [(-x2)]; S2[x1, x2, x3] -> [(-x2)]
13 }]", child: { sequence: [ { filter: "[n] -> { S_1[x1, x2] }" }, { filter: "[n] ->
14 { S2[x1, x2, x3] }", child: { schedule: "[n] -> L_2[{ S2[x1, x2, x3] -> [(x3)] }]"
15 } } ] } } }, { filter: "[n] -> { R[x1] }" } ] } } }'
18 extent: '[n] -> { __pet_test_0[x1, x2] : exists (e0 = floor((x2)/3): 3e0 = x2 and
19 x1 <= -1 + n and x2 <= 9 and x1 >= 0) }'
20 value_bounds: '{ [i0] : i0 >= 0 and i0 <= 1 }'
25 extent: '[n] -> { a[i0, i1] : i0 >= 0 and i1 <= 255 and i1 >= 0 }'
29 extent: '[n] -> { s[] }'
34 domain: '[n] -> { S1[x1] : x1 >= 0 and x1 <= -1 + n }'
35 schedule: '[n] -> { S1[x1] -> [0, x1, 0] }'
43 index: '[n] -> { S1[x1] -> s[] }'
44 reference: __pet_ref_0
50 domain: '[n] -> { [S_1[x1, x2] -> [1]] : exists (e0 = floor((x2)/3): 3e0 = x2 and
51 x1 <= -1 + n and x2 <= 9 and x1 >= 0) }'
52 schedule: '[n] -> { S_1[x1, x2] -> [0, x1, 1, -x2, 0] }'
60 index: '[n] -> { S_1[x1, x2] -> __pet_test_0[(x1), (x2)] }'
61 reference: __pet_ref_2
68 index: '[n] -> { S_1[x1, x2] -> [(x1)] }'
69 reference: __pet_ref_3
73 index: '[n] -> { S_1[x1, x2] -> [(x2 - 256*floor((x2)/256))] }'
74 reference: __pet_ref_4
79 index: '[n] -> { S_1[x1, x2] -> __pet_test_0[(x1), ((3 + x2) : x2 <= 6)] }'
80 reference: __pet_ref_1
84 domain: '[n] -> { [S2[x1, x2, x3] -> [1]] : exists (e0 = floor((x2)/256), e1 = floor((x2)/3):
85 3e1 = x2 and x1 <= -1 + n and x2 <= 9 and x3 >= 0 and 256e0 <= x2 - x3 and x1
86 >= 0 and 256e0 >= -255 + x2) }'
87 schedule: '[n] -> { S2[x1, x2, x3] -> [0, x1, 1, -x2, 1, 0, x3] }'
95 index: '[n] -> { S2[x1, x2, x3] -> s[] }'
96 reference: __pet_ref_6
106 index: '[n] -> { S2[x1, x2, x3] -> s[] }'
107 reference: __pet_ref_7
111 index: '[n] -> { S2[x1, x2, x3] -> a[(x2 - 256*floor((x2)/256)), (255
112 - x2 + 256*floor((x2)/256))] }'
113 reference: __pet_ref_8
118 index: '[n] -> { S2[x1, x2, x3] -> __pet_test_0[(x1), (x2)] }'
119 reference: __pet_ref_5
123 domain: '[n] -> { R[x1] : x1 >= 0 and x1 <= -1 + n }'
124 schedule: '[n] -> { R[x1] -> [0, x1, 2] }'
132 index: '[n] -> { R[x1] -> s[] }'
133 reference: __pet_ref_9
138 extension: '[n] -> { __pet_test_0[x1, x2] -> __pet_test_0[x1, x2''] : exists (e0
139 = floor((x2'')/3): 3e0 = x2'' and x2'' >= x2 and x1 >= 0 and x1 <= -1 + n and