Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487100262
details
property
value
status
complete
benchmark
PastaB7.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n145.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.588306 seconds
cpu usage
0.589175
user time
0.575287
system time
0.013888
max virtual memory
113188.0
max residence set size
19124.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 -> f213_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0 /\ 1+arg3P0 > 0), cost: 1 1: f213_0_main_LE -> f213_0_main_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg3-arg2 < 0 /\ arg3-arg3P1 == 0 /\ -1+arg2-arg2P1 == 0 /\ -1+arg1-arg1P1 == 0 /\ -arg1+arg3 < 0), cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, TRUE, cost: 1 Applied preprocessing Original rule: f213_0_main_LE -> f213_0_main_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg3-arg2 < 0 /\ arg3-arg3P1 == 0 /\ -1+arg2-arg2P1 == 0 /\ -1+arg1-arg1P1 == 0 /\ -arg1+arg3 < 0), cost: 1 New rule: f213_0_main_LE -> f213_0_main_LE : arg1'=-1+arg1, arg2'=-1+arg2, (-arg3+arg2 > 0 /\ arg1-arg3 > 0), cost: 1 Simplified rules Start location: __init 0: f1_0_main_Load -> f213_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0 /\ 1+arg3P0 > 0), cost: 1 3: f213_0_main_LE -> f213_0_main_LE : arg1'=-1+arg1, arg2'=-1+arg2, (-arg3+arg2 > 0 /\ arg1-arg3 > 0), cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, TRUE, cost: 1 Applied acceleration Original rule: f213_0_main_LE -> f213_0_main_LE : arg1'=-1+arg1, arg2'=-1+arg2, (-arg3+arg2 > 0 /\ arg1-arg3 > 0), cost: 1 New rule: f213_0_main_LE -> f213_0_main_LE : arg1'=arg1-n0, arg2'=arg2-n0, (1-arg3+arg2-n0 > 0 /\ n0 >= 0 /\ 1+arg1-arg3-n0 > 0), cost: n0 Applied instantiation Original rule: f213_0_main_LE -> f213_0_main_LE : arg1'=arg1-n0, arg2'=arg2-n0, (1-arg3+arg2-n0 > 0 /\ n0 >= 0 /\ 1+arg1-arg3-n0 > 0), cost: n0 New rule: f213_0_main_LE -> f213_0_main_LE : arg1'=arg1+arg3-arg2, arg2'=arg3, (1 > 0 /\ -arg3+arg2 >= 0 /\ 1+arg1-arg2 > 0), cost: -arg3+arg2 Applied instantiation Original rule: f213_0_main_LE -> f213_0_main_LE : arg1'=arg1-n0, arg2'=arg2-n0, (1-arg3+arg2-n0 > 0 /\ n0 >= 0 /\ 1+arg1-arg3-n0 > 0), cost: n0 New rule: f213_0_main_LE -> f213_0_main_LE : arg1'=arg3, arg2'=-arg1+arg3+arg2, (1 > 0 /\ 1-arg1+arg2 > 0 /\ arg1-arg3 >= 0), cost: arg1-arg3 Applied simplification Original rule: f213_0_main_LE -> f213_0_main_LE : arg1'=arg1+arg3-arg2, arg2'=arg3, (1 > 0 /\ -arg3+arg2 >= 0 /\ 1+arg1-arg2 > 0), cost: -arg3+arg2 New rule: f213_0_main_LE -> f213_0_main_LE : arg1'=arg1+arg3-arg2, arg2'=arg3, (-arg3+arg2 >= 0 /\ 1+arg1-arg2 > 0), cost: -arg3+arg2 Applied simplification Original rule: f213_0_main_LE -> f213_0_main_LE : arg1'=arg3, arg2'=-arg1+arg3+arg2, (1 > 0 /\ 1-arg1+arg2 > 0 /\ arg1-arg3 >= 0), cost: arg1-arg3 New rule: f213_0_main_LE -> f213_0_main_LE : arg1'=arg3, arg2'=-arg1+arg3+arg2, (1-arg1+arg2 > 0 /\ arg1-arg3 >= 0), cost: arg1-arg3 Applied deletion Removed the following rules: 3 Accelerated simple loops Start location: __init 0: f1_0_main_Load -> f213_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0 /\ 1+arg3P0 > 0), cost: 1 6: f213_0_main_LE -> f213_0_main_LE : arg1'=arg1+arg3-arg2, arg2'=arg3, (-arg3+arg2 >= 0 /\ 1+arg1-arg2 > 0), cost: -arg3+arg2 7: f213_0_main_LE -> f213_0_main_LE : arg1'=arg3, arg2'=-arg1+arg3+arg2, (1-arg1+arg2 > 0 /\ arg1-arg3 >= 0), cost: arg1-arg3 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f213_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0 /\ 1+arg3P0 > 0), cost: 1 Second rule: f213_0_main_LE -> f213_0_main_LE : arg1'=arg1+arg3-arg2, arg2'=arg3, (-arg3+arg2 >= 0 /\ 1+arg1-arg2 > 0), cost: -arg3+arg2 New rule: f1_0_main_Load -> f213_0_main_LE : arg1'=-arg2P0+arg1P0+arg3P0, arg3'=arg3P0, arg2'=arg3P0, (arg1 > 0 /\ 1-arg2P0+arg1P0 > 0 /\ arg2P0-arg3P0 >= 0 /\ 1+arg2 > 0 /\ 1+arg3P0 > 0), cost: 1+arg2P0-arg3P0 Applied chaining First rule: f1_0_main_Load -> f213_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0 /\ 1+arg3P0 > 0), cost: 1 Second rule: f213_0_main_LE -> f213_0_main_LE : arg1'=arg3, arg2'=-arg1+arg3+arg2, (1-arg1+arg2 > 0 /\ arg1-arg3 >= 0), cost: arg1-arg3 New rule: f1_0_main_Load -> f213_0_main_LE : arg1'=arg3P0, arg3'=arg3P0, arg2'=arg2P0-arg1P0+arg3P0, (arg1 > 0 /\ 1+arg2P0-arg1P0 > 0 /\ 1+arg2 > 0 /\ arg1P0-arg3P0 >= 0 /\ 1+arg3P0 > 0), cost: 1+arg1P0-arg3P0 Applied deletion Removed the following rules: 6 7 Chained accelerated rules with incoming rules Start location: __init 0: f1_0_main_Load -> f213_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0 /\ 1+arg3P0 > 0), cost: 1 8: f1_0_main_Load -> f213_0_main_LE : arg1'=-arg2P0+arg1P0+arg3P0, arg3'=arg3P0, arg2'=arg3P0, (arg1 > 0 /\ 1-arg2P0+arg1P0 > 0 /\ arg2P0-arg3P0 >= 0 /\ 1+arg2 > 0 /\ 1+arg3P0 > 0), cost: 1+arg2P0-arg3P0 9: f1_0_main_Load -> f213_0_main_LE : arg1'=arg3P0, arg3'=arg3P0, arg2'=arg2P0-arg1P0+arg3P0, (arg1 > 0 /\ 1+arg2P0-arg1P0 > 0 /\ 1+arg2 > 0 /\ arg1P0-arg3P0 >= 0 /\ 1+arg3P0 > 0), cost: 1+arg1P0-arg3P0 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, TRUE, cost: 1 Removed unreachable locations and irrelevant leafs Start location: __init <empty> Computing asymptotic complexity Proved the following lower bound Complexity: Unknown Cpx degree: ?
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS