Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099326
details
property
value
status
complete
benchmark
Velroyen08-twoFloatInterv.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n143.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.259344 seconds
cpu usage
0.264975
user time
0.239409
system time
0.025566
max virtual memory
113188.0
max residence set size
20620.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: __init 0: f1_0_main_Load -> f89_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 1: f89_0_loop_LE -> f131_0_loop_LE : arg1'=arg1P1, arg2'=arg2P1, (-50+arg1 < 0 /\ -19+arg1 > 0 /\ arg1-arg1P1 == 0), cost: 1 2: f89_0_loop_LE -> f131_0_loop_LE : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -50+arg1 < 0 /\ -1+arg1-arg1P2 == 0 /\ -20+arg1 < 0), cost: 1 3: f131_0_loop_LE -> f89_0_loop_LE : arg1'=arg1P3, arg2'=arg2P3, (arg1-arg1P3 == 0 /\ -11+arg1 < 0 /\ -30+arg1 < 0), cost: 1 4: f131_0_loop_LE -> f89_0_loop_LE : arg1'=arg1P4, arg2'=arg2P4, (1+arg1-arg1P4 == 0 /\ -10+arg1 > 0 /\ -29+arg1 < 0), cost: 1 5: f131_0_loop_LE -> f89_0_loop_LE : arg1'=arg1P5, arg2'=arg2P5, (-39+arg1 > 0 /\ 1+arg1-arg1P5 == 0), cost: 1 6: f131_0_loop_LE -> f89_0_loop_LE : arg1'=arg1P6, arg2'=arg2P6, (-28+arg1 > 0 /\ arg1-arg1P6 == 0 /\ -40+arg1 < 0), cost: 1 7: __init -> f1_0_main_Load : arg1'=arg1P7, arg2'=arg2P7, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f89_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f89_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f89_0_loop_LE -> f131_0_loop_LE : arg1'=arg1P1, arg2'=arg2P1, (-50+arg1 < 0 /\ -19+arg1 > 0 /\ arg1-arg1P1 == 0), cost: 1 New rule: f89_0_loop_LE -> f131_0_loop_LE : arg2'=arg2P1, (-19+arg1 > 0 /\ 50-arg1 > 0), cost: 1 Applied preprocessing Original rule: f89_0_loop_LE -> f131_0_loop_LE : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -50+arg1 < 0 /\ -1+arg1-arg1P2 == 0 /\ -20+arg1 < 0), cost: 1 New rule: f89_0_loop_LE -> f131_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P2, (arg1 > 0 /\ 20-arg1 > 0), cost: 1 Applied preprocessing Original rule: f131_0_loop_LE -> f89_0_loop_LE : arg1'=arg1P3, arg2'=arg2P3, (arg1-arg1P3 == 0 /\ -11+arg1 < 0 /\ -30+arg1 < 0), cost: 1 New rule: f131_0_loop_LE -> f89_0_loop_LE : arg2'=arg2P3, 11-arg1 > 0, cost: 1 Applied preprocessing Original rule: f131_0_loop_LE -> f89_0_loop_LE : arg1'=arg1P4, arg2'=arg2P4, (1+arg1-arg1P4 == 0 /\ -10+arg1 > 0 /\ -29+arg1 < 0), cost: 1 New rule: f131_0_loop_LE -> f89_0_loop_LE : arg1'=1+arg1, arg2'=arg2P4, (-10+arg1 > 0 /\ 29-arg1 > 0), cost: 1 Applied preprocessing Original rule: f131_0_loop_LE -> f89_0_loop_LE : arg1'=arg1P5, arg2'=arg2P5, (-39+arg1 > 0 /\ 1+arg1-arg1P5 == 0), cost: 1 New rule: f131_0_loop_LE -> f89_0_loop_LE : arg1'=1+arg1, arg2'=arg2P5, -39+arg1 > 0, cost: 1 Applied preprocessing Original rule: f131_0_loop_LE -> f89_0_loop_LE : arg1'=arg1P6, arg2'=arg2P6, (-28+arg1 > 0 /\ arg1-arg1P6 == 0 /\ -40+arg1 < 0), cost: 1 New rule: f131_0_loop_LE -> f89_0_loop_LE : arg2'=arg2P6, (-28+arg1 > 0 /\ 40-arg1 > 0), cost: 1 Simplified rules Start location: __init 8: f1_0_main_Load -> f89_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 9: f89_0_loop_LE -> f131_0_loop_LE : arg2'=arg2P1, (-19+arg1 > 0 /\ 50-arg1 > 0), cost: 1 10: f89_0_loop_LE -> f131_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P2, (arg1 > 0 /\ 20-arg1 > 0), cost: 1 11: f131_0_loop_LE -> f89_0_loop_LE : arg2'=arg2P3, 11-arg1 > 0, cost: 1 12: f131_0_loop_LE -> f89_0_loop_LE : arg1'=1+arg1, arg2'=arg2P4, (-10+arg1 > 0 /\ 29-arg1 > 0), cost: 1 13: f131_0_loop_LE -> f89_0_loop_LE : arg1'=1+arg1, arg2'=arg2P5, -39+arg1 > 0, cost: 1 14: f131_0_loop_LE -> f89_0_loop_LE : arg2'=arg2P6, (-28+arg1 > 0 /\ 40-arg1 > 0), cost: 1 7: __init -> f1_0_main_Load : arg1'=arg1P7, arg2'=arg2P7, TRUE, cost: 1 Eliminating location f1_0_main_Load by chaining: Applied chaining First rule: __init -> f1_0_main_Load : arg1'=arg1P7, arg2'=arg2P7, TRUE, cost: 1 Second rule: f1_0_main_Load -> f89_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 New rule: __init -> f89_0_loop_LE : arg1'=arg2P7, arg2'=arg2P0, (1+arg2P7 > 0 /\ arg1P7 > 0), cost: 2 Applied deletion Removed the following rules: 7 8 Eliminated locations on linear paths Start location: __init 9: f89_0_loop_LE -> f131_0_loop_LE : arg2'=arg2P1, (-19+arg1 > 0 /\ 50-arg1 > 0), cost: 1 10: f89_0_loop_LE -> f131_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P2, (arg1 > 0 /\ 20-arg1 > 0), cost: 1 11: f131_0_loop_LE -> f89_0_loop_LE : arg2'=arg2P3, 11-arg1 > 0, cost: 1 12: f131_0_loop_LE -> f89_0_loop_LE : arg1'=1+arg1, arg2'=arg2P4, (-10+arg1 > 0 /\ 29-arg1 > 0), cost: 1 13: f131_0_loop_LE -> f89_0_loop_LE : arg1'=1+arg1, arg2'=arg2P5, -39+arg1 > 0, cost: 1 14: f131_0_loop_LE -> f89_0_loop_LE : arg2'=arg2P6, (-28+arg1 > 0 /\ 40-arg1 > 0), cost: 1 15: __init -> f89_0_loop_LE : arg1'=arg2P7, arg2'=arg2P0, (1+arg2P7 > 0 /\ arg1P7 > 0), cost: 2 Eliminating location f131_0_loop_LE by chaining: Applied chaining First rule: f89_0_loop_LE -> f131_0_loop_LE : arg2'=arg2P1, (-19+arg1 > 0 /\ 50-arg1 > 0), cost: 1 Second rule: f131_0_loop_LE -> f89_0_loop_LE : arg1'=1+arg1, arg2'=arg2P4, (-10+arg1 > 0 /\ 29-arg1 > 0), cost: 1 New rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS