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