Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381739853
details
property
value
status
complete
benchmark
ludcmp.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n024.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.810698032379 seconds
cpu usage
0.795526961
max memory
1.82583296E8
stage attributes
key
value
output-size
38982
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l33, true> <l1, l2, true> <l3, l4, true> <l5, l3, true, par{j^0 -> (1 + j^0)}> <l6, l5, ((1 + n^0) <= (0 + i^0))> <l6, l7, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}> <l8, l7, (undef57 = undef57), par{dum^0 -> undef57}> <l9, l5, ((0 + j^0) <= (0 + n^0)) /\ ((0 + n^0) <= (0 + j^0))> <l9, l8, ((1 + n^0) <= (0 + j^0))> <l9, l8, ((1 + j^0) <= (0 + n^0))> <l10, l11, true> <l12, l9, true> <l12, l9, true> <l13, l12, true> <l14, l15, true> <l16, l13, ((1 + n^0) <= (0 + k^0))> <l16, l17, ((0 + k^0) <= (0 + n^0)) /\ (undef167 = undef167), par{dum^0 -> undef167, k^0 -> (1 + k^0)}> <l18, l13, ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0))> <l18, l17, ((1 + imax^0) <= (0 + j^0))> <l18, l17, ((1 + j^0) <= (0 + imax^0))> <l19, l20, true, par{i^0 -> (1 + i^0)}> <l21, l19, ((1 + dum^0) <= (0 + big^0))> <l21, l19, ((0 + big^0) <= (0 + dum^0)), par{big^0 -> (0 + dum^0), imax^0 -> (0 + i^0)}> <l20, l22, true> <l23, l21, ((0 + j^0) <= (0 + k^0)) /\ (undef264 = undef264) /\ (undef255 = undef255), par{dum^0 -> undef255, tmp___0^0 -> undef264}> <l23, l24, ((1 + k^0) <= (0 + j^0)) /\ (undef272 = undef272), par{k^0 -> (1 + k^0), sum^0 -> undef272}> <l22, l18, ((1 + n^0) <= (0 + i^0))> <l22, l24, ((0 + i^0) <= (0 + n^0)) /\ (undef294 = undef294), par{sum^0 -> undef294}> <l24, l23, true> <l15, l10, ((0 + i^0) <= (0 + k^0)), par{i^0 -> (1 + i^0)}> <l15, l14, ((1 + k^0) <= (0 + i^0)) /\ (undef327 = undef327), par{k^0 -> (1 + k^0), sum^0 -> undef327}> <l11, l20, ((0 + j^0) <= (0 + i^0)), par{big^0 -> 0}> <l11, l14, ((1 + i^0) <= (0 + j^0)) /\ (undef349 = undef349), par{sum^0 -> undef349}> <l17, l16, true> <l4, l25, ((1 + n^0) <= (0 + j^0))> <l4, l10, ((0 + j^0) <= (0 + n^0))> <l26, l27, true, par{i^0 -> (1 + i^0)}> <l28, l26, (1 <= (0 + big^0))> <l28, l26, ((1 + big^0) <= 0)> <l28, l26, ((0 + big^0) <= 0) /\ (0 <= (0 + big^0))> <l29, l1, true, par{j^0 -> (1 + j^0)}> <l7, l6, true> <l30, l29, ((0 + temp^0) <= (0 + big^0))> <l30, l29, ((1 + big^0) <= (0 + temp^0)), par{big^0 -> (0 + temp^0)}> <l2, l28, ((1 + n^0) <= (0 + j^0))> <l2, l30, ((0 + j^0) <= (0 + n^0)) /\ (undef494 = undef494), par{temp^0 -> (0 + undef494), tmp^0 -> undef494}> <l31, l3, ((1 + n^0) <= (0 + i^0))> <l31, l1, ((0 + i^0) <= (0 + n^0)), par{big^0 -> 0}> <l27, l31, true> <l32, l27, true> <l33, l32, true> Fresh variables: undef57, undef167, undef255, undef264, undef272, undef294, undef327, undef349, undef494, Undef variables: undef57, undef167, undef255, undef264, undef272, undef294, undef327, undef349, undef494, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l25, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + j^0))> <l0, l25, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + n^0) <= (0 + j^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))), par{big^0 -> 0, j^0 -> (1 + j^0)}> <l0, l7, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0)) /\ ((1 + n^0) <= (0 + j^0)) /\ (undef57 = undef57), par{big^0 -> 0}> <l0, l7, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0)) /\ ((1 + j^0) <= (0 + n^0)) /\ (undef57 = undef57), par{big^0 -> 0}> <l0, l25, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + n^0) <= (0 + j^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))), par{big^0 -> 0, j^0 -> (1 + j^0)}> <l0, l7, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0)) /\ ((1 + n^0) <= (0 + j^0)) /\ (undef57 = undef57), par{big^0 -> 0}> <l0, l7, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0)) /\ ((1 + j^0) <= (0 + n^0)) /\ (undef57 = undef57), par{big^0 -> 0}> <l0, l17, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + imax^0) <= (0 + j^0)), par{big^0 -> 0}> <l0, l17, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + j^0) <= (0 + imax^0)), par{big^0 -> 0}> <l0, l24, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((0 + i^0) <= (0 + n^0)) /\ (undef294 = undef294), par{big^0 -> 0}> <l0, l1, ((0 + i^0) <= (0 + n^0)), par{big^0 -> 0}> <l1, l25, ((1 + n^0) <= (0 + j^0)) /\ (1 <= (0 + big^0)) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}> <l1, l1, ((1 + n^0) <= (0 + j^0)) /\ (1 <= (0 + big^0)) /\ ((0 + (1 + i^0)) <= (0 + n^0)), par{big^0 -> 0, i^0 -> (1 + i^0)}> <l1, l25, ((1 + n^0) <= (0 + j^0)) /\ ((1 + big^0) <= 0) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}> <l1, l1, ((1 + n^0) <= (0 + j^0)) /\ ((1 + big^0) <= 0) /\ ((0 + (1 + i^0)) <= (0 + n^0)), par{big^0 -> 0, i^0 -> (1 + i^0)}> <l1, l25, ((1 + n^0) <= (0 + j^0)) /\ ((0 + big^0) <= 0) /\ (0 <= (0 + big^0)) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}> <l1, l1, ((1 + n^0) <= (0 + j^0)) /\ ((0 + big^0) <= 0) /\ (0 <= (0 + big^0)) /\ ((0 + (1 + i^0)) <= (0 + n^0)), par{big^0 -> 0, i^0 -> (1 + i^0)}>
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634