Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487098690
details
property
value
status
complete
benchmark
n-13.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.034221 seconds
cpu usage
0.034866
user time
0.025278
system time
0.009588
max virtual memory
113188.0
max residence set size
7772.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: l4 0: l0 -> l1 : Result_4^0'=Result_4^post0, x_5^0'=x_5^post0, (x_5^0-x_5^post0 == 0 /\ Result_4^0-Result_4^post0 == 0), cost: 1 1: l1 -> l2 : Result_4^0'=Result_4^post1, x_5^0'=x_5^post1, (-x_5^0 <= 0 /\ -1+x_5^post1-x_5^0 == 0 /\ Result_4^0-Result_4^post1 == 0), cost: 1 3: l1 -> l3 : Result_4^0'=Result_4^post3, x_5^0'=x_5^post3, (0 == 0 /\ 1+x_5^0 <= 0 /\ x_5^0-x_5^post3 == 0), cost: 1 2: l2 -> l1 : Result_4^0'=Result_4^post2, x_5^0'=x_5^post2, (-x_5^post2+x_5^0 == 0 /\ Result_4^0-Result_4^post2 == 0), cost: 1 4: l4 -> l0 : Result_4^0'=Result_4^post4, x_5^0'=x_5^post4, (Result_4^0-Result_4^post4 == 0 /\ -x_5^post4+x_5^0 == 0), cost: 1 Removed unreachable rules and leafs Start location: l4 0: l0 -> l1 : Result_4^0'=Result_4^post0, x_5^0'=x_5^post0, (x_5^0-x_5^post0 == 0 /\ Result_4^0-Result_4^post0 == 0), cost: 1 1: l1 -> l2 : Result_4^0'=Result_4^post1, x_5^0'=x_5^post1, (-x_5^0 <= 0 /\ -1+x_5^post1-x_5^0 == 0 /\ Result_4^0-Result_4^post1 == 0), cost: 1 2: l2 -> l1 : Result_4^0'=Result_4^post2, x_5^0'=x_5^post2, (-x_5^post2+x_5^0 == 0 /\ Result_4^0-Result_4^post2 == 0), cost: 1 4: l4 -> l0 : Result_4^0'=Result_4^post4, x_5^0'=x_5^post4, (Result_4^0-Result_4^post4 == 0 /\ -x_5^post4+x_5^0 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : Result_4^0'=Result_4^post0, x_5^0'=x_5^post0, (x_5^0-x_5^post0 == 0 /\ Result_4^0-Result_4^post0 == 0), cost: 1 New rule: l0 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l2 : Result_4^0'=Result_4^post1, x_5^0'=x_5^post1, (-x_5^0 <= 0 /\ -1+x_5^post1-x_5^0 == 0 /\ Result_4^0-Result_4^post1 == 0), cost: 1 New rule: l1 -> l2 : x_5^0'=1+x_5^0, x_5^0 >= 0, cost: 1 Applied preprocessing Original rule: l2 -> l1 : Result_4^0'=Result_4^post2, x_5^0'=x_5^post2, (-x_5^post2+x_5^0 == 0 /\ Result_4^0-Result_4^post2 == 0), cost: 1 New rule: l2 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l0 : Result_4^0'=Result_4^post4, x_5^0'=x_5^post4, (Result_4^0-Result_4^post4 == 0 /\ -x_5^post4+x_5^0 == 0), cost: 1 New rule: l4 -> l0 : TRUE, cost: 1 Simplified rules Start location: l4 5: l0 -> l1 : TRUE, cost: 1 6: l1 -> l2 : x_5^0'=1+x_5^0, x_5^0 >= 0, cost: 1 7: l2 -> l1 : TRUE, cost: 1 8: l4 -> l0 : TRUE, cost: 1 Eliminating location l0 by chaining: Applied chaining First rule: l4 -> l0 : TRUE, cost: 1 Second rule: l0 -> l1 : TRUE, cost: 1 New rule: l4 -> l1 : TRUE, cost: 2 Applied deletion Removed the following rules: 5 8 Eliminating location l2 by chaining: Applied chaining First rule: l1 -> l2 : x_5^0'=1+x_5^0, x_5^0 >= 0, cost: 1 Second rule: l2 -> l1 : TRUE, cost: 1 New rule: l1 -> l1 : x_5^0'=1+x_5^0, x_5^0 >= 0, cost: 2 Applied deletion Removed the following rules: 6 7 Eliminated locations on linear paths Start location: l4 10: l1 -> l1 : x_5^0'=1+x_5^0, x_5^0 >= 0, cost: 2 9: l4 -> l1 : TRUE, cost: 2 Applied nonterm Original rule: l1 -> l1 : x_5^0'=1+x_5^0, x_5^0 >= 0, cost: 2 New rule: l1 -> [5] : x_5^0 >= 0, cost: NONTERM Applied acceleration Original rule: l1 -> l1 : x_5^0'=1+x_5^0, x_5^0 >= 0, cost: 2 New rule: l1 -> l1 : x_5^0'=n0+x_5^0, x_5^0 >= 0, cost: 2*n0 Applied deletion Removed the following rules: 10 Accelerated simple loops Start location: l4
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS