Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381737260
details
property
value
status
complete
benchmark
Nested.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n040.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.400192022324 seconds
cpu usage
0.397390803
max memory
1.2091392E7
stage attributes
key
value
output-size
2802
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, l4, true> <l1, l2, true, par{arg1 -> 0, arg2 -> undef2}> <l2, l3, (arg1 < 10), par{arg2 -> 3}> <l3, l2, (arg2 > 11), par{arg1 -> (arg1 + 1), arg2 -> undef6}> <l3, l3, (arg2 < 12), par{arg2 -> (arg2 + 1)}> <l4, l1, true, par{arg1 -> undef9, arg2 -> undef10}> Fresh variables: undef2, undef6, undef9, undef10, Undef variables: undef2, undef6, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l3, (arg1 = 0) /\ (arg2 = 3) /\ (0 < 10)> <l3, l3, (arg2 > 11) /\ ((arg1 + 1) < 10), par{arg1 -> (arg1 + 1), arg2 -> 3}> <l3, l3, (arg2 < 12), par{arg2 -> (arg2 + 1)}> Fresh variables: undef2, undef6, undef9, undef10, Undef variables: undef2, undef6, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l3, l3, 12 <= arg2 /\ arg1 <= 8, {arg1 -> 1 + arg1, arg2 -> 3, rest remain the same}> <l3, l3, arg2 <= 11, {arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 <l0, l3, arg1 = 0 /\ arg2 = 3, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.371278 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001948s �[33mRanking function: �[36m8 - arg1�[0m New Graphs: Transitions:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634