Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer Transition Systems pair #487525880
details
property
value
status
complete
benchmark
florian.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n077.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.080677986145 seconds
cpu usage
0.048705501
max memory
1.2447744E7
stage attributes
key
value
output-size
2665
starexec-result
WORST_CASE(Omega(0),?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(0),?) Initial ITS Start location: l2 0: l0 -> l1 : x^0'=x^post0, (1-x^0 <= 0 /\ 1-x^0+x^post0 == 0), cost: 1 1: l1 -> l0 : x^0'=x^post1, x^0-x^post1 == 0, cost: 1 2: l2 -> l0 : x^0'=x^post2, x^0-x^post2 == 0, cost: 1 Applied preprocessing Original rule: l0 -> l1 : x^0'=x^post0, (1-x^0 <= 0 /\ 1-x^0+x^post0 == 0), cost: 1 New rule: l0 -> l1 : x^0'=-1+x^0, -1+x^0 >= 0, 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: l2 -> l0 : x^0'=x^post2, x^0-x^post2 == 0, cost: 1 New rule: l2 -> l0 : TRUE, cost: 1 Simplified rules Start location: l2 3: l0 -> l1 : x^0'=-1+x^0, -1+x^0 >= 0, cost: 1 4: l1 -> l0 : TRUE, cost: 1 5: l2 -> l0 : TRUE, cost: 1 Eliminating location l1 by chaining: Applied chaining First rule: l0 -> l1 : x^0'=-1+x^0, -1+x^0 >= 0, cost: 1 Second rule: l1 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : x^0'=-1+x^0, -1+x^0 >= 0, cost: 2 Applied deletion Removed the following rules: 3 4 Eliminated locations on linear paths Start location: l2 6: l0 -> l0 : x^0'=-1+x^0, -1+x^0 >= 0, cost: 2 5: l2 -> l0 : TRUE, cost: 1 Applied acceleration Original rule: l0 -> l0 : x^0'=-1+x^0, -1+x^0 >= 0, cost: 2 New rule: l0 -> l0 : x^0'=x^0-n0, (n0 >= 0 /\ x^0-n0 >= 0), cost: 2*n0 Applied instantiation Original rule: l0 -> l0 : x^0'=x^0-n0, (n0 >= 0 /\ x^0-n0 >= 0), cost: 2*n0 New rule: l0 -> l0 : x^0'=0, (0 >= 0 /\ x^0 >= 0), cost: 2*x^0 Applied simplification Original rule: l0 -> l0 : x^0'=0, (0 >= 0 /\ x^0 >= 0), cost: 2*x^0 New rule: l0 -> l0 : x^0'=0, x^0 >= 0, cost: 2*x^0 Applied deletion Removed the following rules: 6 Accelerated simple loops Start location: l2 8: l0 -> l0 : x^0'=0, x^0 >= 0, cost: 2*x^0 5: l2 -> l0 : TRUE, cost: 1 Applied chaining First rule: l2 -> l0 : TRUE, cost: 1 Second rule: l0 -> l0 : x^0'=0, x^0 >= 0, cost: 2*x^0 New rule: l2 -> l0 : x^0'=0, x^0 >= 0, cost: 1+2*x^0 Applied deletion Removed the following rules: 8 Chained accelerated rules with incoming rules Start location: l2 5: l2 -> l0 : TRUE, cost: 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integer Transition Systems