Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.................
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 58K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 175K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 50K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 188K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 50K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 816K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DatabaseWithMutex-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649936700051
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-00
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-01
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-02
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-03
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-04
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-05
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-06
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-07
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-08
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-09
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-10
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-11
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-12
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-13
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-14
FORMULA_NAME DatabaseWithMutex-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1526609935799

info: Time: 3600 - MCC
===========================================================================================
prep: translating DatabaseWithMutex-PT-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating DatabaseWithMutex-PT-10 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ DatabaseWithMutex-PT-10 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1630/65536 symbol table entries, 31 collisions
lola: preprocessing...
lola: Size of bit vector: 26560
lola: finding significant places
lola: 830 places, 800 transitions, 700 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1040 transition conflict sets
lola: TASK
lola: reading formula from DatabaseWithMutex-PT-10-UpperBounds.task
lola: MAX(all_active_10 + all_active_1 + all_active_2 + all_active_4 + all_active_5 + all_active_6 + all_active_8 + all_active_9 + all_active_7 + all_active_3) : MAX(MesBuffReply_4_10 + MesBuffReply_9_10 + MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_1_5 + MesBuffReply_1_6 + MesBuffReply_1_7 + MesBuffReply_1_8 + MesBuffReply_1_9 + MesBuffReply_3_10 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_2_5 + MesBuffReply_2_6 + MesBuffReply_2_7 + MesBuffReply_2_8 + MesBuffReply_2_9 + MesBuffReply_8_10 + MesBuffReply_3_1 + MesBuffReply_3_2 + MesBuffReply_3_3 + MesBuffReply_3_4 + MesBuffReply_3_5 + MesBuffReply_3_6 + MesBuffReply_3_7 + MesBuffReply_3_8 + MesBuffReply_3_9 + MesBuffReply_4_1 + MesBuffReply_4_2 + MesBuffReply_4_3 + MesBuffReply_4_4 + MesBuffReply_4_5 + MesBuffReply_4_6 + MesBuffReply_4_7 + MesBuffReply_4_8 + MesBuffReply_4_9 + MesBuffReply_2_10 + MesBuffReply_5_1 + MesBuffReply_5_2 + MesBuffReply_5_3 + MesBuffReply_5_4 + MesBuffReply_5_5 + MesBuffReply_5_6 + MesBuffReply_5_7 + MesBuffReply_5_8 + MesBuffReply_5_9 + MesBuffReply_7_10 + MesBuffReply_6_1 + MesBuffReply_6_2 + MesBuffReply_6_3 + MesBuffReply_6_4 + MesBuffReply_6_5 + MesBuffReply_6_6 + MesBuffReply_6_7 + MesBuffReply_6_8 + MesBuffReply_6_9 + MesBuffReply_7_1 + MesBuffReply_7_2 + MesBuffReply_7_3 + MesBuffReply_7_4 + MesBuffReply_7_5 + MesBuffReply_7_6 + MesBuffReply_7_7 + MesBuffReply_7_8 + MesBuffReply_7_9 + MesBuffReply_1_10 + MesBuffReply_8_1 + MesBuffReply_8_2 + MesBuffReply_8_3 + MesBuffReply_8_4 + MesBuffReply_8_5 + MesBuffReply_8_6 + MesBuffReply_8_7 + MesBuffReply_8_8 + MesBuffReply_10_10 + MesBuffReply_10_1 + MesBuffReply_10_2 + MesBuffReply_10_3 + MesBuffReply_10_4 + MesBuffReply_10_5 + MesBuffReply_10_6 + MesBuffReply_10_7 + MesBuffReply_10_8 + MesBuffReply_10_9 + MesBuffReply_9_9 + MesBuffReply_9_8 + MesBuffReply_5_10 + MesBuffReply_9_7 + MesBuffReply_9_6 + MesBuffReply_9_5 + MesBuffReply_9_4 + MesBuffReply_9_3 + MesBuffReply_9_2 + MesBuffReply_9_1 + MesBuffReply_6_10 + MesBuffReply_8_9) : MAX(RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_3_5 + RecBuff_3_6 + RecBuff_3_7 + RecBuff_3_8 + RecBuff_3_9 + RecBuff_2_10 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_4_5 + RecBuff_4_6 + RecBuff_4_7 + RecBuff_4_8 + RecBuff_4_9 + RecBuff_7_10 + RecBuff_5_1 + RecBuff_5_2 + RecBuff_5_3 + RecBuff_5_4 + RecBuff_5_5 + RecBuff_5_6 + RecBuff_5_7 + RecBuff_5_8 + RecBuff_5_9 + RecBuff_6_1 + RecBuff_6_2 + RecBuff_6_3 + RecBuff_6_4 + RecBuff_6_5 + RecBuff_6_6 + RecBuff_6_7 + RecBuff_6_8 + RecBuff_6_9 + RecBuff_1_10 + RecBuff_7_1 + RecBuff_7_2 + RecBuff_7_3 + RecBuff_7_4 + RecBuff_7_5 + RecBuff_7_6 + RecBuff_7_7 + RecBuff_7_8 + RecBuff_7_9 + RecBuff_6_10 + RecBuff_8_1 + RecBuff_8_2 + RecBuff_8_3 + RecBuff_8_4 + RecBuff_8_5 + RecBuff_8_6 + RecBuff_8_7 + RecBuff_8_8 + RecBuff_8_9 + RecBuff_9_1 + RecBuff_9_2 + RecBuff_9_3 + RecBuff_9_4 + RecBuff_9_5 + RecBuff_9_6 + RecBuff_9_7 + RecBuff_9_8 + RecBuff_9_9 + RecBuff_10_1 + RecBuff_10_2 + RecBuff_10_3 + RecBuff_10_4 + RecBuff_10_5 + RecBuff_10_6 + RecBuff_10_7 + RecBuff_10_8 + RecBuff_10_9 + RecBuff_5_10 + RecBuff_10_10 + RecBuff_4_10 + RecBuff_3_10 + RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuff_1_5 + RecBuff_1_6 + RecBuff_1_7 + RecBuff_1_8 + RecBuff_1_9 + RecBuff_8_10 + RecBuff_2_1 + RecBuff_2_2 + RecBuff_2_3 + RecBuff_2_4 + RecBuff_2_5 + RecBuff_2_6 + RecBuff_2_7 + RecBuff_2_8 + RecBuff_2_9 + RecBuff_9_10) : MAX(Acknowledge_8_1 + Acknowledge_8_2 + Acknowledge_8_3 + Acknowledge_8_4 + Acknowledge_8_5 + Acknowledge_8_6 + Acknowledge_8_7 + Acknowledge_8_8 + Acknowledge_8_9 + Acknowledge_7_10 + Acknowledge_9_1 + Acknowledge_9_2 + Acknowledge_9_3 + Acknowledge_9_4 + Acknowledge_9_5 + Acknowledge_9_6 + Acknowledge_9_7 + Acknowledge_9_8 + Acknowledge_9_9 + Acknowledge_1_10 + Acknowledge_6_10 + Acknowledge_10_1 + Acknowledge_10_2 + Acknowledge_10_3 + Acknowledge_10_4 + Acknowledge_10_5 + Acknowledge_10_6 + Acknowledge_10_7 + Acknowledge_10_8 + Acknowledge_10_9 + Acknowledge_5_10 + Acknowledge_4_10 + Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_1_5 + Acknowledge_1_6 + Acknowledge_1_7 + Acknowledge_1_8 + Acknowledge_1_9 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowledge_2_4 + Acknowledge_2_5 + Acknowledge_2_6 + Acknowledge_2_7 + Acknowledge_2_8 + Acknowledge_2_9 + Acknowledge_9_10 + Acknowledge_10_10 + Acknowledge_3_1 + Acknowledge_3_2 + Acknowledge_3_3 + Acknowledge_3_4 + Acknowledge_3_5 + Acknowledge_3_6 + Acknowledge_3_7 + Acknowledge_3_8 + Acknowledge_3_9 + Acknowledge_3_10 + Acknowledge_4_1 + Acknowledge_4_2 + Acknowledge_4_3 + Acknowledge_4_4 + Acknowledge_4_5 + Acknowledge_4_6 + Acknowledge_4_7 + Acknowledge_4_8 + Acknowledge_5_1 + Acknowledge_5_2 + Acknowledge_5_3 + Acknowledge_5_4 + Acknowledge_5_5 + Acknowledge_5_6 + Acknowledge_5_7 + Acknowledge_5_8 + Acknowledge_8_10 + Acknowledge_5_9 + Acknowledge_6_1 + Acknowledge_6_2 + Acknowledge_6_3 + Acknowledge_6_4 + Acknowledge_6_5 + Acknowledge_6_6 + Acknowledge_6_7 + Acknowledge_6_8 + Acknowledge_6_9 + Acknowledge_2_10 + Acknowledge_4_9 + Acknowledge_7_1 + Acknowledge_7_2 + Acknowledge_7_3 + Acknowledge_7_4 + Acknowledge_7_5 + Acknowledge_7_6 + Acknowledge_7_7 + Acknowledge_7_8 + Acknowledge_7_9) : MAX(WaitMutex_7_1 + WaitMutex_7_2 + WaitMutex_7_3 + WaitMutex_7_4 + WaitMutex_7_5 + WaitMutex_7_6 + WaitMutex_7_7 + WaitMutex_7_8 + WaitMutex_7_9 + WaitMutex_5_10 + WaitMutex_8_1 + WaitMutex_8_2 + WaitMutex_8_3 + WaitMutex_8_4 + WaitMutex_8_5 + WaitMutex_8_6 + WaitMutex_8_7 + WaitMutex_8_8 + WaitMutex_8_9 + WaitMutex_9_1 + WaitMutex_9_2 + WaitMutex_9_3 + WaitMutex_9_4 + WaitMutex_9_5 + WaitMutex_9_6 + WaitMutex_9_7 + WaitMutex_9_8 + WaitMutex_9_9 + WaitMutex_10_10 + WaitMutex_4_10 + WaitMutex_9_10 + WaitMutex_10_8 + WaitMutex_3_10 + WaitMutex_10_7 + WaitMutex_8_10 + WaitMutex_10_6 + WaitMutex_2_10 + WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_1_3 + WaitMutex_1_4 + WaitMutex_1_5 + WaitMutex_1_6 + WaitMutex_1_7 + WaitMutex_1_8 + WaitMutex_1_9 + WaitMutex_10_5 + WaitMutex_7_10 + WaitMutex_2_1 + WaitMutex_2_2 + WaitMutex_2_3 + WaitMutex_2_4 + WaitMutex_2_5 + WaitMutex_2_6 + WaitMutex_2_7 + WaitMutex_2_8 + WaitMutex_2_9 + WaitMutex_10_4 + WaitMutex_10_3 + WaitMutex_10_2 + WaitMutex_10_1 + WaitMutex_3_1 + WaitMutex_3_2 + WaitMutex_3_3 + WaitMutex_3_4 + WaitMutex_3_5 + WaitMutex_3_6 + WaitMutex_3_7 + WaitMutex_3_8 + WaitMutex_3_9 + WaitMutex_6_8 + WaitMutex_1_10 + WaitMutex_6_7 + WaitMutex_6_6 + WaitMutex_6_5 + WaitMutex_6_4 + WaitMutex_6_3 + WaitMutex_6_2 + WaitMutex_6_1 + WaitMutex_5_8 + WaitMutex_5_7 + WaitMutex_5_6 + WaitMutex_5_5 + WaitMutex_5_4 + WaitMutex_5_3 + WaitMutex_5_2 + WaitMutex_5_1 + WaitMutex_4_1 + WaitMutex_4_2 + WaitMutex_4_3 + WaitMutex_4_4 + WaitMutex_4_5 + WaitMutex_4_6 + WaitMutex_4_7 + WaitMutex_4_8 + WaitMutex_6_10 + WaitMutex_4_9 + WaitMutex_5_9 + WaitMutex_6_9 + WaitMutex_10_9) : MAX(all_active_10 + all_active_1 + all_active_2 + all_active_4 + all_active_5 + all_active_6 + all_active_8 + all_active_9 + all_active_7 + all_active_3) : MAX(Modify_7_10 + Modify_1_10 + Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_1_5 + Modify_1_6 + Modify_1_7 + Modify_1_8 + Modify_1_9 + Modify_6_10 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_2_5 + Modify_2_6 + Modify_2_7 + Modify_2_8 + Modify_2_9 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_3_5 + Modify_3_6 + Modify_3_7 + Modify_3_8 + Modify_3_9 + Modify_10_1 + Modify_10_2 + Modify_10_3 + Modify_10_4 + Modify_10_5 + Modify_10_6 + Modify_10_7 + Modify_10_8 + Modify_10_9 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4 + Modify_4_5 + Modify_4_6 + Modify_4_7 + Modify_4_8 + Modify_4_9 + Modify_5_10 + Modify_5_1 + Modify_5_2 + Modify_5_3 + Modify_5_4 + Modify_5_5 + Modify_5_6 + Modify_5_7 + Modify_5_8 + Modify_5_9 + Modify_6_1 + Modify_6_2 + Modify_6_3 + Modify_6_4 + Modify_6_5 + Modify_6_6 + Modify_6_7 + Modify_6_8 + Modify_6_9 + Modify_7_1 + Modify_7_2 + Modify_7_3 + Modify_7_4 + Modify_7_5 + Modify_7_6 + Modify_7_7 + Modify_7_8 + Modify_7_9 + Modify_4_10 + Modify_8_1 + Modify_8_2 + Modify_8_3 + Modify_8_4 + Modify_8_5 + Modify_8_6 + Modify_8_7 + Modify_8_8 + Modify_8_9 + Modify_9_10 + Modify_9_1 + Modify_9_2 + Modify_9_3 + Modify_9_4 + Modify_9_5 + Modify_9_6 + Modify_9_7 + Modify_9_8 + Modify_9_9 + Modify_3_10 + Modify_8_10 + Modify_10_10 + Modify_2_10) : MAX(all_active_10 + all_active_1 + all_active_2 + all_active_4 + all_active_5 + all_active_6 + all_active_8 + all_active_9 + all_active_7 + all_active_3) : MAX(updating_9_9) : MAX(Acknowledge_1_5) : MAX(all_passive_7) : MAX(updating_4_6) : MAX(WaitMutex_9_3) : MAX(updating_4_3) : MAX(updating_4_3) : MAX(WaitMutex_2_9)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(updating_9_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(updating_9_9)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file DatabaseWithMutex-PT-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 6 markings, 5 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-10-UpperBounds-8 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Acknowledge_1_5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Acknowledge_1_5)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file DatabaseWithMutex-PT-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 8 markings, 7 edges

FORMULA DatabaseWithMutex-PT-10-UpperBounds-9 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(all_passive_7)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: ========================================
lola: processed formula: MAX(all_passive_7)
lola: processed formula length: 18
lola: 0 rewrites
lola: closed formula file DatabaseWithMutex-PT-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-10-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(updating_4_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(updating_4_6)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file DatabaseWithMutex-PT-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 6 markings, 5 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-10-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(WaitMutex_9_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(WaitMutex_9_3)
lola: processed formula length: 18
lola: 0 rewrites
lola: closed formula file DatabaseWithMutex-PT-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-10-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(updating_4_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(updating_4_3)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file DatabaseWithMutex-PT-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 6 markings, 5 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-10-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(updating_4_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(updating_4_3)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file DatabaseWithMutex-PT-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 6 markings, 5 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-10-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(WaitMutex_2_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(WaitMutex_2_9)
lola: processed formula length: 18
lola: 0 rewrites
lola: closed formula file DatabaseWithMutex-PT-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-10-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(all_active_10 + all_active_1 + all_active_2 + all_active_4 + all_active_5 + all_active_6 + all_active_8 + all_active_9 + all_active_7 + all_active_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(all_active_10 + all_active_1 + all_active_2 + all_active_4 + all_active_5 + all_active_6 + all_active_8 + all_active_9 + all_active_7 + all_active_3)
lola: processed formula length: 153
lola: 0 rewrites
lola: closed formula file DatabaseWithMutex-PT-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-10-UpperBounds-7 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(all_active_10 + all_active_1 + all_active_2 + all_active_4 + all_active_5 + all_active_6 + all_active_8 + all_active_9 + all_active_7 + all_active_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(all_active_10 + all_active_1 + all_active_2 + all_active_4 + all_active_5 + all_active_6 + all_active_8 + all_active_9 + all_active_7 + all_active_3)
lola: processed formula length: 153
lola: 0 rewrites
lola: closed formula file DatabaseWithMutex-PT-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-10-UpperBounds-0 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(all_active_10 + all_active_1 + all_active_2 + all_active_4 + all_active_5 + all_active_6 + all_active_8 + all_active_9 + all_active_7 + all_active_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(all_active_10 + all_active_1 + all_active_2 + all_active_4 + all_active_5 + all_active_6 + all_active_8 + all_active_9 + all_active_7 + all_active_3)
lola: processed formula length: 153
lola: 0 rewrites
lola: closed formula file DatabaseWithMutex-PT-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-10-UpperBounds-5 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Modify_7_10 + Modify_1_10 + Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_1_5 + Modify_1_6 + Modify_1_7 + Modify_1_8 + Modify_1_9 + Modify_6_10 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_2_5 + Modify_2_6 + Modify_2_7 + Modify_2_8 + Modify_2_9 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_3_5 + Modify_3_6 + Modify_3_7 + Modify_3_8 + Modify_3_9 + Mod... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Modify_7_10 + Modify_1_10 + Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_1_5 + Modify_1_6 + Modify_1_7 + Modify_1_8 + Modify_1_9 + Modify_6_10 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_2_5 + Modify_2_6 + Modify_2_7 + Modify_2_8 + Modify_2_9 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_3_5 + Modify_3_6 + Modify_3_7 + Modify_3_8 + Modify_3_9 + Mod... (shortened)
lola: processed formula length: 1322
lola: 0 rewrites
lola: closed formula file DatabaseWithMutex-PT-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 21 markings, 20 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-10-UpperBounds-6 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_3_5 + RecBuff_3_6 + RecBuff_3_7 + RecBuff_3_8 + RecBuff_3_9 + RecBuff_2_10 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_4_5 + RecBuff_4_6 + RecBuff_4_7 + RecBuff_4_8 + RecBuff_4_9 + RecBuff_7_10 + RecBuff_5_1 + RecBuff_5_2 + RecBuff_5_3 + RecBuff_5_4 + RecBuff_5_5 + RecBuff_5_6 + RecBuff_5_7 + RecBuff_5_8 + Re... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_3_5 + RecBuff_3_6 + RecBuff_3_7 + RecBuff_3_8 + RecBuff_3_9 + RecBuff_2_10 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_4_5 + RecBuff_4_6 + RecBuff_4_7 + RecBuff_4_8 + RecBuff_4_9 + RecBuff_7_10 + RecBuff_5_1 + RecBuff_5_2 + RecBuff_5_3 + RecBuff_5_4 + RecBuff_5_5 + RecBuff_5_6 + RecBuff_5_7 + RecBuff_5_8 + Re... (shortened)
lola: processed formula length: 1422
lola: 0 rewrites
lola: closed formula file DatabaseWithMutex-PT-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 90
lola: SUBRESULT
lola: result: 90
lola: produced by: state space
lola: The maximum value of the given expression is 90
lola: 121 markings, 120 edges

FORMULA DatabaseWithMutex-PT-10-UpperBounds-2 90 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Acknowledge_8_1 + Acknowledge_8_2 + Acknowledge_8_3 + Acknowledge_8_4 + Acknowledge_8_5 + Acknowledge_8_6 + Acknowledge_8_7 + Acknowledge_8_8 + Acknowledge_8_9 + Acknowledge_7_10 + Acknowledge_9_1 + Acknowledge_9_2 + Acknowledge_9_3 + Acknowledge_9_4 + Acknowledge_9_5 + Acknowledge_9_6 + Acknowledge_9_7 + Acknowledge_9_8 + Acknowledge_9_9 + Acknowledge_1_10 + Acknowledge_6_10 + Acknowledge_10_... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Acknowledge_8_1 + Acknowledge_8_2 + Acknowledge_8_3 + Acknowledge_8_4 + Acknowledge_8_5 + Acknowledge_8_6 + Acknowledge_8_7 + Acknowledge_8_8 + Acknowledge_8_9 + Acknowledge_7_10 + Acknowledge_9_1 + Acknowledge_9_2 + Acknowledge_9_3 + Acknowledge_9_4 + Acknowledge_9_5 + Acknowledge_9_6 + Acknowledge_9_7 + Acknowledge_9_8 + Acknowledge_9_9 + Acknowledge_1_10 + Acknowledge_6_10 + Acknowledge_10_... (shortened)
lola: processed formula length: 1822
lola: 0 rewrites
lola: closed formula file DatabaseWithMutex-PT-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 90
lola: 184929 markings, 447246 edges, 36986 markings/sec, 0 secs
lola: 389895 markings, 947166 edges, 40993 markings/sec, 5 secs
lola: 574485 markings, 1490353 edges, 36918 markings/sec, 10 secs
lola: 781204 markings, 1976150 edges, 41344 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 90
lola: produced by: state space
lola: The maximum value of the given expression is 90
lola: 965991 markings, 2410683 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-10-UpperBounds-3 90 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1772 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(WaitMutex_7_1 + WaitMutex_7_2 + WaitMutex_7_3 + WaitMutex_7_4 + WaitMutex_7_5 + WaitMutex_7_6 + WaitMutex_7_7 + WaitMutex_7_8 + WaitMutex_7_9 + WaitMutex_5_10 + WaitMutex_8_1 + WaitMutex_8_2 + WaitMutex_8_3 + WaitMutex_8_4 + WaitMutex_8_5 + WaitMutex_8_6 + WaitMutex_8_7 + WaitMutex_8_8 + WaitMutex_8_9 + WaitMutex_9_1 + WaitMutex_9_2 + WaitMutex_9_3 + WaitMutex_9_4 + WaitMutex_9_5 + WaitMutex_9... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(WaitMutex_7_1 + WaitMutex_7_2 + WaitMutex_7_3 + WaitMutex_7_4 + WaitMutex_7_5 + WaitMutex_7_6 + WaitMutex_7_7 + WaitMutex_7_8 + WaitMutex_7_9 + WaitMutex_5_10 + WaitMutex_8_1 + WaitMutex_8_2 + WaitMutex_8_3 + WaitMutex_8_4 + WaitMutex_8_5 + WaitMutex_8_6 + WaitMutex_8_7 + WaitMutex_8_8 + WaitMutex_8_9 + WaitMutex_9_1 + WaitMutex_9_2 + WaitMutex_9_3 + WaitMutex_9_4 + WaitMutex_9_5 + WaitMutex_9... (shortened)
lola: processed formula length: 1622
lola: 0 rewrites
lola: closed formula file DatabaseWithMutex-PT-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 11 markings, 10 edges

FORMULA DatabaseWithMutex-PT-10-UpperBounds-4 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(MesBuffReply_4_10 + MesBuffReply_9_10 + MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_1_5 + MesBuffReply_1_6 + MesBuffReply_1_7 + MesBuffReply_1_8 + MesBuffReply_1_9 + MesBuffReply_3_10 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_2_5 + MesBuffReply_2_6 + MesBuffReply_2_7 + MesBuffReply_2_8 + MesBuffReply_... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(MesBuffReply_4_10 + MesBuffReply_9_10 + MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_1_5 + MesBuffReply_1_6 + MesBuffReply_1_7 + MesBuffReply_1_8 + MesBuffReply_1_9 + MesBuffReply_3_10 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_2_5 + MesBuffReply_2_6 + MesBuffReply_2_7 + MesBuffReply_2_8 + MesBuffReply_... (shortened)
lola: processed formula length: 1922
lola: 0 rewrites
lola: closed formula file DatabaseWithMutex-PT-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 90
lola: SUBRESULT
lola: result: 90
lola: produced by: state space
lola: The maximum value of the given expression is 90
lola: 301 markings, 300 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-10-UpperBounds-1 90 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 10 90 90 90 10 10 10 10 1 1 1 1 1 1 1 1
lola:
preliminary result: 10 90 90 90 10 10 10 10 1 1 1 1 1 1 1 1
lola: memory consumption: 20068 KB
lola: time consumption: 26 seconds

BK_STOP 1526609961965

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DatabaseWithMutex-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-PT-10.tgz
mv DatabaseWithMutex-PT-10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is DatabaseWithMutex-PT-10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r076-blw3-152649936700051"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;