Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432276245
details
property
value
status
complete
benchmark
e-acqrel-succeed.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
5.1677 seconds
cpu usage
5.1504
user time
4.82331
system time
0.327088
max virtual memory
854680.0
max residence set size
159280.0
stage attributes
key
value
starexec-result
NO
output
5.12/5.16 NO 5.12/5.16 5.12/5.16 Solver Timeout: 4 5.12/5.16 Global Timeout: 300 5.12/5.16 No parsing errors! 5.12/5.16 Init Location: 0 5.12/5.16 Transitions: 5.12/5.16 <l0, l10, true> 5.12/5.16 <l1, l2, true> 5.12/5.16 <l3, l4, true> 5.12/5.16 <l5, l6, true> 5.12/5.16 <l7, l8, true> 5.12/5.16 <l8, l7, true> 5.12/5.16 <l4, l3, (1 <= (0 + n^0))> 5.12/5.16 <l4, l1, ((0 + n^0) <= 0) /\ (undef36 = 1) /\ (undef33 = undef33), par{R^0 -> 0, __rho_1_^0 -> undef33, dobreak^0 -> (0 + undef33)}> 5.12/5.16 <l2, l3, ((0 + dobreak^0) <= 0) /\ (undef42 = 1) /\ (undef39 = undef39), par{A^0 -> 0, __rho_1_^0 -> undef39, n^0 -> (0 + undef39)}> 5.12/5.16 <l2, l7, (1 <= (0 + dobreak^0))> 5.12/5.16 <l9, l1, (undef50 = undef50), par{A^0 -> 0, R^0 -> 0, __rho_1_^0 -> undef50, dobreak^0 -> (0 + undef50)}> 5.12/5.16 <l10, l9, true> 5.12/5.16 5.12/5.16 Fresh variables: 5.12/5.16 undef33, undef36, undef39, undef42, undef50, 5.12/5.16 5.12/5.16 Undef variables: 5.12/5.16 undef33, undef36, undef39, undef42, undef50, 5.12/5.16 5.12/5.16 Abstraction variables: 5.12/5.16 5.12/5.16 Exit nodes: 5.12/5.16 5.12/5.16 Accepting locations: 5.12/5.16 5.12/5.16 Asserts: 5.12/5.16 5.12/5.16 Preprocessed LLVMGraph 5.12/5.16 Init Location: 0 5.12/5.16 Transitions: 5.12/5.16 <l0, l3, (undef50 = undef50) /\ ((0 + (0 + undef50)) <= 0) /\ (undef42 = 1) /\ (undef39 = undef39), par{n^0 -> (0 + undef39)}> 5.12/5.16 <l0, l7, (undef50 = undef50) /\ (1 <= (0 + (0 + undef50)))> 5.12/5.16 <l3, l3, (1 <= (0 + n^0))> 5.12/5.16 <l3, l3, ((0 + n^0) <= 0) /\ (undef36 = 1) /\ (undef33 = undef33) /\ ((0 + (0 + undef33)) <= 0) /\ (undef42 = 1) /\ (undef39 = undef39), par{n^0 -> (0 + undef39)}> 5.12/5.16 <l3, l7, ((0 + n^0) <= 0) /\ (undef36 = 1) /\ (undef33 = undef33) /\ (1 <= (0 + (0 + undef33)))> 5.12/5.16 <l7, l7, true> 5.12/5.16 5.12/5.16 Fresh variables: 5.12/5.16 undef33, undef36, undef39, undef42, undef50, 5.12/5.16 5.12/5.16 Undef variables: 5.12/5.16 undef33, undef36, undef39, undef42, undef50, 5.12/5.16 5.12/5.16 Abstraction variables: 5.12/5.16 5.12/5.16 Exit nodes: 5.12/5.16 5.12/5.16 Accepting locations: 5.12/5.16 5.12/5.16 Asserts: 5.12/5.16 5.12/5.16 ************************************************************* 5.12/5.16 ******************************************************************************************* 5.12/5.16 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.12/5.16 ******************************************************************************************* 5.12/5.16 5.12/5.16 Init Location: 0 5.12/5.16 Graph 0: 5.12/5.16 Transitions: 5.12/5.16 Variables: 5.12/5.16 5.12/5.16 Graph 1: 5.12/5.16 Transitions: 5.12/5.16 <l3, l3, 1 <= n^0, {all remain the same}> 5.12/5.16 <l3, l3, n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}> 5.12/5.16 Variables: 5.12/5.16 n^0 5.12/5.16 5.12/5.16 Graph 2: 5.12/5.16 Transitions: 5.12/5.16 <l7, l7, true, {all remain the same}> 5.12/5.16 Variables: 5.12/5.16 5.12/5.16 Precedence: 5.12/5.16 Graph 0 5.12/5.16 5.12/5.16 Graph 1 5.12/5.16 <l0, l3, undef50 <= 0 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}> 5.12/5.16 5.12/5.16 Graph 2 5.12/5.16 <l0, l7, 1 <= undef50, {all remain the same}> 5.12/5.16 <l3, l7, 1 <= undef33 /\ n^0 <= 0 /\ undef36 = 1, {all remain the same}> 5.12/5.16 5.12/5.16 Map Locations to Subgraph: 5.12/5.16 ( 0 , 0 ) 5.12/5.16 ( 3 , 1 ) 5.12/5.16 ( 7 , 2 ) 5.12/5.16 5.12/5.16 ******************************************************************************************* 5.12/5.16 ******************************** CHECKING ASSERTIONS ******************************** 5.12/5.16 ******************************************************************************************* 5.12/5.16 5.12/5.16 Proving termination of subgraph 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integer_Transition_Systems 2019-03-29 01.54