Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487097943
details
property
value
status
complete
benchmark
florian_pldi.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n140.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.385898 seconds
cpu usage
0.394385
user time
0.357317
system time
0.037068
max virtual memory
113188.0
max residence set size
19748.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: l9 0: l0 -> l1 : guard^0'=guard^post0, j^0'=j^post0, i^0'=i^post0, n^0'=n^post0, (-n^post0+n^0 == 0 /\ guard^0-guard^post0 == 0 /\ j^0-j^post0 == 0 /\ -1-i^0+i^post0 == 0 /\ -j^0+n^0 <= 0), cost: 1 1: l0 -> l2 : guard^0'=guard^post1, j^0'=j^post1, i^0'=i^post1, n^0'=n^post1, (0 == 0 /\ -i^post1+i^0 == 0 /\ -j^post1+j^0 == 0 /\ 1+j^0-n^0 <= 0 /\ -n^post1+n^0 == 0), cost: 1 4: l1 -> l3 : guard^0'=guard^post4, j^0'=j^post4, i^0'=i^post4, n^0'=n^post4, (guard^0-guard^post4 == 0 /\ -n^post4+n^0 == 0 /\ -i^post4+i^0 == 0 /\ -j^post4+j^0 == 0), cost: 1 8: l2 -> l6 : guard^0'=guard^post8, j^0'=j^post8, i^0'=i^post8, n^0'=n^post8, (guard^0 <= 0 /\ -guard^0 <= 0 /\ -n^post8+n^0 == 0 /\ -i^post8+i^0 == 0 /\ guard^0-guard^post8 == 0 /\ j^0-j^post8 == 0), cost: 1 9: l2 -> l7 : guard^0'=guard^post9, j^0'=j^post9, i^0'=i^post9, n^0'=n^post9, (-j^post9+j^0 == 0 /\ guard^0-guard^post9 == 0 /\ 1-guard^0 <= 0 /\ -n^post9+n^0 == 0 /\ -i^post9+i^0 == 0), cost: 1 10: l2 -> l7 : guard^0'=guard^post10, j^0'=j^post10, i^0'=i^post10, n^0'=n^post10, (-n^post10+n^0 == 0 /\ 1+guard^0 <= 0 /\ guard^0-guard^post10 == 0 /\ -i^post10+i^0 == 0 /\ j^0-j^post10 == 0), cost: 1 2: l3 -> l4 : guard^0'=guard^post2, j^0'=j^post2, i^0'=i^post2, n^0'=n^post2, (-i^post2+i^0 == 0 /\ -i^0+n^0 <= 0 /\ j^0-j^post2 == 0 /\ -n^post2+n^0 == 0 /\ guard^0-guard^post2 == 0), cost: 1 3: l3 -> l5 : guard^0'=guard^post3, j^0'=j^post3, i^0'=i^post3, n^0'=n^post3, (guard^0-guard^post3 == 0 /\ 1+i^0-n^0 <= 0 /\ -1-i^0+j^post3 == 0 /\ i^0-i^post3 == 0 /\ -n^post3+n^0 == 0), cost: 1 5: l5 -> l0 : guard^0'=guard^post5, j^0'=j^post5, i^0'=i^post5, n^0'=n^post5, (guard^0-guard^post5 == 0 /\ j^0-j^post5 == 0 /\ -n^post5+n^0 == 0 /\ -i^post5+i^0 == 0), cost: 1 6: l6 -> l5 : guard^0'=guard^post6, j^0'=j^post6, i^0'=i^post6, n^0'=n^post6, (n^0-n^post6 == 0 /\ guard^0-guard^post6 == 0 /\ -1-j^0+j^post6 == 0 /\ -i^post6+i^0 == 0), cost: 1 7: l7 -> l6 : guard^0'=guard^post7, j^0'=j^post7, i^0'=i^post7, n^0'=n^post7, (guard^0-guard^post7 == 0 /\ i^0-i^post7 == 0 /\ 1+n^post7-n^0 == 0 /\ 1-j^0+j^post7 == 0), cost: 1 11: l8 -> l1 : guard^0'=guard^post11, j^0'=j^post11, i^0'=i^post11, n^0'=n^post11, (-n^post11+n^0 == 0 /\ guard^0-guard^post11 == 0 /\ i^post11 == 0 /\ j^0-j^post11 == 0), cost: 1 12: l9 -> l8 : guard^0'=guard^post12, j^0'=j^post12, i^0'=i^post12, n^0'=n^post12, (i^0-i^post12 == 0 /\ guard^0-guard^post12 == 0 /\ -n^post12+n^0 == 0 /\ j^0-j^post12 == 0), cost: 1 Removed unreachable rules and leafs Start location: l9 0: l0 -> l1 : guard^0'=guard^post0, j^0'=j^post0, i^0'=i^post0, n^0'=n^post0, (-n^post0+n^0 == 0 /\ guard^0-guard^post0 == 0 /\ j^0-j^post0 == 0 /\ -1-i^0+i^post0 == 0 /\ -j^0+n^0 <= 0), cost: 1 1: l0 -> l2 : guard^0'=guard^post1, j^0'=j^post1, i^0'=i^post1, n^0'=n^post1, (0 == 0 /\ -i^post1+i^0 == 0 /\ -j^post1+j^0 == 0 /\ 1+j^0-n^0 <= 0 /\ -n^post1+n^0 == 0), cost: 1 4: l1 -> l3 : guard^0'=guard^post4, j^0'=j^post4, i^0'=i^post4, n^0'=n^post4, (guard^0-guard^post4 == 0 /\ -n^post4+n^0 == 0 /\ -i^post4+i^0 == 0 /\ -j^post4+j^0 == 0), cost: 1 8: l2 -> l6 : guard^0'=guard^post8, j^0'=j^post8, i^0'=i^post8, n^0'=n^post8, (guard^0 <= 0 /\ -guard^0 <= 0 /\ -n^post8+n^0 == 0 /\ -i^post8+i^0 == 0 /\ guard^0-guard^post8 == 0 /\ j^0-j^post8 == 0), cost: 1 9: l2 -> l7 : guard^0'=guard^post9, j^0'=j^post9, i^0'=i^post9, n^0'=n^post9, (-j^post9+j^0 == 0 /\ guard^0-guard^post9 == 0 /\ 1-guard^0 <= 0 /\ -n^post9+n^0 == 0 /\ -i^post9+i^0 == 0), cost: 1 10: l2 -> l7 : guard^0'=guard^post10, j^0'=j^post10, i^0'=i^post10, n^0'=n^post10, (-n^post10+n^0 == 0 /\ 1+guard^0 <= 0 /\ guard^0-guard^post10 == 0 /\ -i^post10+i^0 == 0 /\ j^0-j^post10 == 0), cost: 1 3: l3 -> l5 : guard^0'=guard^post3, j^0'=j^post3, i^0'=i^post3, n^0'=n^post3, (guard^0-guard^post3 == 0 /\ 1+i^0-n^0 <= 0 /\ -1-i^0+j^post3 == 0 /\ i^0-i^post3 == 0 /\ -n^post3+n^0 == 0), cost: 1 5: l5 -> l0 : guard^0'=guard^post5, j^0'=j^post5, i^0'=i^post5, n^0'=n^post5, (guard^0-guard^post5 == 0 /\ j^0-j^post5 == 0 /\ -n^post5+n^0 == 0 /\ -i^post5+i^0 == 0), cost: 1 6: l6 -> l5 : guard^0'=guard^post6, j^0'=j^post6, i^0'=i^post6, n^0'=n^post6, (n^0-n^post6 == 0 /\ guard^0-guard^post6 == 0 /\ -1-j^0+j^post6 == 0 /\ -i^post6+i^0 == 0), cost: 1 7: l7 -> l6 : guard^0'=guard^post7, j^0'=j^post7, i^0'=i^post7, n^0'=n^post7, (guard^0-guard^post7 == 0 /\ i^0-i^post7 == 0 /\ 1+n^post7-n^0 == 0 /\ 1-j^0+j^post7 == 0), cost: 1 11: l8 -> l1 : guard^0'=guard^post11, j^0'=j^post11, i^0'=i^post11, n^0'=n^post11, (-n^post11+n^0 == 0 /\ guard^0-guard^post11 == 0 /\ i^post11 == 0 /\ j^0-j^post11 == 0), cost: 1 12: l9 -> l8 : guard^0'=guard^post12, j^0'=j^post12, i^0'=i^post12, n^0'=n^post12, (i^0-i^post12 == 0 /\ guard^0-guard^post12 == 0 /\ -n^post12+n^0 == 0 /\ j^0-j^post12 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : guard^0'=guard^post0, j^0'=j^post0, i^0'=i^post0, n^0'=n^post0, (-n^post0+n^0 == 0 /\ guard^0-guard^post0 == 0 /\ j^0-j^post0 == 0 /\ -1-i^0+i^post0 == 0 /\ -j^0+n^0 <= 0), cost: 1 New rule: l0 -> l1 : i^0'=1+i^0, -j^0+n^0 <= 0, cost: 1 Applied preprocessing Original rule: l0 -> l2 : guard^0'=guard^post1, j^0'=j^post1, i^0'=i^post1, n^0'=n^post1, (0 == 0 /\ -i^post1+i^0 == 0 /\ -j^post1+j^0 == 0 /\ 1+j^0-n^0 <= 0 /\ -n^post1+n^0 == 0), cost: 1 New rule: l0 -> l2 : guard^0'=guard^post1, 1+j^0-n^0 <= 0, cost: 1 Applied preprocessing Original rule: l3 -> l5 : guard^0'=guard^post3, j^0'=j^post3, i^0'=i^post3, n^0'=n^post3, (guard^0-guard^post3 == 0 /\ 1+i^0-n^0 <= 0 /\ -1-i^0+j^post3 == 0 /\ i^0-i^post3 == 0 /\ -n^post3+n^0 == 0), cost: 1 New rule: l3 -> l5 : j^0'=1+i^0, 1+i^0-n^0 <= 0, cost: 1 Applied preprocessing Original rule: l1 -> l3 : guard^0'=guard^post4, j^0'=j^post4, i^0'=i^post4, n^0'=n^post4, (guard^0-guard^post4 == 0 /\ -n^post4+n^0 == 0 /\ -i^post4+i^0 == 0 /\ -j^post4+j^0 == 0), cost: 1 New rule: l1 -> l3 : TRUE, cost: 1 Applied preprocessing Original rule: l5 -> l0 : guard^0'=guard^post5, j^0'=j^post5, i^0'=i^post5, n^0'=n^post5, (guard^0-guard^post5 == 0 /\ j^0-j^post5 == 0 /\ -n^post5+n^0 == 0 /\ -i^post5+i^0 == 0), cost: 1 New rule: l5 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l6 -> l5 : guard^0'=guard^post6, j^0'=j^post6, i^0'=i^post6, n^0'=n^post6, (n^0-n^post6 == 0 /\ guard^0-guard^post6 == 0 /\ -1-j^0+j^post6 == 0 /\ -i^post6+i^0 == 0), cost: 1 New rule: l6 -> l5 : j^0'=1+j^0, TRUE, cost: 1 Applied preprocessing Original rule: l7 -> l6 : guard^0'=guard^post7, j^0'=j^post7, i^0'=i^post7, n^0'=n^post7, (guard^0-guard^post7 == 0 /\ i^0-i^post7 == 0 /\ 1+n^post7-n^0 == 0 /\ 1-j^0+j^post7 == 0), cost: 1 New rule: l7 -> l6 : j^0'=-1+j^0, n^0'=-1+n^0, TRUE, cost: 1 Applied preprocessing Original rule: l2 -> l6 : guard^0'=guard^post8, j^0'=j^post8, i^0'=i^post8, n^0'=n^post8, (guard^0 <= 0 /\ -guard^0 <= 0 /\ -n^post8+n^0 == 0 /\ -i^post8+i^0 == 0 /\ guard^0-guard^post8 == 0 /\ j^0-j^post8 == 0), cost: 1 New rule: l2 -> l6 : guard^0 == 0, cost: 1 Applied preprocessing Original rule: l2 -> l7 : guard^0'=guard^post9, j^0'=j^post9, i^0'=i^post9, n^0'=n^post9, (-j^post9+j^0 == 0 /\ guard^0-guard^post9 == 0 /\ 1-guard^0 <= 0 /\ -n^post9+n^0 == 0 /\ -i^post9+i^0 == 0), cost: 1 New rule: l2 -> l7 : -1+guard^0 >= 0, cost: 1 Applied preprocessing Original rule: l2 -> l7 : guard^0'=guard^post10, j^0'=j^post10, i^0'=i^post10, n^0'=n^post10, (-n^post10+n^0 == 0 /\ 1+guard^0 <= 0 /\ guard^0-guard^post10 == 0 /\ -i^post10+i^0 == 0 /\ j^0-j^post10 == 0), cost: 1 New rule: l2 -> l7 : 1+guard^0 <= 0, cost: 1 Applied preprocessing Original rule: l8 -> l1 : guard^0'=guard^post11, j^0'=j^post11, i^0'=i^post11, n^0'=n^post11, (-n^post11+n^0 == 0 /\ guard^0-guard^post11 == 0 /\ i^post11 == 0 /\ j^0-j^post11 == 0), cost: 1 New rule: l8 -> l1 : i^0'=0, TRUE, cost: 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS