Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099578
details
property
value
status
complete
benchmark
McCarthyIterative.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)
0.332512 seconds
cpu usage
0.337499
user time
0.300351
system time
0.037148
max virtual memory
113188.0
max residence set size
29292.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 -> f160_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0 /\ 1-arg2P0 == 0), cost: 1 1: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1P1, arg2'=arg2P1, (1-arg2P1+arg2 == 0 /\ -101+arg1 < 0 /\ arg2 > 0 /\ 11+arg1-arg1P1 == 0), cost: 1 2: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1P2, arg2'=arg2P2, (-10+arg1-arg1P2 == 0 /\ -100+arg1 > 0 /\ -1-arg2P2+arg2 == 0 /\ arg2 > 0), cost: 1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f160_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0 /\ 1-arg2P0 == 0), cost: 1 New rule: f1_0_main_Load -> f160_0_main_LE : arg1'=arg1P0, arg2'=1, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1P1, arg2'=arg2P1, (1-arg2P1+arg2 == 0 /\ -101+arg1 < 0 /\ arg2 > 0 /\ 11+arg1-arg1P1 == 0), cost: 1 New rule: f160_0_main_LE -> f160_0_main_LE : arg1'=11+arg1, arg2'=1+arg2, (101-arg1 > 0 /\ arg2 > 0), cost: 1 Applied preprocessing Original rule: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1P2, arg2'=arg2P2, (-10+arg1-arg1P2 == 0 /\ -100+arg1 > 0 /\ -1-arg2P2+arg2 == 0 /\ arg2 > 0), cost: 1 New rule: f160_0_main_LE -> f160_0_main_LE : arg1'=-10+arg1, arg2'=-1+arg2, (-100+arg1 > 0 /\ arg2 > 0), cost: 1 Simplified rules Start location: __init 4: f1_0_main_Load -> f160_0_main_LE : arg1'=arg1P0, arg2'=1, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 5: f160_0_main_LE -> f160_0_main_LE : arg1'=11+arg1, arg2'=1+arg2, (101-arg1 > 0 /\ arg2 > 0), cost: 1 6: f160_0_main_LE -> f160_0_main_LE : arg1'=-10+arg1, arg2'=-1+arg2, (-100+arg1 > 0 /\ arg2 > 0), cost: 1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied acceleration Original rule: f160_0_main_LE -> f160_0_main_LE : arg1'=11+arg1, arg2'=1+arg2, (101-arg1 > 0 /\ arg2 > 0), cost: 1 New rule: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1+11*n1, arg2'=n1+arg2, (n1 >= 0 /\ 112-arg1-11*n1 > 0 /\ arg2 > 0), cost: n1 Applied acceleration Original rule: f160_0_main_LE -> f160_0_main_LE : arg1'=-10+arg1, arg2'=-1+arg2, (-100+arg1 > 0 /\ arg2 > 0), cost: 1 New rule: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1-10*n3, arg2'=-n3+arg2, (1-n3+arg2 > 0 /\ n3 >= 0 /\ -90+arg1-10*n3 > 0), cost: n3 Applied instantiation Original rule: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1-10*n3, arg2'=-n3+arg2, (1-n3+arg2 > 0 /\ n3 >= 0 /\ -90+arg1-10*n3 > 0), cost: n3 New rule: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1-10*arg2, arg2'=0, (-90+arg1-10*arg2 > 0 /\ 1 > 0 /\ arg2 >= 0), cost: arg2 Applied simplification Original rule: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1-10*arg2, arg2'=0, (-90+arg1-10*arg2 > 0 /\ 1 > 0 /\ arg2 >= 0), cost: arg2 New rule: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1-10*arg2, arg2'=0, (-90+arg1-10*arg2 > 0 /\ arg2 >= 0), cost: arg2 Applied deletion Removed the following rules: 5 6 Accelerated simple loops Start location: __init 4: f1_0_main_Load -> f160_0_main_LE : arg1'=arg1P0, arg2'=1, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 7: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1+11*n1, arg2'=n1+arg2, (n1 >= 0 /\ 112-arg1-11*n1 > 0 /\ arg2 > 0), cost: n1 9: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1-10*arg2, arg2'=0, (-90+arg1-10*arg2 > 0 /\ arg2 >= 0), cost: arg2 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f160_0_main_LE : arg1'=arg1P0, arg2'=1, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1+11*n1, arg2'=n1+arg2, (n1 >= 0 /\ 112-arg1-11*n1 > 0 /\ arg2 > 0), cost: n1 New rule: f1_0_main_Load -> f160_0_main_LE : arg1'=11*n1+arg1P0, arg2'=1+n1, (arg1 > 0 /\ n1 >= 0 /\ 1+arg1P0 > 0 /\ 112-11*n1-arg1P0 > 0 /\ 1+arg2 > 0), cost: 1+n1 Applied chaining First rule: f1_0_main_Load -> f160_0_main_LE : arg1'=arg1P0, arg2'=1, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1-10*arg2, arg2'=0, (-90+arg1-10*arg2 > 0 /\ arg2 >= 0), cost: arg2 New rule: f1_0_main_Load -> f160_0_main_LE : arg1'=-10+arg1P0, arg2'=0, (arg1 > 0 /\ 1+arg2 > 0 /\ -100+arg1P0 > 0), cost: 2 Applied deletion Removed the following rules: 7 9 Chained accelerated rules with incoming rules Start location: __init 4: f1_0_main_Load -> f160_0_main_LE : arg1'=arg1P0, arg2'=1, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 10: f1_0_main_Load -> f160_0_main_LE : arg1'=11*n1+arg1P0, arg2'=1+n1, (arg1 > 0 /\ n1 >= 0 /\ 1+arg1P0 > 0 /\ 112-11*n1-arg1P0 > 0 /\ 1+arg2 > 0), cost: 1+n1 11: f1_0_main_Load -> f160_0_main_LE : arg1'=-10+arg1P0, arg2'=0, (arg1 > 0 /\ 1+arg2 > 0 /\ -100+arg1P0 > 0), cost: 2 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Removed unreachable locations and irrelevant leafs Start location: __init
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS