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-3254
Executing tool lola
Input is S_QuasiCertifProtocol-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-149479231800255
=====================================================================

--------------------
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-COL-10-CTLCardinality-0
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-1
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-15
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-2
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-3
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-4
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-5
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-6
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-7
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-8
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496382160720


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


checking for too many tokens
===========================================================================================
S_QuasiCertifProtocol-PT-10: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_QuasiCertifProtocol-PT-10 @ 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: 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-COL-10-CTLCardinality.task
lola: E (G ((((n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 + 1 <= CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10) AND (3 <= n1_9 + n1_8 + n1_7 + n1_6 + n1_5 + n1_4 + n1_3 + n1_2 + n1_1 + n1_0 + n1_10)) OR A (X ((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 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6)))))) : A ((A (G ((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 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10))) U A (F ((2 <= CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10))))) : E (F (((3 <= a5) AND (n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9 <= a3) AND (n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9 <= Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0) AND (3 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10)))) : A (F (E (G (((1 <= a5) AND (1 <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10)))))) : A (F ((A (F ((2 <= CstopAbort))) AND A (X ((1 <= s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9)))))) : A (F (A (X ((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 + 1 <= a1))))) : E (((2 <= 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) U A (F ((3 <= a1))))) : E (F ((1 <= n7_3_10 + n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_6_7 + n7_6_8 + n7_6_9 + n7_7_0 + n7_8_10 + n7_8_0 + n7_4_10 + n7_2_10 + n7_9_0 + n7_5_10 + n7_10_0 + n7_0_10 + n7_1_10 + n7_7_10 + n7_6_10 + n7_10_1 + n7_10_2 + n7_10_3 + n7_10_4 + n7_10_5 + n7_10_6 + n7_10_7 + n7_10_8 + n7_10_9 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_0_7 + n7_0_8 + n7_0_9 + n7_1_0 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_1_7 + n7_1_8 + n7_1_9 + n7_9_9 + n7_9_8 + n7_9_7 + n7_2_0 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_2_7 + n7_2_8 + n7_2_9 + n7_9_6 + n7_9_5 + n7_9_4 + n7_9_3 + n7_9_2 + n7_9_1 + n7_10_10 + n7_3_0 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_3_7 + n7_3_8 + n7_3_9 + n7_8_9 + n7_8_8 + n7_8_7 + n7_8_6 + n7_8_5 + n7_8_4 + n7_8_3 + n7_8_2 + n7_8_1 + n7_4_0 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_4_7 + n7_4_8 + n7_4_9 + n7_7_9 + n7_7_8 + n7_7_7 + n7_7_6 + n7_7_5 + n7_7_4 + n7_7_3 + n7_7_2 + n7_7_1 + n7_9_10 + n7_5_0 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6 + n7_5_7 + n7_5_8 + n7_5_9))) : NOT(A (F (((SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 + 1 <= AstopOK) OR (n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9 + 1 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10))))) : (NOT(A (G (((AstopOK <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6) OR (AstopOK <= 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 ((((Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9) AND (Astart <= 2)) OR A (G ((AstopAbort <= CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10)))) OR ((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 + 1 <= n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10) AND A (F ((1 <= AstopOK)))))) : E (G (A (F (((AstopOK <= a4) OR (2 <= SstopAbort)))))) : A (G (((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 <= 0) OR ((AstopAbort + 1 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6) AND (CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 <= 0))))) : E (F (E (G (((3 <= a4) OR (SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= Astart)))))) : A (F (E (G ((c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_10 + c1_9 + 1 <= Astart))))) : ((1 <= AstopOK) OR (NOT(A (G ((1 <= Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0)))) AND NOT(A (X ((2 <= s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9)))))) : E (F ((E (F ((3 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6))) AND ((Cstart_10 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6 + Cstart_7 + Cstart_8 + Cstart_9 <= 2) OR (SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 + 1 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 + 1 <= CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10) AND (3 <= n1_9 + n1_8 + n1_7 + n1_6 + n1_5 + n1_4 + n1_3 + n1_2 + n1_1 + n1_0 + n1_10)) OR A (X ((n9_7_10 + n9_1_10 + n9_6_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_10_5 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 <= n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10) OR (n1_9 + n1_8 + n1_7 + n1_6 + n1_5 + n1_4 + n1_3 + n1_2 + n1_1 + n1_0 + n1_10 <= 2)) AND NOT(AX((n9_7_10 + n9_1_10 + n9_6_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_... (shortened)
lola: processed formula length: 1575
lola: 4 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (G ((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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(E(TRUE U (s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10 + 1 <= 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... (shortened)
lola: processed formula length: 1361
lola: 4 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-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: 542389 markings, 3607975 edges, 3225232092371615744 markings/sec, 0 secs
lola: 986284 markings, 6916240 edges, 88779 markings/sec, 5 secs
lola: 1322601 markings, 9884572 edges, 67263 markings/sec, 10 secs
lola: 1762961 markings, 12818059 edges, 88072 markings/sec, 15 secs
lola: 2153280 markings, 15627772 edges, 78064 markings/sec, 20 secs
lola: 2477815 markings, 18262774 edges, 64907 markings/sec, 25 secs
lola: 2967647 markings, 21735934 edges, 97966 markings/sec, 30 secs
lola: 3464395 markings, 25345037 edges, 99350 markings/sec, 35 secs
lola: 3842113 markings, 28547213 edges, 75544 markings/sec, 40 secs
lola: 4219645 markings, 31537344 edges, 75506 markings/sec, 45 secs
lola: 4585568 markings, 34454894 edges, 73185 markings/sec, 50 secs
lola: 4935417 markings, 37327351 edges, 69970 markings/sec, 55 secs
lola: 5251523 markings, 40076534 edges, 63221 markings/sec, 60 secs
lola: 5519210 markings, 42641736 edges, 53537 markings/sec, 65 secs
lola: 5952179 markings, 45895961 edges, 86594 markings/sec, 70 secs
lola: 6393986 markings, 49253053 edges, 88361 markings/sec, 75 secs
lola: 6750457 markings, 52333789 edges, 71294 markings/sec, 80 secs
lola: 7221687 markings, 55881338 edges, 94246 markings/sec, 85 secs
lola: 7590250 markings, 59052592 edges, 73713 markings/sec, 90 secs
lola: 8011924 markings, 62411991 edges, 84335 markings/sec, 95 secs
lola: 8389185 markings, 65609290 edges, 75452 markings/sec, 100 secs
lola: 8740830 markings, 68700410 edges, 70329 markings/sec, 105 secs
lola: 9079142 markings, 71746529 edges, 67662 markings/sec, 110 secs
lola: 9421705 markings, 74784525 edges, 68513 markings/sec, 115 secs
lola: 9736796 markings, 77700935 edges, 63018 markings/sec, 120 secs
lola: 10011293 markings, 80430769 edges, 54899 markings/sec, 125 secs
lola: 10518827 markings, 83863460 edges, 101507 markings/sec, 130 secs
lola: 11063261 markings, 87418668 edges, 108887 markings/sec, 135 secs
lola: 11546025 markings, 90886561 edges, 96553 markings/sec, 140 secs
lola: 12102115 markings, 94392655 edges, 111218 markings/sec, 145 secs
lola: 12538854 markings, 97723296 edges, 87348 markings/sec, 150 secs
lola: 13086709 markings, 101175290 edges, 109571 markings/sec, 155 secs
lola: 13507041 markings, 104411567 edges, 84066 markings/sec, 160 secs
lola: 14022911 markings, 107801256 edges, 103174 markings/sec, 165 secs
lola: 14462487 markings, 111074441 edges, 87915 markings/sec, 170 secs
lola: 14924164 markings, 114325505 edges, 92335 markings/sec, 175 secs
lola: 15382581 markings, 117566999 edges, 91683 markings/sec, 180 secs
lola: 15779193 markings, 120681055 edges, 79322 markings/sec, 185 secs
lola: 16223895 markings, 123850283 edges, 88940 markings/sec, 190 secs
lola: 16637123 markings, 126971574 edges, 82646 markings/sec, 195 secs
lola: 17034720 markings, 130006451 edges, 79519 markings/sec, 200 secs
lola: 17420991 markings, 133055584 edges, 77254 markings/sec, 205 secs
lola: 17803293 markings, 135999625 edges, 76460 markings/sec, 210 secs
lola: 18150385 markings, 138744936 edges, 69418 markings/sec, 215 secs
lola: 18468651 markings, 141724389 edges, 63653 markings/sec, 220 secs
lola: 18786482 markings, 144697386 edges, 63566 markings/sec, 225 secs
lola: 19131901 markings, 147613762 edges, 69084 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 (F (((3 <= a5) AND (n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9 <= a3) AND (n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9 <= Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0) 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 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: state equation: write sara problem file to QuasiCertifProtocol-COL-10-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-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: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((1 <= a5) AND (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: A(TRUE U NOT(A(TRUE U ((a5 <= 0) OR (s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 <= 0)))))
lola: processed formula length: 123
lola: 3 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-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: 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 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F ((2 <= CstopAbort))) AND A (X ((1 <= 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 CTL
lola: processed formula: A(TRUE U (A(TRUE U (2 <= CstopAbort)) AND AX((1 <= 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: 130
lola: 3 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-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 2 significant temporal operators and needs 9 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 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 + 1 <= a1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 + 1 <= a1)))
lola: processed formula length: 101
lola: 2 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-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: 438434 markings, 2867356 edges, 3225752436249460736 markings/sec, 0 secs
lola: 805837 markings, 5536047 edges, 73481 markings/sec, 5 secs
lola: 1123528 markings, 8049410 edges, 63538 markings/sec, 10 secs
lola: 1410466 markings, 10402648 edges, 57388 markings/sec, 15 secs
lola: 1757928 markings, 12770362 edges, 69492 markings/sec, 20 secs
lola: 2079283 markings, 15078027 edges, 64271 markings/sec, 25 secs
lola: 2363497 markings, 17287343 edges, 56843 markings/sec, 30 secs
lola: 2675476 markings, 19720307 edges, 62396 markings/sec, 35 secs
lola: 3140619 markings, 22963593 edges, 93029 markings/sec, 40 secs
lola: 3559319 markings, 26085850 edges, 83740 markings/sec, 45 secs
lola: 3874060 markings, 28873857 edges, 62948 markings/sec, 50 secs
lola: 4185121 markings, 31260019 edges, 62212 markings/sec, 55 secs
lola: 4481198 markings, 33592115 edges, 59215 markings/sec, 60 secs
lola: 4764828 markings, 35876637 edges, 56726 markings/sec, 65 secs
lola: 5025192 markings, 38090720 edges, 52073 markings/sec, 70 secs
lola: 5268540 markings, 40227088 edges, 48670 markings/sec, 75 secs
lola: 5488430 markings, 42325456 edges, 43978 markings/sec, 80 secs
lola: 5810652 markings, 44928751 edges, 64444 markings/sec, 85 secs
lola: 6237822 markings, 48022851 edges, 85434 markings/sec, 90 secs
lola: 6576074 markings, 50833865 edges, 67650 markings/sec, 95 secs
lola: 6939600 markings, 53697976 edges, 72705 markings/sec, 100 secs
lola: 7310725 markings, 56634845 edges, 74225 markings/sec, 105 secs
lola: 7633743 markings, 59401533 edges, 64604 markings/sec, 110 secs
lola: 8003244 markings, 62326297 edges, 73900 markings/sec, 115 secs
lola: 8325704 markings, 65089439 edges, 64492 markings/sec, 120 secs
lola: 8638039 markings, 67809792 edges, 62467 markings/sec, 125 secs
lola: 8959376 markings, 70535815 edges, 64267 markings/sec, 130 secs
lola: 9254618 markings, 73192802 edges, 59048 markings/sec, 135 secs
lola: 9535402 markings, 75780604 edges, 56157 markings/sec, 140 secs
lola: 9797376 markings, 78319834 edges, 52395 markings/sec, 145 secs
lola: 10037247 markings, 80698563 edges, 47974 markings/sec, 150 secs
lola: 10514921 markings, 83840175 edges, 95535 markings/sec, 155 secs
lola: 11021543 markings, 87071513 edges, 101324 markings/sec, 160 secs
lola: 11424227 markings, 90158809 edges, 80537 markings/sec, 165 secs
lola: 11962651 markings, 93471589 edges, 107685 markings/sec, 170 secs
lola: 12363860 markings, 96433982 edges, 80242 markings/sec, 175 secs
lola: 12853680 markings, 99648739 edges, 97964 markings/sec, 180 secs
lola: 13270615 markings, 102617400 edges, 83387 markings/sec, 185 secs
lola: 13715096 markings, 105690743 edges, 88896 markings/sec, 190 secs
lola: 14137760 markings, 108691269 edges, 84533 markings/sec, 195 secs
lola: 14567091 markings, 111721152 edges, 85866 markings/sec, 200 secs
lola: 14965128 markings, 114619946 edges, 79607 markings/sec, 205 secs
lola: 15391100 markings, 117612695 edges, 85194 markings/sec, 210 secs
lola: 15744622 markings, 120464190 edges, 70704 markings/sec, 215 secs
lola: 16168981 markings, 123418378 edges, 84872 markings/sec, 220 secs
lola: 16546751 markings, 126243858 edges, 75554 markings/sec, 225 secs
lola: 16894677 markings, 129058685 edges, 69585 markings/sec, 230 secs
lola: 17265295 markings, 131819393 edges, 74124 markings/sec, 235 secs
lola: 17630359 markings, 134611562 edges, 73013 markings/sec, 240 secs
lola: 17949495 markings, 137231151 edges, 63827 markings/sec, 245 secs
lola: 18267727 markings, 139782176 edges, 63646 markings/sec, 250 secs
lola: 18561495 markings, 142522532 edges, 58754 markings/sec, 255 secs
lola: 18858955 markings, 145251247 edges, 59492 markings/sec, 260 secs
lola: 19163969 markings, 147861344 edges, 61003 markings/sec, 265 secs
lola: 19435416 markings, 150333354 edges, 54289 markings/sec, 270 secs
lola: 19705997 markings, 152827509 edges, 54116 markings/sec, 275 secs
lola: 19963508 markings, 155504653 edges, 51502 markings/sec, 280 secs
lola: 20209878 markings, 158144046 edges, 49274 markings/sec, 285 secs
lola: 20735360 markings, 161319909 edges, 105096 markings/sec, 290 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((2 <= 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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((2 <= 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 ... (shortened)
lola: processed formula length: 1140
lola: 2 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 333 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= n7_3_10 + n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_6_7 + n7_6_8 + n7_6_9 + n7_7_0 + n7_8_10 + n7_8_0 + n7_4_10 + n7_2_10 + n7_9_0 + n7_5_10 + n7_10_0 + n7_0_10 + n7_1_10 + n7_7_10 + n7_6_10 + n7_10_1 + n7_10_2 + n7_10_3 + n7_10_4 + n7_10_5 + n7_10_6 + n7_10_7 + n7_10_8 + n7_10_9 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_0_7 + n7_0_8 + ... (shortened)
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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-CTLCardinality-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 375 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 + 1 <= AstopOK) OR (n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9 + 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 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 + 1 <= AstopOK) OR (n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9 + 1 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10))))
lola: processed formula length: 329
lola: 5 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-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: ========================================
lola: subprocess 9 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (G (((AstopOK <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6) OR (AstopOK <= 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 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 + 1 <= AstopOK) AND (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 + ... (shortened)
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-COL-10-CTLCardinality-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: ========================================
SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 500 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((AstopOK <= a4) OR (2 <= SstopAbort))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U ((AstopOK <= a4) OR (2 <= SstopAbort))))))
lola: processed formula length: 69
lola: 2 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 600 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 <= 0) OR ((AstopAbort + 1 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6) AND (CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 <= 0)))))
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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-CTLCardinality-11.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 750 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((3 <= a4) OR (SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= Astart))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U ((a4 <= 2) AND (Astart + 1 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6)))))
lola: processed formula length: 187
lola: 3 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 1001 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_10 + c1_9 + 1 <= Astart)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (Astart <= c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_10 + c1_9))))
lola: processed formula length: 112
lola: 3 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1501 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= AstopOK) OR (NOT(A (G ((1 <= Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0)))) AND NOT(A (X ((2 <= 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 a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1501 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= AstopOK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= AstopOK)
lola: processed formula length: 14
lola: 6 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-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: ========================================
lola: subprocess 15 will run for 3003 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= 0)))
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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-CTLCardinality-15.sara
lola: SUBRESULT
lola: result: yeslola:
lola: state equation: calling and running sara
produced by: state space
lola: The predicate is reachable.
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: ========================================
lola: subprocess 15 will run for 3003 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (F ((3 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6))) AND ((Cstart_10 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6 + Cstart_7 + Cstart_8 + Cstart_9 <= 2) OR (SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + S... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
sara: try reading problem file QuasiCertifProtocol-COL-10-CTLCardinality-15.sara.
lola: processed formula: E(TRUE U (E(TRUE U (3 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6)) AND ((Cstart_10 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6 + Cstart_7 + Cstart_8 + Cstart_9 <= 2) OR (SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_... (shortened)
lola: processed formula length: 512
lola: 2 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-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).
sara: place or transition ordering is non-deterministic

lola: 530119 markings, 3520953 edges, 2320247436171280384 markings/sec, 0 secs
lola: 970014 markings, 6770764 edges, 87979 markings/sec, 5 secs
lola: 1294727 markings, 9659076 edges, 64943 markings/sec, 10 secs
lola: 1725430 markings, 12529434 edges, 86141 markings/sec, 15 secs
lola: 2095961 markings, 15235861 edges, 74106 markings/sec, 20 secs
lola: 2426538 markings, 17830017 edges, 66115 markings/sec, 25 secs
lola: 2844061 markings, 20962946 edges, 83505 markings/sec, 30 secs
lola: 3363642 markings, 24604286 edges, 103916 markings/sec, 35 secs
lola: 3770858 markings, 27864952 edges, 81443 markings/sec, 40 secs
lola: 4121119 markings, 30787147 edges, 70052 markings/sec, 45 secs
lola: 4495291 markings, 33695348 edges, 74834 markings/sec, 50 secs
lola: 4834888 markings, 36491080 edges, 67919 markings/sec, 55 secs
lola: 5155940 markings, 39219341 edges, 64210 markings/sec, 60 secs
lola: 5435790 markings, 41812648 edges, 55970 markings/sec, 65 secs
lola: 5773026 markings, 44621001 edges, 67447 markings/sec, 70 secs
lola: 6236705 markings, 48015052 edges, 92736 markings/sec, 75 secs
lola: 6598724 markings, 51059902 edges, 72404 markings/sec, 80 secs
lola: 7020220 markings, 54313764 edges, 84299 markings/sec, 85 secs
lola: 7403024 markings, 57438311 edges, 76561 markings/sec, 90 secs
lola: 7792469 markings, 60597299 edges, 77889 markings/sec, 95 secs
lola: 8134110 markings, 63573033 edges, 68328 markings/sec, 100 secs
lola: 8519482 markings, 66697567 edges, 77074 markings/sec, 105 secs
lola: 8858594 markings, 69664826 edges, 67822 markings/sec, 110 secs
lola: 9183159 markings, 72567913 edges, 64913 markings/sec, 115 secs
lola: 9489772 markings, 75387704 edges, 61323 markings/sec, 120 secs
lola: 9779466 markings, 78135155 edges, 57939 markings/sec, 125 secs
lola: 10037604 markings, 80706528 edges, 51628 markings/sec, 130 secs
lola: 10560553 markings, 84127862 edges, 104590 markings/sec, 135 secs
lola: 11077939 markings, 87529926 edges, 103477 markings/sec, 140 secs
lola: 11543428 markings, 90871775 edges, 93098 markings/sec, 145 secs
lola: 12083739 markings, 94272005 edges, 108062 markings/sec, 150 secs
lola: 12493006 markings, 97434796 edges, 81853 markings/sec, 155 secs
lola: 13032667 markings, 100819291 edges, 107932 markings/sec, 160 secs
lola: 13413478 markings, 103835040 edges, 76162 markings/sec, 165 secs
lola: 13939543 markings, 107159720 edges, 105213 markings/sec, 170 secs
lola: 14338903 markings, 110275472 edges, 79872 markings/sec, 175 secs
lola: 14816358 markings, 113479356 edges, 95491 markings/sec, 180 secs
lola: 15238606 markings, 116611868 edges, 84450 markings/sec, 185 secs
lola: 15653519 markings, 119634120 edges, 82983 markings/sec, 190 secs
lola: 16076542 markings, 122714999 edges, 84605 markings/sec, 195 secs
lola: 16471883 markings, 125741975 edges, 79068 markings/sec, 200 secs
lola: 16850317 markings, 128689894 edges, 75687 markings/sec, 205 secs
lola: 17242216 markings, 131626593 edges, 78380 markings/sec, 210 secs
lola: 17624579 markings, 134567293 edges, 76473 markings/sec, 215 secs
lola: 17959795 markings, 137300516 edges, 67043 markings/sec, 220 secs
lola: 18292797 markings, 139976276 edges, 66600 markings/sec, 225 secs
lola: 18596162 markings, 142840803 edges, 60673 markings/sec, 230 secs
lola: 18917761 markings, 145705380 edges, 64320 markings/sec, 235 secs
lola: 19226658 markings, 148440249 edges, 61779 markings/sec, 240 secs
lola: 19512375 markings, 150997139 edges, 57143 markings/sec, 245 secs
lola: 19791942 markings, 153699774 edges, 55913 markings/sec, 250 secs
lola: 20061791 markings, 156474468 edges, 53970 markings/sec, 255 secs
lola: 20448638 markings, 159585882 edges, 77369 markings/sec, 260 secs
lola: 20965505 markings, 162825551 edges, 103373 markings/sec, 265 secs
lola: 21355304 markings, 165873835 edges, 77960 markings/sec, 270 secs
lola: 21883535 markings, 169160600 edges, 105646 markings/sec, 275 secs
lola: 22257919 markings, 172081943 edges, 74877 markings/sec, 280 secs
lola: 22759681 markings, 175295516 edges, 100352 markings/sec, 285 secs
lola: 23137164 markings, 178251528 edges, 75497 markings/sec, 290 secs
lola: 23611222 markings, 181359212 edges, 94812 markings/sec, 295 secs
lola: 23989196 markings, 184328399 edges, 75595 markings/sec, 300 secs
lola: 24420662 markings, 187318325 edges, 86293 markings/sec, 305 secs
lola: 24813874 markings, 190222046 edges, 78642 markings/sec, 310 secs
lola: 25184823 markings, 193114778 edges, 74190 markings/sec, 315 secs
lola: 25580147 markings, 195990834 edges, 79065 markings/sec, 320 secs
lola: 25943333 markings, 198802367 edges, 72637 markings/sec, 325 secs
lola: 26299410 markings, 201597167 edges, 71215 markings/sec, 330 secs
lola: 26658845 markings, 204353378 edges, 71887 markings/sec, 335 secs
lola: 26980098 markings, 206889947 edges, 64251 markings/sec, 340 secs
lola: 27281902 markings, 209646780 edges, 60361 markings/sec, 345 secs
lola: 27573934 markings, 212354384 edges, 58406 markings/sec, 350 secs
lola: 27892119 markings, 215114960 edges, 63637 markings/sec, 355 secs
lola: 28174597 markings, 217724578 edges, 56496 markings/sec, 360 secs
lola: 28457294 markings, 220143218 edges, 56539 markings/sec, 365 secs
lola: 28721739 markings, 222857585 edges, 52889 markings/sec, 370 secs
lola: 28979553 markings, 225457071 edges, 51563 markings/sec, 375 secs
lola: 29391047 markings, 228496150 edges, 82299 markings/sec, 380 secs
lola: 29838674 markings, 231551535 edges, 89525 markings/sec, 385 secs
lola: 30255474 markings, 234567318 edges, 83360 markings/sec, 390 secs
lola: 30704240 markings, 237620389 edges, 89753 markings/sec, 395 secs
lola: 31115907 markings, 240618012 edges, 82333 markings/sec, 400 secs
lola: 31543049 markings, 243626677 edges, 85428 markings/sec, 405 secs
lola: 31958907 markings, 246610758 edges, 83172 markings/sec, 410 secs
lola: 32333608 markings, 249495217 edges, 74940 markings/sec, 415 secs
lola: 32743452 markings, 252416202 edges, 81969 markings/sec, 420 secs
lola: 33120996 markings, 255277592 edges, 75509 markings/sec, 425 secs
lola: 33481378 markings, 258098082 edges, 72076 markings/sec, 430 secs
lola: 33855737 markings, 260905984 edges, 74872 markings/sec, 435 secs
lola: 34217739 markings, 263723822 edges, 72400 markings/sec, 440 secs
lola: 34542380 markings, 266424928 edges, 64928 markings/sec, 445 secs
lola: 34876386 markings, 268974398 edges, 66801 markings/sec, 450 secs
lola: 35170485 markings, 271726980 edges, 58820 markings/sec, 455 secs
lola: 35461601 markings, 274432029 edges, 58223 markings/sec, 460 secs
lola: 35776411 markings, 277142220 edges, 62962 markings/sec, 465 secs
lola: 36053560 markings, 279658138 edges, 55430 markings/sec, 470 secs
lola: 36327882 markings, 282167295 edges, 54864 markings/sec, 475 secs
lola: 36588701 markings, 284849299 edges, 52164 markings/sec, 480 secs
lola: 36832638 markings, 287428238 edges, 48787 markings/sec, 485 secs
lola: 37319598 markings, 290542103 edges, 97392 markings/sec, 490 secs
lola: 37685649 markings, 293412882 edges, 73210 markings/sec, 495 secs
lola: 38146895 markings, 296430934 edges, 92249 markings/sec, 500 secs
lola: 38504402 markings, 299307614 edges, 71501 markings/sec, 505 secs
lola: 38940219 markings, 302279129 edges, 87163 markings/sec, 510 secs
lola: 39318185 markings, 305121019 edges, 75593 markings/sec, 515 secs
lola: 39698074 markings, 307936553 edges, 75978 markings/sec, 520 secs
lola: 40072726 markings, 310754365 edges, 74930 markings/sec, 525 secs
lola: 40430800 markings, 313483184 edges, 71615 markings/sec, 530 secs
lola: 40764401 markings, 316194783 edges, 66720 markings/sec, 535 secs
lola: 41135966 markings, 318960366 edges, 74313 markings/sec, 540 secs
lola: 41457312 markings, 321485630 edges, 64269 markings/sec, 545 secs
lola: 41757994 markings, 324032406 edges, 60136 markings/sec, 550 secs
lola: 42043609 markings, 326705423 edges, 57123 markings/sec, 555 secs
lola: 42338809 markings, 329357997 edges, 59040 markings/sec, 560 secs
lola: 42633507 markings, 331949893 edges, 58940 markings/sec, 565 secs
lola: 42904867 markings, 334378234 edges, 54272 markings/sec, 570 secs
lola: 43167800 markings, 336859291 edges, 52587 markings/sec, 575 secs
lola: 43416738 markings, 339478995 edges, 49788 markings/sec, 580 secs
lola: 43668960 markings, 342019982 edges, 50444 markings/sec, 585 secs
lola: 44126074 markings, 345043399 edges, 91423 markings/sec, 590 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes unknown no no no unknown no yes yes yes yes no yes no unknown unknown
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496383298005

--------------------
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="S_QuasiCertifProtocol-PT-10"
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/S_QuasiCertifProtocol-PT-10.tgz
mv S_QuasiCertifProtocol-PT-10 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_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 r138-smll-149479231800255"
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 ;