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-2979
Executing tool lola
Input is Peterson-PT-4, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088100075
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463691946334

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ Peterson-PT-4
FORMULA Peterson-COL-4-CTLCardinality-0 CANNOT_COMPUTE
FORMULA Peterson-COL-4-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-4-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-4-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-4-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-4-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-4-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-4-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-4-CTLCardinality-8 CANNOT_COMPUTE
FORMULA Peterson-COL-4-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-4-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-4-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-4-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-4-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-4-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-4-CTLCardinality-15 CANNOT_COMPUTE
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: 1170/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 480 places, 690 transitions, 461 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1055 transition conflict sets
lola: TASK
lola: reading formula from Peterson-COL-4-CTLCardinality.task
lola: read: E(AG (3 <= Turn_3_1 + Turn_0_2 + Turn_1_2 + Turn_2_2 + Turn_3_2 + Turn_0_3 + Turn_1_3 + Turn_2_3 + Turn_0_0 + Turn_1_0 + Turn_2_0 + Turn_3_0 + Turn_0_1 + Turn_1_1 + Turn_2_1 + Turn_3_4 + Turn_2_4 + Turn_1_4 + Turn_0_4 + Turn_3_3) U EX (2 <= EndTurn_0_0 + EndTurn_2_1 + EndTurn_3_1 + EndTurn_0_1 + EndTurn_1_1 + EndTurn_3_0 + EndTurn_4_0 + EndTurn_1_0 + EndTurn_2_0 + EndTurn_1_3 + EndTurn_0_3 + EndTu... (shortened)
lola: formula length: 63370
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(AG (-Turn_2_4 + -Turn_3_4 + -Turn_1_4 + -Turn_0_4 + -Turn_0_3 + -Turn_0_2 + -Turn_0_1 + -Turn_0_0 + -Turn_1_0 + -Turn_1_1 + -Turn_1_2 + -Turn_1_3 + -Turn_3_3 + -Turn_3_2 + -Turn_3_1 + -Turn_3_0 + -Turn_2_3 + -Turn_2_2 + -Turn_2_1 + -Turn_2_0 <= -3) U EX (-EndTurn_0_3 + -EndTurn_0_0 + -EndTurn_4_3 + -EndTurn_4_2 + -EndTurn_4_1 + -EndTurn_4_0 + -EndTurn_3_3 + -EndTurn_3_2 + -EndTurn_3_1 + -EndTurn... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(!(E(TRUE U !(-Turn_2_4 + -Turn_3_4 + -Turn_1_4 + -Turn_0_4 + -Turn_0_3 + -Turn_0_2 + -Turn_0_1 + -Turn_0_0 + -Turn_1_0 + -Turn_1_1 + -Turn_1_2 + -Turn_1_3 + -Turn_3_3 + -Turn_3_2 + -Turn_3_1 + -Turn_3_0 + -Turn_2_3 + -Turn_2_2 + -Turn_2_1 + -Turn_2_0 <= -3))) U EX(-EndTurn_0_3 + -EndTurn_0_0 + -EndTurn_4_3 + -EndTurn_4_2 + -EndTurn_4_1 + -EndTurn_4_0 + -EndTurn_3_3 + -EndTurn_3_2 + -EndTurn_3_1 ... (shortened)
lola: processed formula length: 572
lola: 242019 rewrites
lola: formula mentions 40 of 480 places; total mentions: 40
lola: closed formula file Peterson-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-WantSection_0_F + -WantSection_0_T + -WantSection_1_F + -WantSection_1_T + -WantSection_2_F + -WantSection_2_T + -WantSection_3_F + -WantSection_3_T + -WantSection_4_F + -WantSection_4_T <= -1 U -TestIdentity_3_3_4 + -TestIdentity_3_3_3 + -TestIdentity_3_3_2 + -TestIdentity_3_3_1 + -TestIdentity_3_3_0 + -TestIdentity_3_2_4 + -TestIdentity_3_2_3 + -TestIdentity_3_2_2 + -TestIdentity_3_2_1 + -Tes... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-WantSection_0_F + -WantSection_0_T + -WantSection_1_F + -WantSection_1_T + -WantSection_2_F + -WantSection_2_T + -WantSection_3_F + -WantSection_3_T + -WantSection_4_F + -WantSection_4_T <= -1 U -TestIdentity_3_3_4 + -TestIdentity_3_3_3 + -TestIdentity_3_3_2 + -TestIdentity_3_3_1 + -TestIdentity_3_3_0 + -TestIdentity_3_2_4 + -TestIdentity_3_2_3 + -TestIdentity_3_2_2 + -TestIdentity_3_2_1 + -Tes... (shortened)
lola: processed formula length: 2402
lola: 242017 rewrites
lola: formula mentions 110 of 480 places; total mentions: 110
lola: closed formula file Peterson-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG (-Turn_2_4 + -Turn_3_4 + -Turn_1_4 + -Turn_0_4 + -Turn_0_3 + -Turn_0_2 + -Turn_0_1 + -Turn_0_0 + -Turn_1_0 + -Turn_1_1 + -Turn_1_2 + -Turn_1_3 + -Turn_3_3 + -Turn_3_2 + -Turn_3_1 + -Turn_3_0 + -Turn_2_3 + -Turn_2_2 + -Turn_2_1 + -Turn_2_0 <= -1) AND (AF (EndTurn_0_3 + -TestIdentity_3_3_4 + -TestIdentity_3_3_3 + -TestIdentity_3_3_2 + -TestIdentity_3_3_1 + -TestIdentity_3_3_0 + -TestIdentity_3_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-Turn_2_4 + -Turn_3_4 + -Turn_1_4 + -Turn_0_4 + -Turn_0_3 + -Turn_0_2 + -Turn_0_1 + -Turn_0_0 + -Turn_1_0 + -Turn_1_1 + -Turn_1_2 + -Turn_1_3 + -Turn_3_3 + -Turn_3_2 + -Turn_3_1 + -Turn_3_0 + -Turn_2_3 + -Turn_2_2 + -Turn_2_1 + -Turn_2_0 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-Turn_2_4 + -Turn_3_4 + -Turn_1_4 + -Turn_0_4 + -Turn_0_3 + -Turn_0_2 + -Turn_0_1 + -Turn_0_0 + -Turn_1_0 + -Turn_1_1 + -Turn_1_2 + -Turn_1_3 + -Turn_3_3 + -Turn_3_2 + -Turn_3_1 + -Turn_3_0 + -Turn_2_3 + -Turn_2_2 + -Turn_2_1 + -Turn_2_0 <= -1)))
lola: processed formula length: 259
lola: 242017 rewrites
lola: formula mentions 20 of 480 places; total mentions: 20
lola: closed formula file Peterson-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EndTurn_0_3 + -TestIdentity_3_3_4 + -TestIdentity_3_3_3 + -TestIdentity_3_3_2 + -TestIdentity_3_3_1 + -TestIdentity_3_3_0 + -TestIdentity_3_2_4 + -TestIdentity_3_2_3 + -TestIdentity_3_2_2 + -TestIdentity_3_2_1 + -TestIdentity_3_2_0 + -TestIdentity_0_3_4 + -TestIdentity_0_3_3 + -TestIdentity_0_3_2 + -TestIdentity_0_3_1 + -TestIdentity_0_3_0 + -TestIdentity_3_1_4 + -TestIdentity_3_1_3 + -TestIde... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EndTurn_0_3 + -TestIdentity_3_3_4 + -TestIdentity_3_3_3 + -TestIdentity_3_3_2 + -TestIdentity_3_3_1 + -TestIdentity_3_3_0 + -TestIdentity_3_2_4 + -TestIdentity_3_2_3 + -TestIdentity_3_2_2 + -TestIdentity_3_2_1 + -TestIdentity_3_2_0 + -TestIdentity_0_3_4 + -TestIdentity_0_3_3 + -TestIdentity_0_3_2 + -TestIdentity_0_3_1 + -TestIdentity_0_3_0 + -TestIdentity_3_1_4 + -TestIdentity_3_1_3 + -Te... (shortened)
lola: processed formula length: 2491
lola: 242017 rewrites
lola: formula mentions 120 of 480 places; total mentions: 120
lola: closed formula file Peterson-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: WantSection_0_F + WantSection_0_T + WantSection_1_F + WantSection_1_T + WantSection_2_F + WantSection_2_T + WantSection_3_F + WantSection_3_T + WantSection_4_F + WantSection_4_T + -TestTurn_4_3 + -TestTurn_4_2 + -TestTurn_4_1 + -TestTurn_4_0 + -TestTurn_3_3 + -TestTurn_3_2 + -TestTurn_3_1 + -TestTurn_3_0 + -TestTurn_2_3 + -TestTurn_2_2 + -TestTurn_2_1 + -TestTurn_2_0 + -TestTurn_1_3 + -TestTurn_1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Peterson-COL-4-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
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: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (EG (IsEndLoop_2_3_4 + IsEndLoop_2_3_3 + IsEndLoop_2_3_2 + IsEndLoop_2_3_1 + IsEndLoop_2_3_0 + IsEndLoop_2_2_4 + IsEndLoop_2_2_3 + IsEndLoop_2_2_2 + IsEndLoop_2_2_1 + IsEndLoop_2_2_0 + IsEndLoop_2_1_4 + IsEndLoop_2_1_3 + IsEndLoop_2_1_2 + IsEndLoop_2_1_1 + IsEndLoop_2_1_0 + IsEndLoop_2_0_4 + IsEndLoop_2_0_3 + IsEndLoop_2_0_2 + IsEndLoop_2_0_1 + IsEndLoop_2_0_0 + -TestTurn_4_3 + -TestTurn_4_2 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(!(A(TRUE U !(IsEndLoop_2_3_4 + IsEndLoop_2_3_3 + IsEndLoop_2_3_2 + IsEndLoop_2_3_1 + IsEndLoop_2_3_0 + IsEndLoop_2_2_4 + IsEndLoop_2_2_3 + IsEndLoop_2_2_2 + IsEndLoop_2_2_1 + IsEndLoop_2_2_0 + IsEndLoop_2_1_4 + IsEndLoop_2_1_3 + IsEndLoop_2_1_2 + IsEndLoop_2_1_1 + IsEndLoop_2_1_0 + IsEndLoop_2_0_4 + IsEndLoop_2_0_3 + IsEndLoop_2_0_2 + IsEndLoop_2_0_1 + IsEndLoop_2_0_0 + -TestTurn_4_3 + -TestTur... (shortened)
lola: processed formula length: 2142
lola: 242018 rewrites
lola: formula mentions 120 of 480 places; total mentions: 120
lola: closed formula file Peterson-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E(TestAlone_4_2_3 + TestAlone_1_3_4 + -TestIdentity_3_3_4 + -TestIdentity_3_3_3 + -TestIdentity_3_3_2 + -TestIdentity_3_3_1 + -TestIdentity_3_3_0 + TestAlone_1_3_3 + TestAlone_1_3_2 + TestAlone_1_3_0 + TestAlone_4_1_3 + TestAlone_4_1_2 + TestAlone_4_1_1 + TestAlone_4_1_0 + -TestIdentity_3_2_4 + -TestIdentity_3_2_3 + -TestIdentity_3_2_2 + -TestIdentity_3_2_1 + -TestIdentity_3_2_0 + TestAlone_1_2_4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(TestAlone_4_2_3 + TestAlone_1_3_4 + -TestIdentity_3_3_4 + -TestIdentity_3_3_3 + -TestIdentity_3_3_2 + -TestIdentity_3_3_1 + -TestIdentity_3_3_0 + TestAlone_1_3_3 + TestAlone_1_3_2 + TestAlone_1_3_0 + TestAlone_4_1_3 + TestAlone_4_1_2 + TestAlone_4_1_1 + TestAlone_4_1_0 + -TestIdentity_3_2_4 + -TestIdentity_3_2_3 + -TestIdentity_3_2_2 + -TestIdentity_3_2_1 + -TestIdentity_3_2_0 + TestAlone_1_2_4 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TestAlone_4_2_3 + TestAlone_1_3_4 + -TestIdentity_3_3_4 + -TestIdentity_3_3_3 + -TestIdentity_3_3_2 + -TestIdentity_3_3_1 + -TestIdentity_3_3_0 + TestAlone_1_3_3 + TestAlone_1_3_2 + TestAlone_1_3_0 + TestAlone_4_1_3 + TestAlone_4_1_2 + TestAlone_4_1_1 + TestAlone_4_1_0 + -TestIdentity_3_2_4 + -TestIdentity_3_2_3 + -TestIdentity_3_2_2 + -TestIdentity_3_2_1 + -TestIdentity_3_2_0 + TestAlone_1_2_4 ... (shortened)
lola: processed formula length: 5851
lola: 242017 rewrites
lola: formula mentions 180 of 480 places; total mentions: 280
lola: closed formula file Peterson-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AG (-Turn_2_4 + -Turn_3_4 + -Turn_1_4 + -Turn_0_4 + -Turn_0_3 + -Turn_0_2 + -Turn_0_1 + -Turn_0_0 + -Turn_1_0 + -Turn_1_1 + -Turn_1_2 + -Turn_1_3 + -Turn_3_3 + -Turn_3_2 + -Turn_3_1 + -Turn_3_0 + -Turn_2_3 + -Turn_2_2 + -Turn_2_1 + -Turn_2_0 > -3) AND BeginLoop_4_2_0 + BeginLoop_4_2_1 + BeginLoop_1_3_4 + BeginLoop_1_3_3 + BeginLoop_1_3_2 + BeginLoop_1_3_1 + BeginLoop_1_3_0 + BeginLoop_4_2_2 + Be... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Turn_2_4 + -Turn_3_4 + -Turn_1_4 + -Turn_0_4 + -Turn_0_3 + -Turn_0_2 + -Turn_0_1 + -Turn_0_0 + -Turn_1_0 + -Turn_1_1 + -Turn_1_2 + -Turn_1_3 + -Turn_3_3 + -Turn_3_2 + -Turn_3_1 + -Turn_3_0 + -Turn_2_3 + -Turn_2_2 + -Turn_2_1 + -Turn_2_0 > -3)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EndTurn_0_3 + -WantSection_0_F + -WantSection_0_T + -WantSection_1_F + -WantSection_1_T + -WantSection_2_F + -WantSection_2_T + -WantSection_3_F + -WantSection_3_T + -WantSection_4_F + -WantSection_4_T + EndTurn_0_0 + EndTurn_4_3 + EndTurn_4_2 + EndTurn_4_1 + EndTurn_4_0 + EndTurn_3_3 + EndTurn_3_2 + EndTurn_3_1 + EndTurn_3_0 + EndTurn_2_3 + EndTurn_2_2 + EndTurn_2_1 + EndTurn_2_0 + EndTurn_0_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EndTurn_0_3 + -WantSection_0_F + -WantSection_0_T + -WantSection_1_F + -WantSection_1_T + -WantSection_2_F + -WantSection_2_T + -WantSection_3_F + -WantSection_3_T + -WantSection_4_F + -WantSection_4_T + EndTurn_0_0 + EndTurn_4_3 + EndTurn_4_2 + EndTurn_4_1 + EndTurn_4_0 + EndTurn_3_3 + EndTurn_3_2 + EndTurn_3_1 + EndTurn_3_0 + EndTurn_2_3 + EndTurn_2_2 + EndTurn_2_1 + EndTurn_2_0 + EndTu... (shortened)
lola: processed formula length: 481
lola: 242017 rewrites
lola: formula mentions 30 of 480 places; total mentions: 30
lola: closed formula file Peterson-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EG (WantSection_0_F + WantSection_0_T + WantSection_1_F + WantSection_1_T + WantSection_2_F + WantSection_2_T + WantSection_3_F + WantSection_3_T + WantSection_4_F + WantSection_4_T + -TestTurn_4_3 + -TestTurn_4_2 + -TestTurn_4_1 + -TestTurn_4_0 + -TestTurn_3_3 + -TestTurn_3_2 + -TestTurn_3_1 + -TestTurn_3_0 + -TestTurn_2_3 + -TestTurn_2_2 + -TestTurn_2_1 + -TestTurn_2_0 + -TestTurn_1_3 + -Tes... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(!(A(TRUE U !(WantSection_0_F + WantSection_0_T + WantSection_1_F + WantSection_1_T + WantSection_2_F + WantSection_2_T + WantSection_3_F + WantSection_3_T + WantSection_4_F + WantSection_4_T + -TestTurn_4_3 + -TestTurn_4_2 + -TestTurn_4_1 + -TestTurn_4_0 + -TestTurn_3_3 + -TestTurn_3_2 + -TestTurn_3_1 + -TestTurn_3_0 + -TestTurn_2_3 + -TestTurn_2_2 + -TestTurn_2_1 + -TestTurn_2_0 + -TestTurn_1_... (shortened)
lola: processed formula length: 521
lola: 242018 rewrites
lola: formula mentions 30 of 480 places; total mentions: 30
lola: closed formula file Peterson-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 366 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-TestAlone_4_2_3 + -TestAlone_1_3_4 + -TestAlone_1_3_3 + -TestAlone_1_3_2 + -TestAlone_1_3_0 + -TestAlone_4_1_3 + -TestAlone_4_1_2 + -TestAlone_4_1_1 + -TestAlone_4_1_0 + -TestAlone_1_2_4 + -TestAlone_1_2_3 + -TestAlone_1_2_2 + -TestAlone_1_2_0 + -TestAlone_4_0_3 + -TestAlone_4_0_2 + -TestAlone_4_0_1 + -TestAlone_4_0_0 + -TestAlone_1_1_4 + -TestAlone_1_1_3 + -TestAlone_1_1_2 + -TestAlone_1_1_0 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-TestAlone_4_2_3 + -TestAlone_1_3_4 + -TestAlone_1_3_3 + -TestAlone_1_3_2 + -TestAlone_1_3_0 + -TestAlone_4_1_3 + -TestAlone_4_1_2 + -TestAlone_4_1_1 + -TestAlone_4_1_0 + -TestAlone_1_2_4 + -TestAlone_1_2_3 + -TestAlone_1_2_2 + -TestAlone_1_2_0 + -TestAlone_4_0_3 + -TestAlone_4_0_2 + -TestAlone_4_0_1 + -TestAlone_4_0_0 + -TestAlone_1_1_4 + -TestAlone_1_1_3 + -TestAlone_1_1_2 + -TestAlone_1_1_0 +... (shortened)
lola: processed formula length: 1669
lola: 242018 rewrites
lola: formula mentions 90 of 480 places; total mentions: 95
lola: closed formula file Peterson-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EF (-TestAlone_4_2_3 + IsEndLoop_2_3_4 + -TestAlone_1_3_4 + -TestAlone_1_3_3 + -TestAlone_1_3_2 + -TestAlone_1_3_0 + IsEndLoop_2_3_3 + IsEndLoop_2_3_2 + IsEndLoop_2_3_1 + IsEndLoop_2_3_0 + -TestAlone_4_1_3 + -TestAlone_4_1_2 + -TestAlone_4_1_1 + -TestAlone_4_1_0 + -TestAlone_1_2_4 + -TestAlone_1_2_3 + -TestAlone_1_2_2 + -TestAlone_1_2_0 + IsEndLoop_2_2_4 + IsEndLoop_2_2_3 + IsEndLoop_2_2_2 + IsE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U -TestAlone_4_2_3 + IsEndLoop_2_3_4 + -TestAlone_1_3_4 + -TestAlone_1_3_3 + -TestAlone_1_3_2 + -TestAlone_1_3_0 + IsEndLoop_2_3_3 + IsEndLoop_2_3_2 + IsEndLoop_2_3_1 + IsEndLoop_2_3_0 + -TestAlone_4_1_3 + -TestAlone_4_1_2 + -TestAlone_4_1_1 + -TestAlone_4_1_0 + -TestAlone_1_2_4 + -TestAlone_1_2_3 + -TestAlone_1_2_2 + -TestAlone_1_2_0 + IsEndLoop_2_2_4 + IsEndLoop_2_2_3 + IsEndLoop_2_2_2 ... (shortened)
lola: processed formula length: 7860
lola: 242018 rewrites
lola: formula mentions 290 of 480 places; total mentions: 390
lola: closed formula file Peterson-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (AF ((Turn_2_4 + Turn_3_4 + Turn_1_4 + Turn_0_4 + -IsEndLoop_2_3_4 + -IsEndLoop_2_3_3 + -IsEndLoop_2_3_2 + -IsEndLoop_2_3_1 + -IsEndLoop_2_3_0 + Turn_0_3 + Turn_0_2 + Turn_0_1 + Turn_0_0 + -IsEndLoop_2_2_4 + -IsEndLoop_2_2_3 + -IsEndLoop_2_2_2 + -IsEndLoop_2_2_1 + -IsEndLoop_2_2_0 + -IsEndLoop_2_1_4 + -IsEndLoop_2_1_3 + -IsEndLoop_2_1_2 + -IsEndLoop_2_1_1 + -IsEndLoop_2_1_0 + -IsEndLoop_2_0_4 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (Turn_2_4 + Turn_3_4 + Turn_1_4 + Turn_0_4 + -IsEndLoop_2_3_4 + -IsEndLoop_2_3_3 + -IsEndLoop_2_3_2 + -IsEndLoop_2_3_1 + -IsEndLoop_2_3_0 + Turn_0_3 + Turn_0_2 + Turn_0_1 + Turn_0_0 + -IsEndLoop_2_2_4 + -IsEndLoop_2_2_3 + -IsEndLoop_2_2_2 + -IsEndLoop_2_2_1 + -IsEndLoop_2_2_0 + -IsEndLoop_2_1_4 + -IsEndLoop_2_1_3 + -IsEndLoop_2_1_2 + -IsEndLoop_2_1_1 + -IsEndLoop_2_1_0 + -IsEndLoop_2_0... (shortened)
lola: processed formula length: 2446
lola: 242018 rewrites
lola: formula mentions 140 of 480 places; total mentions: 140
lola: closed formula file Peterson-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-AskForSection_4_2 + -AskForSection_4_1 + -AskForSection_4_0 + -AskForSection_4_3 + -AskForSection_3_3 + -AskForSection_3_2 + -AskForSection_3_1 + -AskForSection_3_0 + -AskForSection_2_3 + -AskForSection_2_2 + -AskForSection_2_1 + -AskForSection_2_0 + -AskForSection_1_3 + -AskForSection_1_2 + -AskForSection_1_1 + -AskForSection_1_0 + -AskForSection_0_3 + -AskForSection_0_2 + -AskForSection_0_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-AskForSection_4_2 + -AskForSection_4_1 + -AskForSection_4_0 + -AskForSection_4_3 + -AskForSection_3_3 + -AskForSection_3_2 + -AskForSection_3_1 + -AskForSection_3_0 + -AskForSection_2_3 + -AskForSection_2_2 + -AskForSection_2_1 + -AskForSection_2_0 + -AskForSection_1_3 + -AskForSection_1_2 + -AskForSection_1_1 + -AskForSection_1_0 + -AskForSection_0_3 + -AskForSection_0_2 + -AskForSecti... (shortened)
lola: processed formula length: 942
lola: 242017 rewrites
lola: formula mentions 50 of 480 places; total mentions: 50
lola: closed formula file Peterson-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG (-IsEndLoop_2_3_4 + -IsEndLoop_2_3_3 + -IsEndLoop_2_3_2 + -IsEndLoop_2_3_1 + -IsEndLoop_2_3_0 + -IsEndLoop_2_2_4 + -IsEndLoop_2_2_3 + -IsEndLoop_2_2_2 + -IsEndLoop_2_2_1 + -IsEndLoop_2_2_0 + -IsEndLoop_2_1_4 + -IsEndLoop_2_1_3 + -IsEndLoop_2_1_2 + -IsEndLoop_2_1_1 + -IsEndLoop_2_1_0 + -IsEndLoop_2_0_4 + -IsEndLoop_2_0_3 + -IsEndLoop_2_0_2 + -IsEndLoop_2_0_1 + -IsEndLoop_2_0_0 + -IsEndLoop_4_3_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-IsEndLoop_2_3_4 + -IsEndLoop_2_3_3 + -IsEndLoop_2_3_2 + -IsEndLoop_2_3_1 + -IsEndLoop_2_3_0 + -IsEndLoop_2_2_4 + -IsEndLoop_2_2_3 + -IsEndLoop_2_2_2 + -IsEndLoop_2_2_1 + -IsEndLoop_2_2_0 + -IsEndLoop_2_1_4 + -IsEndLoop_2_1_3 + -IsEndLoop_2_1_2 + -IsEndLoop_2_1_1 + -IsEndLoop_2_1_0 + -IsEndLoop_2_0_4 + -IsEndLoop_2_0_3 + -IsEndLoop_2_0_2 + -IsEndLoop_2_0_1 + -IsEndLoop_2_0_0 + -IsEndLoop_4_3_4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-IsEndLoop_2_3_4 + -IsEndLoop_2_3_3 + -IsEndLoop_2_3_2 + -IsEndLoop_2_3_1 + -IsEndLoop_2_3_0 + -IsEndLoop_2_2_4 + -IsEndLoop_2_2_3 + -IsEndLoop_2_2_2 + -IsEndLoop_2_2_1 + -IsEndLoop_2_2_0 + -IsEndLoop_2_1_4 + -IsEndLoop_2_1_3 + -IsEndLoop_2_1_2 + -IsEndLoop_2_1_1 + -IsEndLoop_2_1_0 + -IsEndLoop_2_0_4 + -IsEndLoop_2_0_3 + -IsEndLoop_2_0_2 + -IsEndLoop_2_0_1 + -IsEndLoop_2_0_0 + -IsEndL... (shortened)
lola: processed formula length: 1918
lola: 242017 rewrites
lola: formula mentions 100 of 480 places; total mentions: 100
lola: closed formula file Peterson-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 717 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (AF ((-IsEndLoop_2_3_4 + -IsEndLoop_2_3_3 + -IsEndLoop_2_3_2 + -IsEndLoop_2_3_1 + -IsEndLoop_2_3_0 + -IsEndLoop_2_2_4 + -IsEndLoop_2_2_3 + -IsEndLoop_2_2_2 + -IsEndLoop_2_2_1 + -IsEndLoop_2_2_0 + -IsEndLoop_2_1_4 + -IsEndLoop_2_1_3 + -IsEndLoop_2_1_2 + -IsEndLoop_2_1_1 + -IsEndLoop_2_1_0 + -IsEndLoop_2_0_4 + -IsEndLoop_2_0_3 + -IsEndLoop_2_0_2 + -IsEndLoop_2_0_1 + -IsEndLoop_2_0_0 + -IsEndLoop_4_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 717 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-IsEndLoop_2_3_4 + -IsEndLoop_2_3_3 + -IsEndLoop_2_3_2 + -IsEndLoop_2_3_1 + -IsEndLoop_2_3_0 + -IsEndLoop_2_2_4 + -IsEndLoop_2_2_3 + -IsEndLoop_2_2_2 + -IsEndLoop_2_2_1 + -IsEndLoop_2_2_0 + -IsEndLoop_2_1_4 + -IsEndLoop_2_1_3 + -IsEndLoop_2_1_2 + -IsEndLoop_2_1_1 + -IsEndLoop_2_1_0 + -IsEndLoop_2_0_4 + -IsEndLoop_2_0_3 + -IsEndLoop_2_0_2 + -IsEndLoop_2_0_1 + -IsEndLoop_2_0_0 + -IsEndLoop_4_3_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-IsEndLoop_2_3_4 + -IsEndLoop_2_3_3 + -IsEndLoop_2_3_2 + -IsEndLoop_2_3_1 + -IsEndLoop_2_3_0 + -IsEndLoop_2_2_4 + -IsEndLoop_2_2_3 + -IsEndLoop_2_2_2 + -IsEndLoop_2_2_1 + -IsEndLoop_2_2_0 + -IsEndLoop_2_1_4 + -IsEndLoop_2_1_3 + -IsEndLoop_2_1_2 + -IsEndLoop_2_1_1 + -IsEndLoop_2_1_0 + -IsEndLoop_2_0_4 + -IsEndLoop_2_0_3 + -IsEndLoop_2_0_2 + -IsEndLoop_2_0_1 + -IsEndLoop_2_0_0 + -IsEndLoop... (shortened)
lola: processed formula length: 5241
lola: 242017 rewrites
lola: formula mentions 260 of 480 places; total mentions: 280
lola: closed formula file Peterson-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 955 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-EndTurn_0_3 + -EndTurn_0_0 + -EndTurn_4_3 + -EndTurn_4_2 + -EndTurn_4_1 + -EndTurn_4_0 + -EndTurn_3_3 + -EndTurn_3_2 + -EndTurn_3_1 + -EndTurn_3_0 + -EndTurn_2_3 + -EndTurn_2_2 + -EndTurn_2_1 + -EndTurn_2_0 + -EndTurn_0_1 + -EndTurn_1_3 + -EndTurn_1_2 + -EndTurn_1_1 + -EndTurn_1_0 + -EndTurn_0_2 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-WantSection_0_F + -WantSection_0_T + -WantSection_1_F + -WantSection_1_T + -WantSection_2_F + -WantSection_2_T + -WantSection_3_F + -WantSection_3_T + -WantSection_4_F + -WantSection_4_T + AskForSection_4_2 + AskForSection_4_1 + AskForSection_4_0 + AskForSection_4_3 + AskForSection_3_3 + AskForSection_3_2 + AskForSection_3_1 + AskForSection_3_0 + AskForSection_2_3 + AskForSection_2_2 + AskFor... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-WantSection_0_F + -WantSection_0_T + -WantSection_1_F + -WantSection_1_T + -WantSection_2_F + -WantSection_2_T + -WantSection_3_F + -WantSection_3_T + -WantSection_4_F + -WantSection_4_T + AskForSection_4_2 + AskForSection_4_1 + AskForSection_4_0 + AskForSection_4_3 + AskForSection_3_3 + AskForSection_3_2 + AskForSection_3_1 + AskForSection_3_0 + AskForSection_2_3 + AskForSection_2_2... (shortened)
lola: processed formula length: 608
lola: 242017 rewrites
lola: formula mentions 30 of 480 places; total mentions: 30
lola: closed formula file Peterson-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 15 will run for 2861 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-TestIdentity_3_3_4 + -TestIdentity_3_3_3 + -TestIdentity_3_3_2 + -TestIdentity_3_3_1 + -TestIdentity_3_3_0 + -TestIdentity_3_2_4 + -TestIdentity_3_2_3 + -TestIdentity_3_2_2 + -TestIdentity_3_2_1 + -TestIdentity_3_2_0 + -TestIdentity_0_3_4 + -TestIdentity_0_3_3 + -TestIdentity_0_3_2 + -TestIdentity_0_3_1 + -TestIdentity_0_3_0 + -TestIdentity_3_1_4 + -TestIdentity_3_1_3 + -TestIdentity_3_1_2 + -Te... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2861 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -TestIdentity_3_3_4 + -TestIdentity_3_3_3 + -TestIdentity_3_3_2 + -TestIdentity_3_3_1 + -TestIdentity_3_3_0 + -TestIdentity_3_2_4 + -TestIdentity_3_2_3 + -TestIdentity_3_2_2 + -TestIdentity_3_2_1 + -TestIdentity_3_2_0 + -TestIdentity_0_3_4 + -TestIdentity_0_3_3 + -TestIdentity_0_3_2 + -TestIdentity_0_3_1 + -TestIdentity_0_3_0 + -TestIdentity_3_1_4 + -TestIdentity_3_1_3 + -TestIdentity_3_1_2 + -Tes... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Peterson-COL-4-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola: summary: unknown yes yes yes yes no yes no unknown no no yes no yes yes unknown

BK_STOP 1463692625511

--------------------
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="Peterson-PT-4"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/Peterson-PT-4.tgz
mv Peterson-PT-4 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is Peterson-PT-4, 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 r086kn-ebro-146369088100075"
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 ;