Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432274658
details
property
value
status
complete
benchmark
fun4.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n067.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
13.026 seconds
cpu usage
13.0124
user time
12.1422
system time
0.870249
max virtual memory
957992.0
max residence set size
239496.0
stage attributes
key
value
starexec-result
YES
output
12.97/13.02 YES 12.97/13.02 12.97/13.02 Solver Timeout: 4 12.97/13.02 Global Timeout: 300 12.97/13.02 No parsing errors! 12.97/13.02 Init Location: 0 12.97/13.02 Transitions: 12.97/13.02 <l0, l5, true> 12.97/13.02 <l1, l2, ((1 + deltaext^0) <= (0 + deltaext_new^0))> 12.97/13.02 <l1, l2, ((1 + deltaext_new^0) <= (0 + deltaext^0))> 12.97/13.02 <l2, l3, true, par{deltaext^0 -> (0 + deltaext_new^0)}> 12.97/13.02 <l3, l1, ((~(1) + (2 * deltaext^0)) <= ((0 + c0^0) + wnt^0)) /\ (((0 + c0^0) + wnt^0) <= (0 + (2 * deltaext^0))), par{deltaext_new^0 -> (0 + deltaext^0)}> 12.97/13.02 <l3, l1, (((1 + c0^0) + wnt^0) <= (~(1) + (2 * deltaext^0))), par{deltaext_new^0 -> (~(1) + deltaext^0)}> 12.97/13.02 <l3, l1, ((1 + (2 * deltaext^0)) <= ((0 + c0^0) + wnt^0)), par{deltaext_new^0 -> (1 + deltaext^0)}> 12.97/13.02 <l4, l3, (0 <= (0 + wnt^0)) /\ ((0 + wnt^0) <= 3) /\ (0 <= (0 + deltaext^0)) /\ ((0 + deltaext^0) <= 3), par{c0^0 -> 2}> 12.97/13.02 <l5, l4, true> 12.97/13.02 12.97/13.02 Fresh variables: 12.97/13.02 12.97/13.02 Undef variables: 12.97/13.02 12.97/13.02 Abstraction variables: 12.97/13.02 12.97/13.02 Exit nodes: 12.97/13.02 12.97/13.02 Accepting locations: 12.97/13.02 12.97/13.02 Asserts: 12.97/13.02 12.97/13.02 Preprocessed LLVMGraph 12.97/13.02 Init Location: 0 12.97/13.02 Transitions: 12.97/13.02 <l0, l3, (2 = 2) /\ (0 <= (0 + wnt^0)) /\ ((0 + wnt^0) <= 3) /\ (0 <= (0 + deltaext^0)) /\ ((0 + deltaext^0) <= 3)> 12.97/13.02 <l3, l3, (((1 + 2) + wnt^0) <= (~(1) + (2 * deltaext^0))) /\ ((1 + (~(1) + deltaext^0)) <= (0 + deltaext^0)), par{deltaext^0 -> (0 + (~(1) + deltaext^0))}> 12.97/13.02 <l3, l3, ((1 + (2 * deltaext^0)) <= ((0 + 2) + wnt^0)) /\ ((1 + deltaext^0) <= (0 + (1 + deltaext^0))), par{deltaext^0 -> (0 + (1 + deltaext^0))}> 12.97/13.02 12.97/13.02 Fresh variables: 12.97/13.02 12.97/13.02 Undef variables: 12.97/13.02 12.97/13.02 Abstraction variables: 12.97/13.02 12.97/13.02 Exit nodes: 12.97/13.02 12.97/13.02 Accepting locations: 12.97/13.02 12.97/13.02 Asserts: 12.97/13.02 12.97/13.02 ************************************************************* 12.97/13.02 ******************************************************************************************* 12.97/13.02 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 12.97/13.02 ******************************************************************************************* 12.97/13.02 12.97/13.02 Init Location: 0 12.97/13.02 Graph 0: 12.97/13.02 Transitions: 12.97/13.02 Variables: 12.97/13.02 12.97/13.02 Graph 1: 12.97/13.02 Transitions: 12.97/13.02 <l3, l3, 4 + wnt^0 <= 2*deltaext^0, {deltaext^0 -> -1 + deltaext^0, rest remain the same}> 12.97/13.02 <l3, l3, 2*deltaext^0 <= 1 + wnt^0, {deltaext^0 -> 1 + deltaext^0, rest remain the same}> 12.97/13.02 Variables: 12.97/13.02 deltaext^0, wnt^0 12.97/13.02 12.97/13.02 Precedence: 12.97/13.02 Graph 0 12.97/13.02 12.97/13.02 Graph 1 12.97/13.02 <l0, l3, 0 <= deltaext^0 /\ 0 <= wnt^0 /\ deltaext^0 <= 3 /\ wnt^0 <= 3, {all remain the same}> 12.97/13.02 12.97/13.02 Map Locations to Subgraph: 12.97/13.02 ( 0 , 0 ) 12.97/13.02 ( 3 , 1 ) 12.97/13.02 12.97/13.02 ******************************************************************************************* 12.97/13.02 ******************************** CHECKING ASSERTIONS ******************************** 12.97/13.02 ******************************************************************************************* 12.97/13.02 12.97/13.02 Proving termination of subgraph 0 12.97/13.02 Proving termination of subgraph 1 12.97/13.02 Checking unfeasibility... 12.97/13.02 Time used: 0.003862 12.97/13.02 12.97/13.02 Checking conditional termination of SCC {l3}... 12.97/13.02 12.97/13.02 LOG: CALL solveLinear 12.97/13.02 12.97/13.02 LOG: RETURN solveLinear - Elapsed time: 0.000824s 12.97/13.02 12.97/13.02 LOG: CALL solveLinear 12.97/13.02 12.97/13.02 LOG: RETURN solveLinear - Elapsed time: 0.009279s 12.97/13.02 Trying to remove transition: <l3, l3, 2*deltaext^0 <= 1 + wnt^0, {deltaext^0 -> 1 + deltaext^0, rest remain the same}> 12.97/13.02 Solving with 1 template(s). 12.97/13.02 12.97/13.02 LOG: CALL solveNonLinearGetFirstSolution 12.97/13.02 12.97/13.02 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014058s 12.97/13.02 Time used: 0.013862
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