Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099848
details
property
value
status
complete
benchmark
PastaC5.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n142.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
2.27871 seconds
cpu usage
2.28117
user time
2.25196
system time
0.029203
max virtual memory
278168.0
max residence set size
29364.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 -> f168_0_main_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ arg1P0 > 0 /\ 1+arg2 > 0 /\ arg2P0 > 0), cost: 1 1: f168_0_main_EQ -> f168_0_main_EQ : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ -arg1-arg2P1+arg2 == 0 /\ -arg1+arg2 > 0 /\ arg2 > 0 /\ arg1-arg1P1 == 0), cost: 1 2: f168_0_main_EQ -> f168_0_main_EQ : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ arg1-arg2-arg1P2 == 0 /\ -arg2P2+arg2 == 0 /\ -arg1+arg2 < 0 /\ arg2 > 0), cost: 1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied preprocessing Original rule: f168_0_main_EQ -> f168_0_main_EQ : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ -arg1-arg2P1+arg2 == 0 /\ -arg1+arg2 > 0 /\ arg2 > 0 /\ arg1-arg1P1 == 0), cost: 1 New rule: f168_0_main_EQ -> f168_0_main_EQ : arg2'=-arg1+arg2, (arg1 > 0 /\ -arg1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f168_0_main_EQ -> f168_0_main_EQ : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ arg1-arg2-arg1P2 == 0 /\ -arg2P2+arg2 == 0 /\ -arg1+arg2 < 0 /\ arg2 > 0), cost: 1 New rule: f168_0_main_EQ -> f168_0_main_EQ : arg1'=arg1-arg2, (arg2 > 0 /\ arg1-arg2 > 0), cost: 1 Simplified rules Start location: __init 0: f1_0_main_Load -> f168_0_main_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ arg1P0 > 0 /\ 1+arg2 > 0 /\ arg2P0 > 0), cost: 1 4: f168_0_main_EQ -> f168_0_main_EQ : arg2'=-arg1+arg2, (arg1 > 0 /\ -arg1+arg2 > 0), cost: 1 5: f168_0_main_EQ -> f168_0_main_EQ : arg1'=arg1-arg2, (arg2 > 0 /\ arg1-arg2 > 0), cost: 1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied acceleration Original rule: f168_0_main_EQ -> f168_0_main_EQ : arg2'=-arg1+arg2, (arg1 > 0 /\ -arg1+arg2 > 0), cost: 1 New rule: f168_0_main_EQ -> f168_0_main_EQ : arg2'=-arg1*n1+arg2, (arg1 > 0 /\ n1 >= 0 /\ -arg1+arg2-arg1*(-1+n1) > 0), cost: n1 Applied acceleration Original rule: f168_0_main_EQ -> f168_0_main_EQ : arg1'=arg1-arg2, (arg2 > 0 /\ arg1-arg2 > 0), cost: 1 New rule: f168_0_main_EQ -> f168_0_main_EQ : arg1'=arg1-arg2*n3, (arg2 > 0 /\ arg1-arg2-arg2*(-1+n3) > 0 /\ n3 >= 0), cost: n3 Applied deletion Removed the following rules: 4 5 Accelerated simple loops Start location: __init 0: f1_0_main_Load -> f168_0_main_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ arg1P0 > 0 /\ 1+arg2 > 0 /\ arg2P0 > 0), cost: 1 6: f168_0_main_EQ -> f168_0_main_EQ : arg2'=-arg1*n1+arg2, (arg1 > 0 /\ n1 >= 0 /\ -arg1+arg2-arg1*(-1+n1) > 0), cost: n1 7: f168_0_main_EQ -> f168_0_main_EQ : arg1'=arg1-arg2*n3, (arg2 > 0 /\ arg1-arg2-arg2*(-1+n3) > 0 /\ n3 >= 0), cost: n3 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f168_0_main_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ arg1P0 > 0 /\ 1+arg2 > 0 /\ arg2P0 > 0), cost: 1 Second rule: f168_0_main_EQ -> f168_0_main_EQ : arg2'=-arg1*n1+arg2, (arg1 > 0 /\ n1 >= 0 /\ -arg1+arg2-arg1*(-1+n1) > 0), cost: n1 New rule: f1_0_main_Load -> f168_0_main_EQ : arg1'=arg1P0, arg2'=-n1*arg1P0+arg2P0, (arg1 > 0 /\ n1 >= 0 /\ arg1P0 > 0 /\ -arg1P0-(-1+n1)*arg1P0+arg2P0 > 0 /\ 1+arg2 > 0), cost: 1+n1 Applied chaining First rule: f1_0_main_Load -> f168_0_main_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ arg1P0 > 0 /\ 1+arg2 > 0 /\ arg2P0 > 0), cost: 1 Second rule: f168_0_main_EQ -> f168_0_main_EQ : arg1'=arg1-arg2*n3, (arg2 > 0 /\ arg1-arg2-arg2*(-1+n3) > 0 /\ n3 >= 0), cost: n3 New rule: f1_0_main_Load -> f168_0_main_EQ : arg1'=arg1P0-n3*arg2P0, arg2'=arg2P0, (arg1 > 0 /\ arg1P0-(-1+n3)*arg2P0-arg2P0 > 0 /\ 1+arg2 > 0 /\ n3 >= 0 /\ arg2P0 > 0), cost: 1+n3 Applied deletion Removed the following rules: 6 7 Chained accelerated rules with incoming rules Start location: __init 0: f1_0_main_Load -> f168_0_main_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ arg1P0 > 0 /\ 1+arg2 > 0 /\ arg2P0 > 0), cost: 1 8: f1_0_main_Load -> f168_0_main_EQ : arg1'=arg1P0, arg2'=-n1*arg1P0+arg2P0, (arg1 > 0 /\ n1 >= 0 /\ arg1P0 > 0 /\ -arg1P0-(-1+n1)*arg1P0+arg2P0 > 0 /\ 1+arg2 > 0), cost: 1+n1 9: f1_0_main_Load -> f168_0_main_EQ : arg1'=arg1P0-n3*arg2P0, arg2'=arg2P0, (arg1 > 0 /\ arg1P0-(-1+n3)*arg2P0-arg2P0 > 0 /\ 1+arg2 > 0 /\ n3 >= 0 /\ arg2P0 > 0), cost: 1+n3 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, 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