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 S_Peterson-PT-6, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170kn-ebro-146433133600633
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464475885853

bkconf 3600
===========================================================================================
===========================================================================================
S_Peterson-PT-6: translating Petri net model.pnml into LoLA format
S_Peterson-PT-6: translating formula CTLCardinality into LoLA format
===========================================================================================
===========================================================================================
/home/mcc/BenchKit/bin/formula2lola.py CTLCardinality.xml
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
touch formulae;


in benchkit_head lolaszeit 3536
CTLCardinality @ S_Peterson-PT-6
FORMULA Peterson-COL-6-CTLCardinality-0 CANNOT_COMPUTE
FORMULA Peterson-COL-6-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-6-CTLCardinality-2 CANNOT_COMPUTE
FORMULA Peterson-COL-6-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-6-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-6-CTLCardinality-5 CANNOT_COMPUTE
FORMULA Peterson-COL-6-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-6-CTLCardinality-7 CANNOT_COMPUTE
FORMULA Peterson-COL-6-CTLCardinality-8 CANNOT_COMPUTE
FORMULA Peterson-COL-6-CTLCardinality-9 CANNOT_COMPUTE
FORMULA Peterson-COL-6-CTLCardinality-10 CANNOT_COMPUTE
FORMULA Peterson-COL-6-CTLCardinality-11 CANNOT_COMPUTE
FORMULA Peterson-COL-6-CTLCardinality-12 CANNOT_COMPUTE
FORMULA Peterson-COL-6-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-6-CTLCardinality-14 CANNOT_COMPUTE
FORMULA Peterson-COL-6-CTLCardinality-15 CANNOT_COMPUTE
lola: LoLA will run for 3536 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3360/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 1330 places, 2030 transitions, 1303 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3129 transition conflict sets
lola: TASK
lola: reading formula from Peterson-COL-6-CTLCardinality.task
lola: read: EF (AX ((1 <= TestAlone_5_0_1 + TestAlone_4_0_1 + TestAlone_3_0_1 + TestAlone_2_0_1 + TestAlone_0_0_1 + TestAlone_6_5_0 + TestAlone_5_5_0 + TestAlone_4_5_0 + TestAlone_3_5_0 + TestAlone_2_5_0 + TestAlone_1_5_0 + TestAlone_6_4_0 + TestAlone_5_4_0 + TestAlone_4_4_0 + TestAlone_3_4_0 + TestAlone_2_4_0 + TestAlone_2_3_1 + TestAlone_3_3_1 + TestAlone_6_2_1 + TestAlone_0_3_1 + TestAlone_4_2_1 + TestAlon... (shortened)
lola: formula length: 149389
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AX ((-TestAlone_1_4_6 + -TestAlone_4_2_6 + -TestAlone_4_2_5 + -TestAlone_4_2_3 + -TestAlone_4_2_2 + -TestAlone_4_2_1 + -TestAlone_4_2_0 + -TestAlone_1_3_6 + -TestAlone_1_3_5 + -TestAlone_1_3_4 + -TestAlone_1_3_3 + -TestAlone_1_3_2 + -TestAlone_1_3_0 + -TestAlone_4_1_6 + -TestAlone_4_1_5 + -TestAlone_4_1_3 + -TestAlone_4_1_2 + -TestAlone_4_1_1 + -TestAlone_4_1_0 + -TestAlone_6_5_5 + -TestAlone_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((-TestAlone_1_4_6 + -TestAlone_4_2_6 + -TestAlone_4_2_5 + -TestAlone_4_2_3 + -TestAlone_4_2_2 + -TestAlone_4_2_1 + -TestAlone_4_2_0 + -TestAlone_1_3_6 + -TestAlone_1_3_5 + -TestAlone_1_3_4 + -TestAlone_1_3_3 + -TestAlone_1_3_2 + -TestAlone_1_3_0 + -TestAlone_4_1_6 + -TestAlone_4_1_5 + -TestAlone_4_1_3 + -TestAlone_4_1_2 + -TestAlone_4_1_1 + -TestAlone_4_1_0 + -TestAlone_6_5_5 + -TestAl... (shortened)
lola: processed formula length: 5697
lola: 1681254 rewrites
lola: formula mentions 294 of 1330 places; total mentions: 294
lola: closed formula file Peterson-COL-6-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5212 bytes per marking, with 0 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E(-TestTurn_6_5 + -TestTurn_6_4 + -TestTurn_6_3 + -TestTurn_6_2 + -TestTurn_6_1 + -TestTurn_6_0 + -TestTurn_5_5 + -TestTurn_5_4 + -TestTurn_5_3 + -TestTurn_5_2 + -TestTurn_5_1 + -TestTurn_5_0 + -TestTurn_4_5 + -TestTurn_4_4 + -TestTurn_4_3 + -TestTurn_4_2 + -TestTurn_4_1 + -TestTurn_4_0 + -TestTurn_3_5 + -TestTurn_3_4 + -TestTurn_3_3 + -TestTurn_3_2 + -TestTurn_3_1 + -TestTurn_3_0 + -TestTurn_2_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-TestTurn_6_5 + -TestTurn_6_4 + -TestTurn_6_3 + -TestTurn_6_2 + -TestTurn_6_1 + -TestTurn_6_0 + -TestTurn_5_5 + -TestTurn_5_4 + -TestTurn_5_3 + -TestTurn_5_2 + -TestTurn_5_1 + -TestTurn_5_0 + -TestTurn_4_5 + -TestTurn_4_4 + -TestTurn_4_3 + -TestTurn_4_2 + -TestTurn_4_1 + -TestTurn_4_0 + -TestTurn_3_5 + -TestTurn_3_4 + -TestTurn_3_3 + -TestTurn_3_2 + -TestTurn_3_1 + -TestTurn_3_0 + -TestTurn_2_5 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-TestTurn_6_5 + -TestTurn_6_4 + -TestTurn_6_3 + -TestTurn_6_2 + -TestTurn_6_1 + -TestTurn_6_0 + -TestTurn_5_5 + -TestTurn_5_4 + -TestTurn_5_3 + -TestTurn_5_2 + -TestTurn_5_1 + -TestTurn_5_0 + -TestTurn_4_5 + -TestTurn_4_4 + -TestTurn_4_3 + -TestTurn_4_2 + -TestTurn_4_1 + -TestTurn_4_0 + -TestTurn_3_5 + -TestTurn_3_4 + -TestTurn_3_3 + -TestTurn_3_2 + -TestTurn_3_1 + -TestTurn_3_0 + -TestTurn_2_5 ... (shortened)
lola: processed formula length: 6730
lola: 1681253 rewrites
lola: formula mentions 378 of 1330 places; total mentions: 378
lola: closed formula file Peterson-COL-6-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5212 bytes per marking, with 0 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 2 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (-EndTurn_0_5 + -EndTurn_0_0 + -EndTurn_0_1 + CS_6 + CS_5 + CS_4 + CS_3 + CS_2 + CS_1 + CS_0 + -EndTurn_0_2 + -EndTurn_0_3 + -EndTurn_0_4 + -EndTurn_6_5 + -EndTurn_6_4 + -EndTurn_6_3 + -EndTurn_6_2 + -EndTurn_6_1 + -EndTurn_6_0 + -EndTurn_5_5 + -EndTurn_5_4 + -EndTurn_5_3 + -EndTurn_5_2 + -EndTurn_5_1 + -EndTurn_5_0 + -EndTurn_4_5 + -EndTurn_4_4 + -EndTurn_4_3 + -EndTurn_4_2 + -EndTurn_4_1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U !(E(TRUE U !(-EndTurn_0_5 + -EndTurn_0_0 + -EndTurn_0_1 + CS_6 + CS_5 + CS_4 + CS_3 + CS_2 + CS_1 + CS_0 + -EndTurn_0_2 + -EndTurn_0_3 + -EndTurn_0_4 + -EndTurn_6_5 + -EndTurn_6_4 + -EndTurn_6_3 + -EndTurn_6_2 + -EndTurn_6_1 + -EndTurn_6_0 + -EndTurn_5_5 + -EndTurn_5_4 + -EndTurn_5_3 + -EndTurn_5_2 + -EndTurn_5_1 + -EndTurn_5_0 + -EndTurn_4_5 + -EndTurn_4_4 + -EndTurn_4_3 + -EndTurn_4_2 +... (shortened)
lola: processed formula length: 706
lola: 1681254 rewrites
lola: formula mentions 49 of 1330 places; total mentions: 49
lola: closed formula file Peterson-COL-6-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5212 bytes per marking, with 0 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 3 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EX (-TestTurn_6_5 + -TestTurn_6_4 + -TestTurn_6_3 + -TestTurn_6_2 + -TestTurn_6_1 + -TestTurn_6_0 + -TestTurn_5_5 + -TestTurn_5_4 + -TestTurn_5_3 + -TestTurn_5_2 + -TestTurn_5_1 + -TestTurn_5_0 + -TestTurn_4_5 + -TestTurn_4_4 + -TestTurn_4_3 + -TestTurn_4_2 + -TestTurn_4_1 + -TestTurn_4_0 + -TestTurn_3_5 + -TestTurn_3_4 + -TestTurn_3_3 + -TestTurn_3_2 + -TestTurn_3_1 + -TestTurn_3_0 + -TestTur... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX(-TestTurn_6_5 + -TestTurn_6_4 + -TestTurn_6_3 + -TestTurn_6_2 + -TestTurn_6_1 + -TestTurn_6_0 + -TestTurn_5_5 + -TestTurn_5_4 + -TestTurn_5_3 + -TestTurn_5_2 + -TestTurn_5_1 + -TestTurn_5_0 + -TestTurn_4_5 + -TestTurn_4_4 + -TestTurn_4_3 + -TestTurn_4_2 + -TestTurn_4_1 + -TestTurn_4_0 + -TestTurn_3_5 + -TestTurn_3_4 + -TestTurn_3_3 + -TestTurn_3_2 + -TestTurn_3_1 + -TestTurn_3_0 + -Tes... (shortened)
lola: processed formula length: 689
lola: 1681254 rewrites
lola: formula mentions 42 of 1330 places; total mentions: 42
lola: closed formula file Peterson-COL-6-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5212 bytes per marking, with 0 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 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (-TestTurn_6_5 + -TestTurn_6_4 + -TestTurn_6_3 + -TestTurn_6_2 + -TestTurn_6_1 + -TestTurn_6_0 + -TestTurn_5_5 + -TestTurn_5_4 + -TestTurn_5_3 + -TestTurn_5_2 + -TestTurn_5_1 + -TestTurn_5_0 + -TestTurn_4_5 + -TestTurn_4_4 + -TestTurn_4_3 + -TestTurn_4_2 + -TestTurn_4_1 + -TestTurn_4_0 + -TestTurn_3_5 + -TestTurn_3_4 + -TestTurn_3_3 + -TestTurn_3_2 + -TestTurn_3_1 + -TestTurn_3_0 + -TestTurn_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-TestTurn_6_5 + -TestTurn_6_4 + -TestTurn_6_3 + -TestTurn_6_2 + -TestTurn_6_1 + -TestTurn_6_0 + -TestTurn_5_5 + -TestTurn_5_4 + -TestTurn_5_3 + -TestTurn_5_2 + -TestTurn_5_1 + -TestTurn_5_0 + -TestTurn_4_5 + -TestTurn_4_4 + -TestTurn_4_3 + -TestTurn_4_2 + -TestTurn_4_1 + -TestTurn_4_0 + -TestTurn_3_5 + -TestTurn_3_4 + -TestTurn_3_3 + -TestTurn_3_2 + -TestTurn_3_1 + -TestTurn_3_0 + -TestTurn_2_... (shortened)
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 5212 bytes per marking, with 0 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 5 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-EndTurn_0_5 + -EndTurn_0_0 + -EndTurn_0_1 + -EndTurn_0_2 + -EndTurn_0_3 + -EndTurn_0_4 + -EndTurn_6_5 + -EndTurn_6_4 + -EndTurn_6_3 + -EndTurn_6_2 + -EndTurn_6_1 + -EndTurn_6_0 + -EndTurn_5_5 + -EndTurn_5_4 + -EndTurn_5_3 + -EndTurn_5_2 + -EndTurn_5_1 + -EndTurn_5_0 + -EndTurn_4_5 + -EndTurn_4_4 + -EndTurn_4_3 + -EndTurn_4_2 + -EndTurn_4_1 + -EndTurn_4_0 + -EndTurn_3_5 + -EndTurn_3_4 + -EndTurn... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-EndTurn_0_5 + -EndTurn_0_0 + -EndTurn_0_1 + -EndTurn_0_2 + -EndTurn_0_3 + -EndTurn_0_4 + -EndTurn_6_5 + -EndTurn_6_4 + -EndTurn_6_3 + -EndTurn_6_2 + -EndTurn_6_1 + -EndTurn_6_0 + -EndTurn_5_5 + -EndTurn_5_4 + -EndTurn_5_3 + -EndTurn_5_2 + -EndTurn_5_1 + -EndTurn_5_0 + -EndTurn_4_5 + -EndTurn_4_4 + -EndTurn_4_3 + -EndTurn_4_2 + -EndTurn_4_1 + -EndTurn_4_0 + -EndTurn_3_5 + -EndTurn_3_4 + -EndTurn... (shortened)
lola: processed formula length: 11725
lola: 1681253 rewrites
lola: formula mentions 595 of 1330 places; total mentions: 595
lola: closed formula file Peterson-COL-6-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5212 bytes per marking, with 0 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 5 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AG (-CS_6 + -CS_5 + -CS_4 + -CS_3 + -CS_2 + -CS_1 + -CS_0 <= -3) OR (TestIdentity_3_4_6 + TestIdentity_6_2_6 + TestIdentity_6_2_0 + -BeginLoop_1_4_6 + -BeginLoop_1_4_5 + -BeginLoop_1_4_4 + -BeginLoop_1_4_3 + -BeginLoop_1_4_2 + -BeginLoop_1_4_1 + -BeginLoop_1_4_0 + TestIdentity_6_2_1 + TestIdentity_6_2_2 + -BeginLoop_4_2_6 + -BeginLoop_4_2_5 + -BeginLoop_4_2_4 + -BeginLoop_4_2_3 + -BeginLoop_4_2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-CS_6 + -CS_5 + -CS_4 + -CS_3 + -CS_2 + -CS_1 + -CS_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 5212 bytes per marking, with 0 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 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (TestIdentity_3_4_6 + TestIdentity_6_2_6 + TestIdentity_6_2_0 + -BeginLoop_1_4_6 + -BeginLoop_1_4_5 + -BeginLoop_1_4_4 + -BeginLoop_1_4_3 + -BeginLoop_1_4_2 + -BeginLoop_1_4_1 + -BeginLoop_1_4_0 + TestIdentity_6_2_1 + TestIdentity_6_2_2 + -BeginLoop_4_2_6 + -BeginLoop_4_2_5 + -BeginLoop_4_2_4 + -BeginLoop_4_2_3 + -BeginLoop_4_2_2 + -BeginLoop_4_2_1 + -BeginLoop_4_2_0 + TestIdentity_0_5_6 + TestIde... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file Peterson-COL-6-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-Turn_2_6 + -Turn_3_6 + -Turn_4_6 + -Turn_5_6 + -Turn_0_6 + -Turn_1_6 + -Turn_1_5 + -Turn_1_4 + -Turn_1_3 + -Turn_1_2 + -Turn_1_1 + -Turn_1_0 + -Turn_0_5 + -Turn_0_4 + -Turn_0_3 + -Turn_0_2 + -Turn_0_1 + -Turn_0_0 + -Turn_5_5 + -Turn_5_4 + -Turn_5_3 + -Turn_5_2 + -Turn_5_1 + -Turn_5_0 + -Turn_4_5 + -Turn_4_4 + -Turn_4_3 + -Turn_4_2 + -Turn_4_1 + -Turn_4_0 + -Turn_3_5 + -Turn_3_4 + -Turn_3_3 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-Turn_2_6 + -Turn_3_6 + -Turn_4_6 + -Turn_5_6 + -Turn_0_6 + -Turn_1_6 + -Turn_1_5 + -Turn_1_4 + -Turn_1_3 + -Turn_1_2 + -Turn_1_1 + -Turn_1_0 + -Turn_0_5 + -Turn_0_4 + -Turn_0_3 + -Turn_0_2 + -Turn_0_1 + -Turn_0_0 + -Turn_5_5 + -Turn_5_4 + -Turn_5_3 + -Turn_5_2 + -Turn_5_1 + -Turn_5_0 + -Turn_4_5 + -Turn_4_4 + -Turn_4_3 + -Turn_4_2 + -Turn_4_1 + -Turn_4_0 + -Turn_3_5 + -Turn_3_4 + -Tu... (shortened)
lola: processed formula length: 523
lola: 1681253 rewrites
lola: formula mentions 42 of 1330 places; total mentions: 42
lola: closed formula file Peterson-COL-6-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5212 bytes per marking, with 0 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: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AF (-AskForSection_4_5 + -AskForSection_4_4 + -AskForSection_4_3 + -AskForSection_4_2 + -AskForSection_4_1 + -AskForSection_4_0 + -AskForSection_3_5 + -AskForSection_3_4 + -AskForSection_3_3 + -AskForSection_3_2 + -AskForSection_3_1 + -AskForSection_3_0 + TestTurn_6_5 + TestTurn_6_4 + TestTurn_6_3 + TestTurn_6_2 + TestTurn_6_1 + TestTurn_6_0 + -AskForSection_2_5 + -AskForSection_2_4 + -AskForS... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(A(TRUE U -AskForSection_4_5 + -AskForSection_4_4 + -AskForSection_4_3 + -AskForSection_4_2 + -AskForSection_4_1 + -AskForSection_4_0 + -AskForSection_3_5 + -AskForSection_3_4 + -AskForSection_3_3 + -AskForSection_3_2 + -AskForSection_3_1 + -AskForSection_3_0 + TestTurn_6_5 + TestTurn_6_4 + TestTurn_6_3 + TestTurn_6_2 + TestTurn_6_1 + TestTurn_6_0 + -AskForSection_2_5 + -AskForSection_... (shortened)
lola: processed formula length: 1539
lola: 1681254 rewrites
lola: formula mentions 84 of 1330 places; total mentions: 84
lola: closed formula file Peterson-COL-6-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5212 bytes per marking, with 0 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 7 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(AG (TestIdentity_3_4_6 + TestIdentity_6_2_6 + TestIdentity_6_2_0 + TestIdentity_6_2_1 + TestIdentity_6_2_2 + TestIdentity_0_5_6 + TestIdentity_0_5_5 + TestIdentity_0_5_4 + TestIdentity_0_5_3 + TestIdentity_0_5_2 + TestIdentity_0_5_1 + TestIdentity_0_5_0 + TestIdentity_3_3_6 + TestIdentity_3_3_5 + TestIdentity_3_3_4 + TestIdentity_3_3_3 + TestIdentity_3_3_2 + TestIdentity_3_3_1 + TestIdentity_3_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(!(E(TRUE U !(TestIdentity_3_4_6 + TestIdentity_6_2_6 + TestIdentity_6_2_0 + TestIdentity_6_2_1 + TestIdentity_6_2_2 + TestIdentity_0_5_6 + TestIdentity_0_5_5 + TestIdentity_0_5_4 + TestIdentity_0_5_3 + TestIdentity_0_5_2 + TestIdentity_0_5_1 + TestIdentity_0_5_0 + TestIdentity_3_3_6 + TestIdentity_3_3_5 + TestIdentity_3_3_4 + TestIdentity_3_3_3 + TestIdentity_3_3_2 + TestIdentity_3_3_1 + TestIde... (shortened)
lola: processed formula length: 6777
lola: 1681255 rewrites
lola: formula mentions 343 of 1330 places; total mentions: 343
lola: closed formula file Peterson-COL-6-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5212 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-Turn_2_6 + -Turn_3_6 + -Turn_4_6 + -Turn_5_6 + -Turn_0_6 + -Turn_1_6 + -Turn_1_5 + -Turn_1_4 + -Turn_1_3 + -Turn_1_2 + -Turn_1_1 + -Turn_1_0 + -Turn_0_5 + -Turn_0_4 + -Turn_0_3 + -Turn_0_2 + -Turn_0_1 + -Turn_0_0 + CS_6 + CS_5 + CS_4 + CS_3 + CS_2 + CS_1 + CS_0 + -Turn_5_5 + -Turn_5_4 + -Turn_5_3 + -Turn_5_2 + -Turn_5_1 + -Turn_5_0 + -Turn_4_5 + -Turn_4_4 + -Turn_4_3 + -Turn_4_2 + -Turn_4_1 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -Turn_2_6 + -Turn_3_6 + -Turn_4_6 + -Turn_5_6 + -Turn_0_6 + -Turn_1_6 + -Turn_1_5 + -Turn_1_4 + -Turn_1_3 + -Turn_1_2 + -Turn_1_1 + -Turn_1_0 + -Turn_0_5 + -Turn_0_4 + -Turn_0_3 + -Turn_0_2 + -Turn_0_1 + -Turn_0_0 + CS_6 + CS_5 + CS_4 + CS_3 + CS_2 + CS_1 + CS_0 + -Turn_5_5 + -Turn_5_4 + -Turn_5_3 + -Turn_5_2 + -Turn_5_1 + -Turn_5_0 + -Turn_4_5 + -Turn_4_4 + -Turn_4_3 + -Turn_4_2 + -Turn_... (shortened)
lola: processed formula length: 564
lola: 1681253 rewrites
lola: formula mentions 49 of 1330 places; total mentions: 49
lola: closed formula file Peterson-COL-6-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5212 bytes per marking, with 0 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (E(Turn_2_6 + Turn_3_6 + Turn_4_6 + Turn_5_6 + -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 + -WantSection_5_F + -WantSection_5_T + -WantSection_6_F + -WantSection_6_T + Turn_0_6 + Turn_1_6 + Turn_1_5 + Turn_1_4 + Turn_1_3 + Turn_1_2 + Turn_1_1 + Turn_1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(E(Turn_2_6 + Turn_3_6 + Turn_4_6 + Turn_5_6 + -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 + -WantSection_5_F + -WantSection_5_T + -WantSection_6_F + -WantSection_6_T + Turn_0_6 + Turn_1_6 + Turn_1_5 + Turn_1_4 + Turn_1_3 + Turn_1_2 + Turn_1_1 ... (shortened)
lola: processed formula length: 1637
lola: 1681254 rewrites
lola: formula mentions 98 of 1330 places; total mentions: 98
lola: closed formula file Peterson-COL-6-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5212 bytes per marking, with 0 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 10 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EX (-BeginLoop_1_4_6 + -BeginLoop_1_4_5 + -BeginLoop_1_4_4 + -BeginLoop_1_4_3 + -BeginLoop_1_4_2 + -BeginLoop_1_4_1 + -BeginLoop_1_4_0 + -BeginLoop_4_2_6 + -BeginLoop_4_2_5 + -BeginLoop_4_2_4 + -BeginLoop_4_2_3 + -BeginLoop_4_2_2 + -BeginLoop_4_2_1 + -BeginLoop_4_2_0 + -BeginLoop_1_3_6 + -BeginLoop_1_3_5 + -BeginLoop_1_3_4 + -BeginLoop_1_3_3 + -BeginLoop_1_3_2 + -BeginLoop_1_3_1 + -BeginLoop_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(EX(-BeginLoop_1_4_6 + -BeginLoop_1_4_5 + -BeginLoop_1_4_4 + -BeginLoop_1_4_3 + -BeginLoop_1_4_2 + -BeginLoop_1_4_1 + -BeginLoop_1_4_0 + -BeginLoop_4_2_6 + -BeginLoop_4_2_5 + -BeginLoop_4_2_4 + -BeginLoop_4_2_3 + -BeginLoop_4_2_2 + -BeginLoop_4_2_1 + -BeginLoop_4_2_0 + -BeginLoop_1_3_6 + -BeginLoop_1_3_5 + -BeginLoop_1_3_4 + -BeginLoop_1_3_3 + -BeginLoop_1_3_2 + -BeginLoop_1_3_1 + -Beg... (shortened)
lola: processed formula length: 5608
lola: 1681254 rewrites
lola: formula mentions 294 of 1330 places; total mentions: 294
lola: closed formula file Peterson-COL-6-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5212 bytes per marking, with 0 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AG (-IsEndLoop_5_2_6 + -IsEndLoop_2_4_6 + -IsEndLoop_2_4_5 + -IsEndLoop_2_4_4 + -IsEndLoop_2_4_3 + -IsEndLoop_2_4_2 + -IsEndLoop_2_4_1 + -IsEndLoop_2_4_0 + -IsEndLoop_5_2_5 + -IsEndLoop_5_2_4 + -IsEndLoop_5_2_3 + -IsEndLoop_5_2_2 + -IsEndLoop_5_2_1 + -IsEndLoop_5_2_0 + -IsEndLoop_2_3_6 + -IsEndLoop_2_3_5 + -IsEndLoop_2_3_4 + -IsEndLoop_2_3_3 + -IsEndLoop_2_3_2 + -IsEndLoop_2_3_1 + -IsEndLoop_2_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-IsEndLoop_5_2_6 + -IsEndLoop_2_4_6 + -IsEndLoop_2_4_5 + -IsEndLoop_2_4_4 + -IsEndLoop_2_4_3 + -IsEndLoop_2_4_2 + -IsEndLoop_2_4_1 + -IsEndLoop_2_4_0 + -IsEndLoop_5_2_5 + -IsEndLoop_5_2_4 + -IsEndLoop_5_2_3 + -IsEndLoop_5_2_2 + -IsEndLoop_5_2_1 + -IsEndLoop_5_2_0 + -IsEndLoop_2_3_6 + -IsEndLoop_2_3_5 + -IsEndLoop_2_3_4 + -IsEndLoop_2_3_3 + -IsEndLoop_2_3_2 + -IsEndLoop_2_3_1 + -IsEndLoop_2_3_0... (shortened)
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 5212 bytes per marking, with 0 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 12 will run for 386 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AG (-AskForSection_4_5 + -AskForSection_4_4 + -AskForSection_4_3 + -AskForSection_4_2 + -AskForSection_4_1 + -AskForSection_4_0 + -AskForSection_3_5 + -AskForSection_3_4 + -AskForSection_3_3 + -AskForSection_3_2 + -AskForSection_3_1 + -AskForSection_3_0 + -AskForSection_2_5 + -AskForSection_2_4 + -AskForSection_2_3 + -AskForSection_2_2 + -AskForSection_2_1 + -AskForSection_2_0 + -AskForSection... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(E(TRUE U !(-AskForSection_4_5 + -AskForSection_4_4 + -AskForSection_4_3 + -AskForSection_4_2 + -AskForSection_4_1 + -AskForSection_4_0 + -AskForSection_3_5 + -AskForSection_3_4 + -AskForSection_3_3 + -AskForSection_3_2 + -AskForSection_3_1 + -AskForSection_3_0 + -AskForSection_2_5 + -AskForSection_2_4 + -AskForSection_2_3 + -AskForSection_2_2 + -AskForSection_2_1 + -AskForSection_2_0 + ... (shortened)
lola: processed formula length: 911
lola: 1681254 rewrites
lola: formula mentions 42 of 1330 places; total mentions: 42
lola: closed formula file Peterson-COL-6-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5212 bytes per marking, with 0 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: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((AX (TestTurn_6_5 + TestTurn_6_4 + TestTurn_6_3 + TestTurn_6_2 + TestTurn_6_1 + TestTurn_6_0 + TestTurn_5_5 + TestTurn_5_4 + TestTurn_5_3 + TestTurn_5_2 + TestTurn_5_1 + TestTurn_5_0 + TestTurn_4_5 + TestTurn_4_4 + TestTurn_4_3 + TestTurn_4_2 + TestTurn_4_1 + TestTurn_4_0 + TestTurn_3_5 + TestTurn_3_4 + TestTurn_3_3 + TestTurn_3_2 + TestTurn_3_1 + TestTurn_3_0 + TestTurn_2_5 + TestTurn_2_4 + T... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (AX(TestTurn_6_5 + TestTurn_6_4 + TestTurn_6_3 + TestTurn_6_2 + TestTurn_6_1 + TestTurn_6_0 + TestTurn_5_5 + TestTurn_5_4 + TestTurn_5_3 + TestTurn_5_2 + TestTurn_5_1 + TestTurn_5_0 + TestTurn_4_5 + TestTurn_4_4 + TestTurn_4_3 + TestTurn_4_2 + TestTurn_4_1 + TestTurn_4_0 + TestTurn_3_5 + TestTurn_3_4 + TestTurn_3_3 + TestTurn_3_2 + TestTurn_3_1 + TestTurn_3_0 + TestTurn_2_5 + TestTurn_2_4... (shortened)
lola: processed formula length: 1246
lola: 1681255 rewrites
lola: formula mentions 91 of 1330 places; total mentions: 91
lola: closed formula file Peterson-COL-6-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5212 bytes per marking, with 0 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 13 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG ((-TestAlone_1_4_6 + -TestAlone_4_2_6 + -TestAlone_4_2_5 + -TestAlone_4_2_3 + -TestAlone_4_2_2 + -TestAlone_4_2_1 + -TestAlone_4_2_0 + -TestAlone_1_3_6 + -TestAlone_1_3_5 + -TestAlone_1_3_4 + -TestAlone_1_3_3 + -TestAlone_1_3_2 + -TestAlone_1_3_0 + -TestAlone_4_1_6 + -TestAlone_4_1_5 + -TestAlone_4_1_3 + -TestAlone_4_1_2 + -TestAlone_4_1_1 + -TestAlone_4_1_0 + -TestAlone_6_5_5 + -TestAlone_6_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-TestAlone_1_4_6 + -TestAlone_4_2_6 + -TestAlone_4_2_5 + -TestAlone_4_2_3 + -TestAlone_4_2_2 + -TestAlone_4_2_1 + -TestAlone_4_2_0 + -TestAlone_1_3_6 + -TestAlone_1_3_5 + -TestAlone_1_3_4 + -TestAlone_1_3_3 + -TestAlone_1_3_2 + -TestAlone_1_3_0 + -TestAlone_4_1_6 + -TestAlone_4_1_5 + -TestAlone_4_1_3 + -TestAlone_4_1_2 + -TestAlone_4_1_1 + -TestAlone_4_1_0 + -TestAlone_6_5_5 + -TestAlone_6_5_... (shortened)
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 5212 bytes per marking, with 0 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 14 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-Idle_6 + -Idle_5 + -Idle_4 + -Idle_3 + -Idle_2 + -Idle_1 + -Idle_0 > -3 AND (-IsEndLoop_5_2_6 + -IsEndLoop_2_4_6 + -IsEndLoop_2_4_5 + -IsEndLoop_2_4_4 + -IsEndLoop_2_4_3 + -IsEndLoop_2_4_2 + -IsEndLoop_2_4_1 + -IsEndLoop_2_4_0 + -IsEndLoop_5_2_5 + -IsEndLoop_5_2_4 + -IsEndLoop_5_2_3 + -IsEndLoop_5_2_2 + -IsEndLoop_5_2_1 + -IsEndLoop_5_2_0 + -IsEndLoop_2_3_6 + -IsEndLoop_2_3_5 + -IsEndLoop_2_3_4 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 5 atomic propositions
lola: closed formula file Peterson-COL-6-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
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 14 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AF (-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 + -WantSection_5_F + -WantSection_5_T + -WantSection_6_F + -WantSection_6_T > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(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 + -WantSection_5_F + -WantSection_5_T + -WantSection_6_F + -WantSection_6_T > -3))))
lola: processed formula length: 294
lola: 1681254 rewrites
lola: formula mentions 14 of 1330 places; total mentions: 14
lola: closed formula file Peterson-COL-6-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5212 bytes per marking, with 0 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 15 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AG (BeginLoop_1_4_6 + BeginLoop_1_4_5 + BeginLoop_1_4_4 + BeginLoop_1_4_3 + BeginLoop_1_4_2 + BeginLoop_1_4_1 + BeginLoop_1_4_0 + BeginLoop_4_2_6 + BeginLoop_4_2_5 + BeginLoop_4_2_4 + BeginLoop_4_2_3 + BeginLoop_4_2_2 + BeginLoop_4_2_1 + BeginLoop_4_2_0 + BeginLoop_1_3_6 + BeginLoop_1_3_5 + BeginLoop_1_3_4 + BeginLoop_1_3_3 + BeginLoop_1_3_2 + BeginLoop_1_3_1 + BeginLoop_1_3_0 + BeginLoop_4_1_6 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (BeginLoop_1_4_6 + BeginLoop_1_4_5 + BeginLoop_1_4_4 + BeginLoop_1_4_3 + BeginLoop_1_4_2 + BeginLoop_1_4_1 + BeginLoop_1_4_0 + BeginLoop_4_2_6 + BeginLoop_4_2_5 + BeginLoop_4_2_4 + BeginLoop_4_2_3 + BeginLoop_4_2_2 + BeginLoop_4_2_1 + BeginLoop_4_2_0 + BeginLoop_1_3_6 + BeginLoop_1_3_5 + BeginLoop_1_3_4 + BeginLoop_1_3_3 + BeginLoop_1_3_2 + BeginLoop_1_3_1 + BeginLoop_1_3_0 + BeginLoop_4_1_6 + ... (shortened)
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 5212 bytes per marking, with 0 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: 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: RESULT
lola: summary: unknown yes unknown yes no unknown no unknown unknown unknown unknown unknown unknown no unknown unknown
lola: ========================================

BK_STOP 1464478963690

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

parsing of model.pnml complete

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-6"
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/S_Peterson-PT-6.tgz
mv S_Peterson-PT-6 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 S_Peterson-PT-6, 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 r170kn-ebro-146433133600633"
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 ;