Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r110-oct2-155272242500224.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is Philosophers-COL-000005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110-oct2-155272242500224
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.4K Feb 12 04:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 12 04:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 8 03:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 8 03:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 00:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 4 08:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 4 08:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 1 02:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 1 02:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 9.7K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1553045713541

info: Time: 3600 - MCC
===========================================================================================
prep: translating Philosophers-COL-000005 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 Philosophers-COL-000005 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ Philosophers-COL-000005 @ 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: 50/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 25
lola: finding significant places
lola: 25 places, 25 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 35 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-COL-000005-LTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p0 + p1 + p2 + p3 + p4)
lola: LP says that atomic proposition is always true: (p0 + p1 + p2 + p3 + p4 <= p5 + p6 + p7 + p8 + p9)
lola: LP says that atomic proposition is always false: (3 <= p0 + p1 + p2 + p3 + p4)
lola: LP says that atomic proposition is always true: (p0 + p1 + p2 + p3 + p4 <= p5 + p6 + p7 + p8 + p9)
lola: A ((3 <= p15 + p16 + p17 + p18 + p19)) : A (F (G (G (G ((1 <= p10 + p11 + p12 + p13 + p14)))))) : A (X (X (G (X (FALSE))))) : A ((p10 + p11 + p12 + p13 + p14 <= p0 + p1 + p2 + p3 + p4)) : A (((p15 + p16 + p17 + p18 + p19 <= p5 + p6 + p7 + p8 + p9) U F (X ((p20 + p21 + p22 + p23 + p24 <= p5 + p6 + p7 + p8 + p9))))) : A ((G ((p20 + p21 + p22 + p23 + p24 <= p15 + p16 + p17 + p18 + p19)) U ((p15 + p16 + p17 + p18 + p19 <= p0 + p1 + p2 + p3 + p4) U (p5 + p6 + p7 + p8 + p9 <= p0 + p1 + p2 + p3 + p4)))) : A ((p5 + p6 + p7 + p8 + p9 <= p0 + p1 + p2 + p3 + p4)) : A (X (X (((2 <= p15 + p16 + p17 + p18 + p19) U (2 <= p5 + p6 + p7 + p8 + p9))))) : A (G (X (X (G ((1 <= p0 + p1 + p2 + p3 + p4)))))) : A (G ((3 <= p20 + p21 + p22 + p23 + p24))) : A ((G (G ((3 <= p15 + p16 + p17 + p18 + p19))) U (p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24))) : A (X (X (TRUE))) : A ((p20 + p21 + p22 + p23 + p24 <= p10 + p11 + p12 + p13 + p14)) : A (X ((X (FALSE) U F ((p5 + p6 + p7 + p8 + p9 <= p0 + p1 + p2 + p3 + p4))))) : A (G (G (TRUE))) : A ((F (X ((3 <= p15 + p16 + p17 + p18 + p19))) U (3 <= p20 + p21 + p22 + p23 + p24)))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p15 + p16 + p17 + p18 + p19)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p15 + p16 + p17 + p18 + p19)
lola: processed formula length: 34
lola: 30 rewrites
lola: closed formula file Philosophers-COL-000005-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-COL-000005-LTLCardinality-0 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: 30 rewrites
lola: closed formula file Philosophers-COL-000005-LTLCardinality.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 Philosophers-COL-000005-LTLCardinality-2 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: (p10 + p11 + p12 + p13 + p14 <= p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p10 + p11 + p12 + p13 + p14 <= p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 55
lola: 30 rewrites
lola: closed formula file Philosophers-COL-000005-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-COL-000005-LTLCardinality-3 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: (p5 + p6 + p7 + p8 + p9 <= p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p5 + p6 + p7 + p8 + p9 <= p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 50
lola: 30 rewrites
lola: closed formula file Philosophers-COL-000005-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-COL-000005-LTLCardinality-6 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: (p20 + p21 + p22 + p23 + p24 <= p10 + p11 + p12 + p13 + p14)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p20 + p21 + p22 + p23 + p24 <= p10 + p11 + p12 + p13 + p14)
lola: processed formula length: 60
lola: 30 rewrites
lola: closed formula file Philosophers-COL-000005-LTLCardinality.task
lola: processed formula with 1 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 Philosophers-COL-000005-LTLCardinality-12 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 30 rewrites
lola: closed formula file Philosophers-COL-000005-LTLCardinality.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 Philosophers-COL-000005-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((1 <= p0 + p1 + p2 + p3 + p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((1 <= p0 + p1 + p2 + p3 + p4)))))
lola: processed formula length: 45
lola: 30 rewrites
lola: closed formula file Philosophers-COL-000005-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================

FORMULA Philosophers-COL-000005-LTLCardinality-8 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: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 30 rewrites
lola: closed formula file Philosophers-COL-000005-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 11 markings, 10 edges
lola: ========================================

FORMULA Philosophers-COL-000005-LTLCardinality-11 TRUE 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: ...considering subproblem: A (((p15 + p16 + p17 + p18 + p19 <= p5 + p6 + p7 + p8 + p9) U X (F ((p20 + p21 + p22 + p23 + p24 <= p5 + p6 + p7 + p8 + p9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p15 + p16 + p17 + p18 + p19 <= p5 + p6 + p7 + p8 + p9) U X (F ((p20 + p21 + p22 + p23 + p24 <= p5 + p6 + p7 + p8 + p9)))))
lola: processed formula length: 127
lola: 30 rewrites
lola: closed formula file Philosophers-COL-000005-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 11 markings, 10 edges
lola: ========================================

FORMULA Philosophers-COL-000005-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p5 + p6 + p7 + p8 + p9 <= p0 + p1 + p2 + p3 + p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p5 + p6 + p7 + p8 + p9 <= p0 + p1 + p2 + p3 + p4))))
lola: processed formula length: 62
lola: 30 rewrites
lola: closed formula file Philosophers-COL-000005-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12 markings, 16 edges
lola: ========================================

FORMULA Philosophers-COL-000005-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((2 <= p15 + p16 + p17 + p18 + p19) U (2 <= p5 + p6 + p7 + p8 + p9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((2 <= p15 + p16 + p17 + p18 + p19) U (2 <= p5 + p6 + p7 + p8 + p9)))))
lola: processed formula length: 80
lola: 30 rewrites
lola: closed formula file Philosophers-COL-000005-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 51 markings, 90 edges
lola: ========================================

FORMULA Philosophers-COL-000005-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((3 <= p15 + p16 + p17 + p18 + p19))) U (3 <= p20 + p21 + p22 + p23 + p24)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((3 <= p15 + p16 + p17 + p18 + p19))) U (3 <= p20 + p21 + p22 + p23 + p24)))
lola: processed formula length: 85
lola: 30 rewrites
lola: closed formula file Philosophers-COL-000005-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================

FORMULA Philosophers-COL-000005-LTLCardinality-15 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: A (G ((3 <= p20 + p21 + p22 + p23 + p24)))
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 ((3 <= p20 + p21 + p22 + p23 + p24)))
lola: processed formula length: 42
lola: 32 rewrites
lola: closed formula file Philosophers-COL-000005-LTLCardinality.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: (p20 + p21 + p22 + p23 + p24 <= 2)
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: 0 markings, 0 edges

FORMULA Philosophers-COL-000005-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= p10 + p11 + p12 + p13 + p14))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= p10 + p11 + p12 + p13 + p14))))
lola: processed formula length: 46
lola: 30 rewrites
lola: closed formula file Philosophers-COL-000005-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 8 edges
lola: ========================================

FORMULA Philosophers-COL-000005-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24) OR (G ((3 <= p15 + p16 + p17 + p18 + p19)) AND F ((p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24) OR (G ((3 <= p15 + p16 + p17 + p18 + p19)) AND F ((p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24)))))
lola: processed formula length: 179
lola: 30 rewrites
lola: closed formula file Philosophers-COL-000005-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA Philosophers-COL-000005-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p15 + p16 + p17 + p18 + p19 <= p0 + p1 + p2 + p3 + p4) U (p5 + p6 + p7 + p8 + p9 <= p0 + p1 + p2 + p3 + p4)) OR (G ((p20 + p21 + p22 + p23 + p24 <= p15 + p16 + p17 + p18 + p19)) AND F ((p5 + p6 + p7 + p8 + p9 <= p0 + p1 + p2 + p3 + p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p15 + p16 + p17 + p18 + p19 <= p0 + p1 + p2 + p3 + p4) U (p5 + p6 + p7 + p8 + p9 <= p0 + p1 + p2 + p3 + p4)) OR (G ((p20 + p21 + p22 + p23 + p24 <= p15 + p16 + p17 + p18 + p19)) AND F ((p5 + p6 + p7 + p8 + p9 <= p0 + p1 + p2 + p3 + p4)))))
lola: processed formula length: 245
lola: 30 rewrites
lola: closed formula file Philosophers-COL-000005-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 18 edges
lola: ========================================

FORMULA Philosophers-COL-000005-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no yes no no yes no no yes yes yes no yes no
lola:
preliminary result: no no no no yes no no yes no no yes yes yes no yes no
lola: memory consumption: 19112 KB
lola: time consumption: 0 seconds

BK_STOP 1553045713897

--------------------
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="Philosophers-COL-000005"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool win2018"
echo " Input is Philosophers-COL-000005, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r110-oct2-155272242500224"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000005.tgz
mv Philosophers-COL-000005 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;