Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487097178
details
property
value
status
complete
benchmark
polyrank2.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n142.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.060558 seconds
cpu usage
0.061547
user time
0.041344
system time
0.020203
max virtual memory
113188.0
max residence set size
18640.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: l3 0: l0 -> l1 : x^0'=x^post0, z^0'=z^post0, y^0'=y^post0, (1-x^0 <= 0 /\ y^post0+z^0-y^0 == 0 /\ -1-z^0+z^post0 == 0 /\ -x^0+x^post0-y^0 == 0), cost: 1 1: l1 -> l0 : x^0'=x^post1, z^0'=z^post1, y^0'=y^post1, (z^0-z^post1 == 0 /\ x^0-x^post1 == 0 /\ y^0-y^post1 == 0), cost: 1 2: l2 -> l0 : x^0'=x^post2, z^0'=z^post2, y^0'=y^post2, (z^0-z^post2 == 0 /\ y^0-y^post2 == 0 /\ x^0-x^post2 == 0), cost: 1 3: l3 -> l2 : x^0'=x^post3, z^0'=z^post3, y^0'=y^post3, (y^0-y^post3 == 0 /\ x^0-x^post3 == 0 /\ z^0-z^post3 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : x^0'=x^post0, z^0'=z^post0, y^0'=y^post0, (1-x^0 <= 0 /\ y^post0+z^0-y^0 == 0 /\ -1-z^0+z^post0 == 0 /\ -x^0+x^post0-y^0 == 0), cost: 1 New rule: l0 -> l1 : x^0'=x^0+y^0, z^0'=1+z^0, y^0'=-z^0+y^0, -1+x^0 >= 0, cost: 1 Applied preprocessing Original rule: l1 -> l0 : x^0'=x^post1, z^0'=z^post1, y^0'=y^post1, (z^0-z^post1 == 0 /\ x^0-x^post1 == 0 /\ y^0-y^post1 == 0), cost: 1 New rule: l1 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l2 -> l0 : x^0'=x^post2, z^0'=z^post2, y^0'=y^post2, (z^0-z^post2 == 0 /\ y^0-y^post2 == 0 /\ x^0-x^post2 == 0), cost: 1 New rule: l2 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l2 : x^0'=x^post3, z^0'=z^post3, y^0'=y^post3, (y^0-y^post3 == 0 /\ x^0-x^post3 == 0 /\ z^0-z^post3 == 0), cost: 1 New rule: l3 -> l2 : TRUE, cost: 1 Simplified rules Start location: l3 4: l0 -> l1 : x^0'=x^0+y^0, z^0'=1+z^0, y^0'=-z^0+y^0, -1+x^0 >= 0, cost: 1 5: l1 -> l0 : TRUE, cost: 1 6: l2 -> l0 : TRUE, cost: 1 7: l3 -> l2 : TRUE, cost: 1 Eliminating location l2 by chaining: Applied chaining First rule: l3 -> l2 : TRUE, cost: 1 Second rule: l2 -> l0 : TRUE, cost: 1 New rule: l3 -> l0 : TRUE, cost: 2 Applied deletion Removed the following rules: 6 7 Eliminating location l1 by chaining: Applied chaining First rule: l0 -> l1 : x^0'=x^0+y^0, z^0'=1+z^0, y^0'=-z^0+y^0, -1+x^0 >= 0, cost: 1 Second rule: l1 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : x^0'=x^0+y^0, z^0'=1+z^0, y^0'=-z^0+y^0, -1+x^0 >= 0, cost: 2 Applied deletion Removed the following rules: 4 5 Eliminated locations on linear paths Start location: l3 9: l0 -> l0 : x^0'=x^0+y^0, z^0'=1+z^0, y^0'=-z^0+y^0, -1+x^0 >= 0, cost: 2 8: l3 -> l0 : TRUE, cost: 2 Accelerated simple loops Start location: l3 9: l0 -> l0 : x^0'=x^0+y^0, z^0'=1+z^0, y^0'=-z^0+y^0, -1+x^0 >= 0, cost: 2 8: l3 -> l0 : TRUE, cost: 2 Applied chaining First rule: l3 -> l0 : TRUE, cost: 2 Second rule: l0 -> l0 : x^0'=x^0+y^0, z^0'=1+z^0, y^0'=-z^0+y^0, -1+x^0 >= 0, cost: 2 New rule: l3 -> l0 : x^0'=x^0+y^0, z^0'=1+z^0, y^0'=-z^0+y^0, -1+x^0 >= 0, cost: 4 Applied deletion Removed the following rules: 9 Chained accelerated rules with incoming rules Start location: l3 8: l3 -> l0 : TRUE, cost: 2 10: l3 -> l0 : x^0'=x^0+y^0, z^0'=1+z^0, y^0'=-z^0+y^0, -1+x^0 >= 0, cost: 4 Removed unreachable locations and irrelevant leafs Start location: l3 <empty>
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS