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 212K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 41K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ResAllocation-PT-R010C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673579200389
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527013822458

info: Time: 3600 - MCC
===========================================================================================
prep: translating ResAllocation-PT-R010C002 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating ResAllocation-PT-R010C002 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ ResAllocation-PT-R010C002 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 62/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 40
lola: finding significant places
lola: 40 places, 22 transitions, 20 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 32 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R010C002-CTLFireability.task
lola: E (F (A (X (A (X (FIREABLE(t_0_6))))))) : E (F (E (X (E (G (FIREABLE(t_1_4))))))) : E (G (E (G (FIREABLE(t_1_10))))) : (FIREABLE(t_0_5) OR E (((NOT FIREABLE(t_0_10) AND NOT FIREABLE(t_0_2)) U (FIREABLE(t_1_3) AND FIREABLE(t_1_4) AND FIREABLE(t_0_2))))) : NOT(A (G (E (F (FIREABLE(t_0_10)))))) : A (G (E (X ((NOT FIREABLE(t_0_7) OR NOT FIREABLE(t_0_8)))))) : E (G (FIREABLE(t_0_0))) : E (G ((A (F ((FIREABLE(t_1_8) OR FIREABLE(t_0_7)))) OR E (G ((FIREABLE(t_0_10) AND FIREABLE(t_1_7))))))) : (A (F (E ((FIREABLE(t_1_4) U FIREABLE(t_0_8))))) OR (((NOT FIREABLE(t_0_5) OR NOT FIREABLE(t_1_6)) AND (NOT FIREABLE(t_1_3) OR NOT FIREABLE(t_1_1)) AND FIREABLE(t_1_2)) OR (A (X ((FIREABLE(t_0_9) OR FIREABLE(t_1_1)))) AND ((FIREABLE(t_1_8) AND FIREABLE(t_1_5)) OR FIREABLE(t_0_7) OR NOT FIREABLE(t_1_2))))) : E (F (E (G (A (X (FIREABLE(t_0_8))))))) : E (F ((NOT FIREABLE(t_0_3) AND FIREABLE(t_0_10) AND FIREABLE(t_1_9)))) : E (((FIREABLE(t_1_10) OR FIREABLE(t_1_5) OR (FIREABLE(t_1_7) AND FIREABLE(t_1_6)) OR (FIREABLE(t_0_4) AND FIREABLE(t_1_7) AND FIREABLE(t_0_5))) U (A (G (FIREABLE(t_0_5))) AND ((FIREABLE(t_1_5) OR FIREABLE(t_0_6)) AND (FIREABLE(t_1_5) OR FIREABLE(t_1_9)))))) : E (F (A (G (A (X (FIREABLE(t_1_8))))))) : (A (X (E ((FIREABLE(t_0_5) U FIREABLE(t_1_4))))) OR E (F ((FIREABLE(t_0_4) AND FIREABLE(t_0_7) AND FIREABLE(t_1_4) AND FIREABLE(t_1_6) AND FIREABLE(t_0_9))))) : E (F (E (G (E (X (FIREABLE(t_0_6))))))) : E ((FIREABLE(t_1_10) U (FIREABLE(t_1_3) OR FIREABLE(t_1_2))))
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:398
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (A (X (FIREABLE(t_0_6)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX(AX(FIREABLE(t_0_6))))
lola: processed formula length: 33
lola: 11 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 211 markings, 302 edges
lola: ========================================

FORMULA ResAllocation-PT-R010C002-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (E (G (FIREABLE(t_1_4)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX(E(TRUE U NOT(A(TRUE U NOT FIREABLE(t_1_4)))))
lola: processed formula length: 48
lola: 12 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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: 6144 markings, 29057 edges
lola: ========================================

FORMULA ResAllocation-PT-R010C002-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((NOT FIREABLE(t_0_7) OR NOT FIREABLE(t_0_8))))))
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(t_0_7) OR NOT FIREABLE(t_0_8))))))
lola: processed formula length: 69
lola: 10 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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: 212 markings, 303 edges
lola: ========================================

FORMULA ResAllocation-PT-R010C002-CTLFireability-5 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: (A (F (E ((FIREABLE(t_1_4) U FIREABLE(t_0_8))))) OR (((NOT FIREABLE(t_0_5) OR NOT FIREABLE(t_1_6)) AND (NOT FIREABLE(t_1_3) OR NOT FIREABLE(t_1_1)) AND FIREABLE(t_1_2)) OR (A (X ((FIREABLE(t_0_9) OR FIREABLE(t_1_1)))) AND ((FIREABLE(t_1_8) AND FIREABLE(t_1_5)) OR FIREABLE(t_0_7) OR NOT FIREABLE(t_1_2)))))
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(t_1_8) AND FIREABLE(t_1_5)) OR FIREABLE(t_0_7) OR NOT FIREABLE(t_1_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FIREABLE(t_1_8) AND FIREABLE(t_1_5)) OR FIREABLE(t_0_7) OR NOT FIREABLE(t_1_2))
lola: processed formula length: 83
lola: 8 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(t_0_5) OR NOT FIREABLE(t_1_6)) AND (NOT FIREABLE(t_1_3) OR NOT FIREABLE(t_1_1)) AND FIREABLE(t_1_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(t_0_5) OR NOT FIREABLE(t_1_6)) AND (NOT FIREABLE(t_1_3) OR NOT FIREABLE(t_1_1)) AND FIREABLE(t_1_2))
lola: processed formula length: 117
lola: 8 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E ((FIREABLE(t_1_4) U FIREABLE(t_0_8)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U E(FIREABLE(t_1_4) U FIREABLE(t_0_8)))
lola: processed formula length: 46
lola: 10 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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: 57 markings, 113 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(t_0_9) OR FIREABLE(t_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((FIREABLE(t_0_9) OR FIREABLE(t_1_1)))
lola: processed formula length: 41
lola: 9 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA ResAllocation-PT-R010C002-CTLFireability-8 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: E (F (E (G (A (X (FIREABLE(t_0_8)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U NOT(A(TRUE U NOT(AX(FIREABLE(t_0_8))))))
lola: processed formula length: 49
lola: 11 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 212 markings, 515 edges
lola: ========================================

FORMULA ResAllocation-PT-R010C002-CTLFireability-9 TRUE 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 (F (A (X (A (G (FIREABLE(t_1_8)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U AX(NOT(E(TRUE U NOT FIREABLE(t_1_8)))))
lola: processed formula length: 48
lola: 12 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 212 markings, 514 edges
lola: ========================================

FORMULA ResAllocation-PT-R010C002-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E ((FIREABLE(t_0_5) U FIREABLE(t_1_4))))) OR E (F ((FIREABLE(t_0_4) AND FIREABLE(t_0_7) AND FIREABLE(t_1_4) AND FIREABLE(t_1_6) AND FIREABLE(t_0_9)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_0_4) AND FIREABLE(t_0_7) AND FIREABLE(t_1_4) AND FIREABLE(t_1_6) AND FIREABLE(t_0_9))))
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(t_0_4) AND FIREABLE(t_0_7) AND FIREABLE(t_1_4) AND FIREABLE(t_1_6) AND FIREABLE(t_0_9))))
lola: processed formula length: 105
lola: 9 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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:625
lola: formula 0: (FIREABLE(t_0_4) AND FIREABLE(t_0_7) AND FIREABLE(t_1_4) AND FIREABLE(t_1_6) AND FIREABLE(t_0_9))
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R010C002-CTLFireability-6-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 267 markings, 441 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E ((FIREABLE(t_0_5) U FIREABLE(t_1_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E(FIREABLE(t_0_5) U FIREABLE(t_1_4)))
lola: processed formula length: 40
lola: 10 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA ResAllocation-PT-R010C002-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (E (X (FIREABLE(t_0_6)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U NOT(A(TRUE U NOT(EX(FIREABLE(t_0_6))))))
lola: processed formula length: 49
lola: 11 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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: 6144 markings, 31115 edges
lola: ========================================

FORMULA ResAllocation-PT-R010C002-CTLFireability-14 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: E (F ((NOT FIREABLE(t_0_3) AND FIREABLE(t_0_10) AND FIREABLE(t_1_9))))
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 ((NOT FIREABLE(t_0_3) AND FIREABLE(t_0_10) AND FIREABLE(t_1_9))))
lola: processed formula length: 70
lola: 9 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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:625
lola: formula 0: (NOT FIREABLE(t_0_3) AND FIREABLE(t_0_10) AND FIREABLE(t_1_9))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1536 markings, 4690 edges
lola: ========================================

FORMULA ResAllocation-PT-R010C002-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (NOT FIREABLE(t_0_10)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: FIREABLE(t_0_10)
lola: processed formula length: 16
lola: 10 rewrites
lola: closed formula file ResAllocation-PT-R010C002-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is cwpossibly invariant.
lola: 189 markings, 261 edges
lola: ========================================

FORMULA ResAllocation-PT-R010C002-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(t_1_10)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (FIREABLE(t_1_10)))
lola: processed formula length: 24
lola: 8 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 512 markings, 1280 edges
lola: ========================================

FORMULA ResAllocation-PT-R010C002-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(t_0_0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (FIREABLE(t_0_0)))
lola: processed formula length: 23
lola: 8 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 512 markings, 1280 edges
lola: ========================================

FORMULA ResAllocation-PT-R010C002-CTLFireability-6 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 (((FIREABLE(t_1_10) OR FIREABLE(t_1_5) OR (FIREABLE(t_1_7) AND FIREABLE(t_1_6)) OR (FIREABLE(t_0_4) AND FIREABLE(t_1_7) AND FIREABLE(t_0_5))) U (A (G (FIREABLE(t_0_5))) AND ((FIREABLE(t_1_5) OR FIREABLE(t_0_6)) AND (FIREABLE(t_1_5) OR FIREABLE(t_1_9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E((FIREABLE(t_1_10) OR FIREABLE(t_1_5) OR (FIREABLE(t_1_7) AND FIREABLE(t_1_6)) OR (FIREABLE(t_0_4) AND FIREABLE(t_1_7) AND FIREABLE(t_0_5))) U (NOT(E(TRUE U NOT FIREABLE(t_0_5))) AND ((FIREABLE(t_1_5) OR FIREABLE(t_0_6)) AND (FIREABLE(t_1_5) OR FIREABLE(t_1_9)))))
lola: processed formula length: 270
lola: 11 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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: 1536 markings, 3808 edges
lola: ========================================

FORMULA ResAllocation-PT-R010C002-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((FIREABLE(t_1_8) OR FIREABLE(t_0_7)))) OR E (G ((FIREABLE(t_0_10) AND FIREABLE(t_1_7)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U (FIREABLE(t_1_8) OR FIREABLE(t_0_7)))) AND A(TRUE U (NOT FIREABLE(t_0_10) OR NOT FIREABLE(t_1_7))))))
lola: processed formula length: 130
lola: 14 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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 3 significant temporal operators and needs 13 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: 2047 markings, 6350 edges
lola: ========================================

FORMULA ResAllocation-PT-R010C002-CTLFireability-7 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: E ((FIREABLE(t_1_10) U (FIREABLE(t_1_3) OR FIREABLE(t_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((FIREABLE(t_1_10) U (FIREABLE(t_1_3) OR FIREABLE(t_1_2))))
lola: processed formula length: 62
lola: 11 rewrites
lola: closed formula file ResAllocation-PT-R010C002-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (FIREABLE(t_1_3) OR FIREABLE(t_1_2))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R010C002-CTLFireability-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 512 markings, 1280 edges
lola: ========================================

FORMULA ResAllocation-PT-R010C002-CTLFireability-15 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)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t_0_5) OR E (((NOT FIREABLE(t_0_10) AND NOT FIREABLE(t_0_2)) U (FIREABLE(t_1_3) AND FIREABLE(t_1_4) AND FIREABLE(t_0_2)))))
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: FIREABLE(t_0_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_0_5)
lola: processed formula length: 15
lola: 8 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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: 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(t_0_5) OR E (((NOT FIREABLE(t_0_10) AND NOT FIREABLE(t_0_2)) U (FIREABLE(t_1_3) AND FIREABLE(t_1_4) AND FIREABLE(t_0_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_0_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_0_5)
lola: processed formula length: 15
lola: 8 rewrites
lola: closed formula file ResAllocation-PT-R010C002-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: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(t_0_10) AND NOT FIREABLE(t_0_2)) U (FIREABLE(t_1_3) AND FIREABLE(t_1_4) AND FIREABLE(t_0_2))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((NOT FIREABLE(t_0_10) AND NOT FIREABLE(t_0_2)) U (FIREABLE(t_1_3) AND FIREABLE(t_1_4) AND FIREABLE(t_0_2))))
lola: processed formula length: 112
lola: 11 rewrites
lola: closed formula file ResAllocation-PT-R010C002-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (FIREABLE(t_1_3) AND FIREABLE(t_1_4) AND FIREABLE(t_0_2))
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R010C002-CTLFireability-17-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 1792 markings, 5888 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA ResAllocation-PT-R010C002-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no yes no no no no yes no no yes no no no
lola:
preliminary result: yes no no no yes no no no no yes no no yes no no no
lola: memory consumption: 14832 KB
lola: time consumption: 0 seconds

BK_STOP 1527013843921

--------------------
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="ResAllocation-PT-R010C002"
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/ResAllocation-PT-R010C002.tgz
mv ResAllocation-PT-R010C002 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 ResAllocation-PT-R010C002, 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 r136-qhx2-152673579200389"
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 ;