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 204K
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.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 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K 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.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 30K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Railroad-PT-005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578900171
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526961177525

info: Time: 3600 - MCC
===========================================================================================
prep: translating Railroad-PT-005 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Railroad-PT-005 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ Railroad-PT-005 @ 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: 124/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2176
lola: finding significant places
lola: 68 places, 56 transitions, 27 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 42 transition conflict sets
lola: TASK
lola: reading formula from Railroad-PT-005-CTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (pl_P34_5 <= pl_P3_1)
lola: after: (pl_P34_5 <= 0)
lola: LP says that atomic proposition is always false: (3 <= pl_P40_5)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= pl_P37_1)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (pl_P41_1 <= pl_P7_6)
lola: after: (pl_P41_1 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (pl_P12_1 <= pl_P29_6)
lola: after: (pl_P12_1 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (pl_P29_6 <= pl_P7_2)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= pl_P26_1)
lola: place invariant simplifies atomic proposition
lola: before: (pl_P7_3 <= pl_P3_1)
lola: after: (pl_P7_3 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= pl_P29_4)
lola: after: (3 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (1 <= pl_P3_1)
lola: after: (1 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (2 <= pl_P40_4)
lola: place invariant simplifies atomic proposition
lola: before: (pl_P7_6 <= pl_P23_1)
lola: after: (0 <= pl_P23_1)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= pl_P39_1)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= pl_P29_5)
lola: after: (3 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (2 <= pl_P12_1)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= pl_P38_1)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (pl_P7_2 <= pl_P29_6)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= pl_P34_5)
lola: LP says that atomic proposition is always false: (2 <= pl_P40_3)
lola: LP says that atomic proposition is always false: (3 <= pl_P22_1)
lola: LP says that atomic proposition is always false: (3 <= pl_P35_1)
lola: place invariant simplifies atomic proposition
lola: before: (pl_P2_1 <= pl_P3_1)
lola: after: (pl_P2_1 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (pl_P37_1 <= pl_P25_1)
lola: after: (0 <= pl_P25_1)
lola: always true
lola: LP says that atomic proposition is always true: (pl_P0_6 <= pl_P27_1)
lola: LP says that atomic proposition is always false: (1 <= pl_P40_6)
lola: LP says that atomic proposition is always false: (2 <= pl_P12_1)
lola: LP says that atomic proposition is always false: (3 <= pl_P33_1)
lola: LP says that atomic proposition is always false: (3 <= pl_P17_1)
lola: place invariant simplifies atomic proposition
lola: before: (pl_P7_4 <= pl_P18_1)
lola: after: (0 <= pl_P18_1)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (pl_P34_2 <= pl_P7_6)
lola: after: (pl_P34_2 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (pl_P7_4 <= pl_P11_1)
lola: after: (0 <= pl_P11_1)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= pl_P36_1)
lola: LP says that atomic proposition is always false: (2 <= pl_P34_6)
lola: place invariant simplifies atomic proposition
lola: before: (pl_P34_3 <= pl_P29_4)
lola: after: (pl_P34_3 <= 0)
lola: LP says that atomic proposition is always false: (2 <= pl_P10_1)
lola: place invariant simplifies atomic proposition
lola: before: (pl_P0_5 <= pl_P14_1)
lola: after: (pl_P0_5 <= 0)
lola: LP says that atomic proposition is always false: (2 <= pl_P0_1)
lola: place invariant simplifies atomic proposition
lola: before: (pl_P17_1 <= pl_P24_1)
lola: after: (pl_P17_1 <= 0)
lola: always true
lola: ((pl_P0_5 <= pl_P7_1) OR (A (X (())) OR (pl_P25_1 <= pl_P13_1))) : A ((() U ((pl_P41_1 <= 0) OR (pl_P6_1 <= 0)))) : E (F (A (G ((pl_P21_1 <= pl_P35_1))))) : ((pl_P12_1 <= 0) OR (NOT(E (X ((1 <= pl_P12_1)))) OR (((pl_P16_1 <= pl_P34_1) AND (pl_P34_2 <= pl_P0_3))))) : (1 <= pl_P0_4) : A (F ((E (G ((pl_P7_3 <= 0))) AND E (F (FALSE))))) : A (F ((() AND E (G ((pl_P25_1 <= pl_P40_4)))))) : E (F (TRUE)) : FALSE : () : ((A (F (((1 <= pl_P30_1)))) AND ((pl_P18_1 <= pl_P40_2) OR (pl_P40_5 <= pl_P6_1))) AND ((() AND A (G ((1 <= pl_P0_4)))) AND (((pl_P2_1 <= 0))))) : A (((pl_P40_4 <= pl_P36_1) U ((pl_P33_1 <= pl_P0_6)))) : (((A (X (FALSE)) OR ()) AND A (((pl_P6_1 <= pl_P40_5) U (pl_P29_3 <= pl_P27_1)))) OR (E (F ((1 <= pl_P34_2))) OR ())) : (pl_P34_3 <= 0) : NOT(NOT((((pl_P40_4 + 1 <= pl_P33_1) OR (pl_P29_3 <= 0)) OR A (X (FALSE))))) : ((E (G (((1 <= pl_P20_1) AND (pl_P0_5 <= 0)))) OR A ((FALSE U (pl_P6_1 <= pl_P4_1)))) AND (((pl_P10_1 <= pl_P32_1) AND (1 <= pl_P28_1))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
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:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:285
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:288
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((pl_P0_5 <= pl_P7_1) OR (DEADLOCK OR (pl_P25_1 <= pl_P13_1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:704
lola: rewrite Frontend/Parser/formula_rewrite.k:704
lola: rewrite Frontend/Parser/formula_rewrite.k:705
lola: processed formula: ((pl_P0_5 <= pl_P7_1) OR DEADLOCK OR (pl_P25_1 <= pl_P13_1))
lola: processed formula length: 60
lola: 43 rewrites
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: processed formula with 2 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 Railroad-PT-005-CTLCardinality-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: ((pl_P41_1 <= 0) OR (pl_P6_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pl_P41_1 <= 0) OR (pl_P6_1 <= 0))
lola: processed formula length: 36
lola: 40 rewrites
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: processed formula with 2 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 Railroad-PT-005-CTLCardinality-1 TRUE 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: (1 <= pl_P0_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= pl_P0_4)
lola: processed formula length: 14
lola: 40 rewrites
lola: closed formula file Railroad-PT-005-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: ========================================

FORMULA Railroad-PT-005-CTLCardinality-4 TRUE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 40 rewrites
lola: closed formula file Railroad-PT-005-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 Railroad-PT-005-CTLCardinality-5 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 40 rewrites
lola: closed formula file Railroad-PT-005-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 Railroad-PT-005-CTLCardinality-7 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 40 rewrites
lola: closed formula file Railroad-PT-005-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 Railroad-PT-005-CTLCardinality-8 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 40 rewrites
lola: closed formula file Railroad-PT-005-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 Railroad-PT-005-CTLCardinality-9 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: (pl_P34_3 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pl_P34_3 <= 0)
lola: processed formula length: 15
lola: 40 rewrites
lola: closed formula file Railroad-PT-005-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

FORMULA Railroad-PT-005-CTLCardinality-13 TRUE 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: (((pl_P40_4 + 1 <= pl_P33_1) OR (pl_P29_3 <= 0)) OR DEADLOCK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:704
lola: processed formula: (((pl_P40_4 + 1 <= pl_P33_1) OR (pl_P29_3 <= 0)) OR DEADLOCK)
lola: processed formula length: 62
lola: 41 rewrites
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: processed formula with 2 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 Railroad-PT-005-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((pl_P12_1 <= 0) OR (A (X ((pl_P12_1 <= 0))) OR (((pl_P16_1 <= pl_P34_1) AND (pl_P34_2 <= pl_P0_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((pl_P16_1 <= pl_P34_1) AND (pl_P34_2 <= pl_P0_3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((pl_P16_1 <= pl_P34_1) AND (pl_P34_2 <= pl_P0_3)))
lola: processed formula length: 52
lola: 40 rewrites
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: processed formula with 2 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 Railroad-PT-005-CTLCardinality-3 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 (F (A (G ((pl_P21_1 <= pl_P35_1)))))
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:694
lola: processed formula: (pl_P35_1 + 1 <= pl_P21_1)
lola: processed formula length: 26
lola: 42 rewrites
lola: closed formula file Railroad-PT-005-CTLCardinality.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: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 1838 markings, 7698 edges
lola: ========================================

FORMULA Railroad-PT-005-CTLCardinality-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: A (F (E (G ((pl_P25_1 <= pl_P40_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U NOT(A(TRUE U (pl_P40_4 + 1 <= pl_P25_1))))
lola: processed formula length: 51
lola: 43 rewrites
lola: closed formula file Railroad-PT-005-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 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: 13 markings, 14 edges
lola: ========================================

FORMULA Railroad-PT-005-CTLCardinality-6 TRUE 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 (((pl_P40_4 <= pl_P36_1) U ((pl_P33_1 <= pl_P0_6))))
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 (((pl_P40_4 <= pl_P36_1) U ((pl_P33_1 <= pl_P0_6))))
lola: processed formula length: 54
lola: 44 rewrites
lola: closed formula file Railroad-PT-005-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: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Railroad-PT-005-CTLCardinality-11 TRUE 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 (((1 <= pl_P20_1) AND (pl_P0_5 <= 0)))) OR (pl_P6_1 <= pl_P4_1)) AND (((pl_P10_1 <= pl_P32_1) AND (1 <= pl_P28_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (pl_P6_1 <= pl_P4_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pl_P6_1 <= pl_P4_1)
lola: processed formula length: 20
lola: 40 rewrites
lola: closed formula file Railroad-PT-005-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: ========================================
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((pl_P10_1 <= pl_P32_1) AND (1 <= pl_P28_1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((pl_P10_1 <= pl_P32_1) AND (1 <= pl_P28_1)))
lola: processed formula length: 46
lola: 40 rewrites
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: processed formula with 2 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 Railroad-PT-005-CTLCardinality-15 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 (((pl_P6_1 <= pl_P40_5) U (pl_P29_3 <= pl_P27_1))) OR E (F ((1 <= pl_P34_2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= pl_P34_2)))
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 ((1 <= pl_P34_2)))
lola: processed formula length: 23
lola: 41 rewrites
lola: closed formula file Railroad-PT-005-CTLCardinality.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: 3 markings, 2 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.

FORMULA Railroad-PT-005-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (1 <= pl_P34_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-005-CTLCardinality-14-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= pl_P30_1)))) AND (((pl_P18_1 <= pl_P40_2) OR (pl_P40_5 <= pl_P6_1)) AND (A (G ((1 <= pl_P0_4))) AND (((pl_P2_1 <= 0))))))
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: (((pl_P2_1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((pl_P2_1 <= 0)))
lola: processed formula length: 18
lola: 40 rewrites
lola: closed formula file Railroad-PT-005-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA Railroad-PT-005-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no yes yes no yes yes no no no yes yes yes no no
lola:
preliminary result: yes yes no yes yes no yes yes no no no yes yes yes no no
sara: try reading problem file Railroad-PT-005-CTLCardinality-14-0.sara.
lola: memory consumption: 23424 KB
lola: time consumption: 0 seconds
sara: place or transition ordering is non-deterministic


BK_STOP 1526961198809

--------------------
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="Railroad-PT-005"
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/Railroad-PT-005.tgz
mv Railroad-PT-005 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 Railroad-PT-005, 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 r136-qhx2-152673578900171"
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 ;