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)
.................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is TCPcondis-PT-40, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008500237
=====================================================================

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-0
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-1
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-10
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-11
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-12
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-13
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-14
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-15
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-2
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-3
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-4
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-5
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-6
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-7
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-8
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494937406829


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ TCPcondis-PT-40 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 62/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 30 places, 32 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 48 transition conflict sets
lola: TASK
lola: reading formula from TCPcondis-PT-40-CTLCardinality.task
lola: (((ESTAB <= xCLOSEWAIT) AND (2 <= FINWAIT1)) OR E (G ((FINWAIT1 <= xLASTACK)))) : NOT(A (F (((CLOSED <= FIN))))) : E (G (A (X (((xESTAB <= FINWAIT1) AND (xSYNACK <= LISTEN)))))) : NOT((A (F ((SYNACK <= xFINACK))) AND E (F ((xSYNSENT + 1 <= FINWAIT2))))) : NOT(E (F (A (X ((1 <= xFINACK)))))) : (A (F ((1 <= xLASTACK))) OR (FINWAIT1 + 1 <= FINACK)) : (((SYNACK <= SYNRCVD) AND (1 <= xCLOSEWAIT) AND (FINWAIT1 <= 0)) OR A (G (((xTIMEWAIT <= 0) AND (xTIMEWAIT <= 2))))) : E (G (A (F (((2 <= TIMEWAIT) OR (xFINACK <= xLASTACK)))))) : NOT((((xFINACK <= 0) AND (SYN + 1 <= FIN) AND (xSYNSENT <= xFINACK)) OR E (G ((xSYNSENT <= xESTAB))))) : E (F (E (G (((1 <= SYNSENT) AND (3 <= xCLOSED)))))) : E (F (((3 <= SYNACK) AND (FINACK <= SYNACK)))) : NOT(A (G (E (G ((LASTACK <= xCLOSED)))))) : (((((xCLOSING <= 2) AND (xLASTACK <= 2)) OR E (F ((3 <= SYNRCVD)))) AND A (F (((2 <= xCLOSING) AND (1 <= SYNACK))))) OR A ((((xCLOSING <= xCLOSED) AND (2 <= ESTAB)) U ((2 <= ESTAB) OR (3 <= CLOSING))))) : E (G (A (F ((ESTAB <= 1))))) : A (X (A (((1 <= CLOSED) U (2 <= xLASTACK))))) : ((xFINACK <= xLISTEN) AND E (G (((FINWAIT1 <= xCLOSING) OR (2 <= LISTEN)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((ESTAB <= xCLOSEWAIT) AND (2 <= FINWAIT1)) OR E (G ((FINWAIT1 <= xLASTACK))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((ESTAB <= xCLOSEWAIT) AND (2 <= FINWAIT1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ESTAB <= xCLOSEWAIT) AND (2 <= FINWAIT1))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((FINWAIT1 <= xLASTACK)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (xLASTACK + 1 <= FINWAIT1)))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: lola: SUBRESULT
========================================lola:
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((CLOSED <= FIN)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((CLOSED <= FIN))))
lola: processed formula length: 32
lola: 5 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1701227 markings, 3268537 edges, 340245 markings/sec, 0 secs
lola: 3251403 markings, 6343350 edges, 310035 markings/sec, 5 secs
lola: 4764451 markings, 9354670 edges, 302610 markings/sec, 10 secs
lola: 6227556 markings, 12281278 edges, 292621 markings/sec, 15 secs
lola: 7729289 markings, 15301442 edges, 300347 markings/sec, 20 secs
lola: 9123005 markings, 18166670 edges, 278743 markings/sec, 25 secs
lola: 10580414 markings, 21080520 edges, 291482 markings/sec, 30 secs
lola: 12025677 markings, 23983102 edges, 289053 markings/sec, 35 secs
lola: 13365626 markings, 26742469 edges, 267990 markings/sec, 40 secs
lola: 14772626 markings, 29557334 edges, 281400 markings/sec, 45 secs
lola: 16152570 markings, 32406086 edges, 275989 markings/sec, 50 secs
lola: 17585353 markings, 35289571 edges, 286557 markings/sec, 55 secs
lola: 18939168 markings, 38058247 edges, 270763 markings/sec, 60 secs
lola: 20235424 markings, 40757052 edges, 259251 markings/sec, 65 secs
lola: 21634653 markings, 43537208 edges, 279846 markings/sec, 70 secs
lola: 22993154 markings, 46339658 edges, 271700 markings/sec, 75 secs
lola: 24312168 markings, 49093087 edges, 263803 markings/sec, 80 secs
lola: 25728307 markings, 51914461 edges, 283228 markings/sec, 85 secs
lola: 27060009 markings, 54645242 edges, 266340 markings/sec, 90 secs
lola: 28334766 markings, 57297302 edges, 254951 markings/sec, 95 secs
lola: 29590872 markings, 59924866 edges, 251221 markings/sec, 100 secs
lola: 30971278 markings, 62650335 edges, 276081 markings/sec, 105 secs
lola: 32358126 markings, 65504540 edges, 277370 markings/sec, 110 secs
lola: 33690950 markings, 68285196 edges, 266565 markings/sec, 115 secs
lola: 35020014 markings, 71072804 edges, 265813 markings/sec, 120 secs
lola: 36412280 markings, 73875450 edges, 278453 markings/sec, 125 secs
lola: 37811894 markings, 76695761 edges, 279923 markings/sec, 130 secs
lola: 39093084 markings, 79358432 edges, 256238 markings/sec, 135 secs
lola: 40358263 markings, 82001675 edges, 253036 markings/sec, 140 secs
lola: 41590704 markings, 84595753 edges, 246488 markings/sec, 145 secs
lola: 42873500 markings, 87210667 edges, 256559 markings/sec, 150 secs
lola: 44266775 markings, 89970123 edges, 278655 markings/sec, 155 secs
lola: 45563709 markings, 92662143 edges, 259387 markings/sec, 160 secs
lola: 46839510 markings, 95323682 edges, 255160 markings/sec, 165 secs
lola: 48115441 markings, 97998284 edges, 255186 markings/sec, 170 secs
lola: 49403334 markings, 100701787 edges, 257579 markings/sec, 175 secs
lola: 50706114 markings, 103351291 edges, 260556 markings/sec, 180 secs
lola: 52095565 markings, 106103796 edges, 277890 markings/sec, 185 secs
lola: 53344454 markings, 108694981 edges, 249778 markings/sec, 190 secs
lola: 54576220 markings, 111263480 edges, 246353 markings/sec, 195 secs
lola: 55607452 markings, 113425717 edges, 206246 markings/sec, 200 secs
lola: 56775119 markings, 115879904 edges, 233533 markings/sec, 205 secs
lola: 57945529 markings, 118351120 edges, 234082 markings/sec, 210 secs
lola: 59149540 markings, 120858596 edges, 240802 markings/sec, 215 secs
lola: 60493646 markings, 123451287 edges, 268821 markings/sec, 220 secs
lola: 61821513 markings, 126185295 edges, 265573 markings/sec, 225 secs
lola: 63097280 markings, 128844554 edges, 255153 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (((xESTAB <= FINWAIT1) AND (xSYNACK <= LISTEN))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(AX(((xESTAB <= FINWAIT1) AND (xSYNACK <= LISTEN))))))
lola: processed formula length: 70
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1045029 markings, 3241163 edges, 3096159597753270272 markings/sec, 0 secs
lola: 1898936 markings, 6255549 edges, 170781 markings/sec, 5 secs
lola: 2723957 markings, 9166081 edges, 165004 markings/sec, 10 secs
lola: 3531079 markings, 12018427 edges, 161424 markings/sec, 15 secs
lola: 4328730 markings, 14829599 edges, 159530 markings/sec, 20 secs
lola: 5112377 markings, 17601891 edges, 156729 markings/sec, 25 secs
lola: 5895361 markings, 20358931 edges, 156597 markings/sec, 30 secs
lola: 6667663 markings, 23085397 edges, 154460 markings/sec, 35 secs
lola: 7432171 markings, 25785112 edges, 152902 markings/sec, 40 secs
lola: 8190584 markings, 28462721 edges, 151683 markings/sec, 45 secs
lola: 8942021 markings, 31116554 edges, 150287 markings/sec, 50 secs
lola: 9697593 markings, 33791042 edges, 151114 markings/sec, 55 secs
lola: 10451312 markings, 36455610 edges, 150744 markings/sec, 60 secs
lola: 11199026 markings, 39100375 edges, 149543 markings/sec, 65 secs
lola: 11933346 markings, 41707695 edges, 146864 markings/sec, 70 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F ((SYNACK <= xFINACK))) AND E (F ((xSYNSENT + 1 <= FINWAIT2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((xFINACK + 1 <= SYNACK)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (SYNACK <= xFINACK)))
lola: processed formula length: 34
lola: 9 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FINWAIT2 <= xSYNSENT)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-40-CTLCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (X ((1 <= xFINACK))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((xFINACK <= 0)))))
lola: processed formula length: 38
lola: 7 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= xLASTACK))) OR (FINWAIT1 + 1 <= FINACK))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= xLASTACK)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= xLASTACK))
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 322 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FINWAIT1 + 1 <= FINACK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FINWAIT1 + 1 <= FINACK)
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 322 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((SYNACK <= SYNRCVD) AND (1 <= xCLOSEWAIT) AND (FINWAIT1 <= 0)) OR A (G (((xTIMEWAIT <= 0) AND (xTIMEWAIT <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 322 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((SYNACK <= SYNRCVD) AND (1 <= xCLOSEWAIT) AND (FINWAIT1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((SYNACK <= SYNRCVD) AND (1 <= xCLOSEWAIT) AND (FINWAIT1 <= 0))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((xTIMEWAIT <= 0) AND (xTIMEWAIT <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: SUBRESULTstate equation: write sara problem file to TCPcondis-PT-40-CTLCardinality-7.sara

lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((2 <= TIMEWAIT) OR (xFINACK <= xLASTACK))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U ((2 <= TIMEWAIT) OR (xFINACK <= xLASTACK))))))
lola: processed formula length: 73
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2136496 markings, 2255367 edges, 3096159597753270272 markings/sec, 0 secs
lola: 3942572 markings, 4299836 edges, 361215 markings/sec, 5 secs
lola: 5607493 markings, 6229910 edges, 332984 markings/sec, 10 secs
lola: 7354825 markings, 8170786 edges, 349466 markings/sec, 15 secs
lola: 8931471 markings, 9977930 edges, 315329 markings/sec, 20 secs
lola: 10415300 markings, 11815648 edges, 296766 markings/sec, 25 secs
lola: 11848020 markings, 13746995 edges, 286544 markings/sec, 30 secs
lola: 13209013 markings, 15585274 edges, 272199 markings/sec, 35 secs
lola: 14397673 markings, 17400652 edges, 237732 markings/sec, 40 secs
lola: 16050938 markings, 19230093 edges, 330653 markings/sec, 45 secs
lola: 17556945 markings, 21088580 edges, 301201 markings/sec, 50 secs
lola: 19144283 markings, 22817816 edges, 317468 markings/sec, 55 secs
lola: 20569029 markings, 24501212 edges, 284949 markings/sec, 60 secs
lola: 21919446 markings, 26268858 edges, 270083 markings/sec, 65 secs
lola: 23158135 markings, 27996144 edges, 247738 markings/sec, 70 secs
lola: 24466996 markings, 29766344 edges, 261772 markings/sec, 75 secs
lola: 25794589 markings, 31575244 edges, 265519 markings/sec, 80 secs
lola: 27047001 markings, 33450427 edges, 250482 markings/sec, 85 secs
lola: 28129214 markings, 35319006 edges, 216443 markings/sec, 90 secs
lola: 28930301 markings, 37392724 edges, 160217 markings/sec, 95 secs
lola: 30352332 markings, 39083277 edges, 284406 markings/sec, 100 secs
lola: 31432340 markings, 40876392 edges, 216002 markings/sec, 105 secs
lola: 32581488 markings, 42571824 edges, 229830 markings/sec, 110 secs
lola: 33625512 markings, 44527880 edges, 208805 markings/sec, 115 secs
lola: 35206462 markings, 46268355 edges, 316190 markings/sec, 120 secs
lola: 36673371 markings, 47986666 edges, 293382 markings/sec, 125 secs
lola: 38017720 markings, 49716211 edges, 268870 markings/sec, 130 secs
lola: 39514440 markings, 51550058 edges, 299344 markings/sec, 135 secs
lola: 40903307 markings, 53194772 edges, 277773 markings/sec, 140 secs
lola: 42240902 markings, 54820257 edges, 267519 markings/sec, 145 secs
lola: 43411956 markings, 56481677 edges, 234211 markings/sec, 150 secs
lola: 44512159 markings, 58091645 edges, 220041 markings/sec, 155 secs
lola: 45878441 markings, 59676313 edges, 273256 markings/sec, 160 secs
lola: 46831391 markings, 61420526 edges, 190590 markings/sec, 165 secs
lola: 48045404 markings, 63195652 edges, 242803 markings/sec, 170 secs
lola: 49153898 markings, 64970486 edges, 221699 markings/sec, 175 secs
lola: 50184780 markings, 66656466 edges, 206176 markings/sec, 180 secs
lola: 51129619 markings, 68454890 edges, 188968 markings/sec, 185 secs
lola: 52541362 markings, 70211859 edges, 282349 markings/sec, 190 secs
lola: 53809169 markings, 72053050 edges, 253561 markings/sec, 195 secs
lola: 54467275 markings, 73931715 edges, 131621 markings/sec, 200 secs
lola: 55608377 markings, 75895473 edges, 228220 markings/sec, 205 secs
lola: 56826746 markings, 77799421 edges, 243674 markings/sec, 210 secs
lola: 57655599 markings, 79710492 edges, 165771 markings/sec, 215 secs
lola: 58640451 markings, 81770682 edges, 196970 markings/sec, 220 secs
lola: 59313948 markings, 83761519 edges, 134699 markings/sec, 225 secs
lola: 59929467 markings, 85771178 edges, 123104 markings/sec, 230 secs
lola: 61351236 markings, 87511962 edges, 284354 markings/sec, 235 secs
lola: 62683634 markings, 89188152 edges, 266480 markings/sec, 240 secs
lola: 63831326 markings, 90979889 edges, 229538 markings/sec, 245 secs
lola: 64416611 markings, 92826763 edges, 117057 markings/sec, 250 secs
lola: 65526497 markings, 94516608 edges, 221977 markings/sec, 255 secs
lola: 66494144 markings, 96354093 edges, 193529 markings/sec, 260 secs
lola: 67260837 markings, 98271087 edges, 153339 markings/sec, 265 secs
lola: 68786581 markings, 100105538 edges, 305149 markings/sec, 270 secs
lola: 70242853 markings, 101792085 edges, 291254 markings/sec, 275 secs
lola: 71555907 markings, 103447871 edges, 262611 markings/sec, 280 secs
lola: 72956592 markings, 105127889 edges, 280137 markings/sec, 285 secs
lola: 74141290 markings, 106821030 edges, 236940 markings/sec, 290 secs
lola: 75505230 markings, 108716677 edges, 272788 markings/sec, 295 secs
lola: 76919404 markings, 110326371 edges, 282835 markings/sec, 300 secs
lola: 78236788 markings, 111881509 edges, 263477 markings/sec, 305 secs
lola: 79453827 markings, 113478533 edges, 243408 markings/sec, 310 secs
lola: 80498947 markings, 115065677 edges, 209024 markings/sec, 315 secs
lola: 81745776 markings, 116600943 edges, 249366 markings/sec, 320 secs
lola: 82744553 markings, 118175063 edges, 199755 markings/sec, 325 secs
lola: 83984187 markings, 119822855 edges, 247927 markings/sec, 330 secs
lola: 84953467 markings, 121419579 edges, 193856 markings/sec, 335 secs
lola: 85771442 markings, 123084054 edges, 163595 markings/sec, 340 secs
lola: 86745419 markings, 124674204 edges, 194795 markings/sec, 345 secs
lola: 87820213 markings, 126265851 edges, 214959 markings/sec, 350 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((xFINACK <= 0) AND (SYN + 1 <= FIN) AND (xSYNSENT <= xFINACK)) OR E (G ((xSYNSENT <= xESTAB)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= xFINACK) OR (FIN <= SYN) OR (xFINACK + 1 <= xSYNSENT))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= xFINACK) OR (FIN <= SYN) OR (xFINACK + 1 <= xSYNSENT))
lola: processed formula length: 63
lola: 5 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 409 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((xESTAB + 1 <= xSYNSENT)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (xESTAB + 1 <= xSYNSENT))
lola: processed formula length: 34
lola: 6 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 409 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((1 <= SYNSENT) AND (3 <= xCLOSED))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U ((SYNSENT <= 0) OR (xCLOSED <= 2)))))
lola: processed formula length: 60
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 478 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= SYNACK) AND (FINACK <= SYNACK))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-40-CTLCardinality-10.sara
lola: SUBRESULT
lola: result: yes
lola: lola: produced by: state space
lola: state equation: calling and running sara
The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (E (G ((LASTACK <= xCLOSED))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (xCLOSED + 1 <= LASTACK)))
lola: processed formula length: 44
lola: 7 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 717 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((xCLOSING <= 2) AND (xLASTACK <= 2)) OR E (F ((3 <= SYNRCVD)))) AND A (F (((2 <= xCLOSING) AND (1 <= SYNACK))))) OR A ((((xCLOSING <= xCLOSED) AND (2 <= ESTAB)) U ((2 <= ESTAB) OR (3 <= CLOSING)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 717 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((xCLOSING <= 2) AND (xLASTACK <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((xCLOSING <= 2) AND (xLASTACK <= 2))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: sara: try reading problem file TCPcondis-PT-40-CTLCardinality-10.sara.
processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 956 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= xCLOSING) AND (1 <= SYNACK))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((2 <= xCLOSING) AND (1 <= SYNACK)))
lola: processed formula length: 45
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: sara: place or transition ordering is non-deterministic
result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1434 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((xCLOSING <= xCLOSED) AND (2 <= ESTAB)) U ((2 <= ESTAB) OR (3 <= CLOSING))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((xCLOSING <= xCLOSED) AND (2 <= ESTAB)) U ((2 <= ESTAB) OR (3 <= CLOSING)))
lola: processed formula length: 79
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: lola: SUBRESULT
========================================lola:
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 956 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((ESTAB <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (ESTAB <= 1)))))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).

lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 14 will run for 1434 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (((1 <= CLOSED) U (2 <= xLASTACK)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A((1 <= CLOSED) U (2 <= xLASTACK)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 2869 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((xFINACK <= xLISTEN) AND E (G (((FINWAIT1 <= xCLOSING) OR (2 <= LISTEN)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2869 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (xFINACK <= xLISTEN)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (xFINACK <= xLISTEN)
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: RESULT
lola:
SUMMARY: yes unknown no no no no no unknown no yes yes yes no yes no unknown
lola: ========================================
FORMULA TCPcondis-PT-40-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494938077992

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="TCPcondis-PT-40"
export BK_EXAMINATION="CTLCardinality"
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/TCPcondis-PT-40.tgz
mv TCPcondis-PT-40 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is TCPcondis-PT-40, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-ebro-149441008500237"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;