Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381738790
details
property
value
status
complete
benchmark
Velroyen08-alternDivWidening.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n012.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
23.8122169971 seconds
cpu usage
59.878632678
max memory
8.91936768E8
stage attributes
key
value
output-size
19684
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l3, true> <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> 5}> <l2, l2, (arg2 < 0) /\ (arg2 < (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) + 1)}> <l2, l2, (arg2 > 0) /\ (arg2 < (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) + 1)}> <l2, l2, (arg2 <= arg1) /\ (arg2 < 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> 0}> <l2, l2, (arg2 <= arg1) /\ (arg2 > 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> 0}> <l2, l2, (arg2 > arg1) /\ (arg2 < 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) - 1)}> <l2, l2, (arg2 > arg1) /\ (arg2 > 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) - 1)}> <l3, l1, true, par{arg1 -> undef15, arg2 -> undef16}> Fresh variables: undef15, undef16, Undef variables: undef15, undef16, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (arg1 = 5) /\ (arg2 = undef16) /\ (undef15 > 0) /\ (undef16 > ~(1))> <l2, l2, (arg2 < 0) /\ (arg2 < (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) + 1)}> <l2, l2, (arg2 > 0) /\ (arg2 < (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) + 1)}> <l2, l2, (arg2 <= arg1) /\ (arg2 < 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> 0}> <l2, l2, (arg2 <= arg1) /\ (arg2 > 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> 0}> <l2, l2, (arg2 > arg1) /\ (arg2 > 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) - 1)}> Fresh variables: undef15, undef16, Undef variables: undef15, undef16, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, 1 + arg1 + arg2 <= 0 /\ 1 + arg2 <= 0, {arg1 -> 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> <l2, l2, 1 + arg1 + arg2 <= 0 /\ 1 <= arg2, {arg1 -> 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> <l2, l2, arg2 <= arg1 /\ 0 <= arg1 + arg2 /\ 1 + arg2 <= 0, {arg1 -> 1 + arg1, arg2 -> 0, rest remain the same}> <l2, l2, arg2 <= arg1 /\ 0 <= arg1 + arg2 /\ 1 <= arg2, {arg1 -> 1 + arg1, arg2 -> 0, rest remain the same}> <l2, l2, 0 <= arg1 + arg2 /\ 1 + arg1 <= arg2 /\ 1 <= arg2, {arg1 -> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 <l0, l2, 0 <= undef16 /\ 1 <= undef15 /\ arg2 = undef16 /\ arg1 = 5, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.011601
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634