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-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088100058
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463691917293

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLFireability @ Peterson-PT-2
FORMULA Peterson-COL-2-CTLFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-CTLFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-CTLFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-CTLFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-CTLFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-CTLFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-CTLFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-CTLFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-CTLFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-CTLFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-CTLFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-CTLFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-CTLFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-CTLFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-CTLFireability-14 CANNOT_COMPUTE
FORMULA Peterson-COL-2-CTLFireability-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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-CTLFireability.task
lola: read: EF (E((((((FIREABLE(EndLoop_2_1) OR FIREABLE(EndLoop_0_1)) OR FIREABLE(EndLoop_1_1)) OR FIREABLE(EndLoop_1_0)) OR FIREABLE(EndLoop_2_0)) OR FIREABLE(EndLoop_0_0)) U ((((((((((((FIREABLE(NoIdentity_2_0_0) OR FIREABLE(NoIdentity_1_0_0)) OR FIREABLE(NoIdentity_2_1_0)) OR FIREABLE(NoIdentity_0_1_0)) OR FIREABLE(NoIdentity_0_1_1)) OR FIREABLE(NoIdentity_2_1_1)) OR FIREABLE(NoIdentity_0_2_1)) OR FIREABL... (shortened)
lola: formula length: 15050
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (E((FIREABLE(EndLoop_2_1) OR (FIREABLE(EndLoop_0_1) OR (FIREABLE(EndLoop_1_1) OR (FIREABLE(EndLoop_1_0) OR (FIREABLE(EndLoop_2_0) OR FIREABLE(EndLoop_0_0)))))) U ((FIREABLE(NoIdentity_2_0_0) OR (FIREABLE(NoIdentity_1_0_0) OR (FIREABLE(NoIdentity_2_1_0) OR (FIREABLE(NoIdentity_0_1_0) OR (FIREABLE(NoIdentity_0_1_1) OR (FIREABLE(NoIdentity_2_1_1) OR (FIREABLE(NoIdentity_0_2_1) OR (FIREABLE(NoIdent... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U E((FIREABLE(EndLoop_2_1) OR (FIREABLE(EndLoop_0_1) OR (FIREABLE(EndLoop_1_1) OR (FIREABLE(EndLoop_1_0) OR (FIREABLE(EndLoop_2_0) OR FIREABLE(EndLoop_0_0)))))) U ((FIREABLE(NoIdentity_2_0_0) OR (FIREABLE(NoIdentity_1_0_0) OR (FIREABLE(NoIdentity_2_1_0) OR (FIREABLE(NoIdentity_0_1_0) OR (FIREABLE(NoIdentity_0_1_1) OR (FIREABLE(NoIdentity_2_1_1) OR (FIREABLE(NoIdentity_0_2_1) OR (FIREABLE(No... (shortened)
lola: processed formula length: 629
lola: 2513 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AF ((FIREABLE(NotAlone_0_1_0) OR (FIREABLE(NotAlone_2_0_0) OR (FIREABLE(NotAlone_0_2_0) OR (FIREABLE(NotAlone_2_1_0) OR (FIREABLE(NotAlone_1_0_1) OR (FIREABLE(NotAlone_1_2_0) OR (FIREABLE(NotAlone_0_1_1) OR (FIREABLE(NotAlone_2_0_1) OR (FIREABLE(NotAlone_1_0_0) OR (FIREABLE(NotAlone_2_1_1) OR (FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1))))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(A(TRUE U (FIREABLE(NotAlone_0_1_0) OR (FIREABLE(NotAlone_2_0_0) OR (FIREABLE(NotAlone_0_2_0) OR (FIREABLE(NotAlone_2_1_0) OR (FIREABLE(NotAlone_1_0_1) OR (FIREABLE(NotAlone_1_2_0) OR (FIREABLE(NotAlone_0_1_1) OR (FIREABLE(NotAlone_2_0_1) OR (FIREABLE(NotAlone_1_0_0) OR (FIREABLE(NotAlone_2_1_1) OR (FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1))))))))))))))))
lola: processed formula length: 380
lola: 2513 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (AG ((! FIREABLE(BecomeIdle_2) AND (! FIREABLE(BecomeIdle_1) AND ! FIREABLE(BecomeIdle_0))))) AND E(((! FIREABLE(AccessCS_2) AND (! FIREABLE(AccessCS_1) AND ! FIREABLE(AccessCS_0))) OR (! FIREABLE(Identity_1_1) AND (! FIREABLE(Identity_2_1) AND (! FIREABLE(Identity_0_0) AND (! FIREABLE(Identity_1_0) AND (! FIREABLE(Identity_2_0) AND ! FIREABLE(Identity_0_1))))))) R (! FIREABLE(TurnDiff_1_0_1) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG ((! FIREABLE(BecomeIdle_2) AND (! FIREABLE(BecomeIdle_1) AND ! FIREABLE(BecomeIdle_0)))))
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 !((! FIREABLE(BecomeIdle_2) AND (! FIREABLE(BecomeIdle_1) AND ! FIREABLE(BecomeIdle_0)))))))
lola: processed formula length: 112
lola: 2513 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AX (EG ((FIREABLE(AccessCS_2) OR (FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(!(A(TRUE U !((FIREABLE(AccessCS_2) OR (FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0))))))))
lola: processed formula length: 102
lola: 2514 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((AF ((FIREABLE(NotAlone_0_1_0) OR (FIREABLE(NotAlone_2_0_0) OR (FIREABLE(NotAlone_0_2_0) OR (FIREABLE(NotAlone_2_1_0) OR (FIREABLE(NotAlone_1_0_1) OR (FIREABLE(NotAlone_1_2_0) OR (FIREABLE(NotAlone_0_1_1) OR (FIREABLE(NotAlone_2_0_1) OR (FIREABLE(NotAlone_1_0_0) OR (FIREABLE(NotAlone_2_1_1) OR (FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1))))))))))))) AND (FIREABLE(NoIdentity_2_0_0) OR (F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((A(TRUE U (FIREABLE(NotAlone_0_1_0) OR (FIREABLE(NotAlone_2_0_0) OR (FIREABLE(NotAlone_0_2_0) OR (FIREABLE(NotAlone_2_1_0) OR (FIREABLE(NotAlone_1_0_1) OR (FIREABLE(NotAlone_1_2_0) OR (FIREABLE(NotAlone_0_1_1) OR (FIREABLE(NotAlone_2_0_1) OR (FIREABLE(NotAlone_1_0_0) OR (FIREABLE(NotAlone_2_1_1) OR (FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1))))))))))))) AND (FIREABLE(NoIdentity_2_0_0) ... (shortened)
lola: processed formula length: 1565
lola: 2514 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((AX ((FIREABLE(BecomeIdle_2) OR (FIREABLE(BecomeIdle_1) OR FIREABLE(BecomeIdle_0)))) AND (((FIREABLE(EndLoop_2_1) OR (FIREABLE(EndLoop_0_1) OR (FIREABLE(EndLoop_1_1) OR (FIREABLE(EndLoop_1_0) OR (FIREABLE(EndLoop_2_0) OR (FIREABLE(EndLoop_0_0) OR (FIREABLE(Identity_1_1) OR (FIREABLE(Identity_2_1) OR (FIREABLE(Identity_0_0) OR (FIREABLE(Identity_1_0) OR (FIREABLE(Identity_2_0) OR FIREABLE(Ident... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (AX((FIREABLE(BecomeIdle_2) OR (FIREABLE(BecomeIdle_1) OR FIREABLE(BecomeIdle_0)))) AND (((FIREABLE(EndLoop_2_1) OR (FIREABLE(EndLoop_0_1) OR (FIREABLE(EndLoop_1_1) OR (FIREABLE(EndLoop_1_0) OR (FIREABLE(EndLoop_2_0) OR (FIREABLE(EndLoop_0_0) OR (FIREABLE(Identity_1_1) OR (FIREABLE(Identity_2_1) OR (FIREABLE(Identity_0_0) OR (FIREABLE(Identity_1_0) OR (FIREABLE(Identity_2_0) OR FIREABLE(I... (shortened)
lola: processed formula length: 1050
lola: 2513 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EG ((FIREABLE(NoIdentity_2_0_0) OR (FIREABLE(NoIdentity_1_0_0) OR (FIREABLE(NoIdentity_2_1_0) OR (FIREABLE(NoIdentity_0_1_0) OR (FIREABLE(NoIdentity_0_1_1) OR (FIREABLE(NoIdentity_2_1_1) OR (FIREABLE(NoIdentity_0_2_1) OR (FIREABLE(NoIdentity_1_2_1) OR (FIREABLE(NoIdentity_0_2_0) OR (FIREABLE(NoIdentity_1_2_0) OR (FIREABLE(NoIdentity_1_0_1) OR FIREABLE(NoIdentity_2_0_1))))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(A(TRUE U !((FIREABLE(NoIdentity_2_0_0) OR (FIREABLE(NoIdentity_1_0_0) OR (FIREABLE(NoIdentity_2_1_0) OR (FIREABLE(NoIdentity_0_1_0) OR (FIREABLE(NoIdentity_0_1_1) OR (FIREABLE(NoIdentity_2_1_1) OR (FIREABLE(NoIdentity_0_2_1) OR (FIREABLE(NoIdentity_1_2_1) OR (FIREABLE(NoIdentity_0_2_0) OR (FIREABLE(NoIdentity_1_2_0) OR (FIREABLE(NoIdentity_1_0_1) OR FIREABLE(NoIdentity_2_0_1))))))))))))... (shortened)
lola: processed formula length: 404
lola: 2513 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EF ((! FIREABLE(NoIdentity_2_0_0) AND (! FIREABLE(NoIdentity_1_0_0) AND (! FIREABLE(NoIdentity_2_1_0) AND (! FIREABLE(NoIdentity_0_1_0) AND (! FIREABLE(NoIdentity_0_1_1) AND (! FIREABLE(NoIdentity_2_1_1) AND (! FIREABLE(NoIdentity_0_2_1) AND (! FIREABLE(NoIdentity_1_2_1) AND (! FIREABLE(NoIdentity_0_2_0) AND (! FIREABLE(NoIdentity_1_2_0) AND (! FIREABLE(NoIdentity_1_0_1) AND (! FIREABLE(NoIdenti... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(NoIdentity_2_0_0) AND (! FIREABLE(NoIdentity_1_0_0) AND (! FIREABLE(NoIdentity_2_1_0) AND (! FIREABLE(NoIdentity_0_1_0) AND (! FIREABLE(NoIdentity_0_1_1) AND (! FIREABLE(NoIdentity_2_1_1) AND (! FIREABLE(NoIdentity_0_2_1) AND (! FIREABLE(NoIdentity_1_2_1) AND (! FIREABLE(NoIdentity_0_2_0) AND (! FIREABLE(NoIdentity_1_2_0) AND (! FIREABLE(NoIdentity_1_0_1) AND (! FIREABLE(NoIdentity... (shortened)
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 12 bytes per marking, with 5 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 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Loop_0_0_0) OR (FIREABLE(Loop_2_0_1) OR (FIREABLE(Loop_1_0_1) OR (FIREABLE(Loop_0_0_1) OR (FIREABLE(Loop_2_1_0) OR (FIREABLE(Loop_1_1_0) OR (FIREABLE(Loop_0_1_0) OR (FIREABLE(Loop_2_0_0) OR (FIREABLE(Loop_1_0_0) OR (FIREABLE(Loop_2_1_1) OR (FIREABLE(Loop_1_1_1) OR FIREABLE(Loop_0_1_1)))))))))))) AND (! FIREABLE(UpdateTurn_0_0_0) AND (! FIREABLE(UpdateTurn_1_0_0) AND (! FIREABLE(Upda... (shortened)
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 12 bytes per marking, with 5 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EG (AX ((FIREABLE(NotAlone_0_1_0) OR (FIREABLE(NotAlone_2_0_0) OR (FIREABLE(NotAlone_0_2_0) OR (FIREABLE(NotAlone_2_1_0) OR (FIREABLE(NotAlone_1_0_1) OR (FIREABLE(NotAlone_1_2_0) OR (FIREABLE(NotAlone_0_1_1) OR (FIREABLE(NotAlone_2_0_1) OR (FIREABLE(NotAlone_1_0_0) OR (FIREABLE(NotAlone_2_1_1) OR (FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1)))))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U !(A(TRUE U !(AX((FIREABLE(NotAlone_0_1_0) OR (FIREABLE(NotAlone_2_0_0) OR (FIREABLE(NotAlone_0_2_0) OR (FIREABLE(NotAlone_2_1_0) OR (FIREABLE(NotAlone_1_0_1) OR (FIREABLE(NotAlone_1_2_0) OR (FIREABLE(NotAlone_0_1_1) OR (FIREABLE(NotAlone_2_0_1) OR (FIREABLE(NotAlone_1_0_0) OR (FIREABLE(NotAlone_2_1_1) OR (FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1)))))))))))))))))
lola: processed formula length: 384
lola: 2514 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((! FIREABLE(NotAlone_0_1_0) AND (! FIREABLE(NotAlone_2_0_0) AND (! FIREABLE(NotAlone_0_2_0) AND (! FIREABLE(NotAlone_2_1_0) AND (! FIREABLE(NotAlone_1_0_1) AND (! FIREABLE(NotAlone_1_2_0) AND (! FIREABLE(NotAlone_0_1_1) AND (! FIREABLE(NotAlone_2_0_1) AND (! FIREABLE(NotAlone_1_0_0) AND (! FIREABLE(NotAlone_2_1_1) AND (! FIREABLE(NotAlone_0_2_1) AND (! FIREABLE(NotAlone_1_2_1) AND ((FIREABLE(EndL... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ! FIREABLE(NotAlone_0_1_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ! FIREABLE(NotAlone_2_0_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ! FIREABLE(NotAlone_0_2_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ! FIREABLE(NotAlone_2_1_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ! FIREABLE(NotAlone_1_0_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ! FIREABLE(NotAlone_1_2_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ! FIREABLE(NotAlone_0_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ! FIREABLE(NotAlone_1_0_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ! FIREABLE(NotAlone_2_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 19 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ! FIREABLE(NotAlone_0_2_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 20 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ! FIREABLE(NotAlone_1_2_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 21 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(EndLoop_2_1) OR (FIREABLE(EndLoop_0_1) OR (FIREABLE(EndLoop_1_1) OR (FIREABLE(EndLoop_1_0) OR (FIREABLE(EndLoop_2_0) OR (FIREABLE(EndLoop_0_0) OR (FIREABLE(NoIdentity_2_0_0) OR (FIREABLE(NoIdentity_1_0_0) OR (FIREABLE(NoIdentity_2_1_0) OR (FIREABLE(NoIdentity_0_1_0) OR (FIREABLE(NoIdentity_0_1_1) OR (FIREABLE(NoIdentity_2_1_1) OR (FIREABLE(NoIdentity_0_2_1) OR (FIREABLE(NoIdentity_1_2_1)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 22 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(BecomeIdle_2) OR (FIREABLE(BecomeIdle_1) OR FIREABLE(BecomeIdle_0))) AND ((FIREABLE(TurnDiff_1_0_1) OR (FIREABLE(TurnDiff_1_2_0) OR (FIREABLE(TurnDiff_0_2_0) OR (FIREABLE(TurnDiff_2_1_0) OR (FIREABLE(TurnDiff_0_2_1) OR (FIREABLE(TurnDiff_2_1_1) OR (FIREABLE(TurnDiff_0_1_1) OR (FIREABLE(TurnDiff_2_0_1) OR (FIREABLE(TurnDiff_0_1_0) OR (FIREABLE(TurnDiff_2_0_0) OR (FIREABLE(TurnDiff_1_... (shortened)
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 12 bytes per marking, with 5 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 23 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(NoIdentity_2_0_0) OR (FIREABLE(NoIdentity_1_0_0) OR (FIREABLE(NoIdentity_2_1_0) OR (FIREABLE(NoIdentity_0_1_0) OR (FIREABLE(NoIdentity_0_1_1) OR (FIREABLE(NoIdentity_2_1_1) OR (FIREABLE(NoIdentity_0_2_1) OR (FIREABLE(NoIdentity_1_2_1) OR (FIREABLE(NoIdentity_0_2_0) OR (FIREABLE(NoIdentity_1_2_0) OR (FIREABLE(NoIdentity_1_0_1) OR FIREABLE(NoIdentity_2_0_1)))))))))))))
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 12 bytes per marking, with 5 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EX ((FIREABLE(NotAlone_0_1_0) OR (FIREABLE(NotAlone_2_0_0) OR (FIREABLE(NotAlone_0_2_0) OR (FIREABLE(NotAlone_2_1_0) OR (FIREABLE(NotAlone_1_0_1) OR (FIREABLE(NotAlone_1_2_0) OR (FIREABLE(NotAlone_0_1_1) OR (FIREABLE(NotAlone_2_0_1) OR (FIREABLE(NotAlone_1_0_0) OR (FIREABLE(NotAlone_2_1_1) OR (FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1))))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((FIREABLE(NotAlone_0_1_0) OR (FIREABLE(NotAlone_2_0_0) OR (FIREABLE(NotAlone_0_2_0) OR (FIREABLE(NotAlone_2_1_0) OR (FIREABLE(NotAlone_1_0_1) OR (FIREABLE(NotAlone_1_2_0) OR (FIREABLE(NotAlone_0_1_1) OR (FIREABLE(NotAlone_2_0_1) OR (FIREABLE(NotAlone_1_0_0) OR (FIREABLE(NotAlone_2_1_1) OR (FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1))))))))))))))
lola: processed formula length: 368
lola: 2513 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((EF ((FIREABLE(ProgressTurn_0_0) OR (FIREABLE(ProgressTurn_1_0) OR (FIREABLE(ProgressTurn_2_0) OR (FIREABLE(Ask_1) OR (FIREABLE(Ask_2) OR FIREABLE(Ask_0))))))) AND AG ((FIREABLE(ProgressTurn_0_0) OR (FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (E(TRUE U (FIREABLE(ProgressTurn_0_0) OR (FIREABLE(ProgressTurn_1_0) OR (FIREABLE(ProgressTurn_2_0) OR (FIREABLE(Ask_1) OR (FIREABLE(Ask_2) OR FIREABLE(Ask_0))))))) AND !(E(TRUE U !((FIREABLE(ProgressTurn_0_0) OR (FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0))))))))
lola: processed formula length: 286
lola: 2514 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EF ((FIREABLE(ContinueLoop_2_1_0) OR (FIREABLE(ContinueLoop_0_2_0) OR (FIREABLE(ContinueLoop_1_2_0) OR (FIREABLE(ContinueLoop_2_2_0) OR (FIREABLE(ContinueLoop_0_0_1) OR (FIREABLE(ContinueLoop_1_0_1) OR (FIREABLE(ContinueLoop_2_0_1) OR (FIREABLE(ContinueLoop_0_1_1) OR (FIREABLE(ContinueLoop_0_0_0) OR (FIREABLE(ContinueLoop_1_0_0) OR (FIREABLE(ContinueLoop_2_0_0) OR (FIREABLE(ContinueLoop_0_1_0) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(ContinueLoop_2_1_0) OR (FIREABLE(ContinueLoop_0_2_0) OR (FIREABLE(ContinueLoop_1_2_0) OR (FIREABLE(ContinueLoop_2_2_0) OR (FIREABLE(ContinueLoop_0_0_1) OR (FIREABLE(ContinueLoop_1_0_1) OR (FIREABLE(ContinueLoop_2_0_1) OR (FIREABLE(ContinueLoop_0_1_1) OR (FIREABLE(ContinueLoop_0_0_0) OR (FIREABLE(ContinueLoop_1_0_0) OR (FIREABLE(ContinueLoop_2_0_0) OR (FIREABLE(ContinueLoop_0_1_0) OR ... (shortened)
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 12 bytes per marking, with 5 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 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EF (((FIREABLE(TurnEqual_1_0) OR (FIREABLE(TurnEqual_2_0) OR (FIREABLE(TurnEqual_0_0) OR (FIREABLE(TurnEqual_2_1) OR (FIREABLE(TurnEqual_0_1) OR FIREABLE(TurnEqual_1_1)))))) AND (FIREABLE(EndLoop_2_1) OR (FIREABLE(EndLoop_0_1) OR (FIREABLE(EndLoop_1_1) OR (FIREABLE(EndLoop_1_0) OR (FIREABLE(EndLoop_2_0) OR FIREABLE(EndLoop_0_0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U ((FIREABLE(TurnEqual_1_0) OR (FIREABLE(TurnEqual_2_0) OR (FIREABLE(TurnEqual_0_0) OR (FIREABLE(TurnEqual_2_1) OR (FIREABLE(TurnEqual_0_1) OR FIREABLE(TurnEqual_1_1)))))) AND (FIREABLE(EndLoop_2_1) OR (FIREABLE(EndLoop_0_1) OR (FIREABLE(EndLoop_1_1) OR (FIREABLE(EndLoop_1_0) OR (FIREABLE(EndLoop_2_0) OR FIREABLE(EndLoop_0_0)))))))))
lola: processed formula length: 351
lola: 2513 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: yes
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AF (((FIREABLE(Ask_1) OR (FIREABLE(Ask_2) OR FIREABLE(Ask_0))) AND ((FIREABLE(UpdateTurn_0_0_0) OR (FIREABLE(UpdateTurn_1_0_0) OR (FIREABLE(UpdateTurn_1_1_0) OR (FIREABLE(UpdateTurn_2_1_0) OR (FIREABLE(UpdateTurn_2_0_0) OR (FIREABLE(UpdateTurn_0_1_0) OR (FIREABLE(UpdateTurn_0_2_1) OR (FIREABLE(UpdateTurn_2_1_1) OR (FIREABLE(UpdateTurn_2_2_1) OR (FIREABLE(UpdateTurn_1_2_1) OR (FIREABLE(UpdateTu... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U ((FIREABLE(Ask_1) OR (FIREABLE(Ask_2) OR FIREABLE(Ask_0))) AND ((FIREABLE(UpdateTurn_0_0_0) OR (FIREABLE(UpdateTurn_1_0_0) OR (FIREABLE(UpdateTurn_1_1_0) OR (FIREABLE(UpdateTurn_2_1_0) OR (FIREABLE(UpdateTurn_2_0_0) OR (FIREABLE(UpdateTurn_0_1_0) OR (FIREABLE(UpdateTurn_0_2_1) OR (FIREABLE(UpdateTurn_2_1_1) OR (FIREABLE(UpdateTurn_2_2_1) OR (FIREABLE(UpdateTurn_1_2_1) OR (FIREABL... (shortened)
lola: processed formula length: 817
lola: 2513 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EF ((! FIREABLE(Loop_0_0_0) AND (! FIREABLE(Loop_2_0_1) AND (! FIREABLE(Loop_1_0_1) AND (! FIREABLE(Loop_0_0_1) AND (! FIREABLE(Loop_2_1_0) AND (! FIREABLE(Loop_1_1_0) AND (! FIREABLE(Loop_0_1_0) AND (! FIREABLE(Loop_2_0_0) AND (! FIREABLE(Loop_1_0_0) AND (! FIREABLE(Loop_2_1_1) AND (! FIREABLE(Loop_1_1_1) AND (! FIREABLE(Loop_0_1_1) AND (FIREABLE(Alone1_0_2_0) OR (FIREABLE(Alone1_2_1_0) OR (FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Loop_0_0_0) AND (! FIREABLE(Loop_2_0_1) AND (! FIREABLE(Loop_1_0_1) AND (! FIREABLE(Loop_0_0_1) AND (! FIREABLE(Loop_2_1_0) AND (! FIREABLE(Loop_1_1_0) AND (! FIREABLE(Loop_0_1_0) AND (! FIREABLE(Loop_2_0_0) AND (! FIREABLE(Loop_1_0_0) AND (! FIREABLE(Loop_2_1_1) AND (! FIREABLE(Loop_1_1_1) AND (! FIREABLE(Loop_0_1_1) AND (FIREABLE(Alone1_0_2_0) OR (FIREABLE(Alone1_2_1_0) OR (FIREA... (shortened)
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 12 bytes per marking, with 5 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 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((FIREABLE(Ask_1) OR (FIREABLE(Ask_2) OR FIREABLE(Ask_0))) U ((FIREABLE(Ask_1) OR (FIREABLE(Ask_2) OR FIREABLE(Ask_0))) AND (FIREABLE(Loop_0_0_0) OR (FIREABLE(Loop_2_0_1) OR (FIREABLE(Loop_1_0_1) OR (FIREABLE(Loop_0_0_1) OR (FIREABLE(Loop_2_1_0) OR (FIREABLE(Loop_1_1_0) OR (FIREABLE(Loop_0_1_0) OR (FIREABLE(Loop_2_0_0) OR (FIREABLE(Loop_1_0_0) OR (FIREABLE(Loop_2_1_1) OR (FIREABLE(Loop_1_1_1) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((FIREABLE(Ask_1) OR (FIREABLE(Ask_2) OR FIREABLE(Ask_0))) U ((FIREABLE(Ask_1) OR (FIREABLE(Ask_2) OR FIREABLE(Ask_0))) AND (FIREABLE(Loop_0_0_0) OR (FIREABLE(Loop_2_0_1) OR (FIREABLE(Loop_1_0_1) OR (FIREABLE(Loop_0_0_1) OR (FIREABLE(Loop_2_1_0) OR (FIREABLE(Loop_1_1_0) OR (FIREABLE(Loop_0_1_0) OR (FIREABLE(Loop_2_0_0) OR (FIREABLE(Loop_1_0_0) OR (FIREABLE(Loop_2_1_1) OR (FIREABLE(Loop_1_1_1) OR ... (shortened)
lola: processed formula length: 433
lola: 2512 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: 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: subprocess 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E(EX ((FIREABLE(Ask_1) OR (FIREABLE(Ask_2) OR FIREABLE(Ask_0)))) U EX ((FIREABLE(EndLoop_2_1) OR (FIREABLE(EndLoop_0_1) OR (FIREABLE(EndLoop_1_1) OR (FIREABLE(EndLoop_1_0) OR (FIREABLE(EndLoop_2_0) OR FIREABLE(EndLoop_0_0)))))))) OR EX (((FIREABLE(Ask_1) OR (FIREABLE(Ask_2) OR FIREABLE(Ask_0))) AND (FIREABLE(EndLoop_2_1) OR (FIREABLE(EndLoop_0_1) OR (FIREABLE(EndLoop_1_1) OR (FIREABLE(EndLoop_1_0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EX ((FIREABLE(Ask_1) OR (FIREABLE(Ask_2) OR FIREABLE(Ask_0)))) U EX ((FIREABLE(EndLoop_2_1) OR (FIREABLE(EndLoop_0_1) OR (FIREABLE(EndLoop_1_1) OR (FIREABLE(EndLoop_1_0) OR (FIREABLE(EndLoop_2_0) OR FIREABLE(EndLoop_0_0))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX((FIREABLE(Ask_1) OR (FIREABLE(Ask_2) OR FIREABLE(Ask_0)))) U EX((FIREABLE(EndLoop_2_1) OR (FIREABLE(EndLoop_0_1) OR (FIREABLE(EndLoop_1_1) OR (FIREABLE(EndLoop_1_0) OR (FIREABLE(EndLoop_2_0) OR FIREABLE(EndLoop_0_0))))))))
lola: processed formula length: 227
lola: 2514 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: RESULT
lola: summary: yes no no no no no no yes yes yes no no yes yes unknown yes
lola: ========================================

BK_STOP 1463691919499

--------------------
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-2"
export BK_EXAMINATION="CTLFireability"
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-2.tgz
mv Peterson-PT-2 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-2, examination is CTLFireability"
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-146369088100058"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;