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 QuasiCertifProtocol-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-149440926300255
=====================================================================

--------------------
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 1494770028434


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ 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: 523519 markings, 3481360 edges, 3225232092371615744 markings/sec, 0 secs
lola: 961611 markings, 6705489 edges, 87618 markings/sec, 5 secs
lola: 1288207 markings, 9590831 edges, 65319 markings/sec, 10 secs
lola: 1712079 markings, 12439236 edges, 84774 markings/sec, 15 secs
lola: 2085946 markings, 15139934 edges, 74773 markings/sec, 20 secs
lola: 2416860 markings, 17732213 edges, 66183 markings/sec, 25 secs
lola: 2829964 markings, 20849393 edges, 82621 markings/sec, 30 secs
lola: 3345242 markings, 24447445 edges, 103056 markings/sec, 35 secs
lola: 3752755 markings, 27709713 edges, 81503 markings/sec, 40 secs
lola: 4102578 markings, 30640996 edges, 69965 markings/sec, 45 secs
lola: 4475042 markings, 33554368 edges, 74493 markings/sec, 50 secs
lola: 4822049 markings, 36373252 edges, 69401 markings/sec, 55 secs
lola: 5145273 markings, 39122325 edges, 64645 markings/sec, 60 secs
lola: 5427775 markings, 41725741 edges, 56500 markings/sec, 65 secs
lola: 5759359 markings, 44519642 edges, 66317 markings/sec, 70 secs
lola: 6223576 markings, 47905214 edges, 92843 markings/sec, 75 secs
lola: 6589051 markings, 50958852 edges, 73095 markings/sec, 80 secs
lola: 7001942 markings, 54191112 edges, 82578 markings/sec, 85 secs
lola: 7391511 markings, 57340996 edges, 77914 markings/sec, 90 secs
lola: 7779629 markings, 60504892 edges, 77624 markings/sec, 95 secs
lola: 8126609 markings, 63492084 edges, 69396 markings/sec, 100 secs
lola: 8510683 markings, 66614738 edges, 76815 markings/sec, 105 secs
lola: 8844689 markings, 69557577 edges, 66801 markings/sec, 110 secs
lola: 9167261 markings, 72443524 edges, 64514 markings/sec, 115 secs
lola: 9478170 markings, 75273386 edges, 62182 markings/sec, 120 secs
lola: 9768093 markings, 78006555 edges, 57985 markings/sec, 125 secs
lola: 10026217 markings, 80584977 edges, 51625 markings/sec, 130 secs
lola: 10527669 markings, 83912623 edges, 100290 markings/sec, 135 secs
lola: 11049567 markings, 87304393 edges, 104380 markings/sec, 140 secs
lola: 11492293 markings, 90580629 edges, 88545 markings/sec, 145 secs
lola: 12045659 markings, 94007350 edges, 110673 markings/sec, 150 secs
lola: 12434145 markings, 97084091 edges, 77697 markings/sec, 155 secs
lola: 12983151 markings, 100487422 edges, 109801 markings/sec, 160 secs
lola: 13374790 markings, 103485804 edges, 78328 markings/sec, 165 secs
lola: 13882930 markings, 106781161 edges, 101628 markings/sec, 170 secs
lola: 14269458 markings, 109793090 edges, 77306 markings/sec, 175 secs
lola: 14755967 markings, 112990174 edges, 97302 markings/sec, 180 secs
lola: 15151356 markings, 116070542 edges, 79078 markings/sec, 185 secs
lola: 15588113 markings, 119125000 edges, 87351 markings/sec, 190 secs
lola: 15999604 markings, 122123350 edges, 82298 markings/sec, 195 secs
lola: 16374242 markings, 125109565 edges, 74928 markings/sec, 200 secs
lola: 16776608 markings, 128031973 edges, 80473 markings/sec, 205 secs
lola: 17158807 markings, 130979166 edges, 76440 markings/sec, 210 secs
lola: 17527546 markings, 133834504 edges, 73748 markings/sec, 215 secs
lola: 17865380 markings, 136581543 edges, 67567 markings/sec, 220 secs
lola: 18199982 markings, 139158104 edges, 66920 markings/sec, 225 secs
lola: 18498121 markings, 141964467 edges, 59628 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 236 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: 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: ========================================
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: 436389 markings, 2851530 edges, 3225752436249460736 markings/sec, 0 secs
lola: 800529 markings, 5503402 edges, 72828 markings/sec, 5 secs
lola: 1118629 markings, 8007719 edges, 63620 markings/sec, 10 secs
lola: 1401098 markings, 10352336 edges, 56494 markings/sec, 15 secs
lola: 1747552 markings, 12691178 edges, 69291 markings/sec, 20 secs
lola: 2065047 markings, 14963905 edges, 63499 markings/sec, 25 secs
lola: 2353861 markings, 17203713 edges, 57763 markings/sec, 30 secs
lola: 2652878 markings, 19593126 edges, 59803 markings/sec, 35 secs
lola: 3132619 markings, 22908921 edges, 95948 markings/sec, 40 secs
lola: 3560422 markings, 26095363 edges, 85561 markings/sec, 45 secs
lola: 3876731 markings, 28899841 edges, 63262 markings/sec, 50 secs
lola: 4190040 markings, 31297686 edges, 62662 markings/sec, 55 secs
lola: 4488006 markings, 33639589 edges, 59593 markings/sec, 60 secs
lola: 4771302 markings, 35932144 edges, 56659 markings/sec, 65 secs
lola: 5031805 markings, 38158360 edges, 52101 markings/sec, 70 secs
lola: 5279295 markings, 40328505 edges, 49498 markings/sec, 75 secs
lola: 5495534 markings, 42396827 edges, 43248 markings/sec, 80 secs
lola: 5820775 markings, 45034987 edges, 65048 markings/sec, 85 secs
lola: 6250758 markings, 48149766 edges, 85997 markings/sec, 90 secs
lola: 6591410 markings, 50979809 edges, 68130 markings/sec, 95 secs
lola: 6964430 markings, 53892537 edges, 74604 markings/sec, 100 secs
lola: 7336505 markings, 56838589 edges, 74415 markings/sec, 105 secs
lola: 7660207 markings, 59599721 edges, 64740 markings/sec, 110 secs
lola: 8018052 markings, 62465405 edges, 71569 markings/sec, 115 secs
lola: 8341492 markings, 65212762 edges, 64688 markings/sec, 120 secs
lola: 8645811 markings, 67885245 edges, 60864 markings/sec, 125 secs
lola: 8965852 markings, 70600289 edges, 64008 markings/sec, 130 secs
lola: 9260027 markings, 73236929 edges, 58835 markings/sec, 135 secs
lola: 9536273 markings, 75788125 edges, 55249 markings/sec, 140 secs
lola: 9794383 markings, 78284703 edges, 51622 markings/sec, 145 secs
lola: 10030881 markings, 80634464 edges, 47300 markings/sec, 150 secs
lola: 10490961 markings, 83718114 edges, 92016 markings/sec, 155 secs
lola: 11003892 markings, 86947439 edges, 102586 markings/sec, 160 secs
lola: 11388730 markings, 89964269 edges, 76968 markings/sec, 165 secs
lola: 11932210 markings, 93273479 edges, 108696 markings/sec, 170 secs
lola: 12340625 markings, 96237159 edges, 81683 markings/sec, 175 secs
lola: 12816779 markings, 99432191 edges, 95231 markings/sec, 180 secs
lola: 13244236 markings, 102402893 edges, 85491 markings/sec, 185 secs
lola: 13657242 markings, 105330030 edges, 82601 markings/sec, 190 secs
lola: 14092198 markings, 108336955 edges, 86991 markings/sec, 195 secs
lola: 14498551 markings, 111276429 edges, 81271 markings/sec, 200 secs
lola: 14910298 markings, 114205337 edges, 82349 markings/sec, 205 secs
lola: 15318594 markings, 117131740 edges, 81659 markings/sec, 210 secs
lola: 15685787 markings, 119931322 edges, 73439 markings/sec, 215 secs
lola: 16094488 markings, 122847989 edges, 81740 markings/sec, 220 secs
lola: 16463114 markings, 125677945 edges, 73725 markings/sec, 225 secs
lola: 16820586 markings, 128426416 edges, 71494 markings/sec, 230 secs
lola: 17188194 markings, 131213839 edges, 73522 markings/sec, 235 secs
lola: 17542590 markings, 133948995 edges, 70879 markings/sec, 240 secs
lola: 17864050 markings, 136568563 edges, 64292 markings/sec, 245 secs
lola: 18186110 markings, 139040819 edges, 64412 markings/sec, 250 secs
lola: 18470362 markings, 141733943 edges, 56850 markings/sec, 255 secs
lola: 18756806 markings, 144394890 edges, 57289 markings/sec, 260 secs
lola: 19071934 markings, 147045230 edges, 63026 markings/sec, 265 secs
lola: 19331199 markings, 149547059 edges, 51853 markings/sec, 270 secs
lola: 19614897 markings, 151917172 edges, 56740 markings/sec, 275 secs
lola: 19864889 markings, 154524711 edges, 49998 markings/sec, 280 secs
lola: 20120002 markings, 157096978 edges, 51023 markings/sec, 285 secs
lola: 20533611 markings, 160088231 edges, 82722 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: state equation: calling and running 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: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
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: state equation: calling and running sara
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: state equation: calling and running sara
lola: result: yes
lola: 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
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
sara: try reading problem file QuasiCertifProtocol-COL-10-CTLCardinality-15.sara.
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: 522509 markings, 3475068 edges, 2320247436171280384 markings/sec, 0 secs
lola: 960376 markings, 6698497 edges, 87573 markings/sec, 5 secs
lola: 1285934 markings, 9563224 edges, 65112 markings/sec, 10 secs
lola: 1707788 markings, 12405092 edges, 84371 markings/sec, 15 secs
lola: 2081211 markings, 15101628 edges, 74685 markings/sec, 20 secs
lola: 2409628 markings, 17671629 edges, 65683 markings/sec, 25 secs
lola: 2819539 markings, 20740749 edges, 81982 markings/sec, 30 secs
lola: 3329612 markings, 24329115 edges, 102015 markings/sec, 35 secs
lola: 3742600 markings, 27614330 edges, 82598 markings/sec, 40 secs
lola: 4084424 markings, 30522327 edges, 68365 markings/sec, 45 secs
lola: 4461960 markings, 33438710 edges, 75507 markings/sec, 50 secs
lola: 4809552 markings, 36260864 edges, 69518 markings/sec, 55 secs
lola: 5130229 markings, 38992184 edges, 64135 markings/sec, 60 secs
lola: 5411661 markings, 41578973 edges, 56286 markings/sec, 65 secs
lola: 5725797 markings, 44289941 edges, 62827 markings/sec, 70 secs
lola: 6194558 markings, 47689399 edges, 93752 markings/sec, 75 secs
lola: 6566691 markings, 50748690 edges, 74427 markings/sec, 80 secs
lola: 6968793 markings, 53934659 edges, 80420 markings/sec, 85 secs
lola: 7368820 markings, 57128956 edges, 80005 markings/sec, 90 secs
lola: 7745042 markings, 60238991 edges, 75244 markings/sec, 95 secs
lola: 8106331 markings, 63276044 edges, 72258 markings/sec, 100 secs
lola: 8481943 markings, 66379093 edges, 75122 markings/sec, 105 secs
lola: 8816954 markings, 69313995 edges, 67002 markings/sec, 110 secs
lola: 9136502 markings, 72189443 edges, 63910 markings/sec, 115 secs
lola: 9448727 markings, 75029148 edges, 62445 markings/sec, 120 secs
lola: 9744269 markings, 77773992 edges, 59108 markings/sec, 125 secs
lola: 10003147 markings, 80345893 edges, 51776 markings/sec, 130 secs
lola: 10462592 markings, 83539805 edges, 91889 markings/sec, 135 secs
lola: 11009458 markings, 86983741 edges, 109373 markings/sec, 140 secs
lola: 11430977 markings, 90204393 edges, 84304 markings/sec, 145 secs
lola: 11994543 markings, 93680843 edges, 112713 markings/sec, 150 secs
lola: 12397301 markings, 96751656 edges, 80552 markings/sec, 155 secs
lola: 12928711 markings, 100135409 edges, 106282 markings/sec, 160 secs
lola: 13337380 markings, 103136646 edges, 81734 markings/sec, 165 secs
lola: 13826262 markings, 106426908 edges, 97776 markings/sec, 170 secs
lola: 14231786 markings, 109466380 edges, 81105 markings/sec, 175 secs
lola: 14712375 markings, 112675965 edges, 96118 markings/sec, 180 secs
lola: 15101607 markings, 115736111 edges, 77846 markings/sec, 185 secs
lola: 15550852 markings, 118841965 edges, 89849 markings/sec, 190 secs
lola: 15959177 markings, 121851197 edges, 81665 markings/sec, 195 secs
lola: 16335248 markings, 124817187 edges, 75214 markings/sec, 200 secs
lola: 16744417 markings, 127796590 edges, 81834 markings/sec, 205 secs
lola: 17122504 markings, 130718907 edges, 75617 markings/sec, 210 secs
lola: 17498456 markings, 133585316 edges, 75190 markings/sec, 215 secs
lola: 17840237 markings, 136361034 edges, 68356 markings/sec, 220 secs
lola: 18178521 markings, 138973988 edges, 67657 markings/sec, 225 secs
lola: 18477549 markings, 141795498 edges, 59806 markings/sec, 230 secs
lola: 18774224 markings, 144602108 edges, 59335 markings/sec, 235 secs
lola: 19109383 markings, 147378747 edges, 67032 markings/sec, 240 secs
lola: 19393152 markings, 149998072 edges, 56754 markings/sec, 245 secs
lola: 19681336 markings, 152598833 edges, 57637 markings/sec, 250 secs
lola: 19951771 markings, 155392037 edges, 54087 markings/sec, 255 secs
lola: 20210161 markings, 158154660 edges, 51678 markings/sec, 260 secs
lola: 20772721 markings, 161567324 edges, 112512 markings/sec, 265 secs
lola: 21196138 markings, 164605683 edges, 84683 markings/sec, 270 secs
lola: 21680045 markings, 167862437 edges, 96781 markings/sec, 275 secs
lola: 22119002 markings, 170913113 edges, 87791 markings/sec, 280 secs
lola: 22555017 markings, 173997371 edges, 87203 markings/sec, 285 secs
lola: 22994556 markings, 177053373 edges, 87908 markings/sec, 290 secs
lola: 23426253 markings, 180126390 edges, 86339 markings/sec, 295 secs
lola: 23828621 markings, 183047132 edges, 80474 markings/sec, 300 secs
lola: 24272950 markings, 186171157 edges, 88866 markings/sec, 305 secs
lola: 24651096 markings, 189171239 edges, 75629 markings/sec, 310 secs
lola: 25076751 markings, 192219809 edges, 85131 markings/sec, 315 secs
lola: 25474398 markings, 195184031 edges, 79529 markings/sec, 320 secs
lola: 25848406 markings, 198096603 edges, 74802 markings/sec, 325 secs
lola: 26207706 markings, 200969689 edges, 71860 markings/sec, 330 secs
lola: 26601439 markings, 203877911 edges, 78747 markings/sec, 335 secs
lola: 26935616 markings, 206543308 edges, 66835 markings/sec, 340 secs
lola: 27252086 markings, 209349903 edges, 63294 markings/sec, 345 secs
lola: 27558144 markings, 212172534 edges, 61212 markings/sec, 350 secs
lola: 27880313 markings, 215032976 edges, 64434 markings/sec, 355 secs
lola: 28176106 markings, 217741342 edges, 59159 markings/sec, 360 secs
lola: 28471305 markings, 220263531 edges, 59040 markings/sec, 365 secs
lola: 28740190 markings, 223078138 edges, 53777 markings/sec, 370 secs
lola: 29004651 markings, 225764647 edges, 52892 markings/sec, 375 secs
lola: 29470492 markings, 228989418 edges, 93168 markings/sec, 380 secs
lola: 29910252 markings, 232100325 edges, 87952 markings/sec, 385 secs
lola: 30374824 markings, 235300497 edges, 92914 markings/sec, 390 secs
lola: 30804930 markings, 238376454 edges, 86021 markings/sec, 395 secs
lola: 31261061 markings, 241549808 edges, 91226 markings/sec, 400 secs
lola: 31656892 markings, 244578125 edges, 79166 markings/sec, 405 secs
lola: 32108918 markings, 247691389 edges, 90405 markings/sec, 410 secs
lola: 32500937 markings, 250688006 edges, 78404 markings/sec, 415 secs
lola: 32905303 markings, 253666103 edges, 80873 markings/sec, 420 secs
lola: 33303592 markings, 256650724 edges, 79658 markings/sec, 425 secs
lola: 33678973 markings, 259529260 edges, 75076 markings/sec, 430 secs
lola: 34046425 markings, 262422243 edges, 73490 markings/sec, 435 secs
lola: 34420071 markings, 265279406 edges, 74729 markings/sec, 440 secs
lola: 34753445 markings, 267926495 edges, 66675 markings/sec, 445 secs
lola: 35064191 markings, 270765264 edges, 62149 markings/sec, 450 secs
lola: 35365063 markings, 273566185 edges, 60174 markings/sec, 455 secs
lola: 35698284 markings, 276416791 edges, 66644 markings/sec, 460 secs
lola: 35982541 markings, 279112691 edges, 56851 markings/sec, 465 secs
lola: 36280937 markings, 281659989 edges, 59679 markings/sec, 470 secs
lola: 36544893 markings, 284444461 edges, 52791 markings/sec, 475 secs
lola: 36804887 markings, 287114327 edges, 51999 markings/sec, 480 secs
lola: 37285150 markings, 290323450 edges, 96053 markings/sec, 485 secs
lola: 37674350 markings, 293310014 edges, 77840 markings/sec, 490 secs
lola: 38149843 markings, 296450469 edges, 95099 markings/sec, 495 secs
lola: 38529307 markings, 299447149 edges, 75893 markings/sec, 500 secs
lola: 38974190 markings, 302521404 edges, 88977 markings/sec, 505 secs
lola: 39375548 markings, 305476826 edges, 80272 markings/sec, 510 secs
lola: 39748056 markings, 308391804 edges, 74502 markings/sec, 515 secs
lola: 40147478 markings, 311306738 edges, 79884 markings/sec, 520 secs
lola: 40515125 markings, 314141771 edges, 73529 markings/sec, 525 secs
lola: 40880973 markings, 316971570 edges, 73170 markings/sec, 530 secs
lola: 41235476 markings, 319758672 edges, 70901 markings/sec, 535 secs
lola: 41562663 markings, 322338846 edges, 65437 markings/sec, 540 secs
lola: 41861228 markings, 325094306 edges, 59713 markings/sec, 545 secs
lola: 42155390 markings, 327818707 edges, 58832 markings/sec, 550 secs
lola: 42480812 markings, 330600181 edges, 65084 markings/sec, 555 secs
lola: 42756198 markings, 333235348 edges, 55077 markings/sec, 560 secs
lola: 43051249 markings, 335719091 edges, 59010 markings/sec, 565 secs
lola: 43304349 markings, 338395203 edges, 50620 markings/sec, 570 secs
lola: 43561791 markings, 340995762 edges, 51488 markings/sec, 575 secs
lola: 43989209 markings, 344048452 edges, 85484 markings/sec, 580 secs
lola: 44350001 markings, 346826981 edges, 72158 markings/sec, 585 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 1494771157527

--------------------
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="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/QuasiCertifProtocol-PT-10.tgz
mv 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 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 r058-smll-149440926300255"
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 ;