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 180K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.5K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Referendum-COL-0010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578900206
=====================================================================

--------------------
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 Referendum-COL-0010-CTLCardinality-00
FORMULA_NAME Referendum-COL-0010-CTLCardinality-01
FORMULA_NAME Referendum-COL-0010-CTLCardinality-02
FORMULA_NAME Referendum-COL-0010-CTLCardinality-03
FORMULA_NAME Referendum-COL-0010-CTLCardinality-04
FORMULA_NAME Referendum-COL-0010-CTLCardinality-05
FORMULA_NAME Referendum-COL-0010-CTLCardinality-06
FORMULA_NAME Referendum-COL-0010-CTLCardinality-07
FORMULA_NAME Referendum-COL-0010-CTLCardinality-08
FORMULA_NAME Referendum-COL-0010-CTLCardinality-09
FORMULA_NAME Referendum-COL-0010-CTLCardinality-10
FORMULA_NAME Referendum-COL-0010-CTLCardinality-11
FORMULA_NAME Referendum-COL-0010-CTLCardinality-12
FORMULA_NAME Referendum-COL-0010-CTLCardinality-13
FORMULA_NAME Referendum-COL-0010-CTLCardinality-14
FORMULA_NAME Referendum-COL-0010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526972252128

info: Time: 3600 - MCC
===========================================================================================
prep: translating Referendum-COL-0010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Referendum-COL-0010 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ Referendum-COL-0010 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 52/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 31
lola: finding significant places
lola: 31 places, 21 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 13 transition conflict sets
lola: TASK
lola: reading formula from Referendum-COL-0010-CTLCardinality.task
lola: always true
lola: LP says that atomic proposition is always false: (2 <= p0)
lola: always true
lola: always true
lola: always true
lola: LP says that atomic proposition is always false: (3 <= p0)
lola: LP says that atomic proposition is always false: (2 <= p0)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= p0)
lola: always true
lola: always true
lola: always true
lola: LP says that atomic proposition is always false: (3 <= p0)
lola: E (X ((((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) OR (p0 <= 0)) AND E (G ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))))) : E (G (E (((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p0) U (1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))))) : E (F (())) : E (G (E (X (((2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) OR (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))))) : (A (G (((1 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (1 <= p0) OR (2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))) OR E (G ((((2 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))))) : NOT(E (F (E (G ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))))) : E (F (())) : E (G (((p0 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) OR (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p0)))) : NOT((E (((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p0) U (3 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))) AND NOT(A (G (TRUE))))) : E (G (A (F (((p0 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) AND (3 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))))) : E (F (E ((FALSE U FALSE)))) : E (G (((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + 1 <= p0) OR (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + 1 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + 1 <= p0)))) : (NOT(E (G ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 1)))) OR ((((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) AND ((2 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (2 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))) AND (p0 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))) : E (F (((p0 + 1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) AND (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= 0) AND (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p0)))) : (((((1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) OR (3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)) AND A (F ((3 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))) OR A (G (()))) OR A (G ((((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)) AND ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p0) OR (1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))))) : A (G (E (F ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))))
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:279
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
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: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:123
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 31 rewrites
lola: closed formula file Referendum-COL-0010-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 Referendum-COL-0010-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 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: 31 rewrites
lola: closed formula file Referendum-COL-0010-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 Referendum-COL-0010-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 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: 31 rewrites
lola: closed formula file Referendum-COL-0010-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: 0 markings, 0 edges
lola: ========================================

FORMULA Referendum-COL-0010-CTLCardinality-8 TRUE 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: 31 rewrites
lola: closed formula file Referendum-COL-0010-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 Referendum-COL-0010-CTLCardinality-10 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 31 rewrites
lola: closed formula file Referendum-COL-0010-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: 0 markings, 0 edges
lola: ========================================

FORMULA Referendum-COL-0010-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) OR (p0 <= 0)) AND E (G ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX((((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) OR (p0 <= 0)) AND NOT(A(TRUE U (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))))
lola: processed formula length: 272
lola: 34 rewrites
lola: closed formula file Referendum-COL-0010-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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 47591 markings, 271576 edges
lola: ========================================

FORMULA Referendum-COL-0010-CTLCardinality-0 TRUE 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 (G (E (X (((2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) OR (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(EX(((2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) OR (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))))
lola: processed formula length: 197
lola: 33 rewrites
lola: closed formula file Referendum-COL-0010-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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 58082 markings, 383621 edges
lola: ========================================

FORMULA Referendum-COL-0010-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p0 + 1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) AND (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= 0) AND (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p0))))
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 (((p0 + 1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) AND (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= 0) AND (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p0))))
lola: processed formula length: 218
lola: 32 rewrites
lola: closed formula file Referendum-COL-0010-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: ((p0 + 1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) AND (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= 0) AND (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p0))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Referendum-COL-0010-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 6145 markings, 10241 edges

FORMULA Referendum-COL-0010-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)
lola: processed formula length: 111
lola: 33 rewrites
lola: closed formula file Referendum-COL-0010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--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 /EFEG
lola: The predicate does not eventually occur from all states.
lola: 12 markings, 11 edges
lola: ========================================

FORMULA Referendum-COL-0010-CTLCardinality-5 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 (E (F ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)
lola: processed formula length: 115
lola: 32 rewrites
lola: closed formula file Referendum-COL-0010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 223 markings, 676 edges
lola: ========================================

FORMULA Referendum-COL-0010-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p0 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) OR (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p0 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) OR (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p0))))
lola: processed formula length: 145
lola: 31 rewrites
lola: closed formula file Referendum-COL-0010-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: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 12 markings, 11 edges
lola: ========================================

FORMULA Referendum-COL-0010-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + 1 <= p0) OR (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + 1 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + 1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + 1 <= p0) OR (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + 1 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + 1 <= p0))))
lola: processed formula length: 273
lola: 31 rewrites
lola: closed formula file Referendum-COL-0010-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 is not possibly preserved.
lola: 25049 markings, 136371 edges
lola: ========================================

FORMULA Referendum-COL-0010-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((p0 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) AND (3 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U ((p0 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) AND (3 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))))))
lola: processed formula length: 157
lola: 33 rewrites
lola: closed formula file Referendum-COL-0010-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 12 markings, 12 edges
lola: ========================================

FORMULA Referendum-COL-0010-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p0) U (1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(E((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p0) U (1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))))
lola: processed formula length: 146
lola: 33 rewrites
lola: closed formula file Referendum-COL-0010-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: 21 markings, 52 edges
lola: ========================================

FORMULA Referendum-COL-0010-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (1 <= p0) OR (2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))) OR E (G ((((2 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((2 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((((2 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))))
lola: processed formula length: 136
lola: 31 rewrites
lola: closed formula file Referendum-COL-0010-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 is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (1 <= p0) OR (2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))
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 (((1 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (1 <= p0) OR (2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))
lola: processed formula length: 148
lola: 33 rewrites
lola: closed formula file Referendum-COL-0010-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: ((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= 0) AND (p0 <= 0) AND (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= 1))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Referendum-COL-0010-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((2 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))) OR ((((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) AND ((2 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (2 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))) AND (p0 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 1)
lola: processed formula length: 64
lola: 33 rewrites
lola: closed formula file Referendum-COL-0010-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: 12 markings, 11 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F ((2 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))) OR ((((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) AND ((2 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (2 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))) AND (p0 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 1)
lola: processed formula length: 64
lola: 33 rewrites
lola: closed formula file Referendum-COL-0010-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: 12 markings, 11 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) AND ((2 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (2 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))) AND (p0 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) AND ((2 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (2 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))) AND (p0 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))
lola: processed formula length: 271
lola: 31 rewrites
lola: closed formula file Referendum-COL-0010-CTLCardinality.task
lola: processed formula with 4 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Referendum-COL-0010-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no no no no no yes yes no no no no no yes no
lola:
preliminary result: yes yes no no no no no yes yes no no no no no yes no
lola: memory consumption: 23756 KB
lola: time consumption: 1 seconds

BK_STOP 1526972273772

--------------------
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="Referendum-COL-0010"
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/Referendum-COL-0010.tgz
mv Referendum-COL-0010 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 Referendum-COL-0010, 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-152673578900206"
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 ;