Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487100097
details
property
value
status
complete
benchmark
PastaC7.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n143.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.565021 seconds
cpu usage
0.566157
user time
0.550897
system time
0.01526
max virtual memory
292752.0
max residence set size
19168.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 -> f263_0_main_GT : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0 /\ 1+arg3P0 > 0), cost: 1 1: f263_0_main_GT -> f263_0_main_GT : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (1+arg1-arg1P1 == 0 /\ 1+arg1 > 0 /\ -arg1+arg2 >= 0 /\ -1+arg2-arg2P1 == 0 /\ arg1-arg3P1 == 0 /\ -101+arg3 < 0), cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, TRUE, cost: 1 Applied preprocessing Original rule: f263_0_main_GT -> f263_0_main_GT : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (1+arg1-arg1P1 == 0 /\ 1+arg1 > 0 /\ -arg1+arg2 >= 0 /\ -1+arg2-arg2P1 == 0 /\ arg1-arg3P1 == 0 /\ -101+arg3 < 0), cost: 1 New rule: f263_0_main_GT -> f263_0_main_GT : arg1'=1+arg1, arg3'=arg1, arg2'=-1+arg2, (101-arg3 > 0 /\ 1+arg1 > 0 /\ -arg1+arg2 >= 0), cost: 1 Simplified rules Start location: __init 0: f1_0_main_Load -> f263_0_main_GT : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0 /\ 1+arg3P0 > 0), cost: 1 3: f263_0_main_GT -> f263_0_main_GT : arg1'=1+arg1, arg3'=arg1, arg2'=-1+arg2, (101-arg3 > 0 /\ 1+arg1 > 0 /\ -arg1+arg2 >= 0), cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, TRUE, cost: 1 Applied acceleration Original rule: f263_0_main_GT -> f263_0_main_GT : arg1'=1+arg1, arg3'=arg1, arg2'=-1+arg2, (101-arg3 > 0 /\ 1+arg1 > 0 /\ -arg1+arg2 >= 0), cost: 1 New rule: f263_0_main_GT -> f263_0_main_GT : arg1'=arg1+n0, arg3'=-1+arg1+n0, arg2'=arg2-n0, (-1+n0 >= 0 /\ 2-arg1+arg2-2*n0 >= 0 /\ 101-arg3 > 0 /\ 1+arg1 > 0 /\ 103-arg1-n0 > 0), cost: n0 Applied instantiation Original rule: f263_0_main_GT -> f263_0_main_GT : arg1'=arg1+n0, arg3'=-1+arg1+n0, arg2'=arg2-n0, (-1+n0 >= 0 /\ 2-arg1+arg2-2*n0 >= 0 /\ 101-arg3 > 0 /\ 1+arg1 > 0 /\ 103-arg1-n0 > 0), cost: n0 New rule: f263_0_main_GT -> f263_0_main_GT : arg1'=102, arg3'=101, arg2'=-102+arg1+arg2, (101-arg1 >= 0 /\ 1 > 0 /\ 101-arg3 > 0 /\ -202+arg1+arg2 >= 0 /\ 1+arg1 > 0), cost: 102-arg1 Applied simplification Original rule: f263_0_main_GT -> f263_0_main_GT : arg1'=102, arg3'=101, arg2'=-102+arg1+arg2, (101-arg1 >= 0 /\ 1 > 0 /\ 101-arg3 > 0 /\ -202+arg1+arg2 >= 0 /\ 1+arg1 > 0), cost: 102-arg1 New rule: f263_0_main_GT -> f263_0_main_GT : arg1'=102, arg3'=101, arg2'=-102+arg1+arg2, (101-arg3 > 0 /\ -202+arg1+arg2 >= 0 /\ -101+arg1 <= 0 /\ 1+arg1 > 0), cost: 102-arg1 Applied deletion Removed the following rules: 3 Accelerated simple loops Start location: __init 0: f1_0_main_Load -> f263_0_main_GT : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0 /\ 1+arg3P0 > 0), cost: 1 5: f263_0_main_GT -> f263_0_main_GT : arg1'=102, arg3'=101, arg2'=-102+arg1+arg2, (101-arg3 > 0 /\ -202+arg1+arg2 >= 0 /\ -101+arg1 <= 0 /\ 1+arg1 > 0), cost: 102-arg1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f263_0_main_GT : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0 /\ 1+arg3P0 > 0), cost: 1 Second rule: f263_0_main_GT -> f263_0_main_GT : arg1'=102, arg3'=101, arg2'=-102+arg1+arg2, (101-arg3 > 0 /\ -202+arg1+arg2 >= 0 /\ -101+arg1 <= 0 /\ 1+arg1 > 0), cost: 102-arg1 New rule: f1_0_main_Load -> f263_0_main_GT : arg1'=102, arg3'=101, arg2'=-102+arg2P0+arg1P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ -101+arg1P0 <= 0 /\ 1+arg2 > 0 /\ -202+arg2P0+arg1P0 >= 0), cost: 103-arg1P0 Applied deletion Removed the following rules: 5 Chained accelerated rules with incoming rules Start location: __init 0: f1_0_main_Load -> f263_0_main_GT : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ 1+arg2 > 0 /\ 1+arg3P0 > 0), cost: 1 6: f1_0_main_Load -> f263_0_main_GT : arg1'=102, arg3'=101, arg2'=-102+arg2P0+arg1P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ -101+arg1P0 <= 0 /\ 1+arg2 > 0 /\ -202+arg2P0+arg1P0 >= 0), cost: 103-arg1P0 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, TRUE, cost: 1 Removed unreachable locations and irrelevant leafs Start location: __init <empty> Computing asymptotic complexity Proved the following lower bound Complexity: Unknown Cpx degree: ? Solved cost: 0 Rule cost: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS