p1 := proc(a, b, n)
    local i, j;
    for i from 1 to min(n + 2, 10) do
        for j from i to n + 2 do
            a[i, j] := b[i + 1] + a[i - 1, j - 1]
        end do
    end do
end proc:
loop1 := CreateLoop(p1):
iteration_space1 := IterationSpace(loop1);

$\mathrm{iteration\_space1}≔\left[1\le i\,i\le 10\,i\le n+2\,i\le j\,j\le n+2\right]$

$\mathrm{iteration\_space1\_2}≔\mathrm{subs}\left(n=2\,\mathrm{iteration\_space1}\right)\:$$\mathrm{isolve}\left(\mathrm{convert}\left(\mathrm{iteration\_space1\_2}\,\mathrm{set}\right)\right)$

$\left\{i=1\,j=1\right\},\left\{i=1\,j=2\right\},\left\{i=1\,j=3\right\},\left\{i=1\,j=4\right\},\left\{i=2\,j=2\right\},\left\{i=2\,j=3\right\},\left\{i=2\,j=4\right\},\left\{i=3\,j=3\right\},\left\{i=3\,j=4\right\},\left\{i=4\,j=4\right\}$

p2 := proc(a)
    local i;
    for i from 2 to 1 do
        a[i] := a[i - 1]:
    end do
end proc:
loop2 := CreateLoop(p2):
iteration_space2 := IterationSpace(loop2);

$\mathrm{iteration\_space2}≔\left[2\le i\,i\le 1\right]$

$\mathrm{simplex}\left[\mathrm{feasible}\right]\left(\mathrm{iteration\_space2}\right)$

$\mathrm{false}$