Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099503
details
property
value
status
complete
benchmark
AckR.jar-obl-8.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.268724 seconds
cpu usage
0.27701
user time
0.249641
system time
0.027369
max virtual memory
113188.0
max residence set size
20568.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 -> f180_0_ack_GT : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg2 == 0 /\ -arg1P0 == 0 /\ -arg2P0 == 0), cost: 1 1: f1_0_main_Load -> f180_0_ack_GT : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ 1+arg2P1 > 0 /\ -arg1P1 == 0 /\ 1-arg2 == 0), cost: 1 2: f1_0_main_Load -> f180_0_ack_GT : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -1+arg2 > 0 /\ 1+arg2P2 > 0 /\ 1+arg1P2 > 0), cost: 1 3: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P3, arg2'=arg2P3, (-1+arg2-arg2P3 == 0 /\ -arg1 == 0 /\ arg2 > 0 /\ -1 < 0 /\ 1-arg1P3 == 0), cost: 1 4: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P4, arg2'=arg2P4, (arg1 > 0 /\ -arg2P4+arg2 == 0 /\ arg2 > 0 /\ -1 < 0 /\ -1+arg1-arg1P4 == 0), cost: 1 5: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P5, arg2'=arg2P5, (arg1 > 0 /\ -1+arg2-arg2P5 == 0 /\ arg1P5 > 0 /\ arg2 > 0 /\ -1 < 0), cost: 1 6: __init -> f1_0_main_Load : arg1'=arg1P6, arg2'=arg2P6, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f180_0_ack_GT : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg2 == 0 /\ -arg1P0 == 0 /\ -arg2P0 == 0), cost: 1 New rule: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=0, (arg1 > 0 /\ arg2 == 0), cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f180_0_ack_GT : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ 1+arg2P1 > 0 /\ -arg1P1 == 0 /\ 1-arg2 == 0), cost: 1 New rule: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=arg2P1, (arg1 > 0 /\ 1+arg2P1 > 0 /\ -1+arg2 == 0), cost: 1 Applied preprocessing Original rule: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P3, arg2'=arg2P3, (-1+arg2-arg2P3 == 0 /\ -arg1 == 0 /\ arg2 > 0 /\ -1 < 0 /\ 1-arg1P3 == 0), cost: 1 New rule: f180_0_ack_GT -> f180_0_ack_GT : arg1'=1, arg2'=-1+arg2, (arg1 == 0 /\ arg2 > 0), cost: 1 Applied preprocessing Original rule: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P4, arg2'=arg2P4, (arg1 > 0 /\ -arg2P4+arg2 == 0 /\ arg2 > 0 /\ -1 < 0 /\ -1+arg1-arg1P4 == 0), cost: 1 New rule: f180_0_ack_GT -> f180_0_ack_GT : arg1'=-1+arg1, (arg1 > 0 /\ arg2 > 0), cost: 1 Applied preprocessing Original rule: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P5, arg2'=arg2P5, (arg1 > 0 /\ -1+arg2-arg2P5 == 0 /\ arg1P5 > 0 /\ arg2 > 0 /\ -1 < 0), cost: 1 New rule: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P5, arg2'=-1+arg2, (arg1 > 0 /\ arg1P5 > 0 /\ arg2 > 0), cost: 1 Simplified rules Start location: __init 2: f1_0_main_Load -> f180_0_ack_GT : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -1+arg2 > 0 /\ 1+arg2P2 > 0 /\ 1+arg1P2 > 0), cost: 1 7: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=0, (arg1 > 0 /\ arg2 == 0), cost: 1 8: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=arg2P1, (arg1 > 0 /\ 1+arg2P1 > 0 /\ -1+arg2 == 0), cost: 1 9: f180_0_ack_GT -> f180_0_ack_GT : arg1'=1, arg2'=-1+arg2, (arg1 == 0 /\ arg2 > 0), cost: 1 10: f180_0_ack_GT -> f180_0_ack_GT : arg1'=-1+arg1, (arg1 > 0 /\ arg2 > 0), cost: 1 11: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P5, arg2'=-1+arg2, (arg1 > 0 /\ arg1P5 > 0 /\ arg2 > 0), cost: 1 6: __init -> f1_0_main_Load : arg1'=arg1P6, arg2'=arg2P6, TRUE, cost: 1 Applied acceleration Original rule: f180_0_ack_GT -> f180_0_ack_GT : arg1'=-1+arg1, (arg1 > 0 /\ arg2 > 0), cost: 1 New rule: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1-n3, (n3 >= 0 /\ 1+arg1-n3 > 0 /\ arg2 > 0), cost: n3 Applied instantiation Original rule: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1-n3, (n3 >= 0 /\ 1+arg1-n3 > 0 /\ arg2 > 0), cost: n3 New rule: f180_0_ack_GT -> f180_0_ack_GT : arg1'=0, (arg1 >= 0 /\ 1 > 0 /\ arg2 > 0), cost: arg1 Applied acceleration Original rule: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P5, arg2'=-1+arg2, (arg1 > 0 /\ arg1P5 > 0 /\ arg2 > 0), cost: 1 New rule: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P5, arg2'=-n5+arg2, (-1+n5 >= 0 /\ arg1P5 > 0 /\ 1-n5+arg2 > 0 /\ ((arg1 > 0 /\ arg1P5 > 0) \/ (arg1 > 0 /\ arg1P5 > 0))), cost: n5 Applied instantiation Original rule: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P5, arg2'=-n5+arg2, (-1+n5 >= 0 /\ arg1P5 > 0 /\ 1-n5+arg2 > 0 /\ ((arg1 > 0 /\ arg1P5 > 0) \/ (arg1 > 0 /\ arg1P5 > 0))), cost: n5 New rule: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P5, arg2'=0, (1 > 0 /\ -1+arg2 >= 0 /\ arg1P5 > 0 /\ ((arg1 > 0 /\ arg1P5 > 0) \/ (arg1 > 0 /\ arg1P5 > 0))), cost: arg2 Applied simplification Original rule: f180_0_ack_GT -> f180_0_ack_GT : arg1'=0, (arg1 >= 0 /\ 1 > 0 /\ arg2 > 0), cost: arg1 New rule: f180_0_ack_GT -> f180_0_ack_GT : arg1'=0, (arg1 >= 0 /\ arg2 > 0), cost: arg1 Applied simplification Original rule: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P5, arg2'=0, (1 > 0 /\ -1+arg2 >= 0 /\ arg1P5 > 0 /\ ((arg1 > 0 /\ arg1P5 > 0) \/ (arg1 > 0 /\ arg1P5 > 0))), cost: arg2 New rule: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P5, arg2'=0, (arg1 > 0 /\ -1+arg2 >= 0 /\ arg1P5 > 0), cost: arg2 Applied deletion Removed the following rules: 10 11 Accelerated simple loops Start location: __init 2: f1_0_main_Load -> f180_0_ack_GT : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -1+arg2 > 0 /\ 1+arg2P2 > 0 /\ 1+arg1P2 > 0), cost: 1 7: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=0, (arg1 > 0 /\ arg2 == 0), cost: 1 8: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=arg2P1, (arg1 > 0 /\ 1+arg2P1 > 0 /\ -1+arg2 == 0), cost: 1 9: f180_0_ack_GT -> f180_0_ack_GT : arg1'=1, arg2'=-1+arg2, (arg1 == 0 /\ arg2 > 0), cost: 1 14: f180_0_ack_GT -> f180_0_ack_GT : arg1'=0, (arg1 >= 0 /\ arg2 > 0), cost: arg1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS