Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487100115
details
property
value
status
complete
benchmark
Velroyen08-whilePart.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n145.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.0784021 seconds
cpu usage
0.07986
user time
0.065045
system time
0.014815
max virtual memory
113188.0
max residence set size
18512.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: __init 0: f1_0_main_Load -> f48_0_increase_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 1: f48_0_increase_LE -> f48_0_increase_LE : arg1'=arg1P1, arg2'=arg2P1, (-9+arg1 > 0 /\ arg1-arg1P1 == 0), cost: 1 2: f48_0_increase_LE -> f48_0_increase_LE : arg1'=arg1P2, arg2'=arg2P2, (-10+arg1 < 0 /\ -1+arg1-arg1P2 == 0 /\ -5+arg1 > 0), cost: 1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f48_0_increase_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f48_0_increase_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f48_0_increase_LE -> f48_0_increase_LE : arg1'=arg1P1, arg2'=arg2P1, (-9+arg1 > 0 /\ arg1-arg1P1 == 0), cost: 1 New rule: f48_0_increase_LE -> f48_0_increase_LE : arg2'=arg2P1, -9+arg1 > 0, cost: 1 Applied preprocessing Original rule: f48_0_increase_LE -> f48_0_increase_LE : arg1'=arg1P2, arg2'=arg2P2, (-10+arg1 < 0 /\ -1+arg1-arg1P2 == 0 /\ -5+arg1 > 0), cost: 1 New rule: f48_0_increase_LE -> f48_0_increase_LE : arg1'=-1+arg1, arg2'=arg2P2, (10-arg1 > 0 /\ -5+arg1 > 0), cost: 1 Simplified rules Start location: __init 4: f1_0_main_Load -> f48_0_increase_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 5: f48_0_increase_LE -> f48_0_increase_LE : arg2'=arg2P1, -9+arg1 > 0, cost: 1 6: f48_0_increase_LE -> f48_0_increase_LE : arg1'=-1+arg1, arg2'=arg2P2, (10-arg1 > 0 /\ -5+arg1 > 0), cost: 1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied nonterm Original rule: f48_0_increase_LE -> f48_0_increase_LE : arg2'=arg2P1, -9+arg1 > 0, cost: 1 New rule: f48_0_increase_LE -> [3] : -9+arg1 > 0, cost: NONTERM Applied acceleration Original rule: f48_0_increase_LE -> f48_0_increase_LE : arg2'=arg2P1, -9+arg1 > 0, cost: 1 New rule: f48_0_increase_LE -> f48_0_increase_LE : arg2'=arg2P1, -9+arg1 > 0, cost: n1 Applied acceleration Original rule: f48_0_increase_LE -> f48_0_increase_LE : arg1'=-1+arg1, arg2'=arg2P2, (10-arg1 > 0 /\ -5+arg1 > 0), cost: 1 New rule: f48_0_increase_LE -> f48_0_increase_LE : arg1'=arg1-n3, arg2'=arg2P2, (-4+arg1-n3 > 0 /\ 10-arg1 > 0 /\ -1+n3 >= 0), cost: n3 Applied instantiation Original rule: f48_0_increase_LE -> f48_0_increase_LE : arg1'=arg1-n3, arg2'=arg2P2, (-4+arg1-n3 > 0 /\ 10-arg1 > 0 /\ -1+n3 >= 0), cost: n3 New rule: f48_0_increase_LE -> f48_0_increase_LE : arg1'=5, arg2'=arg2P2, (1 > 0 /\ 10-arg1 > 0 /\ -6+arg1 >= 0), cost: -5+arg1 Applied simplification Original rule: f48_0_increase_LE -> f48_0_increase_LE : arg1'=5, arg2'=arg2P2, (1 > 0 /\ 10-arg1 > 0 /\ -6+arg1 >= 0), cost: -5+arg1 New rule: f48_0_increase_LE -> f48_0_increase_LE : arg1'=5, arg2'=arg2P2, (10-arg1 > 0 /\ -6+arg1 >= 0), cost: -5+arg1 Applied deletion Removed the following rules: 5 6 Accelerated simple loops Start location: __init 4: f1_0_main_Load -> f48_0_increase_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 7: f48_0_increase_LE -> [3] : -9+arg1 > 0, cost: NONTERM 8: f48_0_increase_LE -> f48_0_increase_LE : arg2'=arg2P1, -9+arg1 > 0, cost: n1 10: f48_0_increase_LE -> f48_0_increase_LE : arg1'=5, arg2'=arg2P2, (10-arg1 > 0 /\ -6+arg1 >= 0), cost: -5+arg1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f48_0_increase_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f48_0_increase_LE -> [3] : -9+arg1 > 0, cost: NONTERM New rule: f1_0_main_Load -> [3] : (arg1 > 0 /\ -9+arg2 > 0), cost: NONTERM Applied chaining First rule: f1_0_main_Load -> f48_0_increase_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f48_0_increase_LE -> f48_0_increase_LE : arg2'=arg2P1, -9+arg1 > 0, cost: n1 New rule: f1_0_main_Load -> f48_0_increase_LE : arg1'=arg2, arg2'=arg2P1, (arg1 > 0 /\ -9+arg2 > 0), cost: 1+n1 Applied chaining First rule: f1_0_main_Load -> f48_0_increase_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f48_0_increase_LE -> f48_0_increase_LE : arg1'=5, arg2'=arg2P2, (10-arg1 > 0 /\ -6+arg1 >= 0), cost: -5+arg1 New rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS