Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.............................................
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 5.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 153K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is QuasiCertifProtocol-PT-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578700066
=====================================================================

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526923973872

info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-PT-06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-PT-06 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ QuasiCertifProtocol-PT-06 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 386/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8640
lola: finding significant places
lola: 270 places, 116 transitions, 115 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 151 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-06-CTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= a2)
lola: LP says that atomic proposition is always false: (3 <= a3)
lola: LP says that atomic proposition is always false: (2 <= a2)
lola: LP says that atomic proposition is always false: (2 <= Astart)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= n3_1)
lola: LP says that atomic proposition is always false: (2 <= n9_2_4)
lola: LP says that atomic proposition is always false: (2 <= n8_2_5)
lola: LP says that atomic proposition is always false: (3 <= n7_2_0)
lola: LP says that atomic proposition is always false: (3 <= n7_1_0)
lola: LP says that atomic proposition is always false: (3 <= n7_6_0)
lola: LP says that atomic proposition is always false: (3 <= a5)
lola: LP says that atomic proposition is always false: (2 <= n9_1_4)
lola: LP says that atomic proposition is always false: (2 <= n8_6_1)
lola: LP says that atomic proposition is always false: (3 <= n9_6_6)
lola: LP says that atomic proposition is always false: (2 <= n7_2_1)
lola: NOT(E (G (E (F ((AstopOK <= SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6)))))) : ((E (F (((AstopAbort <= malicious_reservoir) AND (2 <= n8_0_0 + n8_1_0 + n8_2_0 + n8_3_0 + n8_4_0 + n8_5_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_2_6 + n8_2_5 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_6 + n8_1_5 + n8_1_4 + n8_1_3 + n8_1_2 + n8_1_1 + n8_0_6 + n8_0_5 + n8_0_4 + n8_0_3 + n8_0_2 + n8_0_1)))) OR E (G (((CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0 <= Astart) OR (3 <= n1_6 + n1_5 + n1_4 + n1_3 + n1_2 + n1_1 + n1_0))))) OR (3 <= n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0)) : A ((E (G ((3 <= Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6))) U E (G (FALSE)))) : A (F (A (X (((1 <= CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0)))))) : E (F ((s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + 1 <= AstopOK))) : A (G (((((CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0 <= n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6))) AND A (F ((1 <= n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6)))))) : ((((n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + 1 <= CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0) OR (s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 <= 2)) AND (SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 <= 2) AND ((s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 <= SstopAbort) OR (1 <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6))) AND E (F (A (F ((1 <= CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0)))))) : A (F ((A (G (TRUE)) AND ((n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 <= 1) AND (s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + 1 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6))))) : E (((c1_5 <= n1_0) U ((n3_1 + 1 <= n7_5_4) OR (Sstart_4 + 1 <= n9_5_0)))) : (E (F ((((1 <= n8_5_4)) AND (s2_5 <= s4_5)))) OR FALSE) : A (G ((((n5_2 <= s4_3) OR (n9_6_4 <= n8_5_5)) AND ((n9_3_0 <= s5_2) OR (n8_0_4 <= s2_0)) AND ((n6_4 + 1 <= n9_5_2) OR (SstopOK_1 <= 0))))) : (A (X (())) AND (() AND E (F (())))) : E (G ((A (F ((n8_4_6 <= n2_0))) AND ((1 <= n8_5_2) OR ((n8_0_1 <= s5_4) AND (n6_1 <= n9_1_1)))))) : E ((((1 <= n6_2) AND (SstopOK_2 <= n9_5_1) AND ((n7_4_4 <= n9_0_2))) U E (F (FALSE)))) : (FALSE OR E ((TRUE U ((SstopOK_5 <= n7_2_0) AND (1 <= n7_0_5))))) : E (F (E (((n7_0_0 <= a4) U FALSE))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 41 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 41 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 41 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 41 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: 0 markings, 0 edges
lola:
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((1 <= CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U AX(((1 <= CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0))))
lola: processed formula length: 104
lola: 43 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 480308 markings, 2591921 edges, 96062 markings/sec, 0 secs
lola: 820681 markings, 5036022 edges, 68075 markings/sec, 5 secs
lola: 1206935 markings, 7570851 edges, 77251 markings/sec, 10 secs
lola: 1581289 markings, 10077391 edges, 74871 markings/sec, 15 secs
lola: 1905836 markings, 12608686 edges, 64909 markings/sec, 20 secs
lola: 2161437 markings, 15015424 edges, 51120 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2267330 markings, 15981372 edges

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((SstopOK_5 <= n7_2_0) AND (1 <= n7_0_5))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((SstopOK_5 <= n7_2_0) AND (1 <= n7_0_5))))
lola: processed formula length: 49
lola: 42 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= n8_5_4)) AND (s2_5 <= s4_5))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((1 <= n8_5_4)) AND (s2_5 <= s4_5))))
lola: processed formula length: 44
lola: 42 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((1 <= n8_5_4)) AND (s2_5 <= s4_5))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8295 markings, 23652 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + 1 <= AstopOK)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + 1 <= AstopOK)))
lola: processed formula length: 71
lola: 42 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + 1 <= AstopOK)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-06-CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((n5_2 <= s4_3) OR (n9_6_4 <= n8_5_5)) AND ((n9_3_0 <= s5_2) OR (n8_0_4 <= s2_0)) AND ((n6_4 + 1 <= n9_5_2) OR (SstopOK_1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((n5_2 <= s4_3) OR (n9_6_4 <= n8_5_5)) AND ((n9_3_0 <= s5_2) OR (n8_0_4 <= s2_0)) AND ((n6_4 + 1 <= n9_5_2) OR (SstopOK_1 <= 0)))))
lola: processed formula length: 141
lola: 43 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((s4_3 + 1 <= n5_2) AND (n8_5_5 + 1 <= n9_6_4)) OR ((s5_2 + 1 <= n9_3_0) AND (s2_0 + 1 <= n8_0_4)) OR ((n9_5_2 <= n6_4) AND (1 <= SstopOK_1)))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file QuasiCertifProtocol-PT-06-CTLCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 <= 1) AND (s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + 1 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((2 <= n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0) OR (s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 <= s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0))
lola: processed formula length: 158
lola: 43 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((n8_4_6 <= n2_0))) AND ((1 <= n8_5_2) OR ((n8_0_1 <= s5_4) AND (n6_1 <= n9_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U (n8_4_6 <= n2_0))) OR ((n8_5_2 <= 0) AND ((s5_4 + 1 <= n8_0_1) OR (n9_1_1 + 1 <= n6_1))))))
lola: processed formula length: 119
lola: 45 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 10 markings, 19 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((c1_5 <= n1_0) U ((n3_1 + 1 <= n7_5_4) OR (Sstart_4 + 1 <= n9_5_0))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((c1_5 <= n1_0) U ((n3_1 + 1 <= n7_5_4) OR (Sstart_4 + 1 <= n9_5_0))))
lola: processed formula length: 74
lola: 44 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((n3_1 + 1 <= n7_5_4) OR (Sstart_4 + 1 <= n9_5_0))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-06-CTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 33141 markings, 161747 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + 1 <= AstopOK)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (AstopOK <= SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6)
lola: processed formula length: 94
lola: 43 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + 1 <= CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0) OR (s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 <= 2)) AND (SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 <= 2) AND ((s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 <= SstopAbort) OR (1 <= s4_0 + s4_1 + s4_2 + s4_3 + s... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((1 <= CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0)))
lola: processed formula length: 96
lola: 42 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (1 <= CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-CTLCardinality-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: lola: state equation: calling and running sara
produced by: state space
lola: The predicate is reachable.
lola: 56 markings, 55 edges
lola: ========================================
sara: try reading problem file QuasiCertifProtocol-PT-06-CTLCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: subprocess 14 will run for 1767 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + 1 <= CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0) OR (s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 <= 2)) AND (SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 <= 2) AND ((s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 <= SstopAbort) OR (1 <= s4_0 + s4_1 + s4_2 + s4_3 + s4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + 1 <= CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0) OR (s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 <= 2)) AND (SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 <= 2) AND ((s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 <= SstopAbort) OR (1 <= s4_0 + s4_1 + s4_2 + s4_3 + s4... (shortened)
lola: processed formula length: 419
lola: 41 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-CTLCardinality.task
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 14 will run for 1767 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0 <= n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6))))) AND A (G (A (F ((1 <= n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1767 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0 <= n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0 <= n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6)))))
lola: processed formula length: 145
lola: 43 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + 1 <= CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0)))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-CTLCardinality-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 57 markings, 56 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3534 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((AstopAbort <= malicious_reservoir) AND (2 <= n8_0_0 + n8_1_0 + n8_2_0 + n8_3_0 + n8_4_0 + n8_5_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_2_6 + n8_2_5 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_6 + n8_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3534 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((AstopAbort <= malicious_reservoir) AND (2 <= n8_0_0 + n8_1_0 + n8_2_0 + n8_3_0 + n8_4_0 + n8_5_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_2_6 + n8_2_5 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_6 + n8_1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((AstopAbort <= malicious_reservoir) AND (2 <= n8_0_0 + n8_1_0 + n8_2_0 + n8_3_0 + n8_4_0 + n8_5_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_2_6 + n8_2_5 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_6 + n8_1_... (shortened)
lola: processed formula length: 495
lola: 42 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((AstopAbort <= malicious_reservoir) AND (2 <= n8_0_0 + n8_1_0 + n8_2_0 + n8_3_0 + n8_4_0 + n8_5_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_2_6 + n8_2_5 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_6 + n8_1_5 + n8_1_4 + n8_1_3 + n8_1_2 + n8_1_1 + n8_0_6 + n8_0_5 + n8_0_4 + n8_0_3 + n8_0_2 + n8_0_1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-CTLCardinality-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35 markings, 34 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no yes yes no yes no yes yes no no yes no yes no
lola:
preliminary result: no yes no yes yes no yes no yes yes no no yes no yes no
lola: memory consumption: 26824 KB
lola: time consumption: 35 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from 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-06"
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-06.tgz
mv QuasiCertifProtocol-PT-06 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is QuasiCertifProtocol-PT-06, 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 r136-qhx2-152673578700066"
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 ;