Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099200
details
property
value
status
complete
benchmark
Swingers.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.0436871 seconds
cpu usage
0.044688
user time
0.034499
system time
0.010189
max virtual memory
113188.0
max residence set size
7884.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: __init 0: f53_0_main_Load -> f53_0_main_Load : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ arg1-arg2P0 == 0 /\ arg2 > 0 /\ -100+arg1+arg2 < 0), cost: 1 1: f1_0_main_ConstantStackPush -> f53_0_main_Load : arg1'=arg1P1, arg2'=arg2P1, (13-arg2P1 == 0 /\ 17-arg1P1 == 0), cost: 1 2: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied preprocessing Original rule: f53_0_main_Load -> f53_0_main_Load : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ arg1-arg2P0 == 0 /\ arg2 > 0 /\ -100+arg1+arg2 < 0), cost: 1 New rule: f53_0_main_Load -> f53_0_main_Load : arg1'=arg2, arg2'=arg1, (arg1 > 0 /\ 100-arg1-arg2 > 0 /\ arg2 > 0), cost: 1 Applied preprocessing Original rule: f1_0_main_ConstantStackPush -> f53_0_main_Load : arg1'=arg1P1, arg2'=arg2P1, (13-arg2P1 == 0 /\ 17-arg1P1 == 0), cost: 1 New rule: f1_0_main_ConstantStackPush -> f53_0_main_Load : arg1'=17, arg2'=13, TRUE, cost: 1 Simplified rules Start location: __init 3: f53_0_main_Load -> f53_0_main_Load : arg1'=arg2, arg2'=arg1, (arg1 > 0 /\ 100-arg1-arg2 > 0 /\ arg2 > 0), cost: 1 4: f1_0_main_ConstantStackPush -> f53_0_main_Load : arg1'=17, arg2'=13, TRUE, cost: 1 2: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied unrolling Original rule: f53_0_main_Load -> f53_0_main_Load : arg1'=arg2, arg2'=arg1, (arg1 > 0 /\ 100-arg1-arg2 > 0 /\ arg2 > 0), cost: 1 New rule: f53_0_main_Load -> f53_0_main_Load : arg1'=arg1, arg2'=arg2, (arg1 > 0 /\ 100-arg1-arg2 > 0 /\ arg2 > 0), cost: 2 Applied nonterm Original rule: f53_0_main_Load -> f53_0_main_Load : arg1'=arg1, arg2'=arg2, (arg1 > 0 /\ 100-arg1-arg2 > 0 /\ arg2 > 0), cost: 2 New rule: f53_0_main_Load -> [3] : (arg1 > 0 /\ 100-arg1-arg2 > 0 /\ arg2 > 0), cost: NONTERM Applied acceleration Original rule: f53_0_main_Load -> f53_0_main_Load : arg1'=arg1, arg2'=arg2, (arg1 > 0 /\ 100-arg1-arg2 > 0 /\ arg2 > 0), cost: 2 New rule: f53_0_main_Load -> f53_0_main_Load : arg1'=arg1, arg2'=arg2, (arg1 > 0 /\ 100-arg1-arg2 > 0 /\ arg2 > 0), cost: 2*n0 Applied deletion Removed the following rules: 3 Accelerated simple loops Start location: __init 5: f53_0_main_Load -> [3] : (arg1 > 0 /\ 100-arg1-arg2 > 0 /\ arg2 > 0), cost: NONTERM 6: f53_0_main_Load -> f53_0_main_Load : arg1'=arg1, arg2'=arg2, (arg1 > 0 /\ 100-arg1-arg2 > 0 /\ arg2 > 0), cost: 2*n0 4: f1_0_main_ConstantStackPush -> f53_0_main_Load : arg1'=17, arg2'=13, TRUE, cost: 1 2: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied chaining First rule: f1_0_main_ConstantStackPush -> f53_0_main_Load : arg1'=17, arg2'=13, TRUE, cost: 1 Second rule: f53_0_main_Load -> [3] : (arg1 > 0 /\ 100-arg1-arg2 > 0 /\ arg2 > 0), cost: NONTERM New rule: f1_0_main_ConstantStackPush -> [3] : (13 > 0 /\ 17 > 0 /\ 70 > 0), cost: NONTERM Applied chaining First rule: f1_0_main_ConstantStackPush -> f53_0_main_Load : arg1'=17, arg2'=13, TRUE, cost: 1 Second rule: f53_0_main_Load -> f53_0_main_Load : arg1'=arg1, arg2'=arg2, (arg1 > 0 /\ 100-arg1-arg2 > 0 /\ arg2 > 0), cost: 2*n0 New rule: f1_0_main_ConstantStackPush -> f53_0_main_Load : arg1'=17, arg2'=13, (13 > 0 /\ 17 > 0 /\ 70 > 0), cost: 1+2*n0 Applied deletion Removed the following rules: 5 6 Chained accelerated rules with incoming rules Start location: __init 4: f1_0_main_ConstantStackPush -> f53_0_main_Load : arg1'=17, arg2'=13, TRUE, cost: 1 7: f1_0_main_ConstantStackPush -> [3] : (13 > 0 /\ 17 > 0 /\ 70 > 0), cost: NONTERM 8: f1_0_main_ConstantStackPush -> f53_0_main_Load : arg1'=17, arg2'=13, (13 > 0 /\ 17 > 0 /\ 70 > 0), cost: 1+2*n0 2: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Removed unreachable locations and irrelevant leafs Start location: __init 7: f1_0_main_ConstantStackPush -> [3] : (13 > 0 /\ 17 > 0 /\ 70 > 0), cost: NONTERM 2: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Eliminating location f1_0_main_ConstantStackPush by chaining: Applied chaining First rule: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Second rule: f1_0_main_ConstantStackPush -> [3] : (13 > 0 /\ 17 > 0 /\ 70 > 0), cost: NONTERM New rule: __init -> [3] : (13 > 0 /\ 17 > 0 /\ 70 > 0), cost: NONTERM
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS