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 568K
-rw-r--r-- 1 mcc users 9.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K 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 290K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is QuasiCertifProtocol-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673583600073
=====================================================================

--------------------
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 QuasiCertifProtocol-PT-10-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527949565509


BK_STOP 1527950444601

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using QuasiCertifProtocol-PT-10 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 1129093, 'Memory': 15948.05, 'Tool': 'lola'}, {'Time': 1137285, 'Memory': 15948.24, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola QuasiCertifProtocol-PT-10...

----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
QuasiCertifProtocol-PT-10: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
QuasiCertifProtocol-PT-10: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ QuasiCertifProtocol-PT-10 @ 3538 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 726/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 550 places, 176 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 231 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: NOT(A (G (((1 <= Astart) OR (n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= AstopOK) OR (SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= a2) OR (1 <= AstopAbort))))) : (E (G (((CstopAbort + 1 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6) OR ((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 <= a2) AND (2 <= a2))))) OR NOT(A (G (((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 <= n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9) OR (s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10 <= a1)))))) : E ((A (G ((1 <= n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9))) U A (F ((2 <= n5_10 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9))))) : E (F ((E (G ((n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9 <= AstopOK))) AND ((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 + 1 <= SstopAbort) AND (Astart + 1 <= a4))))) : (E (X ((1 <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10))) OR ((A (G ((SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_5_0 + n8_6_1 + n8_6_2 + n8_6_3 + n8_6_4 + n8_6_5 + n8_6_6 + n8_6_7 + n8_6_8 + n8_6_9 + n8_3_10 + n8_7_1 + n8_7_2 + n8_7_3 + n8_7_4 + n8_7_5 + n8_7_6 + n8_7_7 + n8_7_8 + n8_7_9 + n8_4_9 + n8_4_8 + n8_4_7 + n8_8_0 + n8_8_1 + n8_8_2 + n8_8_3 + n8_8_4 + n8_8_5 + n8_8_6 + n8_8_7 + n8_8_8 + n8_8_9 + n8_4_6 + n8_4_5 + n8_9_0 + n8_9_1 + n8_9_2 + n8_9_3 + n8_9_4 + n8_9_5 + n8_9_6 + n8_9_7 + n8_9_8 + n8_9_9 + n8_4_4 + n8_2_10 + n8_4_3 + n8_4_2 + n8_4_1 + n8_7_10 + n8_4_0 + n8_3_9 + n8_3_8 + n8_3_7 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_1_10 + n8_2_9 + n8_2_8 + n8_2_7 + n8_2_6 + n8_2_5 + n8_6_10 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_9 + n8_1_8 + n8_1_7 + n8_1_6 + n8_1_5 + n8_1_4 + n8_1_3 + n8_1_2 + n8_1_1 + n8_0_10 + n8_0_9 + n8_0_8 + n8_0_7 + n8_0_6 + n8_0_5 + n8_0_4 + n8_0_3 + n8_0_2 + n8_0_1 + n8_10_0 + n8_10_1 + n8_10_2 + n8_10_3 + n8_10_4 + n8_10_5 + n8_10_6 + n8_10_7 + n8_10_8 + n8_10_9))) AND A (G ((1 <= n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9)))) OR E (((AstopAbort <= Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0) U (3 <= s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9 + s5_10))))) : ((A (G (((CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 <= malicious_reservoir) AND (3 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10)))) AND (((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 <= a3) AND (1 <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10) AND ((s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10 <= a5) OR (a3 <= a2))) AND A (G ((1 <= c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_10 + c1_9))))) OR (E (X ((AstopOK <= 0))) AND E (((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= Cstart_10 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6 + Cstart_7 + Cstart_8 + Cstart_9) U (Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10))))) : ((((n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 <= a1) AND (CstopAbort <= 0) AND ((1 <= a5) OR (CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10) OR (s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9 + s5_10 <= AstopAbort))) AND A (((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 <= a4) U (Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9)))) AND ((((a4 + 1 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6) AND (AstopOK <= 2)) OR (2 <= n9_7_10 + n9_1_10 + n9_6_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_10_5 + n9_10_4 + n9_10_3 + n9_10_2 + n9_10_1 + n9_10_0 + n9_0_10 + n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_0_7 + n9_0_8 + n9_0_9 + n9_5_10 + n9_1_0 + n9_1_1 + n9_1_2 + n9_1_3 + n9_1_4 + n9_1_5 + n9_1_6 + n9_1_7 + n9_1_8 + n9_1_9 + n9_2_0 + n9_2_1 + n9_2_2 + n9_2_3 + n9_2_4 + n9_2_5 + n9_2_6 + n9_2_7 + n9_2_8 + n9_2_9 + n9_3_0 + n9_3_1 + n9_3_2 + n9_3_3 + n9_3_4 + n9_3_5 + n9_3_6 + n9_3_7 + n9_3_8 + n9_3_9 + n9_4_10 + n9_4_0 + n9_4_1 + n9_4_2 + n9_4_3 + n9_4_4 + n9_4_5 + n9_4_6 + n9_4_7 + n9_4_8 + n9_4_9 + n9_9_10 + n9_10_10 + n9_5_0 + n9_5_1 + n9_5_2 + n9_5_3 + n9_5_4 + n9_5_5 + n9_5_6 + n9_5_7 + n9_5_8 + n9_5_9 + n9_6_0 + n9_6_1 + n9_6_2 + n9_6_3 + n9_6_4 + n9_6_5 + n9_6_6 + n9_6_7 + n9_6_8 + n9_6_9 + n9_3_10 + n9_7_0 + n9_7_1 + n9_7_2 + n9_7_3 + n9_7_4 + n9_7_5 + n9_7_6 + n9_7_7 + n9_7_8 + n9_7_9 + n9_8_10 + n9_8_0 + n9_8_1 + n9_8_2 + n9_8_3 + n9_8_4 + n9_8_5 + n9_8_6 + n9_8_7 + n9_8_8 + n9_8_9 + n9_9_0 + n9_9_1 + n9_9_2 + n9_9_3 + n9_9_4 + n9_9_5 + n9_9_6 + n9_9_7 + n9_9_8 + n9_9_9 + n9_2_10)) OR E (X (((a5 <= Astart) AND (a1 <= malicious_reservoir)))))) : A (F (A (X (((1 <= AstopAbort) OR (1 <= AstopOK)))))) : NOT(E (G (A (F ((2 <= n7_9_3)))))) : A (G (NOT(E (X ((2 <= n7_4_7)))))) : A (G (E (F ((1 <= n7_0_5))))) : E (G (A (G ((n7_5_2 <= 0))))) : A ((A (X ((n8_7_9 <= n7_1_8))) U E (X ((2 <= n7_6_7))))) : E (F (A (G ((2 <= n8_9_7))))) : A (X (A (G (((3 <= n8_0_9) OR (n7_0_0 <= n8_6_4)))))) : A (G (E (((n9_10_8 <= SstopOK_9) U (1 <= n8_6_4)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((1 <= Astart) OR (n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= AstopOK) OR (SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= a2) OR (1 <= AstopAbort)))))
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 700 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 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 64 markings, 63 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((CstopAbort + 1 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6) OR ((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 <= a2) AND (2 <= a2))))) OR NOT(A (G (((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 <= n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((CstopAbort + 1 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6) OR ((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 <= a2) AND (2 <= a2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= CstopAbort) AND ((a2 + 1 <= s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9) OR (a2 <= 1)))))
lola: processed formula length: 271
lola: 5 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9 + 1 <= s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9) AND (a1 + 1 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10))))
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 700 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 QuasiCertifProtocol-PT-10-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-10-CTLCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((1 <= n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9))) U A (F ((2 <= n5_10 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U (n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9 <= 0))) U A(TRUE U (2 <= n5_10 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9)))
lola: processed formula length: 195
lola: 4 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 3 significant temporal operators and needs 13 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: 14 markings, 15 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9 <= AstopOK))) AND ((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 + 1 <= SstopAbort) AND (Astart + 1 <= a4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U (AstopOK + 1 <= n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9))) AND ((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 + 1 <= SstopAbort) AND (Astart + 1 <= a4))))
lola: processed formula length: 244
lola: 3 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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: 290242 markings, 2466465 edges, 3689320832170983424 markings/sec, 0 secs
lola: 576527 markings, 4980875 edges, 57257 markings/sec, 5 secs
lola: 825061 markings, 7310134 edges, 49707 markings/sec, 10 secs
lola: 1056880 markings, 9589995 edges, 46364 markings/sec, 15 secs
lola: 1247257 markings, 11654851 edges, 38075 markings/sec, 20 secs
lola: 1489648 markings, 13881008 edges, 48478 markings/sec, 25 secs
lola: 1733842 markings, 16044499 edges, 48839 markings/sec, 30 secs
lola: 1962852 markings, 18179723 edges, 45802 markings/sec, 35 secs
lola: 2197676 markings, 20356435 edges, 46965 markings/sec, 40 secs
lola: 2409843 markings, 22474122 edges, 42433 markings/sec, 45 secs
lola: 2625764 markings, 24599618 edges, 43184 markings/sec, 50 secs
lola: 2923834 markings, 26941021 edges, 59614 markings/sec, 55 secs
lola: 3210100 markings, 29251561 edges, 57253 markings/sec, 60 secs
lola: 3476053 markings, 31505548 edges, 53191 markings/sec, 65 secs
lola: 3712609 markings, 33655716 edges, 47311 markings/sec, 70 secs
lola: 3897833 markings, 35637365 edges, 37045 markings/sec, 75 secs
lola: 4141180 markings, 37898555 edges, 48669 markings/sec, 80 secs
lola: 4360807 markings, 40110081 edges, 43925 markings/sec, 85 secs
lola: 4588836 markings, 42344408 edges, 45606 markings/sec, 90 secs
lola: 4806891 markings, 44528566 edges, 43611 markings/sec, 95 secs
lola: 5013197 markings, 46682598 edges, 41261 markings/sec, 100 secs
lola: 5205801 markings, 48778887 edges, 38521 markings/sec, 105 secs
lola: 5390932 markings, 50857869 edges, 37026 markings/sec, 110 secs
lola: 5554886 markings, 52789826 edges, 32791 markings/sec, 115 secs
lola: 5806191 markings, 54979238 edges, 50261 markings/sec, 120 secs
lola: 6072369 markings, 57137749 edges, 53236 markings/sec, 125 secs
lola: 6320586 markings, 59274303 edges, 49643 markings/sec, 130 secs
lola: 6537536 markings, 61319885 edges, 43390 markings/sec, 135 secs
lola: 6741434 markings, 63313597 edges, 40780 markings/sec, 140 secs
lola: 7003561 markings, 65518434 edges, 52425 markings/sec, 145 secs
lola: 7246682 markings, 67648752 edges, 48624 markings/sec, 150 secs
lola: 7449652 markings, 69646483 edges, 40594 markings/sec, 155 secs
lola: 7680635 markings, 71740927 edges, 46197 markings/sec, 160 secs
lola: 7915132 markings, 73833980 edges, 46899 markings/sec, 165 secs
lola: 8119256 markings, 75856207 edges, 40825 markings/sec, 170 secs
lola: 8355055 markings, 78019068 edges, 47160 markings/sec, 175 secs
lola: 8577880 markings, 80118296 edges, 44565 markings/sec, 180 secs
lola: 8779843 markings, 82136357 edges, 40393 markings/sec, 185 secs
lola: 8997662 markings, 84206465 edges, 43564 markings/sec, 190 secs
lola: 9197665 markings, 86226245 edges, 40001 markings/sec, 195 secs
lola: 9385994 markings, 88203386 edges, 37666 markings/sec, 200 secs
lola: 9585104 markings, 90170700 edges, 39822 markings/sec, 205 secs
lola: 9771753 markings, 92141389 edges, 37330 markings/sec, 210 secs
lola: 9939270 markings, 93981722 edges, 33503 markings/sec, 215 secs
lola: 10098044 markings, 95743106 edges, 31755 markings/sec, 220 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 10124858 markings, 96057732 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X ((1 <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10))) OR ((A (G ((SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5 + n8_5_4 + n8_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((1 <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((1 <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10))
lola: processed formula length: 86
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_5_0 + n8_6_1 + n8_6_2 + n8_6_3 + n8_6_4 + n8_6_5 + n8_6_6 + n8_6_7 + n... (shortened)
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 700 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 QuasiCertifProtocol-PT-10-CTLCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 82 markings, 81 edges
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((AstopAbort <= Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0) U (3 <= s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9 + s5_10)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((AstopAbort <= Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0) U (3 <= s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9 + s5_10))
lola: processed formula length: 223
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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: 349104 markings, 2246307 edges, 2919057411576692736 markings/sec, 0 secs
lola: 657550 markings, 4452355 edges, 61689 markings/sec, 5 secs
lola: 952774 markings, 6616865 edges, 59045 markings/sec, 10 secs
lola: 1193065 markings, 8627309 edges, 48058 markings/sec, 15 secs
lola: 1457890 markings, 10677393 edges, 52965 markings/sec, 20 secs
lola: 1753110 markings, 12697977 edges, 59044 markings/sec, 25 secs
lola: 2035912 markings, 14702249 edges, 56560 markings/sec, 30 secs
lola: 2291245 markings, 16658170 edges, 51067 markings/sec, 35 secs
lola: 2514608 markings, 18535538 edges, 44673 markings/sec, 40 secs
lola: 2902726 markings, 20285163 edges, 77624 markings/sec, 45 secs
lola: 3333437 markings, 21948771 edges, 86142 markings/sec, 50 secs
lola: 3714820 markings, 23555959 edges, 76277 markings/sec, 55 secs
lola: 3994218 markings, 25248505 edges, 55880 markings/sec, 60 secs
lola: 4261520 markings, 27243152 edges, 53460 markings/sec, 65 secs
lola: 4500524 markings, 29073379 edges, 47801 markings/sec, 70 secs
lola: 4739935 markings, 31003696 edges, 47882 markings/sec, 75 secs
lola: 4970396 markings, 32918712 edges, 46092 markings/sec, 80 secs
lola: 5183005 markings, 34786531 edges, 42522 markings/sec, 85 secs
lola: 5384460 markings, 36621868 edges, 40291 markings/sec, 90 secs
lola: 5559429 markings, 38337745 edges, 34994 markings/sec, 95 secs
lola: 5914166 markings, 39960725 edges, 70947 markings/sec, 100 secs
lola: 6296708 markings, 41493574 edges, 76508 markings/sec, 105 secs
lola: 6627538 markings, 43018260 edges, 66166 markings/sec, 110 secs
lola: 7000915 markings, 44590582 edges, 74675 markings/sec, 115 secs
lola: 7362865 markings, 46131245 edges, 72390 markings/sec, 120 secs
lola: 7712198 markings, 47687420 edges, 69867 markings/sec, 125 secs
lola: 8035378 markings, 49090213 edges, 64636 markings/sec, 130 secs
lola: 8350468 markings, 50519105 edges, 63018 markings/sec, 135 secs
lola: 8650989 markings, 51916464 edges, 60104 markings/sec, 140 secs
lola: 8964683 markings, 53322097 edges, 62739 markings/sec, 145 secs
lola: 9258938 markings, 54715747 edges, 58851 markings/sec, 150 secs
lola: 9540904 markings, 56085593 edges, 56393 markings/sec, 155 secs
lola: 9807032 markings, 57452664 edges, 53226 markings/sec, 160 secs
lola: 10054868 markings, 58746475 edges, 49567 markings/sec, 165 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 10069678 markings, 58841954 edges
lola: lola: ========================================
SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 285 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 <= malicious_reservoir) AND (3 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10)))) AND (((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 <= a3) AND (1 <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 285 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 <= malicious_reservoir) AND (3 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10))))
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 700 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: state equation: write sara problem file to QuasiCertifProtocol-PT-10-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 314 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((AstopOK <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((AstopOK <= 0))
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= Cstart_10 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6 + Cstart_7 + Cstart_8 + Cstart_9) U (Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= Cstart_10 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6 + Cstart_7 + Cstart_8 + Cstart_9) U (Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s... (shortened)
lola: processed formula length: 406
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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: 14 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 314 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 <= a1) AND (CstopAbort <= 0) AND ((1 <= a5) OR (CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10) OR (s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 314 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 <= a1) AND (CstopAbort <= 0) AND ((1 <= a5) OR (CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10) OR (s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s... (shortened)
lola: ========================================
----- Kill lola and sara stderr -----
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 <= a1) AND (CstopAbort <= 0) AND ((1 <= a5) OR (CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10) OR (s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s... (shortened)
lola: processed formula length: 435
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: processed formula with 5 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 <= a4) U (Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 <= a4) U (Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9)))
lola: processed formula: A (((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 <= a4) U (Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9)))
lola: processed formula length: 292
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 268679 markings, 1435869 edges, 53736 markings/sec, 0 secs
lola: 541214 markings, 2942955 edges, 54507 markings/sec, 5 secs
lola: 816455 markings, 4613246 edges, 55048 markings/sec, 10 secs
lola: 1068788 markings, 6334860 edges, 50467 markings/sec, 15 secs
lola: 1272636 markings, 8012506 edges, 40770 markings/sec, 20 secs
lola: 1514187 markings, 9379482 edges, 48310 markings/sec, 25 secs
lola: 1786526 markings, 10800386 edges, 54468 markings/sec, 30 secs
lola: 2039877 markings, 12311433 edges, 50670 markings/sec, 35 secs
lola: 2274864 markings, 13848098 edges, 46997 markings/sec, 40 secs
lola: 2481839 markings, 15362831 edges, 41395 markings/sec, 45 secs
lola: 2682889 markings, 16895782 edges, 40210 markings/sec, 50 secs
lola: 2906496 markings, 18326747 edges, 44721 markings/sec, 55 secs
lola: 3161643 markings, 19809224 edges, 51029 markings/sec, 60 secs
lola: 3410529 markings, 21334877 edges, 49777 markings/sec, 65 secs
lola: 3650584 markings, 22916931 edges, 48011 markings/sec, 70 secs
lola: 3869940 markings, 24465754 edges, 43871 markings/sec, 75 secs
lola: 4067182 markings, 25999567 edges, 39448 markings/sec, 80 secs
lola: 4238570 markings, 27460375 edges, 34278 markings/sec, 85 secs
lola: 4411802 markings, 28909544 edges, 34646 markings/sec, 90 secs
lola: 4634028 markings, 30560794 edges, 44445 markings/sec, 95 secs
lola: 4867987 markings, 32101203 edges, 46792 markings/sec, 100 secs
lola: 5101429 markings, 33716049 edges, 46688 markings/sec, 105 secs
lola: 5318568 markings, 35278458 edges, 43428 markings/sec, 110 secs
lola: 5529826 markings, 36902208 edges, 42252 markings/sec, 115 secs
lola: 5726667 markings, 38543912 edges, 39368 markings/sec, 120 secs
lola: 5908226 markings, 40157607 edges, 36312 markings/sec, 125 secs
lola: 6065895 markings, 41769418 edges, 31534 markings/sec, 130 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6086657 markings, 41934939 edges
lola: ========================================
lola: subprocess 8 will run for 375 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((a4 + 1 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6) AND (AstopOK <= 2)) OR (2 <= n9_7_10 + n9_1_10 + n9_6_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_10_5 + n9_10_4 + n9_10_3 + n9_10_2 + n9_10_1 + n9_10_0 + n9_0_10 + n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_0_7 + n9_0_8 + n9_0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((a4 + 1 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6) AND (AstopOK <= 2)) OR (2 <= n9_7_10 + n9_1_10 + n9_6_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_10_5 + n9_10_4 + n9_10_3 + n9_10_2 + n9_10_1 + n9_10_0 + n9_0_10 + n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_0_7 + n9_0_8 + n9_0... (shortened)
lola: processed formula length: 1285
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-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: 0 markings, 0 edges
lola: subprocess 9 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((a5 <= Astart) AND (a1 <= malicious_reservoir))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((a5 <= Astart) AND (a1 <= malicious_reservoir)))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 333 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((1 <= AstopAbort) OR (1 <= AstopOK))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(((1 <= AstopAbort) OR (1 <= AstopOK))))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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: 365844 markings, 1281263 edges, 3689329903141912576 markings/sec, 0 secs
lola: 715210 markings, 2616159 edges, 69873 markings/sec, 5 secs
lola: 1037027 markings, 3936585 edges, 64363 markings/sec, 10 secs
lola: 1302734 markings, 5233714 edges, 53141 markings/sec, 15 secs
lola: 1673142 markings, 6532983 edges, 74082 markings/sec, 20 secs
lola: 2005736 markings, 7806237 edges, 66519 markings/sec, 25 secs
lola: 2309834 markings, 9053641 edges, 60820 markings/sec, 30 secs
lola: 2615014 markings, 10276999 edges, 61036 markings/sec, 35 secs
lola: 2956102 markings, 11559569 edges, 68218 markings/sec, 40 secs
lola: 3283084 markings, 12831063 edges, 65396 markings/sec, 45 secs
lola: 3586011 markings, 14087766 edges, 60585 markings/sec, 50 secs
lola: 3836919 markings, 15313750 edges, 50182 markings/sec, 55 secs
lola: 4135234 markings, 16558209 edges, 59663 markings/sec, 60 secs
lola: 4427225 markings, 17786547 edges, 58398 markings/sec, 65 secs
lola: 4711372 markings, 19009485 edges, 56829 markings/sec, 70 secs
lola: 4977286 markings, 20202356 edges, 53183 markings/sec, 75 secs
lola: 5226099 markings, 21364973 edges, 49763 markings/sec, 80 secs
lola: 5451843 markings, 22499881 edges, 45149 markings/sec, 85 secs
lola: 5737286 markings, 23657562 edges, 57089 markings/sec, 90 secs
lola: 6045309 markings, 24843895 edges, 61605 markings/sec, 95 secs
lola: 6325334 markings, 26006476 edges, 56005 markings/sec, 100 secs
lola: 6552622 markings, 27107002 edges, 45458 markings/sec, 105 secs
lola: 6857480 markings, 28319499 edges, 60972 markings/sec, 110 secs
lola: 7147450 markings, 29516372 edges, 57994 markings/sec, 115 secs
lola: 7393269 markings, 30692066 edges, 49164 markings/sec, 120 secs
lola: 7679294 markings, 31885075 edges, 57205 markings/sec, 125 secs
lola: 7951007 markings, 33061864 edges, 54343 markings/sec, 130 secs
lola: 8204410 markings, 34237560 edges, 50681 markings/sec, 135 secs
lola: 8472847 markings, 35411988 edges, 53687 markings/sec, 140 secs
lola: 8725245 markings, 36589728 edges, 50480 markings/sec, 145 secs
lola: 8966024 markings, 37736689 edges, 48156 markings/sec, 150 secs
lola: 9214552 markings, 38885855 edges, 49706 markings/sec, 155 secs
lola: 9450054 markings, 40040081 edges, 47100 markings/sec, 160 secs
lola: 9674387 markings, 41167819 edges, 44867 markings/sec, 165 secs
lola: 9882531 markings, 42273966 edges, 41629 markings/sec, 170 secs
lola: 10163996 markings, 43365334 edges, 56293 markings/sec, 175 secs
lola: 10498415 markings, 44450434 edges, 66884 markings/sec, 180 secs
lola: 10827392 markings, 45590509 edges, 65795 markings/sec, 185 secs
lola: 11119368 markings, 46796453 edges, 58395 markings/sec, 190 secs
lola: 11431188 markings, 47923122 edges, 62364 markings/sec, 195 secs
lola: 11756942 markings, 49000363 edges, 65151 markings/sec, 200 secs
lola: 12059933 markings, 50113403 edges, 60598 markings/sec, 205 secs
lola: 12339687 markings, 51307876 edges, 55951 markings/sec, 210 secs
lola: 12664970 markings, 52381170 edges, 65057 markings/sec, 215 secs
lola: 12953814 markings, 53402867 edges, 57769 markings/sec, 220 secs
lola: 13209474 markings, 54477720 edges, 51132 markings/sec, 225 secs
lola: 13494827 markings, 55511126 edges, 57071 markings/sec, 230 secs
lola: 13775430 markings, 56486482 edges, 56121 markings/sec, 235 secs
lola: 14030842 markings, 57531817 edges, 51082 markings/sec, 240 secs
lola: 14299925 markings, 58571458 edges, 53817 markings/sec, 245 secs
lola: 14579552 markings, 59559042 edges, 55925 markings/sec, 250 secs
lola: 14833895 markings, 60620378 edges, 50869 markings/sec, 255 secs
lola: 15106198 markings, 61654212 edges, 54461 markings/sec, 260 secs
lola: 15387472 markings, 62704128 edges, 56255 markings/sec, 265 secs
lola: 15669921 markings, 63908754 edges, 56490 markings/sec, 270 secs
lola: 15970998 markings, 65018099 edges, 60215 markings/sec, 275 secs
lola: 16244931 markings, 66196610 edges, 54787 markings/sec, 280 secs
lola: 16531771 markings, 67272899 edges, 57368 markings/sec, 285 secs
lola: 16800236 markings, 68431576 edges, 53693 markings/sec, 290 secs
lola: 17075263 markings, 69540323 edges, 55005 markings/sec, 295 secs
lola: 17352649 markings, 70683578 edges, 55477 markings/sec, 300 secs
lola: 17624696 markings, 71823089 edges, 54409 markings/sec, 305 secs
lola: 17887010 markings, 72978916 edges, 52463 markings/sec, 310 secs
lola: 18130061 markings, 74084745 edges, 48610 markings/sec, 315 secs
lola: 18372253 markings, 75260989 edges, 48438 markings/sec, 320 secs
lola: 18640103 markings, 76335799 edges, 53570 markings/sec, 325 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- 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="QuasiCertifProtocol-PT-10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
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/QuasiCertifProtocol-PT-10.tgz
mv QuasiCertifProtocol-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 mcc4mcc-full"
echo " Input is QuasiCertifProtocol-PT-10, 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 r142-qhx2-152673583600073"
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 ;