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)
.............................................
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_Peterson-PT-2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681100048
=====================================================================

--------------------
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 Peterson-COL-2-CTLCardinality-0
FORMULA_NAME Peterson-COL-2-CTLCardinality-1
FORMULA_NAME Peterson-COL-2-CTLCardinality-10
FORMULA_NAME Peterson-COL-2-CTLCardinality-11
FORMULA_NAME Peterson-COL-2-CTLCardinality-12
FORMULA_NAME Peterson-COL-2-CTLCardinality-13
FORMULA_NAME Peterson-COL-2-CTLCardinality-14
FORMULA_NAME Peterson-COL-2-CTLCardinality-15
FORMULA_NAME Peterson-COL-2-CTLCardinality-2
FORMULA_NAME Peterson-COL-2-CTLCardinality-3
FORMULA_NAME Peterson-COL-2-CTLCardinality-4
FORMULA_NAME Peterson-COL-2-CTLCardinality-5
FORMULA_NAME Peterson-COL-2-CTLCardinality-6
FORMULA_NAME Peterson-COL-2-CTLCardinality-7
FORMULA_NAME Peterson-COL-2-CTLCardinality-8
FORMULA_NAME Peterson-COL-2-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496268222033


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


checking for too many tokens
===========================================================================================
S_Peterson-PT-2: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_Peterson-PT-2 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 228/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 102 places, 126 transitions, 91 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 189 transition conflict sets
lola: TASK
lola: reading formula from Peterson-COL-2-CTLCardinality.task
lola: A (G (NOT(A (X ((3 <= TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1)))))) : NOT(E ((((AskForSection_2_0 + AskForSection_0_0 + AskForSection_0_1 + AskForSection_1_0 + AskForSection_1_1 + AskForSection_2_1 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F) OR (1 <= TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2 + TestIdentity_0_0_0 + TestIdentity_0_0_1 + TestIdentity_0_0_2 + TestIdentity_0_1_0 + TestIdentity_0_1_1 + TestIdentity_0_1_2)) U ((3 <= Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2) AND (3 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndLoop_2_1_2))))) : A (G (NOT(E (G ((3 <= AskForSection_2_0 + AskForSection_0_0 + AskForSection_0_1 + AskForSection_1_0 + AskForSection_1_1 + AskForSection_2_1)))))) : (E (((3 <= TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1) U (2 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndLoop_2_1_2))) OR (E (F ((EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 <= BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_1_0_0 + BeginLoop_1_0_1 + BeginLoop_1_0_2 + BeginLoop_1_1_0 + BeginLoop_1_1_1 + BeginLoop_1_1_2))) AND E (F ((3 <= Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2))))) : (NOT(A (((TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2 <= Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2) U (CS_0 + CS_1 + CS_2 <= BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_1_0_0 + BeginLoop_1_0_1 + BeginLoop_1_0_2 + BeginLoop_1_1_0 + BeginLoop_1_1_1 + BeginLoop_1_1_2)))) OR (A (G (((2 <= BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_1_0_0 + BeginLoop_1_0_1 + BeginLoop_1_0_2 + BeginLoop_1_1_0 + BeginLoop_1_1_1 + BeginLoop_1_1_2) OR (1 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F)))) AND ((WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F + 1 <= EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1) OR ((TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1 + 1 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F) AND (IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndLoop_2_1_2 <= 2))))) : A (G (TRUE)) : A ((((3 <= Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2) AND (3 <= TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1) AND (2 <= TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1)) U A (G ((1 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F))))) : E ((E (G ((1 <= Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2))) U FALSE)) : A (G ((A (F ((2 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F))) OR A (G ((WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F <= BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_1_0_0 + BeginLoop_1_0_1 + BeginLoop_1_0_2 + BeginLoop_1_1_0 + BeginLoop_1_1_1 + BeginLoop_1_1_2)))))) : (A (G (A (G ((3 <= AskForSection_2_0 + AskForSection_0_0 + AskForSection_0_1 + AskForSection_1_0 + AskForSection_1_1 + AskForSection_2_1))))) OR A (G (E (F ((EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndLoop_2_1_2)))))) : ((3 <= TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2) OR E (X (E (F ((Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndLoop_2_1_2)))))) : (A ((((2 <= TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2) OR (WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F <= CS_0 + CS_1 + CS_2)) U ((TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F) OR (2 <= TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2)))) AND (E (G (((TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2 <= CS_0 + CS_1 + CS_2) AND (EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 <= Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2)))) OR (() AND E (X ((2 <= TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1)))))) : (NOT(E (F ((TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1 + 1 <= CS_0 + CS_1 + CS_2)))) OR ((E (X ((3 <= Idle_0 + Idle_1 + Idle_2))) OR (((EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndLoop_2_1_2) OR (CS_0 + CS_1 + CS_2 <= BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_1_0_0 + BeginLoop_1_0_1 + BeginLoop_1_0_2 + BeginLoop_1_1_0 + BeginLoop_1_1_1 + BeginLoop_1_1_2)) AND ((1 <= TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2) OR (3 <= CS_0 + CS_1 + CS_2)))) AND (E (X ((EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 <= Idle_0 + Idle_1 + Idle_2))) OR E (G ((TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2 + TestIdentity_0_0_0 + TestIdentity_0_0_1 + TestIdentity_0_0_2 + TestIdentity_0_1_0 + TestIdentity_0_1_1 + TestIdentity_0_1_2 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndLoop_2_1_2)))))) : (A (G (E (F ((IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndLoop_2_1_2 <= CS_0 + CS_1 + CS_2))))) OR ((2 <= CS_0 + CS_1 + CS_2) AND (((WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F <= 0) AND (WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F + 1 <= TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2 + TestIdentity_0_0_0 + TestIdentity_0_0_1 + TestIdentity_0_0_2 + TestIdentity_0_1_0 + TestIdentity_0_1_1 + TestIdentity_0_1_2)) OR A (G ((CS_0 + CS_1 + CS_2 <= TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1)))))) : (A (G (TRUE)) OR (3 <= BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_1_0_0 + BeginLoop_1_0_1 + BeginLoop_1_0_2 + BeginLoop_1_1_0 + BeginLoop_1_1_1 + BeginLoop_1_1_2)) : ((NOT(E (F ((BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_1_0_0 + BeginLoop_1_0_1 + BeginLoop_1_0_2 + BeginLoop_1_1_0 + BeginLoop_1_1_1 + BeginLoop_1_1_2 <= TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2 + TestIdentity_0_0_0 + TestIdentity_0_0_1 + TestIdentity_0_0_2 + TestIdentity_0_1_0 + TestIdentity_0_1_1 + TestIdentity_0_1_2)))) OR ((1 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F) OR E (G ((IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndLoop_2_1_2 <= Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2))))) AND (E ((TRUE U (1 <= CS_0 + CS_1 + CS_2))) AND ((TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2 + TestIdentity_0_0_0 + TestIdentity_0_0_1 + TestIdentity_0_0_2 + TestIdentity_0_1_0 + TestIdentity_0_1_1 + TestIdentity_0_1_2 <= 2) OR (EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 <= 1))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (X ((3 <= TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1 <= 2)))))
lola: processed formula length: 118
lola: 5 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 364 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((((AskForSection_2_0 + AskForSection_0_0 + AskForSection_0_1 + AskForSection_1_0 + AskForSection_1_1 + AskForSection_2_1 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F) OR (1 <= TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_2_0_0 + TestI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(((AskForSection_2_0 + AskForSection_0_0 + AskForSection_0_1 + AskForSection_1_0 + AskForSection_1_1 + AskForSection_2_1 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F) OR (1 <= TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_2_0_0 + TestIde... (shortened)
lola: processed formula length: 1033
lola: 7 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 364 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (G ((3 <= AskForSection_2_0 + AskForSection_0_0 + AskForSection_0_1 + AskForSection_1_0 + AskForSection_1_1 + AskForSection_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (AskForSection_2_0 + AskForSection_0_0 + AskForSection_0_1 + AskForSection_1_0 + AskForSection_1_1 + AskForSection_2_1 <= 2)))))
lola: processed formula length: 154
lola: 5 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 364 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((3 <= TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1) U (2 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEn... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((3 <= TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1) U (2 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEnd... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((3 <= TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1) U (2 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLo... (shortened)
lola: processed formula length: 428
lola: 1 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 364 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 <= BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_1_0_0 + BeginLoop_1_0_1 + BeginLoop_1_0_2 + BeginLoop_1_1_0 + BeginLoop_1_1_1 + Be... (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 364 bytes per marking, with 0 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2)))
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 364 bytes per marking, with 0 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 Peterson-COL-2-CTLCardinality-5.sara
lola: SUBRESULT
lola: state equation: calling and running sara
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (((TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2 <= Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2) U (CS_0 + CS_1 + CS_2 <= BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2 + 1 <= TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2) R (BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2 <= Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2) U (CS_0 + CS_1 + CS_2 <= BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2_1_... (shortened)
lola: processed formula length: 638
lola: 7 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 364 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
sara: try reading problem file Peterson-COL-2-CTLCardinality-5.sara.
lola: ...considering subproblem: A (G (((2 <= BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_1_0_0 + BeginLoop_1_0_1 + BeginLoop_1_0_2 + BeginLoop_1_1_0 + BeginLoop_1_1_1 + BeginLoop_1_1_2) OR (1 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + ... (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 364 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F + 1 <= EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1) OR ((TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1 + 1 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F + 1 <= EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1) OR ((TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1 + 1 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection... (shortened)
lola: processed formula length: 740
lola: 4 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: processed formula with 3 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.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: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2) AND (3 <= TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1) AND (2 <= TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1)) U A (G ((1 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((3 <= Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2) AND (3 <= TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1) AND (2 <= TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1)) U NOT(E(TRUE U (WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F <= 0)... (shortened)
lola: processed formula length: 403
lola: 3 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 364 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (G ((1 <= Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2))) U FALSE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.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: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((2 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F))) OR A (G ((WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F <= BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(A(TRUE U (2 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F))) AND E(TRUE U (BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_1_0_0 + BeginLoop_... (shortened)
lola: processed formula length: 595
lola: 6 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 364 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (G ((3 <= AskForSection_2_0 + AskForSection_0_0 + AskForSection_0_1 + AskForSection_1_0 + AskForSection_1_1 + AskForSection_2_1))))) OR A (G (E (F ((EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= AskForSection_2_0 + AskForSection_0_0 + AskForSection_0_1 + AskForSection_1_0 + AskForSection_1_1 + AskForSection_2_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 364 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to Peterson-COL-2-CTLCardinality-9.sara
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + ... (shortened)
lola: processed formula length: 438
lola: 3 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 364 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: lola: ========================================
The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2) OR E (X (E (F ((Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEnd... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2)
lola: processed formula length: 220
lola: 0 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndLoop_2_1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndLoop_2_1_... (shortened)
lola: processed formula length: 404
lola: 2 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 364 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: lola: result: yes
========================================
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((2 <= TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2) OR (WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F <= CS_0 + CS_1 + CS_2)) U ((TestAlone_2_0_0 + TestAlone_2_0_1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2) OR (WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F <= CS_0 + CS_1 + CS_2)) U ((TestAlone_2_0_0 + TestAlone_2_0_1 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((2 <= TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2) OR (WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F <= CS_0 + CS_1 + CS_2)) U ((TestAlone_2_0_0 + TestAlone_2_0_1 + T... (shortened)
lola: processed formula length: 913
lola: 4 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 364 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2 <= CS_0 + CS_1 + CS_2) AND (EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 <= Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((CS_0 + CS_1 + CS_2 + 1 <= TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2) OR (Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2 + 1 <= EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 ... (shortened)
lola: processed formula length: 417
lola: 5 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 364 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: lola: result: yes========================================

lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F ((TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1 + 1 <= CS_0 + CS_1 + CS_2)))) OR ((E (X ((3 <= Idle_0 + Idle_1 + Idle_2))) OR (((EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((CS_0 + CS_1 + CS_2 <= TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_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 364 bytes per marking, with 0 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 Peterson-COL-2-CTLCardinality-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((3 <= Idle_0 + Idle_1 + Idle_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((3 <= Idle_0 + Idle_1 + Idle_2))
lola: processed formula length: 35
lola: 4 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 364 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndL... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndL... (shortened)
lola: processed formula length: 1019
lola: 3 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: processed formula with 4 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndLoop_2_1_2 <= CS_0 + CS_1 + CS_2))))) OR ((2 <= CS_0 + CS_1 + CS_2) AND (((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndLoop_2_1_2 <= CS_0 + CS_1 + CS_2)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndLoop_2_1_2 <= CS_0 + CS_1 + CS_2)))))
lola: processed formula length: 375
lola: 2 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 364 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (TRUE)) OR (3 <= BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_1_0_0 + BeginLoop_1_0_1 + BeginLoop_1_0_2 + BeginLoop_1_1_0 + BeginLoop_1_1_1 + BeginLoop_1_1_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 4 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.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: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (F ((BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_1_0_0 + BeginLoop_1_0_1 + BeginLoop_1_0_2 + BeginLoop_1_1_0 + BeginLoop_1_1_1 + BeginLoop_1_1_2 <= TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2 + TestIdentity_0_0_0 + TestIdentity_0_0_1 + TestIdentity_0_0_2 + TestIdentity_0_1_0 + TestIdentity_0_1_1 + TestIdentity_0_1_2 + 1 <= BeginLoop_... (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 364 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndLoop_2_1_2 <= Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2 + 1 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndLoop... (shortened)
lola: processed formula length: 409
lola: 7 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 364 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= CS_0 + CS_1 + CS_2)))
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 364 bytes per marking, with 0 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 Peterson-COL-2-CTLCardinality-18.sara
lola: SUBRESULT
lola: lola: result: yesstate equation: calling and running sara

lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 19 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2 + TestIdentity_0_0_0 + TestIdentity_0_0_1 + TestIdentity_0_0_2 + TestIdentity_0_1_0 + TestIdentity_0_1_1 + TestIdentity_0_1_2 <= 2) OR (EndTurn_1_0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2 + TestIdentity_0_0_0 + TestIdentity_0_0_1 + TestIdentity_0_0_2 + TestIdentity_0_1_0 + TestIdentity_0_1_1 + TestIdentity_0_1_2 <= 2) OR (EndTurn_1_0... (shortened)
lola: processed formula length: 477
lola: 5 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: processed formula with 2 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes yes yes no yes yes yes yes no yes yes yes
sara: try reading problem file Peterson-COL-2-CTLCardinality-18.sara.
sara: place or transition ordering is non-deterministic
FORMULA Peterson-COL-2-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496268222965

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="S_Peterson-PT-2"
export BK_EXAMINATION="CTLCardinality"
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/S_Peterson-PT-2.tgz
mv S_Peterson-PT-2 execution

# this is for BenchKit: explicit launching of the test

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