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 852K
-rw-r--r-- 1 mcc users 8.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 36K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K 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 4.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 52K 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 29K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K 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 317K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is LamportFastMutEx-PT-8, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666473700152
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527151479438


BK_STOP 1527151920105

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using LamportFastMutEx-PT-8 as instance name.
Using LamportFastMutEx as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': 1077967, 'Memory': 15951.52, 'Tool': 'lola'}, {'Time': 1078344, 'Memory': 15671.9, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola LamportFastMutEx-PT-8...

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


checking for too many tokens
===========================================================================================
LamportFastMutEx-PT-8: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ LamportFastMutEx-PT-8 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 981/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 315 places, 666 transitions, 214 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 947 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-PT-8-ReachabilityCardinality.task
lola: E (F ((((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-setx_3_8 + 1 <= 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-fordo_12_8) AND (P-b_6_true + P-b_1_true + P-b_5_false + P-b_4_false + P-b_3_false + P-b_2_false + P-b_7_true + P-b_0_false + P-b_8_true + P-b_0_true + P-b_5_true + P-b_2_true + P-b_1_false + P-b_4_true + P-b_6_false + P-b_3_true + P-b_8_false + P-b_7_false <= 1)) OR ((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-setx_3_8 + 1 <= 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 + P-setbi_24_8) AND (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_11_8 <= 2))))) : A (G ((P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 + P-ify0_4_5 + P-ify0_4_6 + P-ify0_4_7 + P-ify0_4_8 <= P-b_6_true + P-b_1_true + P-b_5_false + P-b_4_false + P-b_3_false + P-b_2_false + P-b_7_true + P-b_0_false + P-b_8_true + P-b_0_true + P-b_5_true + P-b_2_true + P-b_1_false + P-b_4_true + P-b_6_false + P-b_3_true + P-b_8_false + P-b_7_false))) : A (G (((2 <= 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 + P-setbi_5_8) OR (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 + P-ifxi_10_8 <= 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_6_8 + 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_7_8 + P-done_8_0 + P-done_8_1 + P-done_8_2 + P-done_8_3 + P-done_8_4 + P-done_8_5 + P-done_8_6 + P-done_8_7 + P-done_8_8 + P-done_0_8 + P-done_0_7 + P-done_0_6 + P-done_0_5 + P-done_0_4 + P-done_0_3 + 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_1_8 + P-done_0_2 + P-done_0_1 + 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_2_8 + 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_3_8 + 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_4_8 + 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-done_5_8) 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 + P-ifyi_15_8 <= 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-setx_3_8) OR (2 <= y_0 + y_1 + y_2 + y_3 + y_4 + y_5 + y_6 + y_7 + y_8) 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 + P-sety_9_8 + 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 + P-start_1_8)))) : A (G ((((y_0 + y_1 + y_2 + y_3 + y_4 + y_5 + y_6 + y_7 + y_8 <= 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 + P-ifxi_10_8) AND (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-setx_3_8 <= P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 + P-ify0_4_5 + P-ify0_4_6 + P-ify0_4_7 + P-ify0_4_8)) OR ((3 <= P-b_6_true + P-b_1_true + P-b_5_false + P-b_4_false + P-b_3_false + P-b_2_false + P-b_7_true + P-b_0_false + P-b_8_true + P-b_0_true + P-b_5_true + P-b_2_true + P-b_1_false + P-b_4_true + P-b_6_false + P-b_3_true + P-b_8_false + P-b_7_false) AND (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-await_13_8 <= 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_6_8 + 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_7_8 + P-done_8_0 + P-done_8_1 + P-done_8_2 + P-done_8_3 + P-done_8_4 + P-done_8_5 + P-done_8_6 + P-done_8_7 + P-done_8_8 + P-done_0_8 + P-done_0_7 + P-done_0_6 + P-done_0_5 + P-done_0_4 + P-done_0_3 + 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_1_8 + P-done_0_2 + P-done_0_1 + 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_2_8 + 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_3_8 + 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_4_8 + 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-done_5_8)) OR (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 + P-setbi_24_8 <= 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-setx_3_8)))) : A (G (((P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 + P-ify0_4_5 + P-ify0_4_6 + P-ify0_4_7 + P-ify0_4_8 + 1 <= 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_6_8 + 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_7_8 + P-done_8_0 + P-done_8_1 + P-done_8_2 + P-done_8_3 + P-done_8_4 + P-done_8_5 + P-done_8_6 + P-done_8_7 + P-done_8_8 + P-done_0_8 + P-done_0_7 + P-done_0_6 + P-done_0_5 + P-done_0_4 + P-done_0_3 + 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_1_8 + P-done_0_2 + P-done_0_1 + 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_2_8 + 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_3_8 + 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_4_8 + 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-done_5_8) OR (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 + P-CS_21_8 + 1 <= x_0 + x_1 + x_2 + x_3 + x_4 + x_5 + x_6 + x_7 + x_8) OR (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 + P-ifxi_10_8 <= 2)))) : 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 + P-fordo_12_8 <= 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-await_13_8))) : E (F (((P-b_6_true + P-b_1_true + P-b_5_false + P-b_4_false + P-b_3_false + P-b_2_false + P-b_7_true + P-b_0_false + P-b_8_true + P-b_0_true + P-b_5_true + P-b_2_true + P-b_1_false + P-b_4_true + P-b_6_false + P-b_3_true + P-b_8_false + P-b_7_false <= 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-setx_3_8) AND (3 <= 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 + P-ifyi_15_8) AND (x_0 + x_1 + x_2 + x_3 + x_4 + x_5 + x_6 + x_7 + x_8 <= 1) AND ((P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 + P-ify0_4_5 + P-ify0_4_6 + P-ify0_4_7 + P-ify0_4_8 + 1 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5 + P-awaity_6 + P-awaity_7 + P-awaity_8) OR (y_0 + y_1 + y_2 + y_3 + y_4 + y_5 + y_6 + y_7 + y_8 <= P-b_6_true + P-b_1_true + P-b_5_false + P-b_4_false + P-b_3_false + P-b_2_false + P-b_7_true + P-b_0_false + P-b_8_true + P-b_0_true + P-b_5_true + P-b_2_true + P-b_1_false + P-b_4_true + P-b_6_false + P-b_3_true + P-b_8_false + P-b_7_false))))) : E (F (((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 + P-ifxi_10_8 + 1 <= 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 + P-setbi_24_8) AND (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 + P-CS_21_8 + 1 <= P-wait_5_8 + P-wait_5_7 + P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + 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_0_8 + P-wait_5_3 + 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_1_8 + 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_2_8 + P-wait_5_2 + 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_3_8 + P-wait_5_1 + P-wait_5_0 + P-wait_4_8 + P-wait_4_7 + P-wait_4_6 + P-wait_4_5 + P-wait_4_4 + P-wait_4_3 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + 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_6_8 + 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 + P-wait_7_8 + P-wait_8_0 + P-wait_8_1 + P-wait_8_2 + P-wait_8_3 + P-wait_8_4 + P-wait_8_5 + P-wait_8_6 + P-wait_8_7 + P-wait_8_8) AND (P-b_6_true + P-b_1_true + P-b_5_false + P-b_4_false + P-b_3_false + P-b_2_false + P-b_7_true + P-b_0_false + P-b_8_true + P-b_0_true + P-b_5_true + P-b_2_true + P-b_1_false + P-b_4_true + P-b_6_false + P-b_3_true + P-b_8_false + P-b_7_false <= 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_11_8)))) : E (F (((2 <= P-wait_3_5) OR ((3 <= P-done_8_5) AND (1 <= P-done_4_7) AND (P-b_1_true <= P-fordo_12_0))))) : A (G (((P-done_4_5 <= 2) OR ((P-fordo_12_4 + 1 <= P-wait_4_5) AND (P-fordo_12_4 <= 1))))) : A (G (((P-sety_9_8 <= 1) OR (P-done_8_4 + 1 <= P-done_7_7) OR (P-done_6_7 <= 0) OR (P-done_0_0 + 1 <= P-wait_1_1)))) : A (G ((P-done_0_2 <= P-wait_8_4))) : A (G (((P-start_1_5 <= P-wait_6_3) OR (P-done_4_7 <= P-done_4_0) OR ((P-start_1_1 <= P-wait_5_8) AND (P-b_6_false <= P-await_13_0)) OR (P-wait_5_2 <= P-b_8_true)))) : E (F ((3 <= P-wait_3_3))) : E (F (((P-ifxi_10_1 + 1 <= P-CS_21_5) AND (P-setbi_11_1 + 1 <= P-wait_3_8) AND ((2 <= P-wait_8_4) OR (1 <= P-done_3_3))))) : E (F (((P-CS_21_6 <= 2) AND (P-setbi_5_2 <= x_1) AND ((2 <= P-wait_5_5) OR (3 <= x_5)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((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-setx_3_8 + 1 <= 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-fordo_12_8) AND (P-b_6_true + P-b_1_true + P-b_5_false + P-b_4_false + P-b_3_false + P-b_2_false + P-b_7_true + P-b_0_false + P-b_8_true + P-b_0_tr... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 47 markings, 46 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 + P-ify0_4_5 + P-ify0_4_6 + P-ify0_4_7 + P-ify0_4_8 <= P-b_6_true + P-b_1_true + P-b_5_false + P-b_4_false + P-b_3_false + P-b_2_false + P-b_7_true + P-b_0_false + P-b_8_true + P-b_0_true + P-b_5_true + P-b_2_true + P-b_1_false + P-b_4_true + P-b_6_false + P-b_3_true + P-b_8_false + P-b_7_false)))
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 28 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-8-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-8-ReachabilityCardinality.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: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= 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 + P-setbi_5_8) OR (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 + P-ifxi_10_8 <= 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_6_8 + P-done_7_0 + ... (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 28 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 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-8-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-8-ReachabilityCardinality-2.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: 24254 markings, 115757 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((y_0 + y_1 + y_2 + y_3 + y_4 + y_5 + y_6 + y_7 + y_8 <= 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 + P-ifxi_10_8) AND (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-setx_3_8 <= P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 + P-ify0_4_5 + P-ify0_4_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 28 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 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-8-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 58 markings, 57 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 + P-ify0_4_5 + P-ify0_4_6 + P-ify0_4_7 + P-ify0_4_8 + 1 <= 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_6_8 + 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_7_8 + P-done_8_0 + P-done_8_1 + P-done_8_2... (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 28 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-8-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-8-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 321 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 + P-fordo_12_8 <= 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-await_13_8)))
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 28 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-8-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((P-b_6_true + P-b_1_true + P-b_5_false + P-b_4_false + P-b_3_false + P-b_2_false + P-b_7_true + P-b_0_false + P-b_8_true + P-b_0_true + P-b_5_true + P-b_2_true + P-b_1_false + P-b_4_true + P-b_6_false + P-b_3_true + P-b_8_false + P-b_7_false <= 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-setx_3_8) AND (3 <= P-ifyi_15_0 + P-ifyi_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-8-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-8-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((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 + P-ifxi_10_8 + 1 <= 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 + P-setbi_24_8) AND (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 + P-CS_21_8 + 1 <= P-wait_5_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-8-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-8-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 192767 markings, 897653 edges, 38553 markings/sec, 0 secs
lola: sara is running 5 secs || 380531 markings, 1812613 edges, 37553 markings/sec, 5 secs
lola: sara is running 10 secs || 564610 markings, 2729248 edges, 36816 markings/sec, 10 secs
lola: sara is running 15 secs || 747882 markings, 3655656 edges, 36654 markings/sec, 15 secs
lola: sara is running 20 secs || 927724 markings, 4570382 edges, 35968 markings/sec, 20 secs
lola: sara is running 25 secs || 1107030 markings, 5493457 edges, 35861 markings/sec, 25 secs
lola: sara is running 30 secs || 1289501 markings, 6396429 edges, 36494 markings/sec, 30 secs
lola: sara is running 35 secs || 1467357 markings, 7299176 edges, 35571 markings/sec, 35 secs
lola: sara is running 40 secs || 1648428 markings, 8193647 edges, 36214 markings/sec, 40 secs
lola: sara is running 45 secs || 1824874 markings, 9115751 edges, 35289 markings/sec, 45 secs
lola: sara is running 50 secs || 2004802 markings, 10055170 edges, 35986 markings/sec, 50 secs
lola: sara is running 55 secs || 2180726 markings, 10982745 edges, 35185 markings/sec, 55 secs
lola: sara is running 60 secs || 2356762 markings, 11925045 edges, 35207 markings/sec, 60 secs
lola: sara is running 65 secs || 2532311 markings, 12885665 edges, 35110 markings/sec, 65 secs
lola: sara is running 70 secs || 2713494 markings, 13808106 edges, 36237 markings/sec, 70 secs
lola: sara is running 75 secs || 2892593 markings, 14719468 edges, 35820 markings/sec, 75 secs
lola: sara is running 80 secs || 3067022 markings, 15663713 edges, 34886 markings/sec, 80 secs
lola: sara is running 85 secs || 3244493 markings, 16597789 edges, 35494 markings/sec, 85 secs
lola: sara is running 90 secs || 3420605 markings, 17562315 edges, 35222 markings/sec, 90 secs
lola: sara is running 95 secs || 3593800 markings, 18470422 edges, 34639 markings/sec, 95 secs
lola: sara is running 100 secs || 3766140 markings, 19378610 edges, 34468 markings/sec, 100 secs
lola: sara is running 105 secs || 3939570 markings, 20302130 edges, 34686 markings/sec, 105 secs
lola: sara is running 110 secs || 4110283 markings, 21275822 edges, 34143 markings/sec, 110 secs
lola: sara is running 115 secs || 4282539 markings, 22168813 edges, 34451 markings/sec, 115 secs
lola: sara is running 120 secs || 4450693 markings, 23063571 edges, 33631 markings/sec, 120 secs
lola: sara is running 125 secs || 4620761 markings, 24031726 edges, 34014 markings/sec, 125 secs
lola: sara is running 130 secs || 4795396 markings, 24948179 edges, 34927 markings/sec, 130 secs
lola: sara is running 135 secs || 4963455 markings, 25836246 edges, 33612 markings/sec, 135 secs
lola: sara is running 140 secs || 5140826 markings, 26743822 edges, 35474 markings/sec, 140 secs
lola: sara is running 145 secs || 5311412 markings, 27698039 edges, 34117 markings/sec, 145 secs
lola: sara is running 150 secs || 5486172 markings, 28605757 edges, 34952 markings/sec, 150 secs
lola: sara is running 155 secs || 5654857 markings, 29521524 edges, 33737 markings/sec, 155 secs
lola: sara is running 160 secs || 5820972 markings, 30429508 edges, 33223 markings/sec, 160 secs
lola: sara is running 165 secs || 5991088 markings, 31354744 edges, 34023 markings/sec, 165 secs
lola: sara is running 170 secs || 6158895 markings, 32293496 edges, 33561 markings/sec, 170 secs
lola: sara is running 175 secs || 6327574 markings, 33159681 edges, 33736 markings/sec, 175 secs
lola: sara is running 180 secs || 6498928 markings, 34051250 edges, 34271 markings/sec, 180 secs
lola: sara is running 185 secs || 6677604 markings, 34971658 edges, 35735 markings/sec, 185 secs
lola: sara is running 190 secs || 6848326 markings, 35893429 edges, 34144 markings/sec, 190 secs
lola: sara is running 195 secs || 7022161 markings, 36806751 edges, 34767 markings/sec, 195 secs
lola: sara is running 200 secs || 7197156 markings, 37787332 edges, 34999 markings/sec, 200 secs
lola: sara is running 205 secs || 7369529 markings, 38714346 edges, 34475 markings/sec, 205 secs
lola: sara is running 210 secs || 7543104 markings, 39656015 edges, 34715 markings/sec, 210 secs
lola: sara is running 215 secs || 7711703 markings, 40584041 edges, 33720 markings/sec, 215 secs
lola: sara is running 220 secs || 7885160 markings, 41483203 edges, 34691 markings/sec, 220 secs
lola: sara is running 225 secs || 8061659 markings, 42404820 edges, 35300 markings/sec, 225 secs
lola: sara is running 230 secs || 8233811 markings, 43352240 edges, 34430 markings/sec, 230 secs
lola: sara is running 235 secs || 8412924 markings, 44265327 edges, 35823 markings/sec, 235 secs
lola: sara is running 240 secs || 8580540 markings, 45199554 edges, 33523 markings/sec, 240 secs
lola: sara is running 245 secs || 8754582 markings, 46118540 edges, 34808 markings/sec, 245 secs
lola: sara is running 250 secs || 8937923 markings, 47093729 edges, 36668 markings/sec, 250 secs
lola: sara is running 255 secs || 9123670 markings, 48050057 edges, 37149 markings/sec, 255 secs
lola: sara is running 260 secs || 9295973 markings, 48979060 edges, 34461 markings/sec, 260 secs
lola: sara is running 265 secs || 9471769 markings, 49892638 edges, 35159 markings/sec, 265 secs
lola: sara is running 270 secs || 9641701 markings, 50812915 edges, 33986 markings/sec, 270 secs
lola: sara is running 275 secs || 9809988 markings, 51694165 edges, 33657 markings/sec, 275 secs
lola: sara is running 280 secs || 9978172 markings, 52620075 edges, 33637 markings/sec, 280 secs
lola: sara is running 285 secs || 10150967 markings, 53510444 edges, 34559 markings/sec, 285 secs
lola: sara is running 290 secs || 10320683 markings, 54504096 edges, 33943 markings/sec, 290 secs
lola: sara is running 295 secs || 10486713 markings, 55428611 edges, 33206 markings/sec, 295 secs
lola: sara is running 300 secs || 10657449 markings, 56357277 edges, 34147 markings/sec, 300 secs
lola: sara is running 305 secs || 10825325 markings, 57253657 edges, 33575 markings/sec, 305 secs
lola: sara is running 310 secs || 10998532 markings, 58170568 edges, 34641 markings/sec, 310 secs
lola: sara is running 315 secs || 11174587 markings, 59116407 edges, 35211 markings/sec, 315 secs
lola: sara is running 320 secs || 11341317 markings, 60134187 edges, 33346 markings/sec, 320 secs
lola: sara is running 325 secs || 11511398 markings, 61055290 edges, 34016 markings/sec, 325 secs
lola: sara is running 330 secs || 11682934 markings, 61975735 edges, 34307 markings/sec, 330 secs
lola: sara is running 335 secs || 11850215 markings, 62917581 edges, 33456 markings/sec, 335 secs
lola: sara is running 340 secs || 12030422 markings, 63896241 edges, 36041 markings/sec, 340 secs
lola: sara is running 345 secs || 12203020 markings, 64863194 edges, 34520 markings/sec, 345 secs
lola: sara is running 350 secs || 12391551 markings, 65853427 edges, 37706 markings/sec, 350 secs
lola: sara is running 355 secs || 12572079 markings, 66838157 edges, 36106 markings/sec, 355 secs
lola: sara is running 360 secs || 12745528 markings, 67790456 edges, 34690 markings/sec, 360 secs
lola: sara is running 365 secs || 12915710 markings, 68702633 edges, 34036 markings/sec, 365 secs
lola: sara is running 370 secs || 13081375 markings, 69657622 edges, 33133 markings/sec, 370 secs
lola: sara is running 375 secs || 13251799 markings, 70617563 edges, 34085 markings/sec, 375 secs
lola: sara is running 380 secs || 13432608 markings, 71628076 edges, 36162 markings/sec, 380 secs
lola: sara is running 385 secs || 13600668 markings, 72572229 edges, 33612 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= P-wait_3_5) OR ((3 <= P-done_8_5) AND (1 <= P-done_4_7) AND (P-b_1_true <= P-fordo_12_0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-8-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-8-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P-done_4_5 <= 2) OR ((P-fordo_12_4 + 1 <= P-wait_4_5) AND (P-fordo_12_4 <= 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 28 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-8-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-8-ReachabilityCardinality-9.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: subprocess 10 will run for 523 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P-sety_9_8 <= 1) OR (P-done_8_4 + 1 <= P-done_7_7) OR (P-done_6_7 <= 0) OR (P-done_0_0 + 1 <= P-wait_1_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 28 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-8-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-8-ReachabilityCardinality-10.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: subprocess 11 will run for 628 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P-done_0_2 <= P-wait_8_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 28 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-8-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-8-ReachabilityCardinality-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: ========================================
lola: subprocess 12 will run for 785 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P-start_1_5 <= P-wait_6_3) OR (P-done_4_7 <= P-done_4_0) OR ((P-start_1_1 <= P-wait_5_8) AND (P-b_6_false <= P-await_13_0)) OR (P-wait_5_2 <= P-b_8_true))))
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 28 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-8-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-8-ReachabilityCardinality-12.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: subprocess 13 will run for 1047 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= P-wait_3_3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-8-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-8-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((P-ifxi_10_1 + 1 <= P-CS_21_5) AND (P-setbi_11_1 + 1 <= P-wait_3_8) AND ((2 <= P-wait_8_4) OR (1 <= P-done_3_3)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-8-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-8-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25078 markings, 113706 edges
lola: subprocess 15 will run for 3142 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((P-CS_21_6 <= 2) AND (P-setbi_5_2 <= x_1) AND ((2 <= P-wait_5_5) OR (3 <= x_5)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: ========================================
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-8-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-8-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no no no no unknown no yes yes yes yes no yes no
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished 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="LamportFastMutEx-PT-8"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-structural"
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-8.tgz
mv LamportFastMutEx-PT-8 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-structural"
echo " Input is LamportFastMutEx-PT-8, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r115-csrt-152666473700152"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;