details

property	value
status	complete
benchmark	eric1.t2.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n098.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	3.82656693459 seconds
cpu usage	4.101121785
max memory	2.2417408E7

stage attributes

key	value
output-size	2181
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_Transition /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE DP problem for innermost termination. P = f6#(x1, x2) -> f1#(x1, x2) f2#(I0, I1) -> f5#(-1 + I0, 1 + I1) [1 <= I0] f5#(I2, I3) -> f2#(I2, I3) f5#(I4, I5) -> f3#(I4, -1 + I5) [1 <= I5] f3#(I6, I7) -> f5#(-1 + I6, 1 + I7) [1 <= I6] f4#(I8, I9) -> f3#(I8, I9) f3#(I10, I11) -> f4#(1 + I10, -1 + I11) [1 <= I11] f1#(I12, I13) -> f2#(I12, I13) [0 <= I12 /\ 0 <= I13 /\ I13 <= 0] R = f6(x1, x2) -> f1(x1, x2) f2(I0, I1) -> f5(-1 + I0, 1 + I1) [1 <= I0] f5(I2, I3) -> f2(I2, I3) f5(I4, I5) -> f3(I4, -1 + I5) [1 <= I5] f3(I6, I7) -> f5(-1 + I6, 1 + I7) [1 <= I6] f4(I8, I9) -> f3(I8, I9) f3(I10, I11) -> f4(1 + I10, -1 + I11) [1 <= I11] f1(I12, I13) -> f2(I12, I13) [0 <= I12 /\ 0 <= I13 /\ I13 <= 0] The dependency graph for this problem is: 0 -> 7 1 -> 2, 3 2 -> 1 3 -> 4, 6 4 -> 2, 3 5 -> 4, 6 6 -> 5 7 -> 1 Where: 0) f6#(x1, x2) -> f1#(x1, x2) 1) f2#(I0, I1) -> f5#(-1 + I0, 1 + I1) [1 <= I0] 2) f5#(I2, I3) -> f2#(I2, I3) 3) f5#(I4, I5) -> f3#(I4, -1 + I5) [1 <= I5] 4) f3#(I6, I7) -> f5#(-1 + I6, 1 + I7) [1 <= I6] 5) f4#(I8, I9) -> f3#(I8, I9) 6) f3#(I10, I11) -> f4#(1 + I10, -1 + I11) [1 <= I11] 7) f1#(I12, I13) -> f2#(I12, I13) [0 <= I12 /\ 0 <= I13 /\ I13 <= 0] We have the following SCCs. { 1, 2, 3, 4, 5, 6 } DP problem for innermost termination. P = f2#(I0, I1) -> f5#(-1 + I0, 1 + I1) [1 <= I0] f5#(I2, I3) -> f2#(I2, I3) f5#(I4, I5) -> f3#(I4, -1 + I5) [1 <= I5] f3#(I6, I7) -> f5#(-1 + I6, 1 + I7) [1 <= I6] f4#(I8, I9) -> f3#(I8, I9) f3#(I10, I11) -> f4#(1 + I10, -1 + I11) [1 <= I11] R = f6(x1, x2) -> f1(x1, x2) f2(I0, I1) -> f5(-1 + I0, 1 + I1) [1 <= I0] f5(I2, I3) -> f2(I2, I3) f5(I4, I5) -> f3(I4, -1 + I5) [1 <= I5] f3(I6, I7) -> f5(-1 + I6, 1 + I7) [1 <= I6] f4(I8, I9) -> f3(I8, I9) f3(I10, I11) -> f4(1 + I10, -1 + I11) [1 <= I11] f1(I12, I13) -> f2(I12, I13) [0 <= I12 /\ 0 <= I13 /\ I13 <= 0] popout

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

job log

popout

actions

all output return to Integer Transition Systems