Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099230
details
property
value
status
complete
benchmark
ListContentArbitrary.jar-obl-10.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n151.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.172538 seconds
cpu usage
0.174785
user time
0.158527
system time
0.016258
max virtual memory
113188.0
max residence set size
19148.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: __init 0: f297_0_createIntList_Return -> f508_0_random_ArrayAccess : arg1'=arg1P0, arg2'=arg2P0, (-arg1+arg1P0 <= 0 /\ 1+arg1P0 > 0 /\ 1+arg1 > 0), cost: 1 2: f508_0_random_ArrayAccess -> f698_0_nth_LE : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -arg1+arg1P2 <= 0 /\ arg1P2 > 0 /\ 1+arg2P2 > 0 /\ x70 > 0), cost: 1 1: f1_0_main_Load -> f508_0_random_ArrayAccess : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ 1+arg1P1 > 0), cost: 1 6: f1_0_main_Load -> f658_0_createIntList_LE : arg1'=arg1P6, arg2'=arg2P6, (arg1 > 0 /\ 1-arg2P6 == 0 /\ 1+arg1P6 > 0 /\ 1+arg2 > 0), cost: 1 3: f698_0_nth_LE -> f746_0_main_LE : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ 2-arg1+arg1P3 <= 0 /\ -2+arg2 < 0), cost: 1 4: f698_0_nth_LE -> f698_0_nth_LE : arg1'=arg1P4, arg2'=arg2P4, (arg1 > 0 /\ 1+arg1P4 > 0 /\ -1+arg2 > 0 /\ 1-arg1+arg1P4 <= 0 /\ -1-arg2P4+arg2 == 0), cost: 1 5: f746_0_main_LE -> f746_0_main_LE : arg1'=arg1P5, arg2'=arg2P5, (arg1 > 0 /\ -1+arg1-arg1P5 == 0), cost: 1 7: f658_0_createIntList_LE -> f658_0_createIntList_LE : arg1'=arg1P7, arg2'=arg2P7, (arg1 > 0 /\ -1+arg1-arg1P7 == 0 /\ arg2 > 0 /\ 1-arg2P7+arg2 == 0), cost: 1 8: __init -> f1_0_main_Load : arg1'=arg1P8, arg2'=arg2P8, TRUE, cost: 1 Removed unreachable rules and leafs Start location: __init 2: f508_0_random_ArrayAccess -> f698_0_nth_LE : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -arg1+arg1P2 <= 0 /\ arg1P2 > 0 /\ 1+arg2P2 > 0 /\ x70 > 0), cost: 1 1: f1_0_main_Load -> f508_0_random_ArrayAccess : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ 1+arg1P1 > 0), cost: 1 6: f1_0_main_Load -> f658_0_createIntList_LE : arg1'=arg1P6, arg2'=arg2P6, (arg1 > 0 /\ 1-arg2P6 == 0 /\ 1+arg1P6 > 0 /\ 1+arg2 > 0), cost: 1 3: f698_0_nth_LE -> f746_0_main_LE : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ 2-arg1+arg1P3 <= 0 /\ -2+arg2 < 0), cost: 1 4: f698_0_nth_LE -> f698_0_nth_LE : arg1'=arg1P4, arg2'=arg2P4, (arg1 > 0 /\ 1+arg1P4 > 0 /\ -1+arg2 > 0 /\ 1-arg1+arg1P4 <= 0 /\ -1-arg2P4+arg2 == 0), cost: 1 5: f746_0_main_LE -> f746_0_main_LE : arg1'=arg1P5, arg2'=arg2P5, (arg1 > 0 /\ -1+arg1-arg1P5 == 0), cost: 1 7: f658_0_createIntList_LE -> f658_0_createIntList_LE : arg1'=arg1P7, arg2'=arg2P7, (arg1 > 0 /\ -1+arg1-arg1P7 == 0 /\ arg2 > 0 /\ 1-arg2P7+arg2 == 0), cost: 1 8: __init -> f1_0_main_Load : arg1'=arg1P8, arg2'=arg2P8, TRUE, cost: 1 Applied preprocessing Original rule: f508_0_random_ArrayAccess -> f698_0_nth_LE : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -arg1+arg1P2 <= 0 /\ arg1P2 > 0 /\ 1+arg2P2 > 0 /\ x70 > 0), cost: 1 New rule: f508_0_random_ArrayAccess -> f698_0_nth_LE : arg1'=arg1P2, arg2'=arg2P2, (-arg1+arg1P2 <= 0 /\ arg1P2 > 0 /\ 1+arg2P2 > 0), cost: 1 Applied preprocessing Original rule: f698_0_nth_LE -> f746_0_main_LE : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ 2-arg1+arg1P3 <= 0 /\ -2+arg2 < 0), cost: 1 New rule: f698_0_nth_LE -> f746_0_main_LE : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ 2-arg2 > 0 /\ 2-arg1+arg1P3 <= 0), cost: 1 Applied preprocessing Original rule: f698_0_nth_LE -> f698_0_nth_LE : arg1'=arg1P4, arg2'=arg2P4, (arg1 > 0 /\ 1+arg1P4 > 0 /\ -1+arg2 > 0 /\ 1-arg1+arg1P4 <= 0 /\ -1-arg2P4+arg2 == 0), cost: 1 New rule: f698_0_nth_LE -> f698_0_nth_LE : arg1'=arg1P4, arg2'=-1+arg2, (1+arg1P4 > 0 /\ -1+arg2 > 0 /\ 1-arg1+arg1P4 <= 0), cost: 1 Applied preprocessing Original rule: f746_0_main_LE -> f746_0_main_LE : arg1'=arg1P5, arg2'=arg2P5, (arg1 > 0 /\ -1+arg1-arg1P5 == 0), cost: 1 New rule: f746_0_main_LE -> f746_0_main_LE : arg1'=-1+arg1, arg2'=arg2P5, arg1 > 0, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f658_0_createIntList_LE : arg1'=arg1P6, arg2'=arg2P6, (arg1 > 0 /\ 1-arg2P6 == 0 /\ 1+arg1P6 > 0 /\ 1+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f658_0_createIntList_LE : arg1'=arg1P6, arg2'=1, (arg1 > 0 /\ 1+arg1P6 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f658_0_createIntList_LE -> f658_0_createIntList_LE : arg1'=arg1P7, arg2'=arg2P7, (arg1 > 0 /\ -1+arg1-arg1P7 == 0 /\ arg2 > 0 /\ 1-arg2P7+arg2 == 0), cost: 1 New rule: f658_0_createIntList_LE -> f658_0_createIntList_LE : arg1'=-1+arg1, arg2'=1+arg2, (arg1 > 0 /\ arg2 > 0), cost: 1 Simplified rules Start location: __init 9: f508_0_random_ArrayAccess -> f698_0_nth_LE : arg1'=arg1P2, arg2'=arg2P2, (-arg1+arg1P2 <= 0 /\ arg1P2 > 0 /\ 1+arg2P2 > 0), cost: 1 1: f1_0_main_Load -> f508_0_random_ArrayAccess : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ 1+arg1P1 > 0), cost: 1 13: f1_0_main_Load -> f658_0_createIntList_LE : arg1'=arg1P6, arg2'=1, (arg1 > 0 /\ 1+arg1P6 > 0 /\ 1+arg2 > 0), cost: 1 10: f698_0_nth_LE -> f746_0_main_LE : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ 2-arg2 > 0 /\ 2-arg1+arg1P3 <= 0), cost: 1 11: f698_0_nth_LE -> f698_0_nth_LE : arg1'=arg1P4, arg2'=-1+arg2, (1+arg1P4 > 0 /\ -1+arg2 > 0 /\ 1-arg1+arg1P4 <= 0), cost: 1 12: f746_0_main_LE -> f746_0_main_LE : arg1'=-1+arg1, arg2'=arg2P5, arg1 > 0, cost: 1 14: f658_0_createIntList_LE -> f658_0_createIntList_LE : arg1'=-1+arg1, arg2'=1+arg2, (arg1 > 0 /\ arg2 > 0), cost: 1 8: __init -> f1_0_main_Load : arg1'=arg1P8, arg2'=arg2P8, TRUE, cost: 1 Applied acceleration Original rule: f746_0_main_LE -> f746_0_main_LE : arg1'=-1+arg1, arg2'=arg2P5, arg1 > 0, cost: 1 New rule: f746_0_main_LE -> f746_0_main_LE : arg1'=arg1-n2, arg2'=arg2P5, (-1+n2 >= 0 /\ 1+arg1-n2 > 0), cost: n2 Applied instantiation Original rule: f746_0_main_LE -> f746_0_main_LE : arg1'=arg1-n2, arg2'=arg2P5, (-1+n2 >= 0 /\ 1+arg1-n2 > 0), cost: n2 New rule: f746_0_main_LE -> f746_0_main_LE : arg1'=0, arg2'=arg2P5, (1 > 0 /\ -1+arg1 >= 0), cost: arg1 Applied simplification Original rule: f746_0_main_LE -> f746_0_main_LE : arg1'=0, arg2'=arg2P5, (1 > 0 /\ -1+arg1 >= 0), cost: arg1 New rule: f746_0_main_LE -> f746_0_main_LE : arg1'=0, arg2'=arg2P5, -1+arg1 >= 0, cost: arg1 Applied deletion Removed the following rules: 12 Applied acceleration Original rule: f658_0_createIntList_LE -> f658_0_createIntList_LE : arg1'=-1+arg1, arg2'=1+arg2, (arg1 > 0 /\ arg2 > 0), cost: 1 New rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS