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