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-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-149479231800246
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496381844531


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


checking for too many tokens
===========================================================================================
S_QuasiCertifProtocol-PT-02: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_QuasiCertifProtocol-PT-02 @ 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: 142/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 86 places, 56 transitions, 55 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 71 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: A (F (A (G ((3 <= AstopOK))))) : A (F ((3 <= a3))) : NOT(A (F (E (G (TRUE))))) : A (G (TRUE)) : E ((E (F ((1 <= n5_0 + n5_1 + n5_2))) U ((1 <= n2_0 + n2_1 + n2_2) AND (n6_0 + n6_1 + n6_2 <= n4_0 + n4_1 + n4_2) AND (s4_0 + s4_1 + s4_2 + 1 <= n5_0 + n5_1 + n5_2)))) : NOT(E (F (A (G ((3 <= a3)))))) : (NOT((E (F ((n4_0 + n4_1 + n4_2 <= a5))) AND A (F ((2 <= SstopAbort))))) OR (1 <= s5_0 + s5_1 + s5_2)) : A (G (A (F ((CstopOK_2 + CstopOK_1 + CstopOK_0 <= SstopOK_0 + SstopOK_1 + SstopOK_2))))) : ((((n5_0 + n5_1 + n5_2 + 1 <= n8_0_0 + n8_0_1 + n8_0_2 + n8_1_0 + n8_2_0 + n8_2_2 + n8_2_1 + n8_1_2 + n8_1_1) AND (Cstart_0 + Cstart_1 + Cstart_2 + 1 <= a5)) AND (((Sstart_2 + Sstart_1 + Sstart_0 + 1 <= a5) OR (a5 + 1 <= CstopOK_2 + CstopOK_1 + CstopOK_0)) OR A (F ((n5_0 + n5_1 + n5_2 <= n6_0 + n6_1 + n6_2))))) OR E ((((CstopAbort <= SstopOK_0 + SstopOK_1 + SstopOK_2) OR (n6_0 + n6_1 + n6_2 <= n9_0_0 + n9_0_1 + n9_0_2 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_2 + n9_1_1 + n9_1_0)) U (Cstart_0 + Cstart_1 + Cstart_2 + 1 <= n1_0 + n1_1 + n1_2)))) : A ((((3 <= a2) AND (n5_0 + n5_1 + n5_2 <= n2_0 + n2_1 + n2_2) AND (CstopAbort + 1 <= s4_0 + s4_1 + s4_2)) U A (F ((2 <= CstopAbort))))) : E (X (A (((n6_0 + n6_1 + n6_2 <= a5) U (3 <= CstopAbort))))) : (E (G ((a1 <= 1))) AND (A (F ((3 <= a2))) OR (((n2_0 + n2_1 + n2_2 <= a3) AND (1 <= CstopAbort)) OR (Astart + 1 <= a3) OR ((s4_0 + s4_1 + s4_2 + 1 <= n1_0 + n1_1 + n1_2) AND (Cstart_0 + Cstart_1 + Cstart_2 + 1 <= n4_0 + n4_1 + n4_2))))) : E (G (((a5 <= s5_0 + s5_1 + s5_2) OR (1 <= n8_0_0 + n8_0_1 + n8_0_2 + n8_1_0 + n8_2_0 + n8_2_2 + n8_2_1 + n8_1_2 + n8_1_1) OR (SstopAbort <= 2) OR (n6_0 + n6_1 + n6_2 + 1 <= n4_0 + n4_1 + n4_2)))) : A (G (A (F (((2 <= n2_0 + n2_1 + n2_2) OR (3 <= AstopAbort)))))) : A ((((CstopOK_2 + CstopOK_1 + CstopOK_0 + 1 <= n9_0_0 + n9_0_1 + n9_0_2 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_2 + n9_1_1 + n9_1_0) AND (n6_0 + n6_1 + n6_2 <= 2)) U E (G ((n6_0 + n6_1 + n6_2 <= n8_0_0 + n8_0_1 + n8_0_2 + n8_1_0 + n8_2_0 + n8_2_2 + n8_2_1 + n8_1_2 + n8_1_1))))) : E (G ((((a4 <= a3) OR ((Astart <= SstopAbort) AND (2 <= s6_0 + s6_1 + s6_2))) OR E (F ((1 <= s3_1 + s3_0 + s3_2))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((3 <= AstopOK)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (AstopOK <= 2))))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= a3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (3 <= a3))
lola: processed formula length: 19
lola: 1 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (E (G (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 6 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: processed formula with 0 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((1 <= n5_0 + n5_1 + n5_2))) U ((1 <= n2_0 + n2_1 + n2_2) AND (n6_0 + n6_1 + n6_2 <= n4_0 + n4_1 + n4_2) AND (s4_0 + s4_1 + s4_2 + 1 <= n5_0 + n5_1 + n5_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (1 <= n5_0 + n5_1 + n5_2)) U ((1 <= n2_0 + n2_1 + n2_2) AND (n6_0 + n6_1 + n6_2 <= n4_0 + n4_1 + n4_2) AND (s4_0 + s4_1 + s4_2 + 1 <= n5_0 + n5_1 + n5_2)))
lola: processed formula length: 166
lola: 2 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (G ((3 <= a3))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (a3 <= 2)))))
lola: processed formula length: 39
lola: 7 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (F ((n4_0 + n4_1 + n4_2 <= a5))) AND A (F ((2 <= SstopAbort))))) OR (1 <= s5_0 + s5_1 + s5_2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((a5 + 1 <= n4_0 + n4_1 + n4_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((SstopAbort <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= SstopAbort)))
lola: processed formula length: 32
lola: 10 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((CstopOK_2 + CstopOK_1 + CstopOK_0 <= SstopOK_0 + SstopOK_1 + SstopOK_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (CstopOK_2 + CstopOK_1 + CstopOK_0 <= SstopOK_0 + SstopOK_1 + SstopOK_2)))))
lola: processed formula length: 102
lola: 2 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((n5_0 + n5_1 + n5_2 + 1 <= n8_0_0 + n8_0_1 + n8_0_2 + n8_1_0 + n8_2_0 + n8_2_2 + n8_2_1 + n8_1_2 + n8_1_1) AND (Cstart_0 + Cstart_1 + Cstart_2 + 1 <= a5)) AND (((Sstart_2 + Sstart_1 + Sstart_0 + 1 <= a5) OR (a5 + 1 <= CstopOK_2 + CstopOK_1 + CstopOK_0)) OR A (F ((n5_0 + n5_1 + n5_2 <= n6_0 + n6_1 + n6_2))))) OR E ((((CstopAbort <= SstopOK_0 + SstopOK_1 + SstopOK_2) OR (n6_0 + n6_1 + n6_2 <= n... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((n5_0 + n5_1 + n5_2 + 1 <= n8_0_0 + n8_0_1 + n8_0_2 + n8_1_0 + n8_2_0 + n8_2_2 + n8_2_1 + n8_1_2 + n8_1_1) AND (Cstart_0 + Cstart_1 + Cstart_2 + 1 <= a5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((n5_0 + n5_1 + n5_2 + 1 <= n8_0_0 + n8_0_1 + n8_0_2 + n8_1_0 + n8_2_0 + n8_2_2 + n8_2_1 + n8_1_2 + n8_1_1) AND (Cstart_0 + Cstart_1 + Cstart_2 + 1 <= a5))
lola: processed formula length: 155
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((CstopAbort <= SstopOK_0 + SstopOK_1 + SstopOK_2) OR (n6_0 + n6_1 + n6_2 <= n9_0_0 + n9_0_1 + n9_0_2 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_2 + n9_1_1 + n9_1_0)) U (Cstart_0 + Cstart_1 + Cstart_2 + 1 <= n1_0 + n1_1 + n1_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((CstopAbort <= SstopOK_0 + SstopOK_1 + SstopOK_2) OR (n6_0 + n6_1 + n6_2 <= n9_0_0 + n9_0_1 + n9_0_2 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_2 + n9_1_1 + n9_1_0)) U (Cstart_0 + Cstart_1 + Cstart_2 + 1 <= n1_0 + n1_1 + n1_2))
lola: processed formula length: 222
lola: 1 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: lola: ========================================The Boolean predicate is false.

lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= a2) AND (n5_0 + n5_1 + n5_2 <= n2_0 + n2_1 + n2_2) AND (CstopAbort + 1 <= s4_0 + s4_1 + s4_2)) U A (F ((2 <= CstopAbort)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((3 <= a2) AND (n5_0 + n5_1 + n5_2 <= n2_0 + n2_1 + n2_2) AND (CstopAbort + 1 <= s4_0 + s4_1 + s4_2)) U A(TRUE U (2 <= CstopAbort)))
lola: processed formula length: 134
lola: 2 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (((n6_0 + n6_1 + n6_2 <= a5) U (3 <= CstopAbort)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A((n6_0 + n6_1 + n6_2 <= a5) U (3 <= CstopAbort)))
lola: processed formula length: 53
lola: 2 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((a1 <= 1))) AND (A (F ((3 <= a2))) OR (((n2_0 + n2_1 + n2_2 <= a3) AND (1 <= CstopAbort)) OR (Astart + 1 <= a3) OR ((s4_0 + s4_1 + s4_2 + 1 <= n1_0 + n1_1 + n1_2) AND (Cstart_0 + Cstart_1 + Cstart_2 + 1 <= n4_0 + n4_1 + n4_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((a1 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= a1)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= a2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (3 <= a2))
lola: processed formula length: 19
lola: 1 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((n2_0 + n2_1 + n2_2 <= a3) AND (1 <= CstopAbort)) OR (Astart + 1 <= a3) OR ((s4_0 + s4_1 + s4_2 + 1 <= n1_0 + n1_1 + n1_2) AND (Cstart_0 + Cstart_1 + Cstart_2 + 1 <= n4_0 + n4_1 + n4_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((n2_0 + n2_1 + n2_2 <= a3) AND (1 <= CstopAbort)) OR (Astart + 1 <= a3) OR ((s4_0 + s4_1 + s4_2 + 1 <= n1_0 + n1_1 + n1_2) AND (Cstart_0 + Cstart_1 + Cstart_2 + 1 <= n4_0 + n4_1 + n4_2)))
lola: processed formula length: 191
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: processed formula with 5 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((a5 <= s5_0 + s5_1 + s5_2) OR (1 <= n8_0_0 + n8_0_1 + n8_0_2 + n8_1_0 + n8_2_0 + n8_2_2 + n8_2_1 + n8_1_2 + n8_1_1) OR (SstopAbort <= 2) OR (n6_0 + n6_1 + n6_2 + 1 <= n4_0 + n4_1 + n4_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((s5_0 + s5_1 + s5_2 + 1 <= a5) AND (n8_0_0 + n8_0_1 + n8_0_2 + n8_1_0 + n8_2_0 + n8_2_2 + n8_2_1 + n8_1_2 + n8_1_1 <= 0) AND (3 <= SstopAbort) AND (n4_0 + n4_1 + n4_2 <= n6_0 + n6_1 + n6_2))))
lola: processed formula length: 206
lola: 2 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((2 <= n2_0 + n2_1 + n2_2) OR (3 <= AstopAbort))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((2 <= n2_0 + n2_1 + n2_2) OR (3 <= AstopAbort))))))
lola: processed formula length: 79
lola: 2 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((CstopOK_2 + CstopOK_1 + CstopOK_0 + 1 <= n9_0_0 + n9_0_1 + n9_0_2 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_2 + n9_1_1 + n9_1_0) AND (n6_0 + n6_1 + n6_2 <= 2)) U E (G ((n6_0 + n6_1 + n6_2 <= n8_0_0 + n8_0_1 + n8_0_2 + n8_1_0 + n8_2_0 + n8_2_2 + n8_2_1 + n8_1_2 + n8_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((CstopOK_2 + CstopOK_1 + CstopOK_0 + 1 <= n9_0_0 + n9_0_1 + n9_0_2 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_2 + n9_1_1 + n9_1_0) AND (n6_0 + n6_1 + n6_2 <= 2)) U NOT(A(TRUE U (n8_0_0 + n8_0_1 + n8_0_2 + n8_1_0 + n8_2_0 + n8_2_2 + n8_2_1 + n8_1_2 + n8_1_1 + 1 <= n6_0 + n6_1 + n6_2))))
lola: processed formula length: 280
lola: 3 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((a4 <= a3) OR ((Astart <= SstopAbort) AND (2 <= s6_0 + s6_1 + s6_2))) OR E (F ((1 <= s3_1 + s3_0 + s3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((a3 + 1 <= a4) AND ((SstopAbort + 1 <= Astart) OR (s6_0 + s6_1 + s6_2 <= 1))) AND NOT(E(TRUE U (1 <= s3_1 + s3_0 + s3_2))))))
lola: processed formula length: 141
lola: 4 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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: RESULT
lola:
SUMMARY: no no no yes no yes yes yes no no no no yes no yes yes
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496381844758

--------------------
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-02"
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-02.tgz
mv S_QuasiCertifProtocol-PT-02 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-02, 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-149479231800246"
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 ;