Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.....................
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 14K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Kanban-PT-0010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666468900011
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527010664993

info: Time: 3600 - MCC
===========================================================================================
prep: translating Kanban-PT-0010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Kanban-PT-0010 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ Kanban-PT-0010 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 32/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from Kanban-PT-0010-CTLFireability.task
lola: A (G (E (X ((FIREABLE(tsynch1_23) OR FIREABLE(tok4)))))) : A ((E (F ((FIREABLE(tredo4) AND FIREABLE(tredo2)))) U (FIREABLE(tok1) AND FIREABLE(tok2) AND NOT FIREABLE(tsynch4_23) AND FIREABLE(tin4)))) : (FIREABLE(tback1) AND FIREABLE(tok1)) : (A ((FIREABLE(tback2) U (NOT FIREABLE(tok2) AND NOT FIREABLE(tok1)))) AND NOT(E (F (A (X (FIREABLE(tout1))))))) : ((((FIREABLE(tsynch1_23) OR FIREABLE(tok3)) AND NOT FIREABLE(tsynch4_23)) OR FIREABLE(tredo4)) AND NOT(E (X ((NOT FIREABLE(tredo4) OR (FIREABLE(tsynch1_23) AND FIREABLE(tok3))))))) : (FIREABLE(tback3) AND NOT(((FIREABLE(tok3) AND ((FIREABLE(tback4) AND FIREABLE(tok2)) OR (FIREABLE(tredo1) AND FIREABLE(tback3)))) AND NOT(E (F (FIREABLE(tin4))))))) : (((FIREABLE(tin4) OR FIREABLE(tback1) OR (FIREABLE(tback4) AND FIREABLE(tok3)) OR (FIREABLE(tok2) AND FIREABLE(tok4)) OR FIREABLE(tout1)) AND FIREABLE(tredo2)) AND (((E (G (FIREABLE(tredo3))) OR (NOT FIREABLE(tsynch1_23) OR NOT FIREABLE(tredo2))) OR A (X ((FIREABLE(tok4) OR FIREABLE(tredo4))))) OR (E (X (FIREABLE(tredo4))) OR E (X (FIREABLE(tredo2)))))) : E (X (A (F ((FIREABLE(tredo4) AND FIREABLE(tok2) AND (FIREABLE(tredo4) OR FIREABLE(tredo2))))))) : A (G ((NOT FIREABLE(tout1) AND NOT FIREABLE(tback2)))) : E (F (FIREABLE(tin4))) : NOT(E (F (FIREABLE(tredo3)))) : (FIREABLE(tsynch1_23) OR (FIREABLE(tok4) AND NOT FIREABLE(tin4))) : A (X (FIREABLE(tsynch4_23))) : FIREABLE(tok4) : (E (X (A (G ((FIREABLE(tredo4) OR FIREABLE(tredo1)))))) AND NOT(E (G ((FIREABLE(tout1) AND FIREABLE(tok3) AND NOT FIREABLE(tredo3)))))) : (((NOT FIREABLE(tout1) OR NOT FIREABLE(tok3)) AND A (X ((FIREABLE(tok2) AND FIREABLE(tredo1) AND FIREABLE(tback2))))) AND ((E (X ((FIREABLE(tback4) AND FIREABLE(tredo1)))) OR NOT FIREABLE(tredo1)) AND A ((NOT FIREABLE(tsynch1_23) U (FIREABLE(tredo2) AND FIREABLE(tout1))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(tback1) AND FIREABLE(tok1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(tback1) AND FIREABLE(tok1))
lola: processed formula length: 37
lola: 26 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Kanban-PT-0010-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(tsynch1_23) OR (FIREABLE(tok4) AND NOT FIREABLE(tin4)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(tsynch1_23) OR (FIREABLE(tok4) AND NOT FIREABLE(tin4)))
lola: processed formula length: 66
lola: 26 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

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

FORMULA Kanban-PT-0010-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((FIREABLE(tsynch1_23) OR FIREABLE(tok3)) AND NOT FIREABLE(tsynch4_23)) OR FIREABLE(tredo4)) AND A (X ((FIREABLE(tredo4) AND (NOT FIREABLE(tsynch1_23) OR NOT FIREABLE(tok3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((FIREABLE(tsynch1_23) OR FIREABLE(tok3)) AND NOT FIREABLE(tsynch4_23)) OR FIREABLE(tredo4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((FIREABLE(tsynch1_23) OR FIREABLE(tok3)) AND NOT FIREABLE(tsynch4_23)) OR FIREABLE(tredo4))
lola: processed formula length: 95
lola: 26 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA Kanban-PT-0010-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((FIREABLE(tin4) OR FIREABLE(tback1) OR (FIREABLE(tback4) AND FIREABLE(tok3)) OR (FIREABLE(tok2) AND FIREABLE(tok4)) OR FIREABLE(tout1)) AND FIREABLE(tredo2)) AND (E (G (FIREABLE(tredo3))) OR ((NOT FIREABLE(tsynch1_23) OR NOT FIREABLE(tredo2)) OR (A (X ((FIREABLE(tok4) OR FIREABLE(tredo4)))) OR (E (X (FIREABLE(tredo4))) OR E (X (FIREABLE(tredo2))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(tok4) OR FIREABLE(tredo4))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((FIREABLE(tok4) OR FIREABLE(tredo4)))
lola: processed formula length: 41
lola: 27 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(tin4) OR FIREABLE(tback1) OR (FIREABLE(tback4) AND FIREABLE(tok3)) OR (FIREABLE(tok2) AND FIREABLE(tok4)) OR FIREABLE(tout1)) AND FIREABLE(tredo2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FIREABLE(tin4) OR FIREABLE(tback1) OR (FIREABLE(tback4) AND FIREABLE(tok3)) OR (FIREABLE(tok2) AND FIREABLE(tok4)) OR FIREABLE(tout1)) AND FIREABLE(tredo2))
lola: processed formula length: 162
lola: 26 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Kanban-PT-0010-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((FIREABLE(tredo4) AND FIREABLE(tok2) AND (FIREABLE(tredo4) OR FIREABLE(tredo2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(A(TRUE U (FIREABLE(tredo4) AND FIREABLE(tok2) AND (FIREABLE(tredo4) OR FIREABLE(tredo2)))))
lola: processed formula length: 95
lola: 28 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2 markings, 2 edges

FORMULA Kanban-PT-0010-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((FIREABLE(tsynch1_23) OR FIREABLE(tok4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX((FIREABLE(tsynch1_23) OR FIREABLE(tok4))))))
lola: processed formula length: 65
lola: 28 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 333386 markings, 892508 edges

FORMULA Kanban-PT-0010-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(tsynch4_23)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(FIREABLE(tsynch4_23))
lola: processed formula length: 24
lola: 27 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Kanban-PT-0010-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((FIREABLE(tback2) U (NOT FIREABLE(tok2) AND NOT FIREABLE(tok1)))) AND A (G (E (X (NOT FIREABLE(tout1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(tback2) U (NOT FIREABLE(tok2) AND NOT FIREABLE(tok1))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((FIREABLE(tback2) U (NOT FIREABLE(tok2) AND NOT FIREABLE(tok1))))
lola: processed formula length: 68
lola: 30 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (NOT FIREABLE(tout1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX(NOT FIREABLE(tout1)))))
lola: processed formula length: 43
lola: 28 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1918 markings, 3892 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA Kanban-PT-0010-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (G ((FIREABLE(tredo4) OR FIREABLE(tredo1)))))) AND A (F ((NOT FIREABLE(tout1) OR NOT FIREABLE(tok3) OR FIREABLE(tredo3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(tout1) OR NOT FIREABLE(tok3) OR FIREABLE(tredo3))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (FIREABLE(tout1) AND FIREABLE(tok3) AND NOT FIREABLE(tredo3))
lola: processed formula length: 61
lola: 28 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((FIREABLE(tredo4) OR FIREABLE(tredo1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX(NOT(E(TRUE U (NOT FIREABLE(tredo4) AND NOT FIREABLE(tredo1)))))
lola: processed formula length: 66
lola: 29 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Kanban-PT-0010-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(tout1) OR NOT FIREABLE(tok3)) AND (A (X ((FIREABLE(tok2) AND FIREABLE(tredo1) AND FIREABLE(tback2)))) AND ((E (X ((FIREABLE(tback4) AND FIREABLE(tredo1)))) OR NOT FIREABLE(tredo1)) AND A ((NOT FIREABLE(tsynch1_23) U (FIREABLE(tredo2) AND FIREABLE(tout1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(tout1) OR NOT FIREABLE(tok3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(tout1) OR NOT FIREABLE(tok3))
lola: processed formula length: 44
lola: 26 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(tsynch1_23) U (FIREABLE(tredo2) AND FIREABLE(tout1))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((NOT FIREABLE(tsynch1_23) U (FIREABLE(tredo2) AND FIREABLE(tout1))))
lola: processed formula length: 71
lola: 30 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 12 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Kanban-PT-0010-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(tredo3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G (NOT FIREABLE(tredo3)))
lola: processed formula length: 28
lola: 28 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: FIREABLE(tredo3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to Kanban-PT-0010-CTLFireability-11-0.sara
lola: state equation: calling and running sara
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA Kanban-PT-0010-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tin4)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(tin4)))
lola: processed formula length: 22
lola: 27 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Kanban-PT-0010-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tout1) AND NOT FIREABLE(tback2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((NOT FIREABLE(tout1) AND NOT FIREABLE(tback2))))
lola: processed formula length: 54
lola: 28 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FIREABLE(tout1) OR FIREABLE(tback2))
sara: try reading problem file Kanban-PT-0010-CTLFireability-11-0.sara.
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA Kanban-PT-0010-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((FIREABLE(tredo4) AND FIREABLE(tredo2)))) U (FIREABLE(tok1) AND FIREABLE(tok2) AND NOT FIREABLE(tsynch4_23) AND FIREABLE(tin4))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(E(TRUE U (FIREABLE(tredo4) AND FIREABLE(tredo2))) U (FIREABLE(tok1) AND FIREABLE(tok2) AND NOT FIREABLE(tsynch4_23) AND FIREABLE(tin4)))
lola: processed formula length: 138
lola: 28 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 73 markings, 119 edges
lola:
FORMULA Kanban-PT-0010-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)sara: place or transition ordering is non-deterministic

lola: ========================================
lola: ...considering subproblem: (FIREABLE(tback3) AND ((NOT FIREABLE(tok3) OR ((NOT FIREABLE(tback4) OR NOT FIREABLE(tok2)) AND (NOT FIREABLE(tredo1) OR NOT FIREABLE(tback3)))) OR E (F (FIREABLE(tin4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(tok3) OR ((NOT FIREABLE(tback4) OR NOT FIREABLE(tok2)) AND (NOT FIREABLE(tredo1) OR NOT FIREABLE(tback3))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(tok3) OR ((NOT FIREABLE(tback4) OR NOT FIREABLE(tok2)) AND (NOT FIREABLE(tredo1) OR NOT FIREABLE(tback3))))
lola: processed formula length: 124
lola: 26 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
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: ========================================
lola: ...considering subproblem: (FIREABLE(tback3) AND ((NOT FIREABLE(tok3) OR ((NOT FIREABLE(tback4) OR NOT FIREABLE(tok2)) AND (NOT FIREABLE(tredo1) OR NOT FIREABLE(tback3)))) OR E (F (FIREABLE(tin4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(tok3) OR ((NOT FIREABLE(tback4) OR NOT FIREABLE(tok2)) AND (NOT FIREABLE(tredo1) OR NOT FIREABLE(tback3))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(tok3) OR ((NOT FIREABLE(tback4) OR NOT FIREABLE(tok2)) AND (NOT FIREABLE(tredo1) OR NOT FIREABLE(tback3))))
lola: processed formula length: 124
lola: 26 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: FIREABLE(tback3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(tback3)
lola: processed formula length: 16
lola: 26 rewrites
lola: closed formula file Kanban-PT-0010-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Kanban-PT-0010-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no no no no no yes no no no no no no
lola:
preliminary result: no no no no no no no no no yes no no no no no no

lola: memory consumption: 14672 KB
lola: time consumption: 1 seconds

BK_STOP 1527010666030

--------------------
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="Kanban-PT-0010"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-0010.tgz
mv Kanban-PT-0010 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is Kanban-PT-0010, 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 r112-csrt-152666468900011"
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 ;