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 15M
-rw-r--r-- 1 mcc users 3.7K May 30 21:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 30 21:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 29 15:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 15:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.4K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 28 09:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 09:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 28 08:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K May 28 08:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.5K May 28 06:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 28 06:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 26 06:30 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 26 06:30 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 27 04:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 27 04:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 2 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 15M May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RERS17pb113-PT-6, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169900426
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527797252434

info: Time: 3600 - MCC
===========================================================================================
prep: translating RERS17pb113-PT-6 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RERS17pb113-PT-6 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ RERS17pb113-PT-6 @ 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: 31992/65536 symbol table entries, 6831 collisions
lola: preprocessing...
lola: Size of bit vector: 639
lola: finding significant places
lola: 639 places, 31353 transitions, 614 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 47274 transition conflict sets
lola: TASK
lola: reading formula from RERS17pb113-PT-1-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p441)
lola: LP says that atomic proposition is always false: (3 <= p460)
lola: LP says that atomic proposition is always false: (2 <= p512)
lola: LP says that atomic proposition is always false: (3 <= p500)
lola: LP says that atomic proposition is always false: (3 <= p536)
lola: LP says that atomic proposition is always false: (3 <= p574)
lola: LP says that atomic proposition is always false: (2 <= p36)
lola: LP says that atomic proposition is always false: (3 <= p177)
lola: LP says that atomic proposition is always false: (2 <= p168)
lola: LP says that atomic proposition is always false: (2 <= p31)
lola: LP says that atomic proposition is always false: (2 <= p521)
lola: LP says that atomic proposition is always false: (2 <= p72)
lola: LP says that atomic proposition is always false: (2 <= p129)
lola: LP says that atomic proposition is always false: (2 <= p152)
lola: LP says that atomic proposition is always false: (3 <= p86)
lola: LP says that atomic proposition is always false: (2 <= p122)
lola: LP says that atomic proposition is always false: (3 <= p198)
lola: LP says that atomic proposition is always false: (2 <= p530)
lola: LP says that atomic proposition is always false: (3 <= p573)
lola: LP says that atomic proposition is always false: (3 <= p392)
lola: LP says that atomic proposition is always false: (3 <= p140)
lola: LP says that atomic proposition is always false: (3 <= p449)
lola: (E ((((p569 <= p127)) U ())) OR A (G (((1 <= p175) AND (1 <= p130) AND (p110 <= p278) AND (p231 <= p505))))) : NOT((A (F (())) AND (((p62 <= p292) AND (p436 <= p460) AND (p79 <= p448) AND (p307 <= p637)) OR E (F ((1 <= p134)))))) : (NOT(E (((p536 <= p505) U FALSE))) AND (p450 <= p391)) : (FALSE OR A (G (()))) : (E (F ((1 <= p47))) AND (((p387 <= p567) AND (p614 <= p28)) OR (p425 + 1 <= p574))) : A (G (E (X (TRUE)))) : ((((p96 <= p465) AND A (G ((p38 <= p162)))) OR E (F (((1 <= p109))))) AND (p203 <= p429)) : E ((() U A (F ((1 <= p615))))) : A (F (FALSE)) : E (((p565 <= p188) U ())) : NOT(A (G (E (F ((1 <= p498)))))) : NOT(E (G (((p166 <= p603))))) : E ((((p440 <= p447) AND ((p383 <= p239) OR (p173 <= p268))) U E (F (FALSE)))) : A (F (FALSE)) : ((p198 <= p542) AND ((() OR A (X ((1 <= p107)))) OR A (((p89 <= p614) U FALSE)))) : A (F (E ((FALSE U (1 <= p106)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:118
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
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:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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 201 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: 53 rewrites
lola: closed formula file RERS17pb113-PT-1-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 RERS17pb113-PT-1-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 214 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p450 <= p391)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p450 <= p391)
lola: processed formula length: 14
lola: 53 rewrites
lola: closed formula file RERS17pb113-PT-1-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 RERS17pb113-PT-1-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 229 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: 53 rewrites
lola: closed formula file RERS17pb113-PT-1-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: ========================================
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 RERS17pb113-PT-1-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 247 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: 53 rewrites
lola: closed formula file RERS17pb113-PT-1-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 RERS17pb113-PT-1-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 268 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: 53 rewrites
lola: closed formula file RERS17pb113-PT-1-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 RERS17pb113-PT-1-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 5 will run for 292 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: 53 rewrites
lola: closed formula file RERS17pb113-PT-1-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 RERS17pb113-PT-1-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 321 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: 53 rewrites
lola: closed formula file RERS17pb113-PT-1-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 RERS17pb113-PT-1-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p198 <= p542) AND A (X ((1 <= p107))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p198 <= p542)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p198 <= p542)
lola: processed formula length: 14
lola: 53 rewrites
lola: closed formula file RERS17pb113-PT-1-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 8 will run for 402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p107)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((1 <= p107))
lola: processed formula length: 15
lola: 54 rewrites
lola: closed formula file RERS17pb113-PT-1-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 RERS17pb113-PT-1-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking absence of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 258 markings, 257 edges, 52 markings/sec, 0 secs
lola: 522 markings, 521 edges, 53 markings/sec, 5 secs
lola: 790 markings, 789 edges, 54 markings/sec, 10 secs
lola: 1060 markings, 1059 edges, 54 markings/sec, 15 secs
lola: 1332 markings, 1331 edges, 54 markings/sec, 20 secs
lola: 1598 markings, 1597 edges, 53 markings/sec, 25 secs
lola: 1859 markings, 1858 edges, 52 markings/sec, 30 secs
lola: 2120 markings, 2119 edges, 52 markings/sec, 35 secs
lola: 2383 markings, 2382 edges, 53 markings/sec, 40 secs
lola: 2645 markings, 2644 edges, 52 markings/sec, 45 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The net is not deadlock-free.
lola: 2819 markings, 2818 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 452 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p175) AND (1 <= p130) AND (p110 <= p278) AND (p231 <= p505))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((1 <= p175) AND (1 <= p130) AND (p110 <= p278) AND (p231 <= p505))))
lola: processed formula length: 75
lola: 55 rewrites
lola: closed formula file RERS17pb113-PT-1-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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p175 <= 0) OR (p130 <= 0) OR (p278 + 1 <= p110) OR (p505 + 1 <= p231))
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges

FORMULA RERS17pb113-PT-1-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 527 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p498 <= 0)))))
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: (1 <= p498)
lola: processed formula length: 11
lola: 55 rewrites
lola: closed formula file RERS17pb113-PT-1-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: ========================================
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 946 markings, 945 edges, 189 markings/sec, 0 secs
lola: 1913 markings, 2029 edges, 193 markings/sec, 5 secs
lola: 2862 markings, 3156 edges, 190 markings/sec, 10 secs
lola: 3773 markings, 4192 edges, 182 markings/sec, 15 secs
lola: 4757 markings, 5251 edges, 197 markings/sec, 20 secs
lola: 5771 markings, 6331 edges, 203 markings/sec, 25 secs
lola: 6808 markings, 7443 edges, 207 markings/sec, 30 secs
lola: 7858 markings, 8594 edges, 210 markings/sec, 35 secs
lola: 8897 markings, 9777 edges, 208 markings/sec, 40 secs
lola: 9860 markings, 10884 edges, 193 markings/sec, 45 secs
lola: 10760 markings, 11905 edges, 180 markings/sec, 50 secs
lola: 11671 markings, 12941 edges, 182 markings/sec, 55 secs
lola: 12581 markings, 13988 edges, 182 markings/sec, 60 secs
lola: 13532 markings, 15116 edges, 190 markings/sec, 65 secs
lola: 14455 markings, 16205 edges, 185 markings/sec, 70 secs
lola: 15363 markings, 17285 edges, 182 markings/sec, 75 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is cwpossibly invariant.
lola: 15935 markings, 17863 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 616 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p615)))
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: (p615 <= 0)
lola: processed formula length: 11
lola: 55 rewrites
lola: closed formula file RERS17pb113-PT-1-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: 256 markings, 255 edges, 51 markings/sec, 0 secs
lola: 529 markings, 528 edges, 55 markings/sec, 5 secs
lola: 799 markings, 798 edges, 54 markings/sec, 10 secs
lola: 1065 markings, 1064 edges, 53 markings/sec, 15 secs
lola: 1325 markings, 1324 edges, 52 markings/sec, 20 secs
lola: 1588 markings, 1587 edges, 53 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 1810 markings, 1809 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 761 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p106)))
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: (p106 <= 0)
lola: processed formula length: 11
lola: 55 rewrites
lola: closed formula file RERS17pb113-PT-1-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: 270 markings, 269 edges, 54 markings/sec, 0 secs
lola: 527 markings, 526 edges, 51 markings/sec, 5 secs
lola: 796 markings, 795 edges, 54 markings/sec, 10 secs
lola: 1063 markings, 1062 edges, 53 markings/sec, 15 secs
lola: 1328 markings, 1327 edges, 53 markings/sec, 20 secs
lola: 1594 markings, 1593 edges, 53 markings/sec, 25 secs
lola: 1869 markings, 1868 edges, 55 markings/sec, 30 secs
lola: 2178 markings, 2177 edges, 62 markings/sec, 35 secs
lola: 2444 markings, 2443 edges, 53 markings/sec, 40 secs
lola: 2712 markings, 2711 edges, 54 markings/sec, 45 secs
lola: 2985 markings, 2984 edges, 55 markings/sec, 50 secs
lola: 3245 markings, 3244 edges, 52 markings/sec, 55 secs
lola: 3509 markings, 3508 edges, 53 markings/sec, 60 secs
lola: 3776 markings, 3775 edges, 53 markings/sec, 65 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3828 markings, 3827 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 992 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p603 + 1 <= p166))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: ((p166 <= p603))
lola: processed formula length: 16
lola: 55 rewrites
lola: closed formula file RERS17pb113-PT-1-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: 266 markings, 265 edges, 53 markings/sec, 0 secs
lola: 529 markings, 528 edges, 53 markings/sec, 5 secs
lola: 800 markings, 799 edges, 54 markings/sec, 10 secs
lola: 1073 markings, 1072 edges, 55 markings/sec, 15 secs
lola: 1341 markings, 1340 edges, 54 markings/sec, 20 secs
lola: 1606 markings, 1605 edges, 53 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 1810 markings, 1809 edges

FORMULA RERS17pb113-PT-1-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((1 <= p47))) AND (((p387 <= p567) AND (p614 <= p28)) OR (p425 + 1 <= p574)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p387 <= p567) AND (p614 <= p28)) OR (p425 + 1 <= p574))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p387 <= p567) AND (p614 <= p28)) OR (p425 + 1 <= p574))
lola: processed formula length: 59
lola: 53 rewrites
lola: closed formula file RERS17pb113-PT-1-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: ========================================
lola: subprocess 15 will run for 2942 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p47)))
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 <= p47)))
lola: processed formula length: 18
lola: 54 rewrites
lola: closed formula file RERS17pb113-PT-1-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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (1 <= p47)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb113-PT-1-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RERS17pb113-PT-1-CTLCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 717 markings, 716 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA RERS17pb113-PT-1-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2937 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p96 <= p465) AND A (G ((p38 <= p162)))) OR E (F (((1 <= p109))))) AND (p203 <= p429))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2937 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p96 <= p465)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p96 <= p465)
lola: processed formula length: 13
lola: 53 rewrites
lola: closed formula file RERS17pb113-PT-1-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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p109))))
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 <= p109))))
lola: processed formula length: 21
lola: 54 rewrites
lola: closed formula file RERS17pb113-PT-1-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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((1 <= p109))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb113-PT-1-CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RERS17pb113-PT-1-CTLCardinality-17-0.sara.
lola: local time limit reached - aborting
lola:
preliminary result: no yes yes yes yes no unknown no no no yes no no no no no
lola: memory consumption: 126916 KB
lola: time consumption: 633 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p38 <= p162)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p38 <= p162)))
lola: processed formula length: 21
lola: 55 rewrites
lola: closed formula file RERS17pb113-PT-1-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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p162 + 1 <= p38)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb113-PT-1-CTLCardinality-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RERS17pb113-PT-1-CTLCardinality-18-0.sara.
lola: local time limit reached - aborting
lola:
preliminary result: no yes yes yes yes no unknown no no no yes no no no no no
lola: memory consumption: 126916 KB
lola: time consumption: 634 seconds
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: ((((p96 <= p465) AND A (G ((p38 <= p162)))) OR E (F (((1 <= p109))))) AND (p203 <= p429))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p96 <= p465)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p96 <= p465)
lola: processed formula length: 13
lola: 53 rewrites
lola: closed formula file RERS17pb113-PT-1-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: ========================================
lola: ...considering subproblem: (p203 <= p429)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p203 <= p429)
lola: processed formula length: 14
lola: 53 rewrites
lola: closed formula file RERS17pb113-PT-1-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: ========================================
lola: ...considering subproblem: E (F (((1 <= p109))))
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 <= p109))))
lola: processed formula length: 21
lola: 54 rewrites
lola: closed formula file RERS17pb113-PT-1-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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((1 <= p109))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb113-PT-1-CTLCardinality-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RERS17pb113-PT-1-CTLCardinality-18-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 678 markings, 677 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.

FORMULA RERS17pb113-PT-1-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no yes no no no yes no no no no no
lola:
preliminary result: no yes yes yes yes no yes no no no yes no no no no no
lola: ========================================
lola: memory consumption: 102432 KB
lola: time consumption: 638 seconds

BK_STOP 1527797891483

--------------------
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="RERS17pb113-PT-6"
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/RERS17pb113-PT-6.tgz
mv RERS17pb113-PT-6 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 RERS17pb113-PT-6, 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 r280-csrt-152749169900426"
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 ;