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-155272326000023.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-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-smll-155272326000023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 53K Feb 12 09:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 12 09:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 983K Feb 8 09:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Feb 8 09:31 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 15K Feb 5 00:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Feb 5 00:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 549K Feb 4 22:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.0M Feb 4 22:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 56K Feb 4 12:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Feb 4 12:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 737K Feb 1 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.6M Feb 1 08:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.8K 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 19M 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-20-LTLCardinality-00
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-01
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-02
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-03
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-04
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-05
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-06
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-07
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-08
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-09
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-10
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-11
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-12
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-13
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-14
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552863595804

info: Time: 3600 - MCC
===========================================================================================
prep: translating PhilosophersDyn-PT-20 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PhilosophersDyn-PT-20 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ PhilosophersDyn-PT-20 @ 3568 seconds
lola: LoLA will run for 3568 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 17760/65536 symbol table entries, 1877 collisions
lola: preprocessing...
lola: Size of bit vector: 17280
lola: finding significant places
lola: 540 places, 17220 transitions, 461 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 33431 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-PT-20-LTLCardinality.task
lola: A (F ((2 <= HasRight_10 + HasRight_11 + HasRight_12 + HasRight_13 + HasRight_14 + HasRight_15 + HasRight_16 + HasRight_17 + HasRight_18 + HasRight_19 + HasRight_20 + HasRight_9 + HasRight_8 + HasRight_7 + HasRight_6 + HasRight_5 + HasRight_4 + HasRight_3 + HasRight_2 + HasRight_1))) : A (F (G (X ((2 <= WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 + WaitRight_10 + WaitRight_11 + WaitRight_12 + WaitRight_13 + WaitRight_14 + WaitRight_15 + WaitRight_16 + WaitRight_17 + WaitRight_18 + WaitRight_19 + WaitRight_20))))) : A ((G (F ((2 <= Neighbourhood_13_10 + Neighbourhood_13_11 + Neighbourhood_13_12 + Neighbourhood_13_13 + Neighbourhood_13_14 + Neighbourhood_13_15 + Neighbourhood_13_16 + Neighbourhood_13_17 + Neighbourhood_13_18 + Neighbourhood_13_19 + Neighbourhood_13_20 + Neighbourhood_2_10 + Neighbourhood_2_11 + Neighbourhood_2_12 + Neighbourhood_2_13 + Neighbourhood_2_14 + Neighbourhood_2_15 + Neighbourhood_2_16 + Neighbourhood_2_17 + Neighbourhood_2_18 + Neighbourhood_2_19 + Neighbourhood_2_20 + Neighbourhood_18_10 + Neighbourhood_18_11 + Neighbourhood_18_12 + Neighbourhood_18_13 + Neighbourhood_18_14 + Neighbourhood_18_15 + Neighbourhood_18_16 + Neighbourhood_18_17 + Neighbourhood_18_18 + Neighbourhood_18_19 + Neighbourhood_18_20 + Neighbourhood_7_10 + Neighbourhood_7_11 + Neighbourhood_7_12 + Neighbourhood_7_13 + Neighbourhood_7_14 + Neighbourhood_7_15 + Neighbourhood_7_16 + Neighbourhood_7_17 + Neighbourhood_7_18 + Neighbourhood_7_19 + Neighbourhood_7_20 + Neighbourhood_12_10 + Neighbourhood_12_11 + Neighbourhood_12_12 + Neighbourhood_12_13 + Neighbourhood_12_14 + Neighbourhood_12_15 + Neighbourhood_12_16 + Neighbourhood_12_17 + Neighbourhood_12_18 + Neighbourhood_12_19 + Neighbourhood_12_20 + Neighbourhood_1_10 + Neighbourhood_1_11 + Neighbourhood_1_12 + Neighbourhood_1_13 + Neighbourhood_1_14 + Neighbourhood_1_15 + Neighbourhood_1_16 + Neighbourhood_1_17 + Neighbourhood_1_18 + Neighbourhood_1_19 + Neighbourhood_1_20 + Neighbourhood_20_1 + Neighbourhood_20_2 + Neighbourhood_20_3 + Neighbourhood_20_4 + Neighbourhood_20_5 + Neighbourhood_20_6 + Neighbourhood_20_7 + Neighbourhood_20_8 + Neighbourhood_20_9 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_1_9 + Neighbourhood_17_10 + Neighbourhood_17_11 + Neighbourhood_17_12 + Neighbourhood_17_13 + Neighbourhood_17_14 + Neighbourhood_17_15 + Neighbourhood_17_16 + Neighbourhood_17_17 + Neighbourhood_17_18 + Neighbourhood_17_19 + Neighbourhood_17_20 + Neighbourhood_6_10 + Neighbourhood_6_11 + Neighbourhood_6_12 + Neighbourhood_6_13 + Neighbourhood_6_14 + Neighbourhood_6_15 + Neighbourhood_6_16 + Neighbourhood_6_17 + Neighbourhood_6_18 + Neighbourhood_6_19 + Neighbourhood_6_20 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhood_2_7 + Neighbourhood_2_8 + Neighbourhood_2_9 + Neighbourhood_3_1 + Neighbourhood_3_2 + Neighbourhood_3_3 + Neighbourhood_3_4 + Neighbourhood_3_5 + Neighbourhood_3_6 + Neighbourhood_3_7 + Neighbourhood_3_8 + Neighbourhood_3_9 + Neighbourhood_11_10 + Neighbourhood_11_11 + Neighbourhood_11_12 + Neighbourhood_11_13 + Neighbourhood_11_14 + Neighbourhood_11_15 + Neighbourhood_11_16 + Neighbourhood_11_17 + Neighbourhood_11_18 + Neighbourhood_11_19 + Neighbourhood_11_20 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neighbourhood_10_7 + Neighbourhood_10_8 + Neighbourhood_10_9 + Neighbourhood_4_1 + Neighbourhood_4_2 + Neighbourhood_4_3 + Neighbourhood_4_4 + Neighbourhood_4_5 + Neighbourhood_4_6 + Neighbourhood_4_7 + Neighbourhood_4_8 + Neighbourhood_4_9 + Neighbourhood_16_10 + Neighbourhood_16_11 + Neighbourhood_16_12 + Neighbourhood_16_13 + Neighbourhood_16_14 + Neighbourhood_16_15 + Neighbourhood_16_16 + Neighbourhood_16_17 + Neighbourhood_16_18 + Neighbourhood_16_19 + Neighbourhood_16_20 + Neighbourhood_11_1 + Neighbourhood_11_2 + Neighbourhood_11_3 + Neighbourhood_11_4 + Neighbourhood_11_5 + Neighbourhood_11_6 + Neighbourhood_11_7 + Neighbourhood_11_8 + Neighbourhood_11_9 + Neighbourhood_5_1 + Neighbourhood_5_2 + Neighbourhood_5_3 + Neighbourhood_5_4 + Neighbourhood_5_5 + Neighbourhood_5_6 + Neighbourhood_5_7 + Neighbourhood_5_8 + Neighbourhood_5_9 + Neighbourhood_5_10 + Neighbourhood_5_11 + Neighbourhood_5_12 + Neighbourhood_5_13 + Neighbourhood_5_14 + Neighbourhood_5_15 + Neighbourhood_5_16 + Neighbourhood_5_17 + Neighbourhood_5_18 + Neighbourhood_5_19 + Neighbourhood_12_1 + Neighbourhood_12_2 + Neighbourhood_12_3 + Neighbourhood_12_4 + Neighbourhood_12_5 + Neighbourhood_12_6 + Neighbourhood_12_7 + Neighbourhood_12_8 + Neighbourhood_12_9 + Neighbourhood_6_1 + Neighbourhood_6_2 + Neighbourhood_6_3 + Neighbourhood_6_4 + Neighbourhood_6_5 + Neighbourhood_6_6 + Neighbourhood_6_7 + Neighbourhood_6_8 + Neighbourhood_10_10 + Neighbourhood_10_11 + Neighbourhood_10_12 + Neighbourhood_10_13 + Neighbourhood_10_14 + Neighbourhood_10_15 + Neighbourhood_10_16 + Neighbourhood_10_17 + Neighbourhood_10_18 + Neighbourhood_10_19 + Neighbourhood_10_20 + Neighbourhood_13_1 + Neighbourhood_13_2 + Neighbourhood_13_3 + Neighbourhood_13_4 + Neighbourhood_13_5 + Neighbourhood_13_6 + Neighbourhood_13_7 + Neighbourhood_13_8 + Neighbourhood_7_1 + Neighbourhood_7_2 + Neighbourhood_7_3 + Neighbourhood_7_4 + Neighbourhood_7_5 + Neighbourhood_7_6 + Neighbourhood_7_7 + Neighbourhood_7_8 + Neighbourhood_15_10 + Neighbourhood_15_11 + Neighbourhood_15_12 + Neighbourhood_15_13 + Neighbourhood_15_14 + Neighbourhood_15_15 + Neighbourhood_15_16 + Neighbourhood_15_17 + Neighbourhood_15_18 + Neighbourhood_15_19 + Neighbourhood_15_20 + Neighbourhood_14_1 + Neighbourhood_14_2 + Neighbourhood_14_3 + Neighbourhood_14_4 + Neighbourhood_14_5 + Neighbourhood_14_6 + Neighbourhood_14_7 + Neighbourhood_14_8 + Neighbourhood_14_9 + Neighbourhood_8_1 + Neighbourhood_8_2 + Neighbourhood_8_3 + Neighbourhood_8_4 + Neighbourhood_8_5 + Neighbourhood_8_6 + Neighbourhood_8_7 + Neighbourhood_8_8 + Neighbourhood_8_9 + Neighbourhood_4_10 + Neighbourhood_4_11 + Neighbourhood_4_12 + Neighbourhood_4_13 + Neighbourhood_4_14 + Neighbourhood_4_15 + Neighbourhood_4_16 + Neighbourhood_4_17 + Neighbourhood_4_18 + Neighbourhood_4_19 + Neighbourhood_8_19 + Neighbourhood_15_1 + Neighbourhood_15_2 + Neighbourhood_15_3 + Neighbourhood_15_4 + Neighbourhood_15_5 + Neighbourhood_15_6 + Neighbourhood_15_7 + Neighbourhood_15_8 + Neighbourhood_8_18 + Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_9_11 + Neighbourhood_9_12 + Neighbourhood_9_13 + Neighbourhood_9_14 + Neighbourhood_9_15 + Neighbourhood_9_16 + Neighbourhood_9_17 + Neighbourhood_9_18 + Neighbourhood_9_19 + Neighbourhood_8_17 + Neighbourhood_16_1 + Neighbourhood_16_2 + Neighbourhood_16_3 + Neighbourhood_16_4 + Neighbourhood_16_5 + Neighbourhood_16_6 + Neighbourhood_16_7 + Neighbourhood_16_8 + Neighbourhood_8_16 + Neighbourhood_14_10 + Neighbourhood_14_11 + Neighbourhood_14_12 + Neighbourhood_14_13 + Neighbourhood_14_14 + Neighbourhood_14_15 + Neighbourhood_14_16 + Neighbourhood_14_17 + Neighbourhood_14_18 + Neighbourhood_14_19 + Neighbourhood_8_15 + Neighbourhood_17_1 + Neighbourhood_17_2 + Neighbourhood_17_3 + Neighbourhood_17_4 + Neighbourhood_17_5 + Neighbourhood_17_6 + Neighbourhood_17_7 + Neighbourhood_17_8 + Neighbourhood_8_14 + Neighbourhood_3_10 + Neighbourhood_3_11 + Neighbourhood_3_12 + Neighbourhood_3_13 + Neighbourhood_3_14 + Neighbourhood_3_15 + Neighbourhood_3_16 + Neighbourhood_3_17 + Neighbourhood_3_18 + Neighbourhood_3_19 + Neighbourhood_8_13 + Neighbourhood_8_12 + Neighbourhood_8_11 + Neighbourhood_8_10 + Neighbourhood_19_19 + Neighbourhood_19_18 + Neighbourhood_19_17 + Neighbourhood_19_16 + Neighbourhood_19_15 + Neighbourhood_19_14 + Neighbourhood_19_13 + Neighbourhood_19_12 + Neighbourhood_19_11 + Neighbourhood_19_10 + Neighbourhood_18_8 + Neighbourhood_18_7 + Neighbourhood_18_6 + Neighbourhood_18_5 + Neighbourhood_18_4 + Neighbourhood_18_3 + Neighbourhood_18_2 + Neighbourhood_18_1 + Neighbourhood_18_9 + Neighbourhood_19_20 + Neighbourhood_3_20 + Neighbourhood_17_9 + Neighbourhood_14_20 + Neighbourhood_16_9 + Neighbourhood_9_20 + Neighbourhood_15_9 + Neighbourhood_4_20 + Neighbourhood_8_20 + Neighbourhood_20_10 + Neighbourhood_20_11 + Neighbourhood_20_12 + Neighbourhood_20_13 + Neighbourhood_20_14 + Neighbourhood_20_15 + Neighbourhood_20_16 + Neighbourhood_20_17 + Neighbourhood_20_18 + Neighbourhood_20_19 + Neighbourhood_20_20 + Neighbourhood_19_1 + Neighbourhood_19_2 + Neighbourhood_19_3 + Neighbourhood_19_4 + Neighbourhood_19_5 + Neighbourhood_19_6 + Neighbourhood_19_7 + Neighbourhood_19_8 + Neighbourhood_19_9 + Neighbourhood_7_9 + Neighbourhood_13_9 + Neighbourhood_6_9 + Neighbourhood_5_20))) U G (F ((HasRight_10 + HasRight_11 + HasRight_12 + HasRight_13 + HasRight_14 + HasRight_15 + HasRight_16 + HasRight_17 + HasRight_18 + HasRight_19 + HasRight_20 + HasRight_9 + HasRight_8 + HasRight_7 + HasRight_6 + HasRight_5 + HasRight_4 + HasRight_3 + HasRight_2 + HasRight_1 <= WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 + WaitRight_10 + WaitRight_11 + WaitRight_12 + WaitRight_13 + WaitRight_14 + WaitRight_15 + WaitRight_16 + WaitRight_17 + WaitRight_18 + WaitRight_19 + WaitRight_20))))) : A ((WaitLeft_10 + WaitLeft_11 + WaitLeft_12 + WaitLeft_13 + WaitLeft_14 + WaitLeft_15 + WaitLeft_16 + WaitLeft_17 + WaitLeft_18 + WaitLeft_19 + WaitLeft_20 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_20 + HasLeft_19 + HasLeft_18 + HasLeft_17 + HasLeft_16 + HasLeft_15 + HasLeft_14 + HasLeft_13 + HasLeft_12 + HasLeft_11 + HasLeft_10)) : A (X (F ((Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 <= Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_11 + Forks_12 + Forks_13 + Forks_14 + Forks_15 + Forks_16 + Forks_17 + Forks_18 + Forks_19 + Forks_20 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1)))) : A ((Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_11 + Forks_12 + Forks_13 + Forks_14 + Forks_15 + Forks_16 + Forks_17 + Forks_18 + Forks_19 + Forks_20 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 <= WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 + WaitRight_10 + WaitRight_11 + WaitRight_12 + WaitRight_13 + WaitRight_14 + WaitRight_15 + WaitRight_16 + WaitRight_17 + WaitRight_18 + WaitRight_19 + WaitRight_20)) : A (X (F (F (F ((2 <= WaitLeft_10 + WaitLeft_11 + WaitLeft_12 + WaitLeft_13 + WaitLeft_14 + WaitLeft_15 + WaitLeft_16 + WaitLeft_17 + WaitLeft_18 + WaitLeft_19 + WaitLeft_20 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9)))))) : A ((F (G ((1 <= Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_13 + Outside_14 + Outside_15 + Outside_16 + Outside_17 + Outside_18 + Outside_19 + Outside_20 + Outside_12 + Outside_11 + Outside_10 + Outside_2 + Outside_1))) U X (X ((3 <= WaitLeft_10 + WaitLeft_11 + WaitLeft_12 + WaitLeft_13 + WaitLeft_14 + WaitLeft_15 + WaitLeft_16 + WaitLeft_17 + WaitLeft_18 + WaitLeft_19 + WaitLeft_20 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9))))) : A (F (F (X (F ((Neighbourhood_20_10 <= Think_20)))))) : A (G ((Neighbourhood_1_5 <= Neighbourhood_6_16))) : A (F ((Neighbourhood_5_4 <= Neighbourhood_17_19))) : A ((X (F ((Neighbourhood_19_13 <= Neighbourhood_10_15))) U G ((Neighbourhood_7_9 <= Neighbourhood_12_4)))) : A ((HasLeft_6 <= Neighbourhood_18_16)) : A (G ((Neighbourhood_4_7 <= Neighbourhood_18_17))) : A ((Neighbourhood_4_5 <= Outside_8)) : A ((X (X ((Neighbourhood_7_4 <= Neighbourhood_14_5))) U F (F ((Neighbourhood_20_4 <= Neighbourhood_4_18)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 211 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (WaitLeft_10 + WaitLeft_11 + WaitLeft_12 + WaitLeft_13 + WaitLeft_14 + WaitLeft_15 + WaitLeft_16 + WaitLeft_17 + WaitLeft_18 + WaitLeft_19 + WaitLeft_20 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_20 + HasLef... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (WaitLeft_10 + WaitLeft_11 + WaitLeft_12 + WaitLeft_13 + WaitLeft_14 + WaitLeft_15 + WaitLeft_16 + WaitLeft_17 + WaitLeft_18 + WaitLeft_19 + WaitLeft_20 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_20 + HasLef... (shortened)
lola: processed formula length: 522
lola: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-20-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 PhilosophersDyn-PT-20-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 225 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_11 + Forks_12 + Forks_13 + Forks_14 + Forks_15 + Forks_16 + Forks_17 + Forks_18 + Forks_19 + Forks_20 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 <= WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 + WaitRight_10 + WaitRight_11 + WaitRight_12 + WaitRight_13 + W... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_11 + Forks_12 + Forks_13 + Forks_14 + Forks_15 + Forks_16 + Forks_17 + Forks_18 + Forks_19 + Forks_20 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 <= WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 + WaitRight_10 + WaitRight_11 + WaitRight_12 + WaitRight_13 + W... (shortened)
lola: processed formula length: 502
lola: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-20-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 PhilosophersDyn-PT-20-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 241 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (HasLeft_6 <= Neighbourhood_18_16)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (HasLeft_6 <= Neighbourhood_18_16)
lola: processed formula length: 34
lola: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-20-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 PhilosophersDyn-PT-20-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Neighbourhood_4_5 <= Outside_8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Neighbourhood_4_5 <= Outside_8)
lola: processed formula length: 32
lola: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-20-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 PhilosophersDyn-PT-20-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((3 <= WaitLeft_10 + WaitLeft_11 + WaitLeft_12 + WaitLeft_13 + WaitLeft_14 + WaitLeft_15 + WaitLeft_16 + WaitLeft_17 + WaitLeft_18 + WaitLeft_19 + WaitLeft_20 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9))) OR (X (X (F ((3 <= WaitLeft_10 + WaitLeft_11 + WaitLeft_12 + WaitLeft_13 + WaitLeft_14 + WaitLeft_15 + WaitLeft_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((3 <= WaitLeft_10 + WaitLeft_11 + WaitLeft_12 + WaitLeft_13 + WaitLeft_14 + WaitLeft_15 + WaitLeft_16 + WaitLeft_17 + WaitLeft_18 + WaitLeft_19 + WaitLeft_20 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9))) OR (X (X (F ((3 <= WaitLeft_10 + WaitLeft_11 + WaitLeft_12 + WaitLeft_13 + WaitLeft_14 + WaitLeft_15 + WaitLeft_... (shortened)
lola: processed formula length: 850
lola: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-20-LTLCardinality.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: 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, 12 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-20-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((Neighbourhood_20_10 <= Think_20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((Neighbourhood_20_10 <= Think_20))))
lola: processed formula length: 45
lola: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-20-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 191 markings, 380 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-20-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((Neighbourhood_19_13 <= Neighbourhood_10_15))) U G ((Neighbourhood_7_9 <= Neighbourhood_12_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((Neighbourhood_19_13 <= Neighbourhood_10_15))) U G ((Neighbourhood_7_9 <= Neighbourhood_12_4))))
lola: processed formula length: 106
lola: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-20-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: 30037 markings, 79728 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-20-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 <= Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_11 + Forks_12 + Forks_13 + Forks_14 + Forks_15 + Forks_16 + Forks_17 + Forks_18 + Forks_19 + Forks_20 + Forks_5 + Forks_4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 <= Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_11 + Forks_12 + Forks_13 + Forks_14 + Forks_15 + Forks_16 + Forks_17 + Forks_18 + Forks_19 + Forks_20 + Forks_5 + Forks_4... (shortened)
lola: processed formula length: 434
lola: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-20-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 191 markings, 380 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-20-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 422 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= WaitLeft_10 + WaitLeft_11 + WaitLeft_12 + WaitLeft_13 + WaitLeft_14 + WaitLeft_15 + WaitLeft_16 + WaitLeft_17 + WaitLeft_18 + WaitLeft_19 + WaitLeft_20 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= WaitLeft_10 + WaitLeft_11 + WaitLeft_12 + WaitLeft_13 + WaitLeft_14 + WaitLeft_15 + WaitLeft_16 + WaitLeft_17 + WaitLeft_18 + WaitLeft_19 + WaitLeft_20 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9))))
lola: processed formula length: 287
lola: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-20-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: 202 markings, 292 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-20-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Neighbourhood_4_7 <= Neighbourhood_18_17)))
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 ((Neighbourhood_4_7 <= Neighbourhood_18_17)))
lola: processed formula length: 50
lola: 23 rewrites
lola: closed formula file PhilosophersDyn-PT-20-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: (Neighbourhood_18_17 + 1 <= Neighbourhood_4_7)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-PT-20-LTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-PT-20-LTLCardinality-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-20-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Neighbourhood_1_5 <= Neighbourhood_6_16)))
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 ((Neighbourhood_1_5 <= Neighbourhood_6_16)))
lola: processed formula length: 49
lola: 23 rewrites
lola: closed formula file PhilosophersDyn-PT-20-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: (Neighbourhood_6_16 + 1 <= Neighbourhood_1_5)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-PT-20-LTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-PT-20-LTLCardinality-10-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-20-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 675 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Neighbourhood_5_4 <= Neighbourhood_17_19)))
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: (Neighbourhood_17_19 + 1 <= Neighbourhood_5_4)
lola: processed formula length: 46
lola: 23 rewrites
lola: closed formula file PhilosophersDyn-PT-20-LTLCardinality.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 eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-20-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 843 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Neighbourhood_20_4 <= Neighbourhood_4_18)))
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: (Neighbourhood_4_18 + 1 <= Neighbourhood_20_4)
lola: processed formula length: 46
lola: 23 rewrites
lola: closed formula file PhilosophersDyn-PT-20-LTLCardinality.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 eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
FORMULA PhilosophersDyn-PT-20-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 13 will run for 1124 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= HasRight_10 + HasRight_11 + HasRight_12 + HasRight_13 + HasRight_14 + HasRight_15 + HasRight_16 + HasRight_17 + HasRight_18 + HasRight_19 + HasRight_20 + HasRight_9 + HasRight_8 + HasRight_7 + HasRight_6 + HasRight_5 + HasRight_4 + HasRight_3 + HasRight_2 + HasRight_1)))
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: (HasRight_10 + HasRight_11 + HasRight_12 + HasRight_13 + HasRight_14 + HasRight_15 + HasRight_16 + HasRight_17 + HasRight_18 + HasRight_19 + HasRight_20 + HasRight_9 + HasRight_8 + HasRight_7 + HasRight_6 + HasRight_5 + HasRight_4 + HasRight_3 + HasRight_2 + HasRight_1 <= 1)
lola: processed formula length: 275
lola: 23 rewrites
lola: closed formula file PhilosophersDyn-PT-20-LTLCardinality.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: 8 markings, 7 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-20-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 + WaitRight_10 + WaitRight_11 + WaitRight_12 + WaitRight_13 + WaitRight_14 + WaitRight_15 + WaitRight_16 + WaitRight_17 + WaitRight_18 + WaitRight_19 + WaitRight_20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 + WaitRight_10 + WaitRight_11 + WaitRight_12 + WaitRight_13 + WaitRight_14 + WaitRight_15 + WaitRight_16 + WaitRight_17 + WaitRight_18 + WaitRight_19 + WaitRight_20))))
lola: processed formula length: 307
lola: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-20-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: 275 markings, 1037 edges, 55 markings/sec, 0 secs
lola: 508 markings, 1780 edges, 47 markings/sec, 5 secs
lola: 915 markings, 3165 edges, 81 markings/sec, 10 secs
lola: 1167 markings, 4004 edges, 50 markings/sec, 15 secs
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: 1222 markings, 4220 edges

FORMULA PhilosophersDyn-PT-20-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((HasRight_10 + HasRight_11 + HasRight_12 + HasRight_13 + HasRight_14 + HasRight_15 + HasRight_16 + HasRight_17 + HasRight_18 + HasRight_19 + HasRight_20 + HasRight_9 + HasRight_8 + HasRight_7 + HasRight_6 + HasRight_5 + HasRight_4 + HasRight_3 + HasRight_2 + HasRight_1 <= WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((HasRight_10 + HasRight_11 + HasRight_12 + HasRight_13 + HasRight_14 + HasRight_15 + HasRight_16 + HasRight_17 + HasRight_18 + HasRight_19 + HasRight_20 + HasRight_9 + HasRight_8 + HasRight_7 + HasRight_6 + HasRight_5 + HasRight_4 + HasRight_3 + HasRight_2 + HasRight_1 <= WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitR... (shortened)
lola: processed formula length: 9605
lola: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-20-LTLCardinality.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: 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: 303 markings, 715 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-20-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes yes yes no no yes no yes no yes no yes yes
lola:
preliminary result: no no no yes yes yes no no yes no yes no yes no yes yes
lola: memory consumption: 333504 KB
lola: time consumption: 220 seconds

BK_STOP 1552863817176

--------------------
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-20"
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-3957"
echo " Executing tool win2018"
echo " Input is PhilosophersDyn-PT-20, 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 r121-smll-155272326000023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-20.tgz
mv PhilosophersDyn-PT-20 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 ;