Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer Transition Systems pair #487527917
details
property
value
status
complete
benchmark
ex05_rec.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n141.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.0418879985809 seconds
cpu usage
0.036961991
max memory
1974272.0
stage attributes
key
value
output-size
4301
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Initial ITS Start location: __init 0: f1_0_main_Load -> f31_0_loop_InvokeMethod : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 1: f31_0_loop_InvokeMethod -> f31_0_loop_InvokeMethod : arg1'=arg1P1, arg2'=arg2P1, arg1-arg1P1 == 0, cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f31_0_loop_InvokeMethod : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f31_0_loop_InvokeMethod : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f31_0_loop_InvokeMethod -> f31_0_loop_InvokeMethod : arg1'=arg1P1, arg2'=arg2P1, arg1-arg1P1 == 0, cost: 1 New rule: f31_0_loop_InvokeMethod -> f31_0_loop_InvokeMethod : arg2'=arg2P1, TRUE, cost: 1 Simplified rules Start location: __init 3: f1_0_main_Load -> f31_0_loop_InvokeMethod : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 4: f31_0_loop_InvokeMethod -> f31_0_loop_InvokeMethod : arg2'=arg2P1, TRUE, cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied nonterm Original rule: f31_0_loop_InvokeMethod -> f31_0_loop_InvokeMethod : arg2'=arg2P1, TRUE, cost: 1 New rule: f31_0_loop_InvokeMethod -> [3] : TRUE, cost: NONTERM Applied acceleration Original rule: f31_0_loop_InvokeMethod -> f31_0_loop_InvokeMethod : arg2'=arg2P1, TRUE, cost: 1 New rule: f31_0_loop_InvokeMethod -> f31_0_loop_InvokeMethod : arg2'=arg2P1, TRUE, cost: n0 Applied deletion Removed the following rules: 4 Accelerated simple loops Start location: __init 3: f1_0_main_Load -> f31_0_loop_InvokeMethod : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 5: f31_0_loop_InvokeMethod -> [3] : TRUE, cost: NONTERM 6: f31_0_loop_InvokeMethod -> f31_0_loop_InvokeMethod : arg2'=arg2P1, TRUE, cost: n0 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f31_0_loop_InvokeMethod : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f31_0_loop_InvokeMethod -> [3] : TRUE, cost: NONTERM New rule: f1_0_main_Load -> [3] : (arg1 > 0 /\ 1+arg2 > 0), cost: NONTERM Applied chaining First rule: f1_0_main_Load -> f31_0_loop_InvokeMethod : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f31_0_loop_InvokeMethod -> f31_0_loop_InvokeMethod : arg2'=arg2P1, TRUE, cost: n0 New rule: f1_0_main_Load -> f31_0_loop_InvokeMethod : arg1'=arg2, arg2'=arg2P1, (arg1 > 0 /\ 1+arg2 > 0), cost: 1+n0 Applied deletion Removed the following rules: 5 6 Chained accelerated rules with incoming rules Start location: __init 3: f1_0_main_Load -> f31_0_loop_InvokeMethod : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 7: f1_0_main_Load -> [3] : (arg1 > 0 /\ 1+arg2 > 0), cost: NONTERM 8: f1_0_main_Load -> f31_0_loop_InvokeMethod : arg1'=arg2, arg2'=arg2P1, (arg1 > 0 /\ 1+arg2 > 0), cost: 1+n0 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Removed unreachable locations and irrelevant leafs Start location: __init 7: f1_0_main_Load -> [3] : (arg1 > 0 /\ 1+arg2 > 0), cost: NONTERM 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Eliminating location f1_0_main_Load by chaining: Applied chaining First rule: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Second rule: f1_0_main_Load -> [3] : (arg1 > 0 /\ 1+arg2 > 0), cost: NONTERM New rule: __init -> [3] : (1+arg2P2 > 0 /\ arg1P2 > 0), cost: NONTERM
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integer Transition Systems