Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099212
details
property
value
status
complete
benchmark
PlusSwap.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n143.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.121791 seconds
cpu usage
0.122864
user time
0.105461
system time
0.017403
max virtual memory
113188.0
max residence set size
18472.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: __init 0: f1_0_main_Load -> f234_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 1: f234_0_main_LE -> f234_0_main_LE : arg1'=arg1P1, arg2'=arg2P1, (arg1-arg2P1 == 0 /\ -1-arg1P1+arg2 == 0 /\ arg2 > 0), cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied preprocessing Original rule: f234_0_main_LE -> f234_0_main_LE : arg1'=arg1P1, arg2'=arg2P1, (arg1-arg2P1 == 0 /\ -1-arg1P1+arg2 == 0 /\ arg2 > 0), cost: 1 New rule: f234_0_main_LE -> f234_0_main_LE : arg1'=-1+arg2, arg2'=arg1, arg2 > 0, cost: 1 Simplified rules Start location: __init 0: f1_0_main_Load -> f234_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 3: f234_0_main_LE -> f234_0_main_LE : arg1'=-1+arg2, arg2'=arg1, arg2 > 0, cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied unrolling Original rule: f234_0_main_LE -> f234_0_main_LE : arg1'=-1+arg2, arg2'=arg1, arg2 > 0, cost: 1 New rule: f234_0_main_LE -> f234_0_main_LE : arg1'=-1+arg1, arg2'=-1+arg2, (arg1 > 0 /\ arg2 > 0), cost: 2 Applied acceleration Original rule: f234_0_main_LE -> f234_0_main_LE : arg1'=-1+arg1, arg2'=-1+arg2, (arg1 > 0 /\ arg2 > 0), cost: 2 New rule: f234_0_main_LE -> f234_0_main_LE : arg1'=arg1-n0, arg2'=-n0+arg2, (n0 >= 0 /\ 1+arg1-n0 > 0 /\ 1-n0+arg2 > 0), cost: 2*n0 Applied instantiation Original rule: f234_0_main_LE -> f234_0_main_LE : arg1'=arg1-n0, arg2'=-n0+arg2, (n0 >= 0 /\ 1+arg1-n0 > 0 /\ 1-n0+arg2 > 0), cost: 2*n0 New rule: f234_0_main_LE -> f234_0_main_LE : arg1'=0, arg2'=-arg1+arg2, (arg1 >= 0 /\ 1 > 0 /\ 1-arg1+arg2 > 0), cost: 2*arg1 Applied instantiation Original rule: f234_0_main_LE -> f234_0_main_LE : arg1'=arg1-n0, arg2'=-n0+arg2, (n0 >= 0 /\ 1+arg1-n0 > 0 /\ 1-n0+arg2 > 0), cost: 2*n0 New rule: f234_0_main_LE -> f234_0_main_LE : arg1'=arg1-arg2, arg2'=0, (1 > 0 /\ arg2 >= 0 /\ 1+arg1-arg2 > 0), cost: 2*arg2 Applied simplification Original rule: f234_0_main_LE -> f234_0_main_LE : arg1'=0, arg2'=-arg1+arg2, (arg1 >= 0 /\ 1 > 0 /\ 1-arg1+arg2 > 0), cost: 2*arg1 New rule: f234_0_main_LE -> f234_0_main_LE : arg1'=0, arg2'=-arg1+arg2, (arg1 >= 0 /\ 1-arg1+arg2 > 0), cost: 2*arg1 Applied simplification Original rule: f234_0_main_LE -> f234_0_main_LE : arg1'=arg1-arg2, arg2'=0, (1 > 0 /\ arg2 >= 0 /\ 1+arg1-arg2 > 0), cost: 2*arg2 New rule: f234_0_main_LE -> f234_0_main_LE : arg1'=arg1-arg2, arg2'=0, (arg2 >= 0 /\ 1+arg1-arg2 > 0), cost: 2*arg2 Applied deletion Removed the following rules: 3 Accelerated simple loops Start location: __init 0: f1_0_main_Load -> f234_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 6: f234_0_main_LE -> f234_0_main_LE : arg1'=0, arg2'=-arg1+arg2, (arg1 >= 0 /\ 1-arg1+arg2 > 0), cost: 2*arg1 7: f234_0_main_LE -> f234_0_main_LE : arg1'=arg1-arg2, arg2'=0, (arg2 >= 0 /\ 1+arg1-arg2 > 0), cost: 2*arg2 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f234_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f234_0_main_LE -> f234_0_main_LE : arg1'=0, arg2'=-arg1+arg2, (arg1 >= 0 /\ 1-arg1+arg2 > 0), cost: 2*arg1 New rule: f1_0_main_Load -> f234_0_main_LE : arg1'=0, arg2'=-arg1P0+arg2P0, (arg1 > 0 /\ arg1P0 >= 0 /\ 1+arg2 > 0 /\ 1-arg1P0+arg2P0 > 0), cost: 1+2*arg1P0 Applied chaining First rule: f1_0_main_Load -> f234_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f234_0_main_LE -> f234_0_main_LE : arg1'=arg1-arg2, arg2'=0, (arg2 >= 0 /\ 1+arg1-arg2 > 0), cost: 2*arg2 New rule: f1_0_main_Load -> f234_0_main_LE : arg1'=arg1P0-arg2P0, arg2'=0, (arg1 > 0 /\ 1+arg1P0-arg2P0 > 0 /\ 1+arg2 > 0 /\ arg2P0 >= 0), cost: 1+2*arg2P0 Applied deletion Removed the following rules: 6 7 Chained accelerated rules with incoming rules Start location: __init 0: f1_0_main_Load -> f234_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 8: f1_0_main_Load -> f234_0_main_LE : arg1'=0, arg2'=-arg1P0+arg2P0, (arg1 > 0 /\ arg1P0 >= 0 /\ 1+arg2 > 0 /\ 1-arg1P0+arg2P0 > 0), cost: 1+2*arg1P0 9: f1_0_main_Load -> f234_0_main_LE : arg1'=arg1P0-arg2P0, arg2'=0, (arg1 > 0 /\ 1+arg1P0-arg2P0 > 0 /\ 1+arg2 > 0 /\ arg2P0 >= 0), cost: 1+2*arg2P0 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Removed unreachable locations and irrelevant leafs Start location: __init <empty>
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS