Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r121-smll-155272326000018.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
Input is PhilosophersDyn-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-smll-155272326000018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 7.3K Feb 12 09:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Feb 12 09:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 8 08:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 8 08:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 108 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 346 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.5K Feb 5 00:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 5 00:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 4 22:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 4 22:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Feb 4 12:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 4 12:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 1 07:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 1 07:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K Feb 4 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 87K 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 PhilosophersDyn-PT-03-LTLFireability-00
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-01
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-02
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-03
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-04
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-05
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-06
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-07
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-08
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-09
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-10
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-11
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-12
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-13
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-14
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1552861576065

info: Time: 3600 - MCC
===========================================================================================
prep: translating PhilosophersDyn-PT-03 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PhilosophersDyn-PT-03 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ PhilosophersDyn-PT-03 @ 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: 114/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 960
lola: finding significant places
lola: 30 places, 84 transitions, 19 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 145 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-PT-03-LTLFireability.task
lola: A ((G (F (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))) U G ((FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR FIREABLE(Leave_1_3_1) OR FIREABLE(Leave_3_1_3) OR FIREABLE(Leave_1_2_2) OR FIREABLE(Leave_3_3_3) OR FIREABLE(Leave_3_2_1) OR FIREABLE(Leave_2_1_3) OR FIREABLE(Leave_3_2_2) OR FIREABLE(Leave_2_2_2) OR FIREABLE(Leave_3_1_2) OR FIREABLE(Leave_1_1_1) OR FIREABLE(Leave_2_1_2) OR FIREABLE(Leave_1_2_3))))) : A ((G (((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3)) U (FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR FIREABLE(Leave_1_3_1) OR FIREABLE(Leave_3_1_3) OR FIREABLE(Leave_1_2_2) OR FIREABLE(Leave_3_3_3) OR FIREABLE(Leave_3_2_1) OR FIREABLE(Leave_2_1_3) OR FIREABLE(Leave_3_2_2) OR FIREABLE(Leave_2_2_2) OR FIREABLE(Leave_3_1_2) OR FIREABLE(Leave_1_1_1) OR FIREABLE(Leave_2_1_2) OR FIREABLE(Leave_1_2_3)))) U ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)) U G ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2)))))) : A (X (X ((F ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3))) U G ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3))))))) : A (F (X ((FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR FIREABLE(Leave_1_3_1) OR FIREABLE(Leave_3_1_3) OR FIREABLE(Leave_1_2_2) OR FIREABLE(Leave_3_3_3) OR FIREABLE(Leave_3_2_1) OR FIREABLE(Leave_2_1_3) OR FIREABLE(Leave_3_2_2) OR FIREABLE(Leave_2_2_2) OR FIREABLE(Leave_3_1_2) OR FIREABLE(Leave_1_1_1) OR FIREABLE(Leave_2_1_2) OR FIREABLE(Leave_1_2_3))))) : A (G (G (X (G (F ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))))))) : A (F ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3)))) : A (G (G (F (X (G ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))))))) : A (X (X ((G ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3))) U F ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3))))))) : A (G (X (F (X (FIREABLE(Join_3_1_2)))))) : A (X (G ((FIREABLE(Join_2_2_2) U FIREABLE(Leave_3_2_1))))) : A (FIREABLE(Join_2_3_2)) : A (FIREABLE(Leave_2_2_1)) : A (X (F (FIREABLE(TakeLeft_3)))) : A (X ((X (FIREABLE(Join_2_2_1)) U X (X (FIREABLE(Leave_3_1_1)))))) : A (FIREABLE(Initialize_2_3)) : A (X (X ((F (FIREABLE(SearchForks_2)) U F (FIREABLE(Join_3_2_3))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(Join_2_3_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Join_2_3_2)
lola: processed formula length: 20
lola: 28 rewrites
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.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 PhilosophersDyn-PT-03-LTLFireability-10 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: FIREABLE(Leave_2_2_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Leave_2_2_1)
lola: processed formula length: 21
lola: 28 rewrites
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.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 PhilosophersDyn-PT-03-LTLFireability-11 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: FIREABLE(Initialize_2_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Initialize_2_3)
lola: processed formula length: 24
lola: 28 rewrites
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.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 PhilosophersDyn-PT-03-LTLFireability-14 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: A (X (G ((F (FIREABLE(Leave_3_2_1)) AND (FIREABLE(Join_2_2_2) OR FIREABLE(Leave_3_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F (FIREABLE(Leave_3_2_1)) AND (FIREABLE(Join_2_2_2) OR FIREABLE(Leave_3_2_1))))))
lola: processed formula length: 91
lola: 28 rewrites
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.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: 5 markings, 5 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-03-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((F ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3))) U G ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRig... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((F ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3))) U G ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRig... (shortened)
lola: processed formula length: 469
lola: 28 rewrites
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.task
lola: the resulting Büchi automaton has 6 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 PhilosophersDyn-PT-03-LTLFireability-2 FALSE 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: A (X (F ((FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR ... (shortened)
lola: processed formula length: 711
lola: 28 rewrites
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 6 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-03-LTLFireability-3 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 (F (FIREABLE(TakeLeft_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(TakeLeft_3))))
lola: processed formula length: 32
lola: 28 rewrites
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.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: 10 markings, 10 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-03-LTLFireability-12 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 (X ((FIREABLE(Join_2_2_1) U X (FIREABLE(Leave_3_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((FIREABLE(Join_2_2_1) U X (FIREABLE(Leave_3_1_1))))))
lola: processed formula length: 62
lola: 28 rewrites
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.task
lola: the resulting Büchi automaton has 6 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: 5 markings, 5 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-03-LTLFireability-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: ...considering subproblem: A (X (X ((F ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3))) OR (G ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3))) AND F ((FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((F ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3))) OR (G ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3))) AND F ((FI... (shortened)
lola: processed formula length: 598
lola: 28 rewrites
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.task
lola: the resulting Büchi automaton has 5 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: 5 markings, 5 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-03-LTLFireability-7 FALSE 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 (X (F (FIREABLE(Join_3_2_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F (FIREABLE(Join_3_2_3)))))
lola: processed formula length: 36
lola: 28 rewrites
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-03-LTLFireability-15 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 (F ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (NOT FIREABLE(Eat_3_2) AND NOT FIREABLE(Eat_1_3) AND NOT FIREABLE(Eat_1_2) AND NOT FIREABLE(Eat_2_2) AND NOT FIREABLE(Eat_3_1) AND NOT FIREABLE(Eat_2_1) AND NOT FIREABLE(Eat_2_3) AND NOT FIREABLE(Eat_1_1) AND NOT FIREABLE(Eat_3_3))
lola: processed formula length: 231
lola: 30 rewrites
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.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: 5 markings, 4 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-03-LTLFireability-5 FALSE 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 (G (F (FIREABLE(Join_3_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(Join_3_1_2))))
lola: processed formula length: 32
lola: 28 rewrites
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.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: 5 markings, 5 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-03-LTLFireability-8 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 (F (G ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))))
lola: processed formula length: 261
lola: 28 rewrites
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.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: 6 markings, 7 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-03-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))))
lola: processed formula length: 261
lola: 28 rewrites
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.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: 9 markings, 9 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-03-LTLFireability-4 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 ((G ((FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR FI... (shortened)
lola: processed formula length: 1507
lola: 28 rewrites
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.task
lola: the resulting Büchi automaton has 8 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: 5 markings, 5 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-03-LTLFireability-0 FALSE 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 ((((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)) U G ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2)))) OR (G ((F ((FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leav... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)) U G ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2)))) OR (G ((F ((FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leav... (shortened)
lola: processed formula length: 1858
lola: 28 rewrites
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.task
lola: the resulting Büchi automaton has 19 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: 6 markings, 6 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-03-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no no no no no no no no no no yes no
lola:
preliminary result: no no no yes no no no no no no no no no no yes no
lola: memory consumption: 14780 KB
lola: time consumption: 0 seconds

BK_STOP 1552861576310

--------------------
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="PhilosophersDyn-PT-03"
export BK_EXAMINATION="LTLFireability"
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-3957"
echo " Executing tool win2018"
echo " Input is PhilosophersDyn-PT-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-smll-155272326000018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;