details

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

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	5.51274991035 seconds
cpu usage	20.029717098
max memory	1.335656448E9

stage attributes

key	value
output-size	8795
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: 0(0(1(2(x1)))) -> 0(2(3(x1))) 3(4(1(4(x1)))) -> 3(1(3(2(x1)))) 2(3(5(5(2(x1))))) -> 2(3(5(3(x1)))) 3(0(0(5(4(4(0(x1))))))) -> 3(0(4(3(3(5(x1)))))) 1(2(0(0(2(3(4(2(5(x1))))))))) -> 4(1(0(0(1(2(0(2(5(x1))))))))) 5(5(2(2(1(0(0(0(0(x1))))))))) -> 5(3(4(2(5(5(3(x1))))))) 1(3(3(2(3(0(3(2(4(3(x1)))))))))) -> 1(3(2(1(1(5(4(1(2(2(3(x1))))))))))) 0(5(5(3(1(2(3(1(3(2(1(x1))))))))))) -> 0(0(5(3(2(5(5(5(2(0(x1)))))))))) 1(0(2(5(2(0(0(0(5(5(1(x1))))))))))) -> 4(5(4(0(3(5(2(0(1(1(x1)))))))))) 1(5(1(0(5(3(5(0(1(1(2(x1))))))))))) -> 1(4(0(3(4(0(5(3(3(x1))))))))) 4(1(4(1(5(5(0(3(3(4(2(2(x1)))))))))))) -> 4(4(0(2(0(3(4(3(3(4(2(x1))))))))))) 0(1(0(1(2(0(4(1(3(0(3(2(1(x1))))))))))))) -> 0(3(2(3(5(2(3(0(3(2(4(x1))))))))))) 3(3(4(2(5(2(5(0(5(2(4(0(4(x1))))))))))))) -> 3(3(4(3(5(1(1(0(4(0(2(4(4(x1))))))))))))) 4(5(4(5(5(1(3(0(4(4(5(3(4(0(x1)))))))))))))) -> 4(2(5(4(4(1(1(2(0(1(3(0(3(5(x1)))))))))))))) 5(0(1(1(2(4(4(4(3(2(1(2(3(2(x1)))))))))))))) -> 4(4(3(2(1(2(3(0(2(4(2(4(2(x1))))))))))))) 4(1(3(5(3(3(5(3(5(1(2(3(4(5(5(0(x1)))))))))))))))) -> 1(1(3(3(2(4(3(4(0(2(4(1(5(2(1(0(5(x1))))))))))))))))) 5(2(5(3(5(4(4(5(2(1(4(1(0(5(4(1(x1)))))))))))))))) -> 5(2(5(4(4(4(2(0(2(3(4(2(0(3(5(x1))))))))))))))) 2(2(4(1(2(3(4(0(1(5(0(3(1(0(5(3(2(5(x1)))))))))))))))))) -> 3(5(3(2(5(4(2(0(3(1(3(5(5(3(2(2(5(x1))))))))))))))))) 2(4(3(4(4(3(4(2(0(0(3(1(2(0(2(4(0(0(x1)))))))))))))))))) -> 5(0(0(4(3(3(2(5(4(3(4(4(4(0(5(2(0(x1))))))))))))))))) 4(3(4(1(3(1(4(0(0(5(3(2(1(2(2(3(5(2(3(x1))))))))))))))))))) -> 1(5(4(1(2(1(2(5(2(0(1(1(3(2(2(2(2(1(3(0(3(x1))))))))))))))))))))) 5(1(5(1(1(0(1(5(2(4(1(3(5(0(5(3(0(4(4(x1))))))))))))))))))) -> 5(2(3(2(5(1(4(3(4(4(5(2(0(1(2(1(3(4(x1)))))))))))))))))) 0(3(2(5(0(0(4(1(2(2(0(3(3(3(5(1(3(2(4(2(x1)))))))))))))))))))) -> 0(1(4(3(4(4(5(0(3(5(5(3(0(1(5(5(3(2(1(2(x1)))))))))))))))))))) 4(4(5(5(3(4(0(0(1(5(4(4(3(5(4(5(1(5(0(1(x1)))))))))))))))))))) -> 0(1(4(2(2(2(3(1(2(0(2(2(2(2(4(5(2(3(1(x1))))))))))))))))))) 0(0(3(0(5(3(2(5(2(4(1(1(5(5(1(4(5(2(3(0(1(x1))))))))))))))))))))) -> 0(2(4(2(3(0(2(3(5(2(3(1(1(5(5(2(1(0(2(1(1(x1))))))))))))))))))))) 2(3(4(4(0(2(5(2(1(1(1(3(4(3(3(0(5(4(1(0(1(x1))))))))))))))))))))) -> 3(0(0(0(0(1(0(3(2(3(2(0(3(1(4(5(4(5(4(3(1(x1))))))))))))))))))))) Proof: Bounds Processor: bound: 1 enrichment: match automaton: final states: {274,255,237,218,201,181,167,152,140,124,113,101,89, 78,68,60,50,40,31,26,18,12,9,5,1} transitions: f60() -> 2* 00(75) -> 76* 00(65) -> 66* 00(289) -> 290* 00(62) -> 63* 00(254) -> 237* 00(52) -> 53* 00(229) -> 230* 00(224) -> 225* 00(22) -> 23* 00(2) -> 41* 00(179) -> 180* 00(159) -> 160* 00(144) -> 145* 00(104) -> 105* 00(291) -> 292* 00(286) -> 287* 00(281) -> 282* 00(256) -> 257* 00(49) -> 40* 00(236) -> 218* 00(19) -> 20* 00(14) -> 102* 00(4) -> 1* 00(191) -> 192* 00(131) -> 132* 00(116) -> 117* 00(91) -> 92* 00(288) -> 289* 00(81) -> 82* 00(273) -> 255* 00(268) -> 269* 00(56) -> 57* 00(16) -> 17* 00(178) -> 179* 00(93) -> 94* 00(290) -> 291* 00(88) -> 78* 00(73) -> 74* 00(48) -> 49* 00(245) -> 246* 00(43) -> 168* 00(23) -> 24* 00(13) -> 125* 00(205) -> 206* 00(3) -> 182* 20(272) -> 273* popout

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

job log

popout

actions

all output return to SRS Stand 10685