details

property	value
status	complete
benchmark	96176.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n053.star.cs.uiowa.edu
space	ICFP_2010

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	5.20279598236 seconds
cpu usage	18.989250401
max memory	1.34316032E9

stage attributes

key	value
output-size	7400
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: 0(1(2(x1))) -> 3(4(1(x1))) 0(2(0(2(x1)))) -> 3(5(4(4(x1)))) 1(0(4(5(x1)))) -> 1(5(4(5(x1)))) 2(2(1(0(4(x1))))) -> 1(5(4(2(5(x1))))) 1(1(0(1(4(3(x1)))))) -> 1(1(4(2(3(3(x1)))))) 1(4(0(2(0(4(x1)))))) -> 1(4(4(2(4(5(x1)))))) 2(2(2(0(3(5(0(x1))))))) -> 0(5(2(4(4(5(0(x1))))))) 0(0(4(0(0(5(3(0(x1)))))))) -> 0(0(0(0(2(4(5(0(x1)))))))) 1(2(4(3(0(5(4(4(x1)))))))) -> 1(4(2(3(3(1(4(x1))))))) 0(2(5(4(4(1(3(4(2(x1))))))))) -> 0(0(4(5(4(5(4(2(2(x1))))))))) 1(2(4(1(4(4(3(1(4(x1))))))))) -> 1(1(5(5(5(2(4(3(2(x1))))))))) 5(5(4(1(0(1(5(3(5(5(x1)))))))))) -> 3(4(3(4(4(4(0(4(2(5(x1)))))))))) 0(0(2(5(2(1(0(3(1(5(4(x1))))))))))) -> 0(4(2(4(5(5(5(1(0(3(1(x1))))))))))) 4(2(3(5(4(5(1(4(3(0(4(1(x1)))))))))))) -> 3(2(0(2(2(1(3(1(1(x1))))))))) 5(2(5(0(0(2(2(5(1(2(2(2(x1)))))))))))) -> 5(0(3(1(0(1(0(1(5(5(3(x1))))))))))) 2(2(3(2(2(0(2(2(2(3(0(2(4(x1))))))))))))) -> 2(4(1(3(2(4(3(1(4(4(5(4(1(x1))))))))))))) 4(0(2(2(3(2(4(2(5(5(5(3(3(x1))))))))))))) -> 4(0(5(0(4(0(4(2(4(4(2(5(3(x1))))))))))))) 0(3(5(4(3(0(5(0(3(1(2(4(5(1(x1)))))))))))))) -> 0(0(2(1(2(5(5(4(3(0(0(1(1(x1))))))))))))) 0(4(2(4(1(5(0(4(0(3(4(3(1(2(x1)))))))))))))) -> 0(0(5(4(0(4(0(1(2(2(0(0(0(1(x1)))))))))))))) 2(5(5(4(4(2(3(3(1(5(5(3(2(5(3(x1))))))))))))))) -> 2(4(0(5(3(3(5(4(2(4(3(1(5(2(x1)))))))))))))) 0(5(4(5(1(1(2(5(3(0(4(5(3(5(4(3(x1)))))))))))))))) -> 0(0(5(0(3(4(0(2(0(3(2(2(5(5(4(3(x1)))))))))))))))) 2(3(3(1(2(4(5(4(3(2(5(0(4(2(2(3(x1)))))))))))))))) -> 0(4(0(0(4(5(4(5(2(1(1(5(0(2(4(3(x1)))))))))))))))) 2(3(1(2(5(0(5(3(2(2(5(1(2(1(5(0(4(1(x1)))))))))))))))))) -> 1(1(5(3(3(1(1(5(4(4(5(2(2(3(5(2(5(5(1(x1))))))))))))))))))) 2(5(5(2(5(0(0(1(0(3(3(3(4(1(3(2(3(3(5(x1))))))))))))))))))) -> 3(2(4(0(1(5(5(4(0(3(4(4(2(0(3(1(0(3(5(x1))))))))))))))))))) 2(4(4(1(0(3(3(2(5(5(0(3(5(4(4(3(3(1(3(3(x1)))))))))))))))))))) -> 3(0(1(2(3(2(1(1(4(4(4(3(4(5(1(4(1(5(x1)))))))))))))))))) Proof: Bounds Processor: bound: 1 enrichment: match automaton: final states: {221,203,185,171,156,143,130,119,108,97,87,79,69,62,54,45,39,34,27,23,17,13,9,5,1} transitions: f60() -> 2* 30(40) -> 41* 30(237) -> 221* 30(10) -> 204* 30(2) -> 18* 30(199) -> 200* 30(189) -> 190* 30(104) -> 105* 30(94) -> 95* 30(226) -> 227* 30(211) -> 212* 30(206) -> 207* 30(4) -> 1* 30(166) -> 167* 30(161) -> 162* 30(151) -> 152* 30(121) -> 122* 30(101) -> 102* 30(86) -> 79* 30(66) -> 67* 30(46) -> 55* 30(41) -> 42* 30(233) -> 234* 30(198) -> 199* 30(68) -> 62* 30(220) -> 203* 30(18) -> 19* 30(8) -> 5* 30(3) -> 70* 30(150) -> 151* 30(145) -> 146* 30(80) -> 81* 40(75) -> 76* 40(65) -> 66* 40(55) -> 56* 40(30) -> 31* 40(227) -> 228* 40(25) -> 26* 40(222) -> 223* 40(20) -> 21* 40(10) -> 11* 40(137) -> 138* 40(122) -> 123* 40(112) -> 113* 40(102) -> 103* 40(77) -> 78* 40(67) -> 68* 40(47) -> 48* 40(229) -> 230* 40(209) -> 210* 40(2) -> 6* 40(194) -> 195* 40(154) -> 155* popout

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

job log

popout

actions

all output return to SRS Stand 10685