Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487100067
details
property
value
status
complete
benchmark
ListReverseAcyclicList.jar-obl-9.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_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.122322 seconds
cpu usage
0.124365
user time
0.099585
system time
0.02478
max virtual memory
113188.0
max residence set size
19040.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 -> f152_0_createList_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+x30 > 0 /\ 1-arg1+arg1P0 <= 0 /\ arg2 > 0 /\ 1+arg1P0 > 0 /\ -1+x30-arg2P0 == 0), cost: 1 1: f152_0_createList_LE -> f196_0_reverse_NULL : arg1'=arg1P1, arg2'=arg2P1, (-1+arg2 < 0 /\ 1+arg1P1 > 0 /\ 1+arg1 > 0 /\ -arg1+arg1P1 <= 0), cost: 1 2: f152_0_createList_LE -> f152_0_createList_LE : arg1'=arg1P2, arg2'=arg2P2, (1+arg1 > 0 /\ arg2 > 0 /\ -1+arg2-arg2P2 == 0 /\ arg1P2 > 0 /\ -2-arg1+arg1P2 <= 0), cost: 1 3: f196_0_reverse_NULL -> f196_0_reverse_NULL : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ 1+arg1P3 > 0 /\ 1-arg1+arg1P3 <= 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f152_0_createList_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+x30 > 0 /\ 1-arg1+arg1P0 <= 0 /\ arg2 > 0 /\ 1+arg1P0 > 0 /\ -1+x30-arg2P0 == 0), cost: 1 New rule: f1_0_main_Load -> f152_0_createList_LE : arg1'=arg1P0, arg2'=-1+x30, (1+x30 > 0 /\ 1-arg1+arg1P0 <= 0 /\ arg2 > 0 /\ 1+arg1P0 > 0), cost: 1 Applied preprocessing Original rule: f152_0_createList_LE -> f196_0_reverse_NULL : arg1'=arg1P1, arg2'=arg2P1, (-1+arg2 < 0 /\ 1+arg1P1 > 0 /\ 1+arg1 > 0 /\ -arg1+arg1P1 <= 0), cost: 1 New rule: f152_0_createList_LE -> f196_0_reverse_NULL : arg1'=arg1P1, arg2'=arg2P1, (1-arg2 > 0 /\ 1+arg1P1 > 0 /\ -arg1+arg1P1 <= 0), cost: 1 Applied preprocessing Original rule: f152_0_createList_LE -> f152_0_createList_LE : arg1'=arg1P2, arg2'=arg2P2, (1+arg1 > 0 /\ arg2 > 0 /\ -1+arg2-arg2P2 == 0 /\ arg1P2 > 0 /\ -2-arg1+arg1P2 <= 0), cost: 1 New rule: f152_0_createList_LE -> f152_0_createList_LE : arg1'=arg1P2, arg2'=-1+arg2, (1+arg1 > 0 /\ arg2 > 0 /\ arg1P2 > 0 /\ -2-arg1+arg1P2 <= 0), cost: 1 Applied preprocessing Original rule: f196_0_reverse_NULL -> f196_0_reverse_NULL : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ 1+arg1P3 > 0 /\ 1-arg1+arg1P3 <= 0), cost: 1 New rule: f196_0_reverse_NULL -> f196_0_reverse_NULL : arg1'=arg1P3, arg2'=arg2P3, (1+arg1P3 > 0 /\ 1-arg1+arg1P3 <= 0), cost: 1 Simplified rules Start location: __init 5: f1_0_main_Load -> f152_0_createList_LE : arg1'=arg1P0, arg2'=-1+x30, (1+x30 > 0 /\ 1-arg1+arg1P0 <= 0 /\ arg2 > 0 /\ 1+arg1P0 > 0), cost: 1 6: f152_0_createList_LE -> f196_0_reverse_NULL : arg1'=arg1P1, arg2'=arg2P1, (1-arg2 > 0 /\ 1+arg1P1 > 0 /\ -arg1+arg1P1 <= 0), cost: 1 7: f152_0_createList_LE -> f152_0_createList_LE : arg1'=arg1P2, arg2'=-1+arg2, (1+arg1 > 0 /\ arg2 > 0 /\ arg1P2 > 0 /\ -2-arg1+arg1P2 <= 0), cost: 1 8: f196_0_reverse_NULL -> f196_0_reverse_NULL : arg1'=arg1P3, arg2'=arg2P3, (1+arg1P3 > 0 /\ 1-arg1+arg1P3 <= 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied acceleration Original rule: f152_0_createList_LE -> f152_0_createList_LE : arg1'=arg1P2, arg2'=-1+arg2, (1+arg1 > 0 /\ arg2 > 0 /\ arg1P2 > 0 /\ -2-arg1+arg1P2 <= 0), cost: 1 New rule: f152_0_createList_LE -> f152_0_createList_LE : arg1'=arg1P2, arg2'=arg2-n0, (-1+n0 >= 0 /\ arg1P2 > 0 /\ 2+arg1-arg1P2 >= 0 /\ 1+arg2-n0 > 0 /\ ((1+arg1 > 0 /\ arg1P2 > 0) \/ (1+arg1 > 0 /\ 1+arg1P2 > 0))), cost: n0 Applied instantiation Original rule: f152_0_createList_LE -> f152_0_createList_LE : arg1'=arg1P2, arg2'=arg2-n0, (-1+n0 >= 0 /\ arg1P2 > 0 /\ 2+arg1-arg1P2 >= 0 /\ 1+arg2-n0 > 0 /\ ((1+arg1 > 0 /\ arg1P2 > 0) \/ (1+arg1 > 0 /\ 1+arg1P2 > 0))), cost: n0 New rule: f152_0_createList_LE -> f152_0_createList_LE : arg1'=arg1P2, arg2'=0, (1 > 0 /\ -1+arg2 >= 0 /\ arg1P2 > 0 /\ 2+arg1-arg1P2 >= 0 /\ ((1+arg1 > 0 /\ 1+arg1P2 > 0) \/ (1+arg1 > 0 /\ arg1P2 > 0))), cost: arg2 Applied simplification Original rule: f152_0_createList_LE -> f152_0_createList_LE : arg1'=arg1P2, arg2'=0, (1 > 0 /\ -1+arg2 >= 0 /\ arg1P2 > 0 /\ 2+arg1-arg1P2 >= 0 /\ ((1+arg1 > 0 /\ 1+arg1P2 > 0) \/ (1+arg1 > 0 /\ arg1P2 > 0))), cost: arg2 New rule: f152_0_createList_LE -> f152_0_createList_LE : arg1'=arg1P2, arg2'=0, (-1+arg2 >= 0 /\ 1+arg1 > 0 /\ arg1P2 > 0 /\ 2+arg1-arg1P2 >= 0), cost: arg2 Applied deletion Removed the following rules: 7 Accelerated simple loops Start location: __init 5: f1_0_main_Load -> f152_0_createList_LE : arg1'=arg1P0, arg2'=-1+x30, (1+x30 > 0 /\ 1-arg1+arg1P0 <= 0 /\ arg2 > 0 /\ 1+arg1P0 > 0), cost: 1 6: f152_0_createList_LE -> f196_0_reverse_NULL : arg1'=arg1P1, arg2'=arg2P1, (1-arg2 > 0 /\ 1+arg1P1 > 0 /\ -arg1+arg1P1 <= 0), cost: 1 10: f152_0_createList_LE -> f152_0_createList_LE : arg1'=arg1P2, arg2'=0, (-1+arg2 >= 0 /\ 1+arg1 > 0 /\ arg1P2 > 0 /\ 2+arg1-arg1P2 >= 0), cost: arg2 8: f196_0_reverse_NULL -> f196_0_reverse_NULL : arg1'=arg1P3, arg2'=arg2P3, (1+arg1P3 > 0 /\ 1-arg1+arg1P3 <= 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f152_0_createList_LE : arg1'=arg1P0, arg2'=-1+x30, (1+x30 > 0 /\ 1-arg1+arg1P0 <= 0 /\ arg2 > 0 /\ 1+arg1P0 > 0), cost: 1 Second rule: f152_0_createList_LE -> f152_0_createList_LE : arg1'=arg1P2, arg2'=0, (-1+arg2 >= 0 /\ 1+arg1 > 0 /\ arg1P2 > 0 /\ 2+arg1-arg1P2 >= 0), cost: arg2 New rule: f1_0_main_Load -> f152_0_createList_LE : arg1'=arg1P2, arg2'=0, (-1-arg1+arg1P2 <= 0 /\ 1-arg1 <= 0 /\ -2+x30 >= 0 /\ arg2 > 0 /\ arg1P2 > 0), cost: x30 Applied deletion Removed the following rules: 10 Applied chaining First rule: f152_0_createList_LE -> f196_0_reverse_NULL : arg1'=arg1P1, arg2'=arg2P1, (1-arg2 > 0 /\ 1+arg1P1 > 0 /\ -arg1+arg1P1 <= 0), cost: 1 Second rule: f196_0_reverse_NULL -> f196_0_reverse_NULL : arg1'=arg1P3, arg2'=arg2P3, (1+arg1P3 > 0 /\ 1-arg1+arg1P3 <= 0), cost: 1 New rule: f152_0_createList_LE -> f196_0_reverse_NULL : arg1'=arg1P3, arg2'=arg2P3, (1+arg1P3 > 0 /\ 1-arg1+arg1P3 <= 0 /\ 1-arg2 > 0), cost: 2 Applied deletion Removed the following rules: 8 Chained accelerated rules with incoming rules Start location: __init 5: f1_0_main_Load -> f152_0_createList_LE : arg1'=arg1P0, arg2'=-1+x30, (1+x30 > 0 /\ 1-arg1+arg1P0 <= 0 /\ arg2 > 0 /\ 1+arg1P0 > 0), cost: 1 11: f1_0_main_Load -> f152_0_createList_LE : arg1'=arg1P2, arg2'=0, (-1-arg1+arg1P2 <= 0 /\ 1-arg1 <= 0 /\ -2+x30 >= 0 /\ arg2 > 0 /\ arg1P2 > 0), cost: x30
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS