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 572K
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K 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 15K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K 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.6K 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 200K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is LamportFastMutEx-PT-6, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469100138
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527016761133

info: Time: 3600 - MCC
===========================================================================================
prep: translating LamportFastMutEx-PT-6 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating LamportFastMutEx-PT-6 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ LamportFastMutEx-PT-6 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 637/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 217
lola: finding significant places
lola: 217 places, 420 transitions, 152 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 597 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-PT-6-ReachabilityCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (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-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_0_false + 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)
lola: after: (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 <= 6)
lola: LP says that atomic proposition is always true: (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 <= 6)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= x_0 + x_1 + x_2 + x_3 + x_4 + x_5 + x_6)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (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-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_0_false + 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)
lola: after: (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 <= 6)
lola: LP says that atomic proposition is always true: (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 <= 6)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= y_0 + y_1 + y_2 + y_3 + y_4 + y_5 + y_6)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (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_0_false + 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 <= y_0 + y_1 + y_2 + y_3 + y_4 + y_5 + y_6)
lola: after: (5 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (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-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_0_false + 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)
lola: after: (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 <= 6)
lola: LP says that atomic proposition is always true: (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 <= 6)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= 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_0_false + 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)
lola: after: (0 <= 5)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (y_0 + y_1 + y_2 + y_3 + y_4 + y_5 + y_6 <= 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)
lola: after: (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)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= x_0 + x_1 + x_2 + x_3 + x_4 + x_5 + x_6)
lola: after: (2 <= 0)
lola: always false
lola: LP says that atomic proposition is always true: (P-wait_0_3 <= P-start_1_3)
lola: LP says that atomic proposition is always false: (3 <= P-sety_9_1)
lola: LP says that atomic proposition is always false: (2 <= P-wait_0_5)
lola: LP says that atomic proposition is always true: (P-done_0_0 <= P-done_0_6)
lola: LP says that atomic proposition is always false: (2 <= P-done_5_2)
lola: LP says that atomic proposition is always true: (P-wait_0_2 <= P-wait_5_0)
lola: LP says that atomic proposition is always false: (3 <= P-done_4_6)
lola: LP says that atomic proposition is always false: (2 <= P-done_2_0)
lola: LP says that atomic proposition is always false: (2 <= P-awaity_2)
lola: LP says that atomic proposition is always false: (2 <= P-b_1_true)
lola: LP says that atomic proposition is always false: (3 <= P-done_4_5)
lola: A (G ((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-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))) : A (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 <= 2)))) : E (F (())) : A (G (())) : A (G ((((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 <= 1) AND (P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + P-wait_5_3 + P-wait_5_2 + 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_5_1 + 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_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_5_0 + 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_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 <= 0)) OR ((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 <= 2) 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_0_6 + P-done_0_5 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_1 + P-done_0_0 + 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_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_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_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_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 <= 0))))) : E (F (())) : E (F (((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 + 1 <= 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) AND (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 <= 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 <= 1)))) : A (G ((((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-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) OR (P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + P-wait_5_3 + P-wait_5_2 + 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_5_1 + 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_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_5_0 + 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_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-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) OR (3 <= 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) OR (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))))) : E (F ((((1 <= P-done_6_5)) AND (1 <= P-b_4_true)))) : A (G ((P-awaity_5 <= P-fordo_12_5))) : E (F (FALSE)) : E (F (())) : E (F (())) : E (F (((1 <= P-ifyi_15_5) AND (P-setbi_24_6 <= P-sety_9_1) AND ((P-sety_9_6 <= P-done_4_5)) AND (1 <= P-done_6_5)))) : E (F (FALSE)) : E (F (FALSE))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 24 rewrites
lola: closed formula file LamportFastMutEx-PT-6-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-6-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 24 rewrites
lola: closed formula file LamportFastMutEx-PT-6-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges

FORMULA LamportFastMutEx-PT-6-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 24 rewrites
lola: closed formula file LamportFastMutEx-PT-6-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-6-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 24 rewrites
lola: closed formula file LamportFastMutEx-PT-6-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-6-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 24 rewrites
lola: closed formula file LamportFastMutEx-PT-6-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-6-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 24 rewrites
lola: closed formula file LamportFastMutEx-PT-6-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-6-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 24 rewrites
lola: closed formula file LamportFastMutEx-PT-6-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola:
FORMULA LamportFastMutEx-PT-6-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 24 rewrites
lola: closed formula file LamportFastMutEx-PT-6-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges

FORMULA LamportFastMutEx-PT-6-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
========================================
lola: ========================================
lola: ...considering subproblem: A (G ((P-awaity_5 <= P-fordo_12_5)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((P-awaity_5 <= P-fordo_12_5)))
lola: processed formula length: 36
lola: 26 rewrites
lola: closed formula file LamportFastMutEx-PT-6-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (P-fordo_12_5 + 1 <= P-awaity_5)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-6-ReachabilityCardinality-8-0.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: 548 markings, 1525 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-6-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= P-done_6_5)) AND (1 <= P-b_4_true))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((1 <= P-done_6_5)) AND (1 <= P-b_4_true))))
lola: processed formula length: 51
lola: 25 rewrites
lola: closed formula file LamportFastMutEx-PT-6-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((1 <= P-done_6_5)) AND (1 <= P-b_4_true))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-6-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= P-ifyi_15_5) AND (P-setbi_24_6 <= P-sety_9_1) AND ((P-sety_9_6 <= P-done_4_5)) AND (1 <= P-done_6_5))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((1 <= P-ifyi_15_5) AND (P-setbi_24_6 <= P-sety_9_1) AND ((P-sety_9_6 <= P-done_4_5)) AND (1 <= P-done_6_5))))
lola: processed formula length: 116
lola: 25 rewrites
lola: closed formula file LamportFastMutEx-PT-6-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((1 <= P-ifyi_15_5) AND (P-setbi_24_6 <= P-sety_9_1) AND ((P-sety_9_6 <= P-done_4_5)) AND (1 <= P-done_6_5))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-6-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-6-ReachabilityCardinality-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1169 markings, 3118 edges

FORMULA LamportFastMutEx-PT-6-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (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 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((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 <= 2))))
lola: processed formula length: 119
lola: 26 rewrites
lola: closed formula file LamportFastMutEx-PT-6-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((3 <= 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))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-6-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-6-ReachabilityCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 269726 markings, 899868 edges, 53945 markings/sec, 0 secs
lola: sara is running 5 secs || 520395 markings, 1743120 edges, 50134 markings/sec, 5 secs
lola: sara is running 10 secs || 788416 markings, 2663756 edges, 53604 markings/sec, 10 secs
lola: sara is running 15 secs || 1052527 markings, 3601740 edges, 52822 markings/sec, 15 secs
lola: sara is running 20 secs || 1317689 markings, 4544671 edges, 53032 markings/sec, 20 secs
lola: sara is running 25 secs || 1591032 markings, 5516449 edges, 54669 markings/sec, 25 secs
lola: sara is running 30 secs || 1867384 markings, 6499554 edges, 55270 markings/sec, 30 secs
lola: sara is running 35 secs || 2140917 markings, 7486936 edges, 54707 markings/sec, 35 secs
lola: sara is running 40 secs || 2412138 markings, 8485377 edges, 54244 markings/sec, 40 secs
lola: sara is running 45 secs || 2686820 markings, 9460847 edges, 54936 markings/sec, 45 secs
lola: sara is running 50 secs || 2961790 markings, 10443876 edges, 54994 markings/sec, 50 secs
lola: sara is running 55 secs || 3235342 markings, 11418085 edges, 54710 markings/sec, 55 secs
lola: sara is running 60 secs || 3505400 markings, 12392479 edges, 54012 markings/sec, 60 secs
lola: sara is running 65 secs || 3771187 markings, 13371286 edges, 53157 markings/sec, 65 secs
lola: sara is running 70 secs || 4037558 markings, 14362653 edges, 53274 markings/sec, 70 secs
lola: sara is running 75 secs || 4307134 markings, 15306021 edges, 53915 markings/sec, 75 secs
lola: sara is running 80 secs || 4562271 markings, 16250424 edges, 51027 markings/sec, 80 secs
lola: sara is running 85 secs || 4830098 markings, 17208207 edges, 53565 markings/sec, 85 secs
lola: sara is running 90 secs || 5100686 markings, 18164371 edges, 54118 markings/sec, 90 secs
lola: sara is running 95 secs || 5368568 markings, 19146812 edges, 53576 markings/sec, 95 secs
lola: sara is running 100 secs || 5634347 markings, 20121642 edges, 53156 markings/sec, 100 secs
lola: sara is running 105 secs || 5899421 markings, 21123406 edges, 53015 markings/sec, 105 secs
lola: sara is running 110 secs || 6153922 markings, 22083259 edges, 50900 markings/sec, 110 secs
lola: sara is running 115 secs || 6409764 markings, 23004854 edges, 51168 markings/sec, 115 secs
lola: sara is running 120 secs || 6664010 markings, 23923275 edges, 50849 markings/sec, 120 secs
lola: sara is running 125 secs || 6923983 markings, 24893805 edges, 51995 markings/sec, 125 secs
lola: sara is running 130 secs || 7189443 markings, 25842244 edges, 53092 markings/sec, 130 secs
lola: sara is running 135 secs || 7453484 markings, 26823801 edges, 52808 markings/sec, 135 secs
lola: sara is running 140 secs || 7716466 markings, 27803988 edges, 52596 markings/sec, 140 secs
lola: sara is running 145 secs || 7973067 markings, 28771899 edges, 51320 markings/sec, 145 secs
lola: sara is running 150 secs || 8231203 markings, 29725778 edges, 51627 markings/sec, 150 secs
lola: sara is running 155 secs || 8495886 markings, 30726379 edges, 52937 markings/sec, 155 secs
lola: sara is running 160 secs || 8756546 markings, 31680965 edges, 52132 markings/sec, 160 secs
lola: sara is running 165 secs || 9022633 markings, 32633959 edges, 53217 markings/sec, 165 secs
lola: sara is running 170 secs || 9280874 markings, 33603834 edges, 51648 markings/sec, 170 secs
lola: sara is running 175 secs || 9541147 markings, 34592971 edges, 52055 markings/sec, 175 secs
lola: sara is running 180 secs || 9800964 markings, 35564130 edges, 51963 markings/sec, 180 secs
lola: sara is running 185 secs || 10060888 markings, 36509879 edges, 51985 markings/sec, 185 secs
lola: sara is running 190 secs || 10319111 markings, 37496075 edges, 51645 markings/sec, 190 secs
lola: sara is running 195 secs || 10574927 markings, 38441523 edges, 51163 markings/sec, 195 secs
lola: sara is running 200 secs || 10836910 markings, 39413720 edges, 52397 markings/sec, 200 secs
lola: sara is running 205 secs || 11092267 markings, 40369478 edges, 51071 markings/sec, 205 secs
lola: sara is running 210 secs || 11353072 markings, 41298994 edges, 52161 markings/sec, 210 secs
lola: sara is running 215 secs || 11611569 markings, 42267091 edges, 51699 markings/sec, 215 secs
lola: sara is running 220 secs || 11865545 markings, 43257028 edges, 50795 markings/sec, 220 secs
lola: sara is running 225 secs || 12129971 markings, 44207721 edges, 52885 markings/sec, 225 secs
lola: sara is running 230 secs || 12383970 markings, 45121390 edges, 50800 markings/sec, 230 secs
lola: sara is running 235 secs || 12633178 markings, 46049743 edges, 49842 markings/sec, 235 secs
lola: sara is running 240 secs || 12886091 markings, 47000029 edges, 50583 markings/sec, 240 secs
lola: sara is running 245 secs || 13142379 markings, 47915400 edges, 51258 markings/sec, 245 secs
lola: sara is running 250 secs || 13394924 markings, 48858181 edges, 50509 markings/sec, 250 secs
lola: sara is running 255 secs || 13647565 markings, 49819658 edges, 50528 markings/sec, 255 secs
lola: sara is running 260 secs || 13897699 markings, 50753676 edges, 50027 markings/sec, 260 secs
lola: sara is running 265 secs || 14146580 markings, 51694933 edges, 49776 markings/sec, 265 secs
lola: sara is running 270 secs || 14409548 markings, 52660474 edges, 52594 markings/sec, 270 secs
lola: sara is running 275 secs || 14672436 markings, 53625852 edges, 52578 markings/sec, 275 secs
lola: sara is running 280 secs || 14932771 markings, 54624662 edges, 52067 markings/sec, 280 secs
lola: sara is running 285 secs || 15195464 markings, 55594410 edges, 52539 markings/sec, 285 secs
lola: sara is running 290 secs || 15454044 markings, 56592171 edges, 51716 markings/sec, 290 secs
lola: sara is running 295 secs || 15704660 markings, 57501332 edges, 50123 markings/sec, 295 secs
lola: sara is running 300 secs || 15954605 markings, 58472864 edges, 49989 markings/sec, 300 secs
lola: sara is running 305 secs || 16214593 markings, 59410068 edges, 51998 markings/sec, 305 secs
lola: sara is running 310 secs || 16455856 markings, 60310238 edges, 48253 markings/sec, 310 secs
lola: sara is running 315 secs || 16707907 markings, 61232072 edges, 50410 markings/sec, 315 secs
lola: sara is running 320 secs || 16957679 markings, 62127639 edges, 49954 markings/sec, 320 secs
lola: sara is running 325 secs || 17205892 markings, 63072146 edges, 49643 markings/sec, 325 secs
lola: sara is running 330 secs || 17450941 markings, 63991218 edges, 49010 markings/sec, 330 secs
lola: sara is running 335 secs || 17695170 markings, 64897728 edges, 48846 markings/sec, 335 secs
lola: sara is running 340 secs || 17937117 markings, 65836198 edges, 48389 markings/sec, 340 secs
lola: sara is running 345 secs || 18187061 markings, 66753429 edges, 49989 markings/sec, 345 secs
lola: sara is running 350 secs || 18429680 markings, 67634771 edges, 48524 markings/sec, 350 secs
lola: sara is running 355 secs || 18676087 markings, 68548117 edges, 49281 markings/sec, 355 secs
lola: sara is running 360 secs || 18917780 markings, 69446909 edges, 48339 markings/sec, 360 secs
lola: sara is running 365 secs || 19168025 markings, 70355226 edges, 50049 markings/sec, 365 secs
lola: sara is running 370 secs || 19408028 markings, 71272824 edges, 48001 markings/sec, 370 secs
lola: sara is running 375 secs || 19650085 markings, 72218355 edges, 48411 markings/sec, 375 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19890898 markings, 73138768 edges

FORMULA LamportFastMutEx-PT-6-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 796 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((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-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)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((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-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)))
lola: processed formula length: 197
lola: 26 rewrites
lola: closed formula file LamportFastMutEx-PT-6-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (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 + 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)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-6-ReachabilityCardinality-12-0.sara
lola: lola: state equation: calling and running sara
SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 704 markings, 824 edges

FORMULA LamportFastMutEx-PT-6-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1061 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((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 + 1 <= 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) AND (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 <= 0) AND (P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setb... (shortened)
lola: ========================================
lola: SUBTASK
lola: sara: try reading problem file LamportFastMutEx-PT-6-ReachabilityCardinality-12-0.sara.
checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((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 + 1 <= 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) AND (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 <= 0) AND (P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setb... (shortened)
lola: processed formula length: 445
lola: 25 rewrites
lola: closed formula file LamportFastMutEx-PT-6-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((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 + 1 <= 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) AND (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 <= 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 <= 1))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-6-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-6-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((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-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) OR (P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + P-wait_5_3 + P-wait_5_2 + 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_5_1 + P-wait_1_0 + P... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((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-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) OR (P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + P-wait_5_3 + P-wait_5_2 + 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_5_1 + P-wait_1_0 + P... (shortened)
lola: processed formula length: 1169
lola: 26 rewrites
lola: closed formula file LamportFastMutEx-PT-6-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((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 + 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) 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 + 1 <= P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + P-wait_5_3 + P-wait_5_2 + 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_5_1 + 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_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_5_0 + 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_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) 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 <= 2) AND (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 <= 0)))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-6-ReachabilityCardinality-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31 markings, 30 edges
lola: state equation: calling and running sara
lola: ========================================
FORMULA LamportFastMutEx-PT-6-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 15 will run for 3184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((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 <= 1) AND (P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + P-wait_5_3 + P-wait_5_2 + 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_5_1 + 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_2_0 + P-wait_2_1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((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 <= 1) AND (P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + P-wait_5_3 + P-wait_5_2 + 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_5_1 + 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_2_0 + P-wait_2_1 ... (shortened)
lola: sara: processed formula length: 1515
lola: 26 rewrites
lola: closed formula file LamportFastMutEx-PT-6-ReachabilityCardinality.task
try reading problem file LamportFastMutEx-PT-6-ReachabilityCardinality-14-0.sara.lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola:
using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 566 markings, 704 edges
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((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) OR (1 <= P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + P-wait_5_3 + P-wait_5_2 + 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_5_1 + 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_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_5_0 + 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_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)) AND ((3 <= 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) OR (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_0_6 + P-done_0_5 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_1 + P-done_0_0 + 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_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_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_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_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)))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-6-ReachabilityCardinality-15-0.sara
lola: ========================================

FORMULA LamportFastMutEx-PT-6-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no no yes no yes no no no no yes no no
lola:
preliminary result: no no no yes no no yes no yes no no no no yes no no
sara: place or transition ordering is non-deterministic
lola: memory consumption: 23280 KB
lola: time consumption: 386 seconds

sara: warning, failure of lp_solve (at job 8061)

BK_TIME_CONFINEMENT_REACHED

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-PT-6"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
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-6.tgz
mv LamportFastMutEx-PT-6 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 lola"
echo " Input is LamportFastMutEx-PT-6, 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 r112-csrt-152666469100138"
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 ;