Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487097154
details
property
value
status
complete
benchmark
curious.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n151.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.0449891 seconds
cpu usage
0.046175
user time
0.038106
system time
0.008069
max virtual memory
113188.0
max residence set size
7888.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: l5 0: l0 -> l2 : b^0'=b^post0, (-1+b^post0 == 0 /\ -b^0 <= 0), cost: 1 1: l2 -> l3 : b^0'=b^post1, (1+b^0 <= 0 /\ b^0-b^post1 == 0), cost: 1 2: l2 -> l3 : b^0'=b^post2, (1-b^0 <= 0 /\ b^0-b^post2 == 0), cost: 1 3: l3 -> l1 : b^0'=b^post3, b^post3 == 0, cost: 1 4: l1 -> l0 : b^0'=b^post4, b^0-b^post4 == 0, cost: 1 5: l4 -> l0 : b^0'=b^post5, b^0-b^post5 == 0, cost: 1 6: l5 -> l4 : b^0'=b^post6, b^0-b^post6 == 0, cost: 1 Applied preprocessing Original rule: l0 -> l2 : b^0'=b^post0, (-1+b^post0 == 0 /\ -b^0 <= 0), cost: 1 New rule: l0 -> l2 : b^0'=1, b^0 >= 0, cost: 1 Applied preprocessing Original rule: l2 -> l3 : b^0'=b^post1, (1+b^0 <= 0 /\ b^0-b^post1 == 0), cost: 1 New rule: l2 -> l3 : 1+b^0 <= 0, cost: 1 Applied preprocessing Original rule: l2 -> l3 : b^0'=b^post2, (1-b^0 <= 0 /\ b^0-b^post2 == 0), cost: 1 New rule: l2 -> l3 : -1+b^0 >= 0, cost: 1 Applied preprocessing Original rule: l3 -> l1 : b^0'=b^post3, b^post3 == 0, cost: 1 New rule: l3 -> l1 : b^0'=0, TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l0 : b^0'=b^post4, b^0-b^post4 == 0, cost: 1 New rule: l1 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l0 : b^0'=b^post5, b^0-b^post5 == 0, cost: 1 New rule: l4 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l5 -> l4 : b^0'=b^post6, b^0-b^post6 == 0, cost: 1 New rule: l5 -> l4 : TRUE, cost: 1 Simplified rules Start location: l5 7: l0 -> l2 : b^0'=1, b^0 >= 0, cost: 1 8: l2 -> l3 : 1+b^0 <= 0, cost: 1 9: l2 -> l3 : -1+b^0 >= 0, cost: 1 10: l3 -> l1 : b^0'=0, TRUE, cost: 1 11: l1 -> l0 : TRUE, cost: 1 12: l4 -> l0 : TRUE, cost: 1 13: l5 -> l4 : TRUE, cost: 1 Eliminating location l4 by chaining: Applied chaining First rule: l5 -> l4 : TRUE, cost: 1 Second rule: l4 -> l0 : TRUE, cost: 1 New rule: l5 -> l0 : TRUE, cost: 2 Applied deletion Removed the following rules: 12 13 Eliminating location l1 by chaining: Applied chaining First rule: l3 -> l1 : b^0'=0, TRUE, cost: 1 Second rule: l1 -> l0 : TRUE, cost: 1 New rule: l3 -> l0 : b^0'=0, TRUE, cost: 2 Applied deletion Removed the following rules: 10 11 Eliminated locations on linear paths Start location: l5 7: l0 -> l2 : b^0'=1, b^0 >= 0, cost: 1 8: l2 -> l3 : 1+b^0 <= 0, cost: 1 9: l2 -> l3 : -1+b^0 >= 0, cost: 1 15: l3 -> l0 : b^0'=0, TRUE, cost: 2 14: l5 -> l0 : TRUE, cost: 2
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS