Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381739329
details
property
value
status
complete
benchmark
dsa_test6.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n039.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0294229984283 seconds
cpu usage
0.02170772
max memory
3960832.0
stage attributes
key
value
output-size
2376
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, l5, true> <l1, l2, (10 <= (0 + i4^0))> <l1, l3, ((1 + i4^0) <= 10), par{i4^0 -> (1 + i4^0)}> <l3, l1, true> <l4, l3, (undef8 = undef8), par{i4^0 -> 0, tmp^0 -> undef8}> <l5, l4, true> Fresh variables: undef8, Undef variables: undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l3, (i4^0 = 0) /\ (undef8 = undef8)> <l3, l2, (10 <= (0 + i4^0))> <l3, l3, ((1 + i4^0) <= 10), par{i4^0 -> (1 + i4^0)}> Fresh variables: undef8, Undef variables: undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l3, l3, i4^0 <= 9, {i4^0 -> 1 + i4^0, rest remain the same}> Variables: i4^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l3, i4^0 = 0, {all remain the same}> Graph 2 <l3, l2, 10 <= i4^0, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 2 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001373 Checking conditional termination of SCC {l3}...
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634