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 216K
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K 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 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Philosophers-PT-000005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469900759
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527057758569

info: Time: 3600 - MCC
===========================================================================================
prep: translating Philosophers-PT-000005 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 Philosophers-PT-000005 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ Philosophers-PT-000005 @ 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: 50/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 25
lola: finding significant places
lola: 25 places, 25 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 35 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-PT-000005-CTLCardinality.task
lola: always true
lola: always true
lola: LP says that atomic proposition is always false: (3 <= Fork_2)
lola: LP says that atomic proposition is always false: (2 <= Fork_1)
lola: LP says that atomic proposition is always false: (2 <= Catch1_1)
lola: LP says that atomic proposition is always false: (2 <= Fork_3)
lola: LP says that atomic proposition is always false: (2 <= Eat_2)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= Catch1_5)
lola: LP says that atomic proposition is always false: (3 <= Catch2_4)
lola: LP says that atomic proposition is always false: (3 <= Fork_5)
lola: LP says that atomic proposition is always false: (3 <= Eat_5)
lola: LP says that atomic proposition is always false: (3 <= Catch1_2)
lola: A (F ((E (G (TRUE)) AND (1 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5)))) : (3 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5) : ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + 1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5) AND (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + 1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) AND ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 1) OR (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 0))) : (A (((1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) U (1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5))) AND (((1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5) OR (1 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5)) OR (E (F ((3 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5))) OR A (X ((1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5)))))) : NOT(A (X (A (F ((Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)))))) : ((A (X (((1 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5) OR (3 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5)))) OR ((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 2) AND (Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 2) AND (1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5))) AND E (G (((1 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5) AND ((3 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) OR (2 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)))))) : (1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) : NOT(A (((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 <= 1) U ((3 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5))))) : NOT(((E (X ((1 <= Think_1))) AND ()) AND A (F (((Catch2_3 <= Fork_5)))))) : (A (F (())) OR (A (X ((Catch1_5 <= 0))) OR (E (X (FALSE)) OR (Fork_4 <= Think_4)))) : E (G (A (G (FALSE)))) : (Think_3 <= Eat_2) : E (F (E (G (((Eat_1 <= Catch1_1)))))) : NOT((E (X (())) OR ((Think_2 <= Catch1_1) AND ((Eat_2 + 1 <= Eat_4) OR (Catch1_5 <= 0))))) : (NOT(E (X (((Eat_3 <= Catch2_5))))) AND (Eat_1 <= Think_1)) : E ((() U (Fork_3 <= Catch2_5)))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5)
lola: processed formula length: 59
lola: 38 rewrites
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: processed formula with 1 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 Philosophers-PT-000005-CTLCardinality-1 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: ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + 1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5) AND (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + 1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) AND ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 1) OR (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + 1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5) AND (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + 1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) AND ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 1) OR (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 0)))
lola: processed formula length: 345
lola: 38 rewrites
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: processed formula with 4 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 Philosophers-PT-000005-CTLCardinality-2 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: (1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)
lola: processed formula length: 59
lola: 38 rewrites
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: processed formula with 1 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 Philosophers-PT-000005-CTLCardinality-6 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 38 rewrites
lola: closed formula file Philosophers-PT-000005-CTLCardinality.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: ========================================

FORMULA Philosophers-PT-000005-CTLCardinality-8 TRUE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 38 rewrites
lola: closed formula file Philosophers-PT-000005-CTLCardinality.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 Philosophers-PT-000005-CTLCardinality-10 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: (Think_3 <= Eat_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Think_3 <= Eat_2)
lola: processed formula length: 18
lola: 38 rewrites
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: processed formula with 1 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 Philosophers-PT-000005-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Catch1_1 + 1 <= Think_2) OR ((Eat_4 <= Eat_2) AND (1 <= Catch1_5)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Catch1_1 + 1 <= Think_2) OR ((Eat_4 <= Eat_2) AND (1 <= Catch1_5)))
lola: processed formula length: 70
lola: 38 rewrites
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: processed formula with 3 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: ========================================

FORMULA Philosophers-PT-000005-CTLCardinality-13 TRUE 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: (Fork_3 <= Catch2_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Fork_3 <= Catch2_5)
lola: processed formula length: 20
lola: 38 rewrites
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: processed formula with 1 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 Philosophers-PT-000005-CTLCardinality-15 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 (X (((1 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5) OR (3 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5)))) OR ((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 2) AND (Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 2) AND (1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5))) AND E (G (((1 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5) AND ((3 <= Catch1_1 + Catch1_... (shortened)
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: ((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 2) AND (Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 2) AND (1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 2) AND (Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 2) AND (1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5))
lola: processed formula length: 184
lola: 38 rewrites
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: processed formula with 3 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 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5) AND ((3 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) OR (2 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((1 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5) AND ((3 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) OR (2 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)))))
lola: processed formula length: 194
lola: 38 rewrites
lola: closed formula file Philosophers-PT-000005-CTLCardinality.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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Philosophers-PT-000005-CTLCardinality-5 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: (A (((1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) U (1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5))) AND (((1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5) OR (1 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5)) OR (E (F ((3 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5))) OR A (X ((1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5))))))
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 (((1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) U (1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5)))
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 (((1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) U (1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5)))
lola: processed formula length: 127
lola: 42 rewrites
lola: closed formula file Philosophers-PT-000005-CTLCardinality.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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Philosophers-PT-000005-CTLCardinality-3 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: E (X (E (G ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + 1 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:627
lola: processed formula: (Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + 1 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5)
lola: processed formula length: 99
lola: 39 rewrites
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate is not possibly preserved from any successor.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-PT-000005-CTLCardinality-4 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 (X (((Catch2_5 + 1 <= Eat_3)))) AND (Eat_1 <= Think_1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Eat_1 <= Think_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Eat_1 <= Think_1)
lola: processed formula length: 18
lola: 38 rewrites
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: processed formula with 1 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 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((Catch2_5 + 1 <= Eat_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(((Catch2_5 + 1 <= Eat_3)))
lola: processed formula length: 29
lola: 39 rewrites
lola: closed formula file Philosophers-PT-000005-CTLCardinality.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 Philosophers-PT-000005-CTLCardinality-14 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: (A (X ((Catch1_5 <= 0))) OR (Fork_4 <= Think_4))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Fork_4 <= Think_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Fork_4 <= Think_4)
lola: processed formula length: 19
lola: 38 rewrites
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: processed formula with 1 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Philosophers-PT-000005-CTLCardinality-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: E (F (E (G (((Eat_1 <= Catch1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: ((Eat_1 <= Catch1_1))
lola: processed formula length: 21
lola: 39 rewrites
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--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 /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA Philosophers-PT-000005-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 <= 0)
lola: processed formula length: 44
lola: 40 rewrites
lola: closed formula file Philosophers-PT-000005-CTLCardinality.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 does not eventually occur.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA Philosophers-PT-000005-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((2 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5) R ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:646
lola: rewrite Frontend/Parser/formula_rewrite.k:610
lola: processed formula: E (((2 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5) R ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 2))))
lola: processed formula length: 119
lola: 40 rewrites
lola: closed formula file Philosophers-PT-000005-CTLCardinality.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: There is a path where Predicate Phi releases Predicate Psi.
lola: 0 markings, 0 edges

FORMULA Philosophers-PT-000005-CTLCardinality-7 TRUE 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 yes yes yes no no yes yes no no
lola:
preliminary result: no no no no no no no yes yes yes no no yes yes no no
lola: ========================================
lola: memory consumption: 24236 KB
lola: time consumption: 0 seconds

BK_STOP 1527057758943

--------------------
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="Philosophers-PT-000005"
export BK_EXAMINATION="CTLCardinality"
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/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 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 Philosophers-PT-000005, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r112-csrt-152666469900759"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;