Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381739820
details
property
value
status
complete
benchmark
bsort100.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n081.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.966375827789 seconds
cpu usage
0.962446303
max memory
8.7453696E7
stage attributes
key
value
output-size
6509
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, l16, true> <l1, l2, (101 <= (0 + Index2^0)), par{Sorted5^0 -> 0, i8^0 -> 1}> <l1, l3, ((0 + Index2^0) <= 100), par{Index2^0 -> (1 + Index2^0)}> <l3, l1, true> <l4, l5, true> <l6, l4, true> <l7, l8, true> <l8, l2, ((0 + Sorted5^0) <= 0) /\ (0 <= (0 + Sorted5^0)), par{i8^0 -> (1 + i8^0)}> <l8, l6, (1 <= (0 + Sorted5^0))> <l8, l6, ((1 + Sorted5^0) <= 0)> <l9, l10, true, par{Index7^0 -> (1 + Index7^0)}> <l2, l11, true> <l12, l9, (undef81 = undef81), par{Sorted5^0 -> 0, Temp6^0 -> undef81}> <l12, l9, true> <l13, l12, ((0 + Index7^0) <= (100 + (~(1) * i8^0)))> <l13, l7, ((101 + (~(1) * i8^0)) <= (0 + Index7^0))> <l14, l7, (100 <= (0 + Index7^0))> <l14, l13, ((0 + Index7^0) <= 99)> <l10, l14, true> <l11, l4, (100 <= (0 + i8^0))> <l11, l10, ((0 + i8^0) <= 99), par{Index7^0 -> 1, Sorted5^0 -> 1}> <l15, l3, (undef146 = ~(1)), par{Index2^0 -> 1, fact3^0 -> (0 + undef146), factor^0 -> undef146}> <l16, l15, true> Fresh variables: undef81, undef146, Undef variables: undef81, undef146, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l3, (Index2^0 = 1) /\ (undef146 = ~(1))> <l3, l10, (101 <= (0 + Index2^0)) /\ ((0 + 1) <= 99), par{Index7^0 -> 1, Sorted5^0 -> 1, i8^0 -> 1}> <l3, l3, ((0 + Index2^0) <= 100), par{Index2^0 -> (1 + Index2^0)}> <l10, l5, (100 <= (0 + Index7^0)) /\ ((0 + Sorted5^0) <= 0) /\ (0 <= (0 + Sorted5^0)) /\ (100 <= (0 + (1 + i8^0))), par{i8^0 -> (1 + i8^0)}> <l10, l10, (100 <= (0 + Index7^0)) /\ ((0 + Sorted5^0) <= 0) /\ (0 <= (0 + Sorted5^0)) /\ ((0 + (1 + i8^0)) <= 99), par{Index7^0 -> 1, Sorted5^0 -> 1, i8^0 -> (1 + i8^0)}> <l10, l5, (100 <= (0 + Index7^0)) /\ (1 <= (0 + Sorted5^0))> <l10, l5, (100 <= (0 + Index7^0)) /\ ((1 + Sorted5^0) <= 0)> <l10, l10, ((0 + Index7^0) <= 99) /\ ((0 + Index7^0) <= (100 + (~(1) * i8^0))) /\ (undef81 = undef81), par{Index7^0 -> (1 + Index7^0), Sorted5^0 -> 0}> <l10, l10, ((0 + Index7^0) <= 99) /\ ((0 + Index7^0) <= (100 + (~(1) * i8^0))), par{Index7^0 -> (1 + Index7^0)}> <l10, l5, ((0 + Index7^0) <= 99) /\ ((101 + (~(1) * i8^0)) <= (0 + Index7^0)) /\ ((0 + Sorted5^0) <= 0) /\ (0 <= (0 + Sorted5^0)) /\ (100 <= (0 + (1 + i8^0))), par{i8^0 -> (1 + i8^0)}> <l10, l10, ((0 + Index7^0) <= 99) /\ ((101 + (~(1) * i8^0)) <= (0 + Index7^0)) /\ ((0 + Sorted5^0) <= 0) /\ (0 <= (0 + Sorted5^0)) /\ ((0 + (1 + i8^0)) <= 99), par{Index7^0 -> 1, Sorted5^0 -> 1, i8^0 -> (1 + i8^0)}> <l10, l5, ((0 + Index7^0) <= 99) /\ ((101 + (~(1) * i8^0)) <= (0 + Index7^0)) /\ (1 <= (0 + Sorted5^0))> <l10, l5, ((0 + Index7^0) <= 99) /\ ((101 + (~(1) * i8^0)) <= (0 + Index7^0)) /\ ((1 + Sorted5^0) <= 0)> Fresh variables: undef81, undef146, Undef variables: undef81, undef146, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l3, l3, Index2^0 <= 100, {Index2^0 -> 1 + Index2^0, rest remain the same}> Variables: Index2^0 Graph 2:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634