Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487098297
details
property
value
status
complete
benchmark
array_free2.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n139.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.068509 seconds
cpu usage
0.069692
user time
0.052185
system time
0.017507
max virtual memory
113188.0
max residence set size
18396.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: l7 0: l0 -> l1 : i1^0'=i1^post0, -1-i1^0+i1^post0 == 0, cost: 1 7: l1 -> l4 : i1^0'=i1^post7, i1^0-i1^post7 == 0, cost: 1 1: l2 -> l0 : i1^0'=i1^post1, i1^0-i1^post1 == 0, cost: 1 2: l3 -> l2 : i1^0'=i1^post2, i1^0-i1^post2 == 0, cost: 1 3: l3 -> l0 : i1^0'=i1^post3, i1^0-i1^post3 == 0, cost: 1 4: l3 -> l2 : i1^0'=i1^post4, i1^0-i1^post4 == 0, cost: 1 5: l4 -> l5 : i1^0'=i1^post5, (i1^0-i1^post5 == 0 /\ 42-i1^0 <= 0), cost: 1 6: l4 -> l3 : i1^0'=i1^post6, (-41+i1^0 <= 0 /\ i1^0-i1^post6 == 0), cost: 1 8: l6 -> l1 : i1^0'=i1^post8, i1^post8 == 0, cost: 1 9: l7 -> l6 : i1^0'=i1^post9, i1^0-i1^post9 == 0, cost: 1 Removed unreachable rules and leafs Start location: l7 0: l0 -> l1 : i1^0'=i1^post0, -1-i1^0+i1^post0 == 0, cost: 1 7: l1 -> l4 : i1^0'=i1^post7, i1^0-i1^post7 == 0, cost: 1 1: l2 -> l0 : i1^0'=i1^post1, i1^0-i1^post1 == 0, cost: 1 2: l3 -> l2 : i1^0'=i1^post2, i1^0-i1^post2 == 0, cost: 1 3: l3 -> l0 : i1^0'=i1^post3, i1^0-i1^post3 == 0, cost: 1 4: l3 -> l2 : i1^0'=i1^post4, i1^0-i1^post4 == 0, cost: 1 6: l4 -> l3 : i1^0'=i1^post6, (-41+i1^0 <= 0 /\ i1^0-i1^post6 == 0), cost: 1 8: l6 -> l1 : i1^0'=i1^post8, i1^post8 == 0, cost: 1 9: l7 -> l6 : i1^0'=i1^post9, i1^0-i1^post9 == 0, cost: 1 Applied preprocessing Original rule: l0 -> l1 : i1^0'=i1^post0, -1-i1^0+i1^post0 == 0, cost: 1 New rule: l0 -> l1 : i1^0'=1+i1^0, TRUE, cost: 1 Applied preprocessing Original rule: l2 -> l0 : i1^0'=i1^post1, i1^0-i1^post1 == 0, cost: 1 New rule: l2 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l2 : i1^0'=i1^post2, i1^0-i1^post2 == 0, cost: 1 New rule: l3 -> l2 : TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l0 : i1^0'=i1^post3, i1^0-i1^post3 == 0, cost: 1 New rule: l3 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l2 : i1^0'=i1^post4, i1^0-i1^post4 == 0, cost: 1 New rule: l3 -> l2 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l3 : i1^0'=i1^post6, (-41+i1^0 <= 0 /\ i1^0-i1^post6 == 0), cost: 1 New rule: l4 -> l3 : -41+i1^0 <= 0, cost: 1 Applied preprocessing Original rule: l1 -> l4 : i1^0'=i1^post7, i1^0-i1^post7 == 0, cost: 1 New rule: l1 -> l4 : TRUE, cost: 1 Applied preprocessing Original rule: l6 -> l1 : i1^0'=i1^post8, i1^post8 == 0, cost: 1 New rule: l6 -> l1 : i1^0'=0, TRUE, cost: 1 Applied preprocessing Original rule: l7 -> l6 : i1^0'=i1^post9, i1^0-i1^post9 == 0, cost: 1 New rule: l7 -> l6 : TRUE, cost: 1 Applied deletion Removed the following rules: 12 Simplified rules Start location: l7 10: l0 -> l1 : i1^0'=1+i1^0, TRUE, cost: 1 16: l1 -> l4 : TRUE, cost: 1 11: l2 -> l0 : TRUE, cost: 1 13: l3 -> l0 : TRUE, cost: 1 14: l3 -> l2 : TRUE, cost: 1 15: l4 -> l3 : -41+i1^0 <= 0, cost: 1 17: l6 -> l1 : i1^0'=0, TRUE, cost: 1 18: l7 -> l6 : TRUE, cost: 1 Eliminating location l6 by chaining:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS