Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487098576
details
property
value
status
complete
benchmark
disj_nightmare_abi.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n149.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.0757631 seconds
cpu usage
0.077392
user time
0.060158
system time
0.017234
max virtual memory
113188.0
max residence set size
18728.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, y^0'=y^post0, (y^0-y^post0 == 0 /\ x^0 <= 0 /\ x^post0-y^0 == 0 /\ -x^0 <= 0 /\ 1-y^0 <= 0), cost: 1 2: l0 -> l2 : x^0'=x^post2, y^0'=y^post2, (x^0 <= 0 /\ -x^0 <= 0 /\ -y^post2+y^0 == 0 /\ 1+y^0 <= 0 /\ -y^0+x^post2 == 0), cost: 1 1: l1 -> l0 : x^0'=x^post1, y^0'=y^post1, (-y^post1+y^0 == 0 /\ x^0-x^post1 == 0), cost: 1 3: l2 -> l0 : x^0'=x^post3, y^0'=y^post3, (x^0-x^post3 == 0 /\ y^0-y^post3 == 0), cost: 1 4: l3 -> l0 : x^0'=x^post4, y^0'=y^post4, (x^0-x^post4 == 0 /\ -y^post4+y^0 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : x^0'=x^post0, y^0'=y^post0, (y^0-y^post0 == 0 /\ x^0 <= 0 /\ x^post0-y^0 == 0 /\ -x^0 <= 0 /\ 1-y^0 <= 0), cost: 1 New rule: l0 -> l1 : x^0'=y^0, (x^0 == 0 /\ -1+y^0 >= 0), cost: 1 Applied preprocessing Original rule: l1 -> l0 : x^0'=x^post1, y^0'=y^post1, (-y^post1+y^0 == 0 /\ x^0-x^post1 == 0), cost: 1 New rule: l1 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l0 -> l2 : x^0'=x^post2, y^0'=y^post2, (x^0 <= 0 /\ -x^0 <= 0 /\ -y^post2+y^0 == 0 /\ 1+y^0 <= 0 /\ -y^0+x^post2 == 0), cost: 1 New rule: l0 -> l2 : x^0'=y^0, (x^0 == 0 /\ 1+y^0 <= 0), cost: 1 Applied preprocessing Original rule: l2 -> l0 : x^0'=x^post3, y^0'=y^post3, (x^0-x^post3 == 0 /\ y^0-y^post3 == 0), cost: 1 New rule: l2 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l0 : x^0'=x^post4, y^0'=y^post4, (x^0-x^post4 == 0 /\ -y^post4+y^0 == 0), cost: 1 New rule: l3 -> l0 : TRUE, cost: 1 Simplified rules Start location: l3 5: l0 -> l1 : x^0'=y^0, (x^0 == 0 /\ -1+y^0 >= 0), cost: 1 7: l0 -> l2 : x^0'=y^0, (x^0 == 0 /\ 1+y^0 <= 0), cost: 1 6: l1 -> l0 : TRUE, cost: 1 8: l2 -> l0 : TRUE, cost: 1 9: l3 -> l0 : TRUE, cost: 1 Eliminating location l1 by chaining: Applied chaining First rule: l0 -> l1 : x^0'=y^0, (x^0 == 0 /\ -1+y^0 >= 0), cost: 1 Second rule: l1 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : x^0'=y^0, (x^0 == 0 /\ -1+y^0 >= 0), cost: 2 Applied deletion Removed the following rules: 5 6 Eliminating location l2 by chaining: Applied chaining First rule: l0 -> l2 : x^0'=y^0, (x^0 == 0 /\ 1+y^0 <= 0), cost: 1 Second rule: l2 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : x^0'=y^0, (x^0 == 0 /\ 1+y^0 <= 0), cost: 2 Applied deletion Removed the following rules: 7 8 Eliminated locations on linear paths Start location: l3 10: l0 -> l0 : x^0'=y^0, (x^0 == 0 /\ -1+y^0 >= 0), cost: 2 11: l0 -> l0 : x^0'=y^0, (x^0 == 0 /\ 1+y^0 <= 0), cost: 2 9: l3 -> l0 : TRUE, cost: 1 Accelerated simple loops Start location: l3 10: l0 -> l0 : x^0'=y^0, (x^0 == 0 /\ -1+y^0 >= 0), cost: 2 11: l0 -> l0 : x^0'=y^0, (x^0 == 0 /\ 1+y^0 <= 0), cost: 2 9: l3 -> l0 : TRUE, cost: 1 Applied chaining First rule: l3 -> l0 : TRUE, cost: 1 Second rule: l0 -> l0 : x^0'=y^0, (x^0 == 0 /\ -1+y^0 >= 0), cost: 2 New rule: l3 -> l0 : x^0'=y^0, (x^0 == 0 /\ -1+y^0 >= 0), cost: 3 Applied chaining First rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS