Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.........................................................................
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 37K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 255K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is LamportFastMutEx-PT-7, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-csrt-152666472300143
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527139219076


BK_STOP 1527139815591

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using LamportFastMutEx-PT-7 as instance name.
Using LamportFastMutEx as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 1196598, 'Memory': 15927.39, 'Tool': 'lola'}, {'Time': 1547894, 'Memory': 15952.35, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola LamportFastMutEx-PT-7...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
LamportFastMutEx-PT-7: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
LamportFastMutEx-PT-7: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ LamportFastMutEx-PT-7 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 800/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 264 places, 536 transitions, 182 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 762 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-PT-7-CTLCardinality.task
lola: A (F (((2 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 + P-ifxi_10_5 + P-ifxi_10_6 + P-ifxi_10_7) AND (2 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7) AND (P-done_6_0 + P-done_6_1 + P-done_6_2 + P-done_6_3 + P-done_6_4 + P-done_6_5 + P-done_6_6 + P-done_6_7 + P-done_7_0 + P-done_7_1 + P-done_7_2 + P-done_7_3 + P-done_7_4 + P-done_7_5 + P-done_7_6 + P-done_7_7 + P-done_0_7 + P-done_0_6 + P-done_0_5 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_1 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_1_3 + P-done_1_4 + P-done_1_5 + P-done_1_6 + P-done_1_7 + P-done_0_0 + P-done_2_0 + P-done_2_1 + P-done_2_2 + P-done_2_3 + P-done_2_4 + P-done_2_5 + P-done_2_6 + P-done_2_7 + P-done_3_0 + P-done_3_1 + P-done_3_2 + P-done_3_3 + P-done_3_4 + P-done_3_5 + P-done_3_6 + P-done_3_7 + P-done_4_0 + P-done_4_1 + P-done_4_2 + P-done_4_3 + P-done_4_4 + P-done_4_5 + P-done_4_6 + P-done_4_7 + P-done_5_0 + P-done_5_1 + P-done_5_2 + P-done_5_3 + P-done_5_4 + P-done_5_5 + P-done_5_6 + P-done_5_7 <= P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4 + P-await_13_5 + P-await_13_6 + P-await_13_7) AND (P-wait_5_7 + P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + P-wait_5_3 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_0_5 + P-wait_0_6 + P-wait_0_7 + P-wait_5_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_1_5 + P-wait_1_6 + P-wait_1_7 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_2_5 + P-wait_2_6 + P-wait_2_7 + P-wait_5_1 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_3_5 + P-wait_3_6 + P-wait_3_7 + P-wait_5_0 + P-wait_4_7 + P-wait_4_6 + P-wait_4_5 + P-wait_4_4 + P-wait_4_3 + P-wait_4_2 + P-wait_4_1 + P-wait_4_0 + P-wait_6_0 + P-wait_6_1 + P-wait_6_2 + P-wait_6_3 + P-wait_6_4 + P-wait_6_5 + P-wait_6_6 + P-wait_6_7 + P-wait_7_0 + P-wait_7_1 + P-wait_7_2 + P-wait_7_3 + P-wait_7_4 + P-wait_7_5 + P-wait_7_6 + P-wait_7_7 <= 0) AND (P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4 + P-setbi_24_5 + P-setbi_24_6 + P-setbi_24_7 + 1 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 + P-ifxi_10_5 + P-ifxi_10_6 + P-ifxi_10_7)))) : A (G (((P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4 + P-await_13_5 + P-await_13_6 + P-await_13_7 <= P-wait_5_7 + P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + P-wait_5_3 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_0_5 + P-wait_0_6 + P-wait_0_7 + P-wait_5_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_1_5 + P-wait_1_6 + P-wait_1_7 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_2_5 + P-wait_2_6 + P-wait_2_7 + P-wait_5_1 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_3_5 + P-wait_3_6 + P-wait_3_7 + P-wait_5_0 + P-wait_4_7 + P-wait_4_6 + P-wait_4_5 + P-wait_4_4 + P-wait_4_3 + P-wait_4_2 + P-wait_4_1 + P-wait_4_0 + P-wait_6_0 + P-wait_6_1 + P-wait_6_2 + P-wait_6_3 + P-wait_6_4 + P-wait_6_5 + P-wait_6_6 + P-wait_6_7 + P-wait_7_0 + P-wait_7_1 + P-wait_7_2 + P-wait_7_3 + P-wait_7_4 + P-wait_7_5 + P-wait_7_6 + P-wait_7_7) OR (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P-fordo_12_4 + P-fordo_12_5 + P-fordo_12_6 + P-fordo_12_7 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4 + P-sety_9_5 + P-sety_9_6 + P-sety_9_7)))) : A (F ((1 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3 + P-setbi_5_4 + P-setbi_5_5 + P-setbi_5_6 + P-setbi_5_7))) : NOT((E (F (((P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4 + P-start_1_5 + P-start_1_6 + P-start_1_7 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P-fordo_12_4 + P-fordo_12_5 + P-fordo_12_6 + P-fordo_12_7) AND (1 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + P-ifyi_15_5 + P-ifyi_15_6 + P-ifyi_15_7)))) AND A (((3 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5 + P-awaity_6 + P-awaity_7) U (P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 + P-setx_3_4 + P-setx_3_5 + P-setx_3_6 + P-setx_3_7 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 + P-ifxi_10_5 + P-ifxi_10_6 + P-ifxi_10_7))))) : A (F ((2 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4 + P-sety_9_5 + P-sety_9_6 + P-sety_9_7))) : E (F (A (G (((3 <= P-wait_5_7 + P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + P-wait_5_3 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_0_5 + P-wait_0_6 + P-wait_0_7 + P-wait_5_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_1_5 + P-wait_1_6 + P-wait_1_7 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_2_5 + P-wait_2_6 + P-wait_2_7 + P-wait_5_1 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_3_5 + P-wait_3_6 + P-wait_3_7 + P-wait_5_0 + P-wait_4_7 + P-wait_4_6 + P-wait_4_5 + P-wait_4_4 + P-wait_4_3 + P-wait_4_2 + P-wait_4_1 + P-wait_4_0 + P-wait_6_0 + P-wait_6_1 + P-wait_6_2 + P-wait_6_3 + P-wait_6_4 + P-wait_6_5 + P-wait_6_6 + P-wait_6_7 + P-wait_7_0 + P-wait_7_1 + P-wait_7_2 + P-wait_7_3 + P-wait_7_4 + P-wait_7_5 + P-wait_7_6 + P-wait_7_7) AND (1 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + P-ifyi_15_5 + P-ifyi_15_6 + P-ifyi_15_7)))))) : E (((P-done_6_0 + P-done_6_1 + P-done_6_2 + P-done_6_3 + P-done_6_4 + P-done_6_5 + P-done_6_6 + P-done_6_7 + P-done_7_0 + P-done_7_1 + P-done_7_2 + P-done_7_3 + P-done_7_4 + P-done_7_5 + P-done_7_6 + P-done_7_7 + P-done_0_7 + P-done_0_6 + P-done_0_5 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_1 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_1_3 + P-done_1_4 + P-done_1_5 + P-done_1_6 + P-done_1_7 + P-done_0_0 + P-done_2_0 + P-done_2_1 + P-done_2_2 + P-done_2_3 + P-done_2_4 + P-done_2_5 + P-done_2_6 + P-done_2_7 + P-done_3_0 + P-done_3_1 + P-done_3_2 + P-done_3_3 + P-done_3_4 + P-done_3_5 + P-done_3_6 + P-done_3_7 + P-done_4_0 + P-done_4_1 + P-done_4_2 + P-done_4_3 + P-done_4_4 + P-done_4_5 + P-done_4_6 + P-done_4_7 + P-done_5_0 + P-done_5_1 + P-done_5_2 + P-done_5_3 + P-done_5_4 + P-done_5_5 + P-done_5_6 + P-done_5_7 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3 + P-setbi_5_4 + P-setbi_5_5 + P-setbi_5_6 + P-setbi_5_7) U E (G ((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4 + P-setbi_24_5 + P-setbi_24_6 + P-setbi_24_7))))) : E (F (E (G (((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 + P-CS_21_5 + P-CS_21_6 + P-CS_21_7) AND (1 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4 + P-sety_9_5 + P-sety_9_6 + P-sety_9_7)))))) : NOT(((E (G ((2 <= P-wait_4_6))) AND A (X ((P-start_1_1 <= P-wait_1_2)))) OR NOT(E (G ((P-setbi_5_7 <= P-wait_4_4)))))) : A (X (E (G ((P-b_0_false <= 0))))) : E (G (((P-setx_3_6 <= 2) AND (P-fordo_12_5 <= 0)))) : (A (G (((P-ifyi_15_5 <= 2) OR (P-setbi_11_3 + 1 <= P-start_1_4)))) AND A (F (((3 <= P-sety_9_2) OR (3 <= P-setx_3_0) OR (P-wait_4_0 <= 0))))) : E (F ((((1 <= P-CS_21_5) OR (2 <= P-wait_2_5) OR ((P-wait_2_5 <= P-done_1_0) AND (3 <= P-await_13_3))) AND E (G ((P-wait_4_1 <= P-done_2_6)))))) : NOT((((P-done_5_2 + 1 <= P-setbi_11_2) OR (P-done_2_2 + 1 <= P-wait_4_1) OR ((x_5 <= 0) AND (P-done_3_0 + 1 <= P-sety_9_4))) OR E (F (((P-wait_2_7 <= P-start_1_0) AND (2 <= P-setx_3_3)))))) : NOT((A (F ((P-wait_2_6 + 1 <= P-fordo_12_0))) AND A (G ((P-setbi_24_4 <= 2))))) : (((((P-await_13_1 <= 1) AND (P-sety_9_1 <= 0)) OR ((P-done_3_0 + 1 <= P-b_2_false) AND (P-done_3_7 + 1 <= P-start_1_1))) AND A (F (((2 <= P-wait_0_1) AND (P-wait_4_5 <= P-ifyi_15_6))))) OR E (G (A (F ((3 <= P-b_4_false))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 + P-ifxi_10_5 + P-ifxi_10_6 + P-ifxi_10_7) AND (2 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7) AND (P-done_6_0 + P-done_6_1 + P-done_6_2 + P-done_6_3 + P-done_6_4 + P-done_6_5 + P-done_6_6 + P-done_6_7 + P-done_7_0 + P-done_7_1 + P-done_7_2 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 + P-ifxi_10_5 + P-ifxi_10_6 + P-ifxi_10_7) AND (2 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7) AND (P-done_6_0 + P-done_6_1 + P-done_6_2 + P-done_6_3 + P-done_6_4 + P-done_6_5 + P-done_6_6 + P-done_6_7 + P-done_7_0 + P-done_7_1 + P-done_7_2 + P-done_7_3 + P-done_7_4 + P-done_7_5 + P-done_7_6 + P-done_7_7 + P-done_0_7 + P-done_0_6 + P-done_0_5 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_1 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_1_3 + P-done_1_4 + P-done_1_5 + P-done_1_6 + P-done_1_7 + P-done_0_0 + P-done_2_0 + P-done_2_1 + P-done_2_2 + P-done_2_3 + P-done_2_4 + P-done_2_5 + P-done_2_6 + P-done_2_7 + P-done_3_0 + P-done_3_1 + P-done_3_2 + P-done_3_3 + P-done_3_4 + P-done_3_5 + P-done_3_6 + P-done_3_7 + P-done_4_0 + P-done_4_1 + P-done_4_2 + P-done_4_3 + P-done_4_4 + P-done_4_5 + P-done_4_6 + P-done_4_7 + P-done_5_0 + P-done_5_1 + P-done_5_2 + P-done_5_3 + P-done_5_4 + P-done_5_5 + P-done_5_6 + P-done_5_7 <= P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4 + P-await_13_5 + P-await_13_6 + P-await_13_7) AND (P-wait_5_7 + P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + P-wait_5_3 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_0_5 + P-wait_0_6 + P-wait_0_7 + P-wait_5_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_1_5 + P-wait_1_6 + P-wait_1_7 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_2_5 + P-wait_2_6 + P-wait_2_7 + P-wait_5_1 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_3_5 + P-wait_3_6 + P-wait_3_7 + P-wait_5_0 + P-wait_4_7 + P-wait_4_6 + P-wait_4_5 + P-wait_4_4 + P-wait_4_3 + P-wait_4_2 + P-wait_4_1 + P-wait_4_0 + P-wait_6_0 + P-wait_6_1 + P-wait_6_2 + P-wait_6_3 + P-wait_6_4 + P-wait_6_5 + P-wait_6_6 + P-wait_6_7 + P-wait_7_0 + P-wait_7_1 + P-wait_7_2 + P-wait_7_3 + P-wait_7_4 + P-wait_7_5 + P-wait_7_6 + P-wait_7_7 <= 0) AND (P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4 + P-setbi_24_5 + P-setbi_24_6 + P-setbi_24_7 + 1 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 + P-ifxi_10_5 + P-ifxi_10_6 + P-ifxi_10_7))))
lola: processed formula: A (F (((2 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 + P-ifxi_10_5 + P-ifxi_10_6 + P-ifxi_10_7) AND (2 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7) AND (P-done_6_0 + P-done_6_1 + P-done_6_2 + P-done_6_3 + P-done_6_4 + P-done_6_5 + P-done_6_6 + P-done_6_7 + P-done_7_0 + P-done_7_1 + P-done_7_2 +... (shortened)
lola: processed formula length: 2294
lola: 0 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 9 unused bits
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: 30 markings, 30 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4 + P-await_13_5 + P-await_13_6 + P-await_13_7 <= P-wait_5_7 + P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + P-wait_5_3 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_0_5 + P-wait_0_6 + P-wait_0_7 + P-wait_5_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_1_5 + P-wait_1_6 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-7-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-7-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 28266 markings, 52184 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3 + P-setbi_5_4 + P-setbi_5_5 + P-setbi_5_6 + P-setbi_5_7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3 + P-setbi_5_4 + P-setbi_5_5 + P-setbi_5_6 + P-setbi_5_7)))
lola: processed formula: A (F ((1 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3 + P-setbi_5_4 + P-setbi_5_5 + P-setbi_5_6 + P-setbi_5_7)))
lola: processed formula length: 124
lola: 0 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 167924 markings, 304031 edges, 33585 markings/sec, 0 secs
lola: 317282 markings, 616431 edges, 29872 markings/sec, 5 secs
lola: 470753 markings, 918086 edges, 30694 markings/sec, 10 secs
lola: 611614 markings, 1199686 edges, 28172 markings/sec, 15 secs
lola: 761031 markings, 1516286 edges, 29883 markings/sec, 20 secs
lola: 965173 markings, 1993142 edges, 40828 markings/sec, 25 secs
lola: 1179775 markings, 2509467 edges, 42920 markings/sec, 30 secs
lola: 1392874 markings, 3032630 edges, 42620 markings/sec, 35 secs
lola: 1603914 markings, 3566588 edges, 42208 markings/sec, 40 secs
lola: 1822655 markings, 4104724 edges, 43748 markings/sec, 45 secs
lola: 1983495 markings, 4491527 edges, 32168 markings/sec, 50 secs
lola: 2154714 markings, 4937504 edges, 34244 markings/sec, 55 secs
lola: 2337808 markings, 5434137 edges, 36619 markings/sec, 60 secs
lola: 2499595 markings, 5882880 edges, 32357 markings/sec, 65 secs
lola: 2662755 markings, 6333551 edges, 32632 markings/sec, 70 secs
lola: 2822391 markings, 6776780 edges, 31927 markings/sec, 75 secs
lola: 2983086 markings, 7230450 edges, 32139 markings/sec, 80 secs
lola: 3148965 markings, 7708257 edges, 33176 markings/sec, 85 secs
lola: 3294145 markings, 8106597 edges, 29036 markings/sec, 90 secs
lola: 3457799 markings, 8453396 edges, 32731 markings/sec, 95 secs
lola: 3688806 markings, 9024060 edges, 46201 markings/sec, 100 secs
lola: 3926082 markings, 9600093 edges, 47455 markings/sec, 105 secs
lola: 4159440 markings, 10165316 edges, 46672 markings/sec, 110 secs
lola: 4389862 markings, 10737545 edges, 46084 markings/sec, 115 secs
lola: 4578996 markings, 11199672 edges, 37827 markings/sec, 120 secs
lola: 4736473 markings, 11598039 edges, 31495 markings/sec, 125 secs
lola: 4895885 markings, 12030389 edges, 31882 markings/sec, 130 secs
lola: 5061136 markings, 12477291 edges, 33050 markings/sec, 135 secs
lola: 5236882 markings, 12964678 edges, 35149 markings/sec, 140 secs
lola: 5431635 markings, 13504374 edges, 38951 markings/sec, 145 secs
lola: 5659788 markings, 14147494 edges, 45631 markings/sec, 150 secs
lola: 5883551 markings, 14809715 edges, 44753 markings/sec, 155 secs
lola: 6034339 markings, 15120248 edges, 30158 markings/sec, 160 secs
lola: 6202474 markings, 15512484 edges, 33627 markings/sec, 165 secs
lola: 6370613 markings, 15915875 edges, 33628 markings/sec, 170 secs
lola: 6541201 markings, 16342983 edges, 34118 markings/sec, 175 secs
lola: 6710207 markings, 16748986 edges, 33801 markings/sec, 180 secs
lola: 6880828 markings, 17178927 edges, 34124 markings/sec, 185 secs
lola: 7056512 markings, 17610860 edges, 35137 markings/sec, 190 secs
lola: 7205038 markings, 17978070 edges, 29705 markings/sec, 195 secs
lola: 7358486 markings, 18367531 edges, 30690 markings/sec, 200 secs
lola: 7510377 markings, 18790504 edges, 30378 markings/sec, 205 secs
lola: 7668329 markings, 19204802 edges, 31590 markings/sec, 210 secs
lola: 7822400 markings, 19646861 edges, 30814 markings/sec, 215 secs
lola: 7970845 markings, 20039111 edges, 29689 markings/sec, 220 secs
lola: 8112547 markings, 20439328 edges, 28340 markings/sec, 225 secs
lola: 8269010 markings, 20878206 edges, 31293 markings/sec, 230 secs
lola: 8425045 markings, 21333095 edges, 31207 markings/sec, 235 secs
lola: 8560266 markings, 21694003 edges, 27044 markings/sec, 240 secs
lola: 8695111 markings, 21978804 edges, 26969 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (((P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4 + P-start_1_5 + P-start_1_6 + P-start_1_7 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P-fordo_12_4 + P-fordo_12_5 + P-fordo_12_6 + P-fordo_12_7) AND (1 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + P-ifyi_15_5 + P-ifyi_15_6 + P-ifyi_15_7)))) AND A (((3 <= P-awaity_0 + P-aw... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P-fordo_12_4 + P-fordo_12_5 + P-fordo_12_6 + P-fordo_12_7 + 1 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4 + P-start_1_5 + P-start_1_6 + P-start_1_7) OR (P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + P-ifyi_15_5 + P-ifyi_15_6 + P-ifyi_15_7 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40 markings, 39 edges
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5 + P-awaity_6 + P-awaity_7 <= 2) R (P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 + P-ifxi_10_5 + P-ifxi_10_6 + P-ifxi_10_7 + 1 <= P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 + P-setx_3_4 + P-setx_3_5 + P-setx_3_6 + P-setx_3_7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((3 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5 + P-awaity_6 + P-awaity_7) U (P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 + P-setx_3_4 + P-setx_3_5 + P-setx_3_6 + P-setx_3_7 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 + P-ifxi_10_5 + P-ifxi_10_6 + P-ifxi_10_7)))
lola: processed formula length: 335
lola: 11 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4 + P-sety_9_5 + P-sety_9_6 + P-sety_9_7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4 + P-sety_9_5 + P-sety_9_6 + P-sety_9_7)))
lola: processed formula: A (F ((2 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4 + P-sety_9_5 + P-sety_9_6 + P-sety_9_7)))
lola: processed formula length: 116
lola: 0 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 9 unused bits
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: 148 markings, 148 edges
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((3 <= P-wait_5_7 + P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + P-wait_5_3 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_0_5 + P-wait_0_6 + P-wait_0_7 + P-wait_5_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_1_5 + P-wait_1_6 + P-wait_1_7 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_2_5 + P-wait_2_6 + P-wa... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U ((P-wait_5_7 + P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + P-wait_5_3 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_0_5 + P-wait_0_6 + P-wait_0_7 + P-wait_5_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_1_5 + P-wait_1_6 + P-wait_1_7 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_2_5 + P-wait_2_6 +... (shortened)
lola: processed formula length: 984
lola: 3 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 915267 markings, 3070818 edges, 2017605623675355136 markings/sec, 0 secs
lola: 1693694 markings, 6322185 edges, 155685 markings/sec, 5 secs
lola: 2425283 markings, 9622614 edges, 146318 markings/sec, 10 secs
lola: 3092915 markings, 12926073 edges, 133526 markings/sec, 15 secs
lola: 3803541 markings, 16223775 edges, 142125 markings/sec, 20 secs
lola: 4404624 markings, 19378997 edges, 120217 markings/sec, 25 secs
lola: 5028834 markings, 22547953 edges, 124842 markings/sec, 30 secs
lola: 5667663 markings, 25597526 edges, 127766 markings/sec, 35 secs
lola: 6297446 markings, 28791861 edges, 125957 markings/sec, 40 secs
lola: 6933191 markings, 32027526 edges, 127149 markings/sec, 45 secs
lola: 7508236 markings, 35196624 edges, 115009 markings/sec, 50 secs
lola: 8114498 markings, 38413711 edges, 121252 markings/sec, 55 secs
lola: 8710066 markings, 41570425 edges, 119114 markings/sec, 60 secs
lola: 9263126 markings, 44632970 edges, 110612 markings/sec, 65 secs
lola: 9875630 markings, 48104294 edges, 122501 markings/sec, 70 secs
lola: 10440397 markings, 51195943 edges, 112953 markings/sec, 75 secs
lola: 10991490 markings, 54226656 edges, 110219 markings/sec, 80 secs
lola: 11568879 markings, 57366716 edges, 115478 markings/sec, 85 secs
lola: 12136965 markings, 60469908 edges, 113617 markings/sec, 90 secs
lola: 12659699 markings, 63513575 edges, 104547 markings/sec, 95 secs
lola: 13268535 markings, 66836112 edges, 121767 markings/sec, 100 secs
lola: 13845626 markings, 70104829 edges, 115418 markings/sec, 105 secs
lola: 14404548 markings, 73328256 edges, 111784 markings/sec, 110 secs
lola: 14938661 markings, 76327366 edges, 106823 markings/sec, 115 secs
lola: 15494486 markings, 79283960 edges, 111165 markings/sec, 120 secs
lola: 16048401 markings, 82255539 edges, 110783 markings/sec, 125 secs
lola: 16590358 markings, 85219131 edges, 108391 markings/sec, 130 secs
lola: 17182386 markings, 88345190 edges, 118406 markings/sec, 135 secs
lola: 17718502 markings, 91402419 edges, 107223 markings/sec, 140 secs
lola: 18253145 markings, 94336150 edges, 106929 markings/sec, 145 secs
lola: 18771579 markings, 97251103 edges, 103687 markings/sec, 150 secs
lola: 19312361 markings, 100250626 edges, 108156 markings/sec, 155 secs
lola: 19838269 markings, 103341075 edges, 105182 markings/sec, 160 secs
lola: 20388453 markings, 106421735 edges, 110037 markings/sec, 165 secs
lola: 20920401 markings, 109291219 edges, 106390 markings/sec, 170 secs
lola: 21426880 markings, 112076078 edges, 101296 markings/sec, 175 secs
lola: 21956186 markings, 115125046 edges, 105861 markings/sec, 180 secs
lola: 22483813 markings, 118097233 edges, 105525 markings/sec, 185 secs
lola: 22989003 markings, 121043593 edges, 101038 markings/sec, 190 secs
lola: 23534107 markings, 124048614 edges, 109021 markings/sec, 195 secs
lola: 24061335 markings, 126880197 edges, 105446 markings/sec, 200 secs
lola: 24578628 markings, 129951280 edges, 103459 markings/sec, 205 secs
lola: 25086567 markings, 133016341 edges, 101588 markings/sec, 210 secs
lola: 25608937 markings, 136064660 edges, 104474 markings/sec, 215 secs
lola: 26130475 markings, 139011035 edges, 104308 markings/sec, 220 secs
lola: 26643791 markings, 141910469 edges, 102663 markings/sec, 225 secs
lola: 27158041 markings, 144834113 edges, 102850 markings/sec, 230 secs
lola: 27661849 markings, 147649144 edges, 100762 markings/sec, 235 secs
lola: 28168839 markings, 150512603 edges, 101398 markings/sec, 240 secs
lola: 28673755 markings, 153342230 edges, 100983 markings/sec, 245 secs
lola: 29187970 markings, 156157970 edges, 102843 markings/sec, 250 secs
lola: 29703396 markings, 159031344 edges, 103085 markings/sec, 255 secs
lola: 30208284 markings, 161808540 edges, 100978 markings/sec, 260 secs
lola: 30722509 markings, 164748421 edges, 102845 markings/sec, 265 secs
lola: 31225845 markings, 167736236 edges, 100667 markings/sec, 270 secs
lola: 31719606 markings, 170545327 edges, 98752 markings/sec, 275 secs
lola: 32218093 markings, 173332676 edges, 99697 markings/sec, 280 secs
lola: 32703271 markings, 176135407 edges, 97036 markings/sec, 285 secs
lola: 33174357 markings, 178953460 edges, 94217 markings/sec, 290 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((P-done_6_0 + P-done_6_1 + P-done_6_2 + P-done_6_3 + P-done_6_4 + P-done_6_5 + P-done_6_6 + P-done_6_7 + P-done_7_0 + P-done_7_1 + P-done_7_2 + P-done_7_3 + P-done_7_4 + P-done_7_5 + P-done_7_6 + P-done_7_7 + P-done_0_7 + P-done_0_6 + P-done_0_5 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_1 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_1_3 + P-done_1_4 + P-done_1_5 + P-done_1_6 + P-don... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((P-done_6_0 + P-done_6_1 + P-done_6_2 + P-done_6_3 + P-done_6_4 + P-done_6_5 + P-done_6_6 + P-done_6_7 + P-done_7_0 + P-done_7_1 + P-done_7_2 + P-done_7_3 + P-done_7_4 + P-done_7_5 + P-done_7_6 + P-done_7_7 + P-done_0_7 + P-done_0_6 + P-done_0_5 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_1 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_1_3 + P-done_1_4 + P-done_1_5 + P-done_1_6 + P-done_... (shortened)
lola: processed formula length: 1209
lola: 3 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 26 markings, 27 edges
lola: ========================================
lola: subprocess 7 will run for 332 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 + P-CS_21_5 + P-CS_21_6 + P-CS_21_7) AND (1 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4 + P-sety_9_5 + P-sety_9_6 + P-sety_9_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U ((P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 + P-CS_21_5 + P-CS_21_6 + P-CS_21_7 + 1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7) OR (P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4 + P-sety_9_5 + P-sety_9_6 + P-sety_9_7 <= 0)))))
lola: processed formula length: 360
lola: 3 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 19956 markings, 38503 edges
lola: ========================================
lola: subprocess 8 will run for 373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (G ((2 <= P-wait_4_6))) AND A (X ((P-start_1_1 <= P-wait_1_2)))) OR NOT(E (G ((P-setbi_5_7 <= P-wait_4_4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((P-wait_4_6 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((P-wait_4_6 <= 1)))
lola: processed formula: A (F ((P-wait_4_6 <= 1)))
lola: processed formula length: 25
lola: 14 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 9 unused bits
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: ========================================
lola: subprocess 9 will run for 427 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((P-setbi_5_7 <= P-wait_4_4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (P-wait_4_4 + 1 <= P-setbi_5_7)))
lola: processed formula length: 46
lola: 16 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 26 markings, 26 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 427 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((P-b_0_false <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (1 <= P-b_0_false))))
lola: processed formula length: 37
lola: 3 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 139 markings, 145 edges
lola: ========================================
lola: subprocess 10 will run for 498 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((P-setx_3_6 <= 2) AND (P-fordo_12_5 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((3 <= P-setx_3_6) OR (1 <= P-fordo_12_5))))
lola: processed formula length: 58
lola: 2 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 11 will run for 597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((P-ifyi_15_5 <= 2) OR (P-setbi_11_3 + 1 <= P-start_1_4)))) AND A (F (((3 <= P-sety_9_2) OR (3 <= P-setx_3_0) OR (P-wait_4_0 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P-ifyi_15_5 <= 2) OR (P-setbi_11_3 + 1 <= P-start_1_4))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-7-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-7-CTLCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: subprocess 12 will run for 747 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= P-sety_9_2) OR (3 <= P-setx_3_0) OR (P-wait_4_0 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((3 <= P-sety_9_2) OR (3 <= P-setx_3_0) OR (P-wait_4_0 <= 0))))
lola: processed formula: A (F (((3 <= P-sety_9_2) OR (3 <= P-setx_3_0) OR (P-wait_4_0 <= 0))))
lola: processed formula length: 71
lola: 0 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 9 unused bits
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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 747 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= P-CS_21_5) OR (2 <= P-wait_2_5) OR ((P-wait_2_5 <= P-done_1_0) AND (3 <= P-await_13_3))) AND E (G ((P-wait_4_1 <= P-done_2_6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: E(TRUE U (((1 <= P-CS_21_5) OR (2 <= P-wait_2_5) OR ((P-wait_2_5 <= P-done_1_0) AND (3 <= P-await_13_3))) AND NOT(A(TRUE U (P-done_2_6 + 1 <= P-wait_4_1)))))
lola: processed formula length: 159
lola: 3 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14163 markings, 19527 edges
lola: ========================================
lola: subprocess 13 will run for 996 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((P-done_5_2 + 1 <= P-setbi_11_2) OR (P-done_2_2 + 1 <= P-wait_4_1) OR ((x_5 <= 0) AND (P-done_3_0 + 1 <= P-sety_9_4))) OR E (F (((P-wait_2_7 <= P-start_1_0) AND (2 <= P-setx_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 996 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P-setbi_11_2 <= P-done_5_2) AND (P-wait_4_1 <= P-done_2_2) AND ((1 <= x_5) OR (P-sety_9_4 <= P-done_3_0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P-setbi_11_2 <= P-done_5_2) AND (P-wait_4_1 <= P-done_2_2) AND ((1 <= x_5) OR (P-sety_9_4 <= P-done_3_0)))
lola: processed formula length: 109
lola: 5 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-7-CTLCardinality.task
lola: processed formula with 4 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: ========================================
lola: subprocess 14 will run for 1494 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P-start_1_0 + 1 <= P-wait_2_7) OR (P-setx_3_3 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-7-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-7-CTLCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1494 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F ((P-wait_2_6 + 1 <= P-fordo_12_0))) AND A (G ((P-setbi_24_4 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1494 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((P-fordo_12_0 <= P-wait_2_6)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (P-wait_2_6 + 1 <= P-fordo_12_0)))
lola: processed formula length: 47
lola: 9 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 26 markings, 26 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2988 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((P-await_13_1 <= 1) AND (P-sety_9_1 <= 0)) OR ((P-done_3_0 + 1 <= P-b_2_false) AND (P-done_3_7 + 1 <= P-start_1_1))) AND A (F (((2 <= P-wait_0_1) AND (P-wait_4_5 <= P-ifyi_15_6))))) OR E (G (A (F ((3 <= P-b_4_false))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2988 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((P-await_13_1 <= 1) AND (P-sety_9_1 <= 0)) OR ((P-done_3_0 + 1 <= P-b_2_false) AND (P-done_3_7 + 1 <= P-start_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((P-await_13_1 <= 1) AND (P-sety_9_1 <= 0)) OR ((P-done_3_0 + 1 <= P-b_2_false) AND (P-done_3_7 + 1 <= P-start_1_1)))
lola: processed formula length: 119
lola: 0 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-7-CTLCardinality.task
lola: processed formula with 4 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: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((3 <= P-b_4_false)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (3 <= P-b_4_false)))))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 26 markings, 27 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown no no unknown yes yes yes yes yes yes yes yes yes unknown
FORMULA LamportFastMutEx-PT-7-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-7-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-7-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-7-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-7-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-7-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-7-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-7-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-7-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-7-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-7-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-7-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-7-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-7-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-7-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-7-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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="LamportFastMutEx-PT-7"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-7.tgz
mv LamportFastMutEx-PT-7 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is LamportFastMutEx-PT-7, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-csrt-152666472300143"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;