Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099398
details
property
value
status
complete
benchmark
FactSLR.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.678057 seconds
cpu usage
0.682055
user time
0.657983
system time
0.024072
max virtual memory
278304.0
max residence set size
20996.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 -> f563_0_mk_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (arg1 > 0 /\ -arg2 == 0 /\ -arg3P0 == 0 /\ -1-arg1P0 == 0 /\ -arg2P0 == 0 /\ -arg4P0 == 0), cost: 1 1: f1_0_main_Load -> f563_0_mk_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, arg4'=arg4P1, (arg1 > 0 /\ -1+3*x30-arg1P1 == 0 /\ 1-arg4P1 == 0 /\ arg2 > 0 /\ 1+x30 > 0 /\ -arg3P1+arg2 == 0 /\ 3*x30-arg2P1 == 0), cost: 1 2: f563_0_mk_LE -> f563_0_mk_LE : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, arg4'=arg4P2, (arg1-arg2P2 == 0 /\ -1+arg1-arg1P2 == 0 /\ arg2 > 0 /\ -arg4P2+arg4 == 0 /\ arg3-arg3P2 == 0 /\ -arg3+arg4 >= 0 /\ 1+arg3 > 0), cost: 1 3: f563_0_mk_LE -> f563_0_mk_LE : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, arg4'=arg4P3, (1+arg4 > 0 /\ arg3-arg3P3 == 0 /\ arg1-arg2P3 == 0 /\ 1-arg4P3+arg4 == 0 /\ arg2 > 0 /\ -1+arg1-arg1P3 == 0 /\ -arg3+arg4 < 0 /\ 1+arg3 > 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, arg4'=arg4P4, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f563_0_mk_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (arg1 > 0 /\ -arg2 == 0 /\ -arg3P0 == 0 /\ -1-arg1P0 == 0 /\ -arg2P0 == 0 /\ -arg4P0 == 0), cost: 1 New rule: f1_0_main_Load -> f563_0_mk_LE : arg1'=-1, arg3'=0, arg2'=0, arg4'=0, (arg1 > 0 /\ arg2 == 0), cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f563_0_mk_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, arg4'=arg4P1, (arg1 > 0 /\ -1+3*x30-arg1P1 == 0 /\ 1-arg4P1 == 0 /\ arg2 > 0 /\ 1+x30 > 0 /\ -arg3P1+arg2 == 0 /\ 3*x30-arg2P1 == 0), cost: 1 New rule: f1_0_main_Load -> f563_0_mk_LE : arg1'=-1+3*x30, arg3'=arg2, arg2'=3*x30, arg4'=1, (arg1 > 0 /\ arg2 > 0 /\ 1+x30 > 0), cost: 1 Applied preprocessing Original rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, arg4'=arg4P2, (arg1-arg2P2 == 0 /\ -1+arg1-arg1P2 == 0 /\ arg2 > 0 /\ -arg4P2+arg4 == 0 /\ arg3-arg3P2 == 0 /\ -arg3+arg4 >= 0 /\ 1+arg3 > 0), cost: 1 New rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1+arg1, arg2'=arg1, (arg2 > 0 /\ -arg3+arg4 >= 0 /\ 1+arg3 > 0), cost: 1 Applied preprocessing Original rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, arg4'=arg4P3, (1+arg4 > 0 /\ arg3-arg3P3 == 0 /\ arg1-arg2P3 == 0 /\ 1-arg4P3+arg4 == 0 /\ arg2 > 0 /\ -1+arg1-arg1P3 == 0 /\ -arg3+arg4 < 0 /\ 1+arg3 > 0), cost: 1 New rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1+arg1, arg2'=arg1, arg4'=1+arg4, (1+arg4 > 0 /\ arg2 > 0 /\ arg3-arg4 > 0), cost: 1 Simplified rules Start location: __init 5: f1_0_main_Load -> f563_0_mk_LE : arg1'=-1, arg3'=0, arg2'=0, arg4'=0, (arg1 > 0 /\ arg2 == 0), cost: 1 6: f1_0_main_Load -> f563_0_mk_LE : arg1'=-1+3*x30, arg3'=arg2, arg2'=3*x30, arg4'=1, (arg1 > 0 /\ arg2 > 0 /\ 1+x30 > 0), cost: 1 7: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1+arg1, arg2'=arg1, (arg2 > 0 /\ -arg3+arg4 >= 0 /\ 1+arg3 > 0), cost: 1 8: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1+arg1, arg2'=arg1, arg4'=1+arg4, (1+arg4 > 0 /\ arg2 > 0 /\ arg3-arg4 > 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, arg4'=arg4P4, TRUE, cost: 1 Applied acceleration Original rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1+arg1, arg2'=arg1, (arg2 > 0 /\ -arg3+arg4 >= 0 /\ 1+arg3 > 0), cost: 1 New rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=arg1-n1, arg2'=1+arg1-n1, (-1+n1 >= 0 /\ arg2 > 0 /\ 2+arg1-n1 > 0 /\ -arg3+arg4 >= 0 /\ 1+arg3 > 0), cost: n1 Applied instantiation Original rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=arg1-n1, arg2'=1+arg1-n1, (-1+n1 >= 0 /\ arg2 > 0 /\ 2+arg1-n1 > 0 /\ -arg3+arg4 >= 0 /\ 1+arg3 > 0), cost: n1 New rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1, arg2'=0, (arg1 >= 0 /\ 1 > 0 /\ arg2 > 0 /\ -arg3+arg4 >= 0 /\ 1+arg3 > 0), cost: 1+arg1 Applied acceleration Original rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1+arg1, arg2'=arg1, arg4'=1+arg4, (1+arg4 > 0 /\ arg2 > 0 /\ arg3-arg4 > 0), cost: 1 New rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=arg1-n3, arg2'=1+arg1-n3, arg4'=n3+arg4, (1+arg4 > 0 /\ 2+arg1-n3 > 0 /\ -1+n3 >= 0 /\ arg2 > 0 /\ 1+arg3-n3-arg4 > 0), cost: n3 Applied instantiation Original rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=arg1-n3, arg2'=1+arg1-n3, arg4'=n3+arg4, (1+arg4 > 0 /\ 2+arg1-n3 > 0 /\ -1+n3 >= 0 /\ arg2 > 0 /\ 1+arg3-n3-arg4 > 0), cost: n3 New rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1, arg2'=0, arg4'=1+arg1+arg4, (arg1 >= 0 /\ 1 > 0 /\ 1+arg4 > 0 /\ arg2 > 0 /\ -arg1+arg3-arg4 > 0), cost: 1+arg1 Applied instantiation Original rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=arg1-n3, arg2'=1+arg1-n3, arg4'=n3+arg4, (1+arg4 > 0 /\ 2+arg1-n3 > 0 /\ -1+n3 >= 0 /\ arg2 > 0 /\ 1+arg3-n3-arg4 > 0), cost: n3 New rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=arg1-arg3+arg4, arg2'=1+arg1-arg3+arg4, arg4'=arg3, (1 > 0 /\ 1+arg4 > 0 /\ -1+arg3-arg4 >= 0 /\ arg2 > 0 /\ 2+arg1-arg3+arg4 > 0), cost: arg3-arg4 Applied simplification Original rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1, arg2'=0, (arg1 >= 0 /\ 1 > 0 /\ arg2 > 0 /\ -arg3+arg4 >= 0 /\ 1+arg3 > 0), cost: 1+arg1 New rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1, arg2'=0, (arg1 >= 0 /\ arg2 > 0 /\ -arg3+arg4 >= 0 /\ 1+arg3 > 0), cost: 1+arg1 Applied simplification Original rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1, arg2'=0, arg4'=1+arg1+arg4, (arg1 >= 0 /\ 1 > 0 /\ 1+arg4 > 0 /\ arg2 > 0 /\ -arg1+arg3-arg4 > 0), cost: 1+arg1 New rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1, arg2'=0, arg4'=1+arg1+arg4, (arg1 >= 0 /\ 1+arg4 > 0 /\ arg2 > 0 /\ -arg1+arg3-arg4 > 0), cost: 1+arg1 Applied simplification Original rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=arg1-arg3+arg4, arg2'=1+arg1-arg3+arg4, arg4'=arg3, (1 > 0 /\ 1+arg4 > 0 /\ -1+arg3-arg4 >= 0 /\ arg2 > 0 /\ 2+arg1-arg3+arg4 > 0), cost: arg3-arg4 New rule: f563_0_mk_LE -> f563_0_mk_LE : arg1'=arg1-arg3+arg4, arg2'=1+arg1-arg3+arg4, arg4'=arg3, (1+arg4 > 0 /\ -1+arg3-arg4 >= 0 /\ arg2 > 0 /\ 2+arg1-arg3+arg4 > 0), cost: arg3-arg4 Applied deletion Removed the following rules: 7 8 Accelerated simple loops Start location: __init 5: f1_0_main_Load -> f563_0_mk_LE : arg1'=-1, arg3'=0, arg2'=0, arg4'=0, (arg1 > 0 /\ arg2 == 0), cost: 1 6: f1_0_main_Load -> f563_0_mk_LE : arg1'=-1+3*x30, arg3'=arg2, arg2'=3*x30, arg4'=1, (arg1 > 0 /\ arg2 > 0 /\ 1+x30 > 0), cost: 1 12: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1, arg2'=0, (arg1 >= 0 /\ arg2 > 0 /\ -arg3+arg4 >= 0 /\ 1+arg3 > 0), cost: 1+arg1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS