Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487098036
details
property
value
status
complete
benchmark
simple.t2.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.156649 seconds
cpu usage
0.159583
user time
0.129826
system time
0.029757
max virtual memory
113188.0
max residence set size
28672.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: l4 0: l0 -> l1 : x^0'=x^post0, 1-x^0+x^post0 == 0, cost: 1 2: l0 -> l2 : x^0'=x^post2, (1-x^0+x^post2 == 0 /\ 1-x^post2 <= 0), cost: 1 1: l1 -> l0 : x^0'=x^post1, x^0-x^post1 == 0, cost: 1 3: l2 -> l0 : x^0'=x^post3, x^0-x^post3 == 0, cost: 1 4: l3 -> l0 : x^0'=x^post4, x^0-x^post4 == 0, cost: 1 5: l4 -> l3 : x^0'=x^post5, x^0-x^post5 == 0, cost: 1 Applied preprocessing Original rule: l0 -> l1 : x^0'=x^post0, 1-x^0+x^post0 == 0, cost: 1 New rule: l0 -> l1 : x^0'=-1+x^0, TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l0 : x^0'=x^post1, x^0-x^post1 == 0, cost: 1 New rule: l1 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l0 -> l2 : x^0'=x^post2, (1-x^0+x^post2 == 0 /\ 1-x^post2 <= 0), cost: 1 New rule: l0 -> l2 : x^0'=-1+x^0, -2+x^0 >= 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : x^0'=x^post3, x^0-x^post3 == 0, cost: 1 New rule: l2 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l0 : x^0'=x^post4, x^0-x^post4 == 0, cost: 1 New rule: l3 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l3 : x^0'=x^post5, x^0-x^post5 == 0, cost: 1 New rule: l4 -> l3 : TRUE, cost: 1 Simplified rules Start location: l4 6: l0 -> l1 : x^0'=-1+x^0, TRUE, cost: 1 8: l0 -> l2 : x^0'=-1+x^0, -2+x^0 >= 0, cost: 1 7: l1 -> l0 : TRUE, cost: 1 9: l2 -> l0 : TRUE, cost: 1 10: l3 -> l0 : 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 -> l0 : TRUE, cost: 1 New rule: l4 -> l0 : TRUE, cost: 2 Applied deletion Removed the following rules: 10 11 Eliminating location l1 by chaining: Applied chaining First rule: l0 -> l1 : x^0'=-1+x^0, TRUE, cost: 1 Second rule: l1 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : x^0'=-1+x^0, TRUE, cost: 2 Applied deletion Removed the following rules: 6 7 Eliminating location l2 by chaining: Applied chaining First rule: l0 -> l2 : x^0'=-1+x^0, -2+x^0 >= 0, cost: 1 Second rule: l2 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : x^0'=-1+x^0, -2+x^0 >= 0, cost: 2 Applied deletion Removed the following rules: 8 9 Eliminated locations on linear paths Start location: l4 13: l0 -> l0 : x^0'=-1+x^0, TRUE, cost: 2
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS