Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099653
details
property
value
status
complete
benchmark
HanR.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n141.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.063326 seconds
cpu usage
0.064333
user time
0.052026
system time
0.012307
max virtual memory
113188.0
max residence set size
18452.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 -> f291_0_solve_GE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg2 == 0 /\ -arg1P0 == 0 /\ -arg2P0 == 0), cost: 1 1: f1_0_main_Load -> f291_0_solve_GE : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ 1-arg2P1 == 0 /\ arg2 > 0 /\ 1+arg1P1 > 0), cost: 1 2: f291_0_solve_GE -> f291_0_solve_GE : arg1'=arg1P2, arg2'=arg2P2, (-1+arg1 > 0 /\ -1+arg1-arg1P2 == 0 /\ -arg2P2+arg2 == 0 /\ -2+arg2 < 0 /\ -1 < 0), cost: 1 3: f291_0_solve_GE -> f291_0_solve_GE : arg1'=arg1P3, arg2'=arg2P3, (-1+arg1 > 0 /\ -2+arg2 < 0 /\ -1+arg1-arg1P3 == 0 /\ arg2-arg2P3 == 0 /\ -1 < 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f291_0_solve_GE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg2 == 0 /\ -arg1P0 == 0 /\ -arg2P0 == 0), cost: 1 New rule: f1_0_main_Load -> f291_0_solve_GE : arg1'=0, arg2'=0, (arg1 > 0 /\ arg2 == 0), cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f291_0_solve_GE : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ 1-arg2P1 == 0 /\ arg2 > 0 /\ 1+arg1P1 > 0), cost: 1 New rule: f1_0_main_Load -> f291_0_solve_GE : arg1'=arg1P1, arg2'=1, (arg1 > 0 /\ arg2 > 0 /\ 1+arg1P1 > 0), cost: 1 Applied preprocessing Original rule: f291_0_solve_GE -> f291_0_solve_GE : arg1'=arg1P2, arg2'=arg2P2, (-1+arg1 > 0 /\ -1+arg1-arg1P2 == 0 /\ -arg2P2+arg2 == 0 /\ -2+arg2 < 0 /\ -1 < 0), cost: 1 New rule: f291_0_solve_GE -> f291_0_solve_GE : arg1'=-1+arg1, (2-arg2 > 0 /\ -1+arg1 > 0), cost: 1 Applied preprocessing Original rule: f291_0_solve_GE -> f291_0_solve_GE : arg1'=arg1P3, arg2'=arg2P3, (-1+arg1 > 0 /\ -2+arg2 < 0 /\ -1+arg1-arg1P3 == 0 /\ arg2-arg2P3 == 0 /\ -1 < 0), cost: 1 New rule: f291_0_solve_GE -> f291_0_solve_GE : arg1'=-1+arg1, (2-arg2 > 0 /\ -1+arg1 > 0), cost: 1 Applied deletion Removed the following rules: 7 Simplified rules Start location: __init 5: f1_0_main_Load -> f291_0_solve_GE : arg1'=0, arg2'=0, (arg1 > 0 /\ arg2 == 0), cost: 1 6: f1_0_main_Load -> f291_0_solve_GE : arg1'=arg1P1, arg2'=1, (arg1 > 0 /\ arg2 > 0 /\ 1+arg1P1 > 0), cost: 1 8: f291_0_solve_GE -> f291_0_solve_GE : arg1'=-1+arg1, (2-arg2 > 0 /\ -1+arg1 > 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied acceleration Original rule: f291_0_solve_GE -> f291_0_solve_GE : arg1'=-1+arg1, (2-arg2 > 0 /\ -1+arg1 > 0), cost: 1 New rule: f291_0_solve_GE -> f291_0_solve_GE : arg1'=arg1-n0, (2-arg2 > 0 /\ n0 >= 0 /\ arg1-n0 > 0), cost: n0 Applied instantiation Original rule: f291_0_solve_GE -> f291_0_solve_GE : arg1'=arg1-n0, (2-arg2 > 0 /\ n0 >= 0 /\ arg1-n0 > 0), cost: n0 New rule: f291_0_solve_GE -> f291_0_solve_GE : arg1'=1, (2-arg2 > 0 /\ 1 > 0 /\ -1+arg1 >= 0), cost: -1+arg1 Applied simplification Original rule: f291_0_solve_GE -> f291_0_solve_GE : arg1'=1, (2-arg2 > 0 /\ 1 > 0 /\ -1+arg1 >= 0), cost: -1+arg1 New rule: f291_0_solve_GE -> f291_0_solve_GE : arg1'=1, (2-arg2 > 0 /\ -1+arg1 >= 0), cost: -1+arg1 Applied deletion Removed the following rules: 8 Accelerated simple loops Start location: __init 5: f1_0_main_Load -> f291_0_solve_GE : arg1'=0, arg2'=0, (arg1 > 0 /\ arg2 == 0), cost: 1 6: f1_0_main_Load -> f291_0_solve_GE : arg1'=arg1P1, arg2'=1, (arg1 > 0 /\ arg2 > 0 /\ 1+arg1P1 > 0), cost: 1 10: f291_0_solve_GE -> f291_0_solve_GE : arg1'=1, (2-arg2 > 0 /\ -1+arg1 >= 0), cost: -1+arg1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f291_0_solve_GE : arg1'=arg1P1, arg2'=1, (arg1 > 0 /\ arg2 > 0 /\ 1+arg1P1 > 0), cost: 1 Second rule: f291_0_solve_GE -> f291_0_solve_GE : arg1'=1, (2-arg2 > 0 /\ -1+arg1 >= 0), cost: -1+arg1 New rule: f1_0_main_Load -> f291_0_solve_GE : arg1'=1, arg2'=1, (arg1 > 0 /\ -1+arg1P1 >= 0 /\ arg2 > 0), cost: arg1P1 Applied deletion Removed the following rules: 10 Chained accelerated rules with incoming rules Start location: __init 5: f1_0_main_Load -> f291_0_solve_GE : arg1'=0, arg2'=0, (arg1 > 0 /\ arg2 == 0), cost: 1 6: f1_0_main_Load -> f291_0_solve_GE : arg1'=arg1P1, arg2'=1, (arg1 > 0 /\ arg2 > 0 /\ 1+arg1P1 > 0), cost: 1 11: f1_0_main_Load -> f291_0_solve_GE : arg1'=1, arg2'=1, (arg1 > 0 /\ -1+arg1P1 >= 0 /\ arg2 > 0), cost: arg1P1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Removed unreachable locations and irrelevant leafs Start location: __init <empty> Computing asymptotic complexity
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS