Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487097577
details
property
value
status
complete
benchmark
fuhs-inflasso.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.67544 seconds
cpu usage
0.679102
user time
0.647981
system time
0.031121
max virtual memory
278168.0
max residence set size
19696.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: l4 0: l0 -> l1 : i^0'=i^post0, n^0'=n^post0, j^0'=j^post0, (n^0-n^post0 == 0 /\ -j^post0+j^0 == 0 /\ -1-i^0+i^post0 == 0 /\ i^0-j^0 <= 0), cost: 1 1: l0 -> l2 : i^0'=i^post1, n^0'=n^post1, j^0'=j^post1, (n^0-n^post1 == 0 /\ i^0-i^post1 == 0 /\ 1-i^0+j^0 <= 0 /\ -1-j^0+j^post1 == 0), cost: 1 3: l1 -> l0 : i^0'=i^post3, n^0'=n^post3, j^0'=j^post3, (1+i^0-n^0 <= 0 /\ j^post3 == 0 /\ i^0-i^post3 == 0 /\ n^0-n^post3 == 0), cost: 1 2: l2 -> l0 : i^0'=i^post2, n^0'=n^post2, j^0'=j^post2, (n^0-n^post2 == 0 /\ j^0-j^post2 == 0 /\ i^0-i^post2 == 0), cost: 1 4: l3 -> l1 : i^0'=i^post4, n^0'=n^post4, j^0'=j^post4, (i^post4 == 0 /\ n^0-n^post4 == 0 /\ j^0-j^post4 == 0), cost: 1 5: l4 -> l3 : i^0'=i^post5, n^0'=n^post5, j^0'=j^post5, (i^0-i^post5 == 0 /\ n^0-n^post5 == 0 /\ j^0-j^post5 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : i^0'=i^post0, n^0'=n^post0, j^0'=j^post0, (n^0-n^post0 == 0 /\ -j^post0+j^0 == 0 /\ -1-i^0+i^post0 == 0 /\ i^0-j^0 <= 0), cost: 1 New rule: l0 -> l1 : i^0'=1+i^0, i^0-j^0 <= 0, cost: 1 Applied preprocessing Original rule: l0 -> l2 : i^0'=i^post1, n^0'=n^post1, j^0'=j^post1, (n^0-n^post1 == 0 /\ i^0-i^post1 == 0 /\ 1-i^0+j^0 <= 0 /\ -1-j^0+j^post1 == 0), cost: 1 New rule: l0 -> l2 : j^0'=1+j^0, 1-i^0+j^0 <= 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : i^0'=i^post2, n^0'=n^post2, j^0'=j^post2, (n^0-n^post2 == 0 /\ j^0-j^post2 == 0 /\ i^0-i^post2 == 0), cost: 1 New rule: l2 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l0 : i^0'=i^post3, n^0'=n^post3, j^0'=j^post3, (1+i^0-n^0 <= 0 /\ j^post3 == 0 /\ i^0-i^post3 == 0 /\ n^0-n^post3 == 0), cost: 1 New rule: l1 -> l0 : j^0'=0, 1+i^0-n^0 <= 0, cost: 1 Applied preprocessing Original rule: l3 -> l1 : i^0'=i^post4, n^0'=n^post4, j^0'=j^post4, (i^post4 == 0 /\ n^0-n^post4 == 0 /\ j^0-j^post4 == 0), cost: 1 New rule: l3 -> l1 : i^0'=0, TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l3 : i^0'=i^post5, n^0'=n^post5, j^0'=j^post5, (i^0-i^post5 == 0 /\ n^0-n^post5 == 0 /\ j^0-j^post5 == 0), cost: 1 New rule: l4 -> l3 : TRUE, cost: 1 Simplified rules Start location: l4 6: l0 -> l1 : i^0'=1+i^0, i^0-j^0 <= 0, cost: 1 7: l0 -> l2 : j^0'=1+j^0, 1-i^0+j^0 <= 0, cost: 1 9: l1 -> l0 : j^0'=0, 1+i^0-n^0 <= 0, cost: 1 8: l2 -> l0 : TRUE, cost: 1 10: l3 -> l1 : i^0'=0, TRUE, cost: 1 11: l4 -> l3 : TRUE, cost: 1 Eliminating location l3 by chaining: Applied chaining First rule: l4 -> l3 : TRUE, cost: 1 Second rule: l3 -> l1 : i^0'=0, TRUE, cost: 1 New rule: l4 -> l1 : i^0'=0, TRUE, cost: 2 Applied deletion Removed the following rules: 10 11 Eliminating location l2 by chaining: Applied chaining First rule: l0 -> l2 : j^0'=1+j^0, 1-i^0+j^0 <= 0, cost: 1 Second rule: l2 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : j^0'=1+j^0, 1-i^0+j^0 <= 0, cost: 2 Applied deletion Removed the following rules: 7 8 Eliminated locations on linear paths Start location: l4 6: l0 -> l1 : i^0'=1+i^0, i^0-j^0 <= 0, cost: 1 13: l0 -> l0 : j^0'=1+j^0, 1-i^0+j^0 <= 0, cost: 2 9: l1 -> l0 : j^0'=0, 1+i^0-n^0 <= 0, cost: 1 12: l4 -> l1 : i^0'=0, TRUE, cost: 2 Applied acceleration Original rule: l0 -> l0 : j^0'=1+j^0, 1-i^0+j^0 <= 0, cost: 2 New rule: l0 -> l0 : j^0'=n0+j^0, (n0 >= 0 /\ i^0-n0-j^0 >= 0), cost: 2*n0 Applied instantiation Original rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS