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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578700068
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526924029815

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 ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ 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-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (2 <= a1)
lola: LP says that atomic proposition is always false: (2 <= a3)
lola: LP says that atomic proposition is always false: (2 <= n7_1_0)
lola: LP says that atomic proposition is always false: (3 <= n9_0_3)
lola: LP says that atomic proposition is always false: (3 <= n6_4)
lola: LP says that atomic proposition is always false: (2 <= n1_5)
lola: LP says that atomic proposition is always false: (2 <= n7_5_0)
lola: LP says that atomic proposition is always false: (3 <= n9_0_4)
lola: LP says that atomic proposition is always false: (3 <= c1_4)
lola: LP says that atomic proposition is always false: (3 <= n9_0_2)
lola: LP says that atomic proposition is always false: (2 <= n8_1_1)
lola: LP says that atomic proposition is always false: (2 <= n7_6_5)
lola: LP says that atomic proposition is always false: (3 <= n7_2_6)
lola: LP says that atomic proposition is always false: (3 <= n3_2)
lola: A (G (((2 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6) OR (SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 <= n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6) OR (s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_6 + 1 <= n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6) OR ((2 <= c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0) AND (n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 <= n1_6 + n1_5 + n1_4 + n1_3 + n1_2 + n1_1 + n1_0)) OR (AstopOK <= SstopAbort)))) : A (G (((AstopOK <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6) AND (((n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6 <= n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_1_3 + n9_1_4 + n9_1_5 + n9_1_6 + n9_2_0 + n9_2_1 + n9_2_2 + n9_2_3 + n9_2_4 + n9_2_5 + n9_2_6 + n9_1_2 + n9_3_0 + n9_3_1 + n9_3_2 + n9_3_3 + n9_3_4 + n9_3_5 + n9_3_6 + n9_4_0 + n9_4_1 + n9_4_2 + n9_4_3 + n9_4_4 + n9_4_5 + n9_4_6 + n9_1_1 + n9_1_0 + n9_5_0 + n9_5_1 + n9_5_2 + n9_5_3 + n9_5_4 + n9_5_5 + n9_5_6 + n9_6_0 + n9_6_1 + n9_6_2 + n9_6_3 + n9_6_4 + n9_6_5 + n9_6_6) AND (AstopOK <= n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6)) OR ((2 <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6) AND (2 <= s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_6)))))) : E (F ((((n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + 1 <= Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0) OR (1 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6)) AND (1 <= n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6)))) : A (G (((malicious_reservoir + 1 <= a5) OR (s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 <= 0) OR ((a3 + 1 <= n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0) AND (AstopOK + 1 <= SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6))))) : E (F (((Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= 0) AND (AstopAbort + 1 <= n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6) AND (((3 <= n1_6 + n1_5 + n1_4 + n1_3 + n1_2 + n1_1 + n1_0) AND (malicious_reservoir <= a3)) OR ((3 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6) AND (2 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6)))))) : E (F ((n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6 + 1 <= n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6))) : A (G ((a5 <= c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0))) : E (F (())) : A (G (((n9_1_2 <= n8_1_5)))) : A (G (())) : E (F (())) : A (G ((((n7_0_2 <= n8_1_2)) AND (n7_6_1 <= n3_3)))) : E (F (())) : A (G ((n7_4_1 <= n8_3_4))) : E (F (((n8_1_3 + 1 <= s4_1)))) : E (F (FALSE))
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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: 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: 15 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-ReachabilityCardinality.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-ReachabilityCardinality-7 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 15 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-ReachabilityCardinality.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: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-9 TRUE 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: 15 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-ReachabilityCardinality.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-ReachabilityCardinality-10 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: 15 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-ReachabilityCardinality.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-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 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: 15 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-ReachabilityCardinality.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-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((n7_4_1 <= n8_3_4)))
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 ((n7_4_1 <= n8_3_4)))
lola: processed formula length: 26
lola: 17 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-ReachabilityCardinality.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: (n8_3_4 + 1 <= n7_4_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityCardinality-5-0.sara
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((n8_1_3 + 1 <= s4_1))))
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 (((n8_1_3 + 1 <= s4_1))))
lola: processed formula length: 30
lola: 16 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-ReachabilityCardinality.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: ((n8_1_3 + 1 <= s4_1))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((n9_1_2 <= n8_1_5))))
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 (((n9_1_2 <= n8_1_5))))
lola: processed formula length: 28
lola: 17 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-ReachabilityCardinality.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: ((n8_1_5 + 1 <= n9_1_2))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityCardinality-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 43 markings, 42 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((n7_0_2 <= n8_1_2)) AND (n7_6_1 <= n3_3))))
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 ((((n7_0_2 <= n8_1_2)) AND (n7_6_1 <= n3_3))))
lola: processed formula length: 51
lola: 17 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-ReachabilityCardinality.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: (((n8_1_2 + 1 <= n7_0_2)) OR (n3_3 + 1 <= n7_6_1))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityCardinality-8-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((a5 <= c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_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 ((a5 <= c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0)))
lola: processed formula length: 62
lola: 17 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-ReachabilityCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: formula 0: (c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + 1 <= a5)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((malicious_reservoir + 1 <= a5) OR (s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 <= 0) OR ((a3 + 1 <= n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0) AND (AstopOK + 1 <= SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_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 (((malicious_reservoir + 1 <= a5) OR (s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 <= 0) OR ((a3 + 1 <= n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0) AND (AstopOK + 1 <= SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6)))))
lola: processed formula length: 267
lola: 17 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-ReachabilityCardinality.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: ((a5 <= malicious_reservoir) AND (1 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6) AND ((n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 <= a3) OR (SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 <= AstopOK)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 42 markings, 41 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= 0) AND (AstopAbort + 1 <= n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6) AND (((3 <= n1_6 + n1_5 + n1_4 + n1_3 + n1_2 + n1_1 + n1_0) AND (malicious_reservoir <= a3)) OR ((3 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6) AND (2 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6))))))
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 (((Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= 0) AND (AstopAbort + 1 <= n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6) AND (((3 <= n1_6 + n1_5 + n1_4 + n1_3 + n1_2 + n1_1 + n1_0) AND (malicious_reservoir <= a3)) OR ((3 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6) AND (2 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6))))))
lola: processed formula length: 374
lola: 16 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-ReachabilityCardinality.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: ((Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= 0) AND (AstopAbort + 1 <= n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6) AND (((3 <= n1_6 + n1_5 + n1_4 + n1_3 + n1_2 + n1_1 + n1_0) AND (malicious_reservoir <= a3)) OR ((3 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6) AND (2 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6))))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityCardinality-11-0.sara
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_5_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 ((n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_5_1... (shortened)
lola: processed formula length: 502
lola: 16 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-ReachabilityCardinality.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: (n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6 + 1 <= n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityCardinality-12-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: 21 markings, 20 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6) OR (SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 <= n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6) OR (s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_6 + 1 <= n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6) OR ((2 <= c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0) AND (n4_0 + n4_1 + n4_2 + n4_3 + n4... (shortened)
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 (((2 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6) OR (SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 <= n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6) OR (s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_6 + 1 <= n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6) OR ((2 <= c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0) AND (n4_0 + n4_1 + n4_2 + n4_3 + n4... (shortened)
lola: processed formula length: 499
lola: 17 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-ReachabilityCardinality.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: ((s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 <= 1) AND (n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + 1 <= SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6) AND (n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 <= s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_6) AND ((c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 <= 1) OR (n1_6 + n1_5 + n1_4 + n1_3 + n1_2 + n1_1 + n1_0 + 1 <= n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6)) AND (SstopAbort + 1 <= AstopOK))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityCardinality-13-0.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: 62 markings, 61 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + 1 <= Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0) OR (1 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6)) AND (1 <= n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_... (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 ((((n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + 1 <= Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0) OR (1 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6)) AND (1 <= n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_... (shortened)
lola: processed formula length: 650
lola: 16 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-ReachabilityCardinality.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: (((n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + 1 <= Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0) OR (1 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6)) AND (1 <= n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-06-ReachabilityCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 157185 markings, 558765 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((AstopOK <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6) AND (((n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7... (shortened)
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 (((AstopOK <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6) AND (((n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7... (shortened)
lola: processed formula length: 1142
lola: 17 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-ReachabilityCardinality.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_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + 1 <= AstopOK) OR (((n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_1_3 + n9_1_4 + n9_1_5 + n9_1_6 + n9_2_0 + n9_2_1 + n9_2_2 + n9_2_3 + n9_2_4 + n9_2_5 + n9_2_6 + n9_1_2 + n9_3_0 + n9_3_1 + n9_3_2 + n9_3_3 + n9_3_4 + n9_3_5 + n9_3_6 + n9_4_0 + n9_4_1 + n9_4_2 + n9_4_3 + n9_4_4 + n9_4_5 + n9_4_6 + n9_1_1 + n9_1_0 + n9_5_0 + n9_5_1 + n9_5_2 + n9_5_3 + n9_5_4 + n9_5_5 + n9_5_6 + n9_6_0 + n9_6_1 + n9_6_2 + n9_6_3 + n9_6_4 + n9_6_5 + n9_6_6 + 1 <= n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6) OR (n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + 1 <= AstopOK)) AND ((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 <= 1) OR (s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_6 <= 1))))
lola: state equation: Generated DNF with 9 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-ReachabilityCardinality-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 28 markings, 27 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no yes yes no no no yes no no no no yes no
lola:
preliminary result: no no no no yes yes no no no yes no no no no yes no
lola: memory consumption: 25212 KB
lola: time consumption: 8 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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-152673578700068"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;