details

property	value
status	complete
benchmark	GCD4.jar-obl-8.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n027.star.cs.uiowa.edu
space	From_AProVE_2014

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.918473005295 seconds
cpu usage	0.916704307
max memory	2.4342528E7

stage attributes

key	value
output-size	8976
starexec-result	WORST_CASE(Omega(0),?)

output

/export/starexec/sandbox/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(0),?) Initial ITS Start location: __init 0: f1_0_main_Load -> f152_0_gcd_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 1: f152_0_gcd_LE -> f216_0_mod_LT : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ -arg2P1+arg2 == 0 /\ arg2 > 0 /\ arg1-arg1P1 == 0), cost: 1 2: f216_0_mod_LT -> f152_0_gcd_LE : arg1'=arg1P2, arg2'=arg2P2, (-arg1+arg2 > 0 /\ arg1-arg2P2 == 0 /\ arg2-arg1P2 == 0), cost: 1 3: f216_0_mod_LT -> f216_0_mod_LT : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ arg1-arg1P3-arg2 == 0 /\ -arg1+arg2 <= 0 /\ arg2 > 0 /\ arg2-arg2P3 == 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied preprocessing Original rule: f152_0_gcd_LE -> f216_0_mod_LT : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ -arg2P1+arg2 == 0 /\ arg2 > 0 /\ arg1-arg1P1 == 0), cost: 1 New rule: f152_0_gcd_LE -> f216_0_mod_LT : (arg1 > 0 /\ arg2 > 0), cost: 1 Applied preprocessing Original rule: f216_0_mod_LT -> f152_0_gcd_LE : arg1'=arg1P2, arg2'=arg2P2, (-arg1+arg2 > 0 /\ arg1-arg2P2 == 0 /\ arg2-arg1P2 == 0), cost: 1 New rule: f216_0_mod_LT -> f152_0_gcd_LE : arg1'=arg2, arg2'=arg1, -arg1+arg2 > 0, cost: 1 Applied preprocessing Original rule: f216_0_mod_LT -> f216_0_mod_LT : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ arg1-arg1P3-arg2 == 0 /\ -arg1+arg2 <= 0 /\ arg2 > 0 /\ arg2-arg2P3 == 0), cost: 1 New rule: f216_0_mod_LT -> f216_0_mod_LT : arg1'=arg1-arg2, (-arg1+arg2 <= 0 /\ arg2 > 0), cost: 1 Simplified rules Start location: __init 0: f1_0_main_Load -> f152_0_gcd_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 5: f152_0_gcd_LE -> f216_0_mod_LT : (arg1 > 0 /\ arg2 > 0), cost: 1 6: f216_0_mod_LT -> f152_0_gcd_LE : arg1'=arg2, arg2'=arg1, -arg1+arg2 > 0, cost: 1 7: f216_0_mod_LT -> f216_0_mod_LT : arg1'=arg1-arg2, (-arg1+arg2 <= 0 /\ arg2 > 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied acceleration Original rule: f216_0_mod_LT -> f216_0_mod_LT : arg1'=arg1-arg2, (-arg1+arg2 <= 0 /\ arg2 > 0), cost: 1 New rule: f216_0_mod_LT -> f216_0_mod_LT : arg1'=arg1-n0*arg2, (n0 >= 0 /\ arg2 > 0 /\ arg1-arg2-(-1+n0)*arg2 >= 0), cost: n0 Applied deletion Removed the following rules: 7 Accelerated simple loops Start location: __init 0: f1_0_main_Load -> f152_0_gcd_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 5: f152_0_gcd_LE -> f216_0_mod_LT : (arg1 > 0 /\ arg2 > 0), cost: 1 6: f216_0_mod_LT -> f152_0_gcd_LE : arg1'=arg2, arg2'=arg1, -arg1+arg2 > 0, cost: 1 8: f216_0_mod_LT -> f216_0_mod_LT : arg1'=arg1-n0*arg2, (n0 >= 0 /\ arg2 > 0 /\ arg1-arg2-(-1+n0)*arg2 >= 0), cost: n0 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied chaining First rule: f152_0_gcd_LE -> f216_0_mod_LT : (arg1 > 0 /\ arg2 > 0), cost: 1 Second rule: f216_0_mod_LT -> f216_0_mod_LT : arg1'=arg1-n0*arg2, (n0 >= 0 /\ arg2 > 0 /\ arg1-arg2-(-1+n0)*arg2 >= 0), cost: n0 New rule: f152_0_gcd_LE -> f216_0_mod_LT : arg1'=arg1-n0*arg2, (arg1 > 0 /\ n0 >= 0 /\ arg2 > 0 /\ arg1-arg2-(-1+n0)*arg2 >= 0), cost: 1+n0 Applied deletion Removed the following rules: 8 Chained accelerated rules with incoming rules Start location: __init 0: f1_0_main_Load -> f152_0_gcd_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 5: f152_0_gcd_LE -> f216_0_mod_LT : (arg1 > 0 /\ arg2 > 0), cost: 1 9: f152_0_gcd_LE -> f216_0_mod_LT : arg1'=arg1-n0*arg2, (arg1 > 0 /\ n0 >= 0 /\ arg2 > 0 /\ arg1-arg2-(-1+n0)*arg2 >= 0), cost: 1+n0 6: f216_0_mod_LT -> f152_0_gcd_LE : arg1'=arg2, arg2'=arg1, -arg1+arg2 > 0, cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Eliminating location f1_0_main_Load by chaining: Applied chaining First rule: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Second rule: f1_0_main_Load -> f152_0_gcd_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 New rule: __init -> f152_0_gcd_LE : arg1'=arg1P0, arg2'=arg2P0, (1+arg2P4 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ arg1P4 > 0), cost: 2 Applied deletion Removed the following rules: 0 4 Eliminated locations on linear paths Start location: __init 5: f152_0_gcd_LE -> f216_0_mod_LT : (arg1 > 0 /\ arg2 > 0), cost: 1 9: f152_0_gcd_LE -> f216_0_mod_LT : arg1'=arg1-n0*arg2, (arg1 > 0 /\ n0 >= 0 /\ arg2 > 0 /\ arg1-arg2-(-1+n0)*arg2 >= 0), cost: 1+n0 6: f216_0_mod_LT -> f152_0_gcd_LE : arg1'=arg2, arg2'=arg1, -arg1+arg2 > 0, cost: 1 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Integer Transition Systems