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 4.3K May 30 21:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 30 21:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 29 15:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 15:56 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.2K May 28 09:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K 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 11K 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.0K May 28 06:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 28 06:44 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 4.0K May 27 04:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 04:14 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-5, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169900417
=====================================================================

--------------------
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 1527795788257

info: Time: 3600 - MCC
===========================================================================================
prep: translating RERS17pb113-PT-5 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RERS17pb113-PT-5 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ RERS17pb113-PT-5 @ 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: 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 <= p521)
lola: LP says that atomic proposition is always false: (3 <= p138)
lola: LP says that atomic proposition is always false: (3 <= p591)
lola: LP says that atomic proposition is always false: (2 <= p600)
lola: LP says that atomic proposition is always false: (2 <= p437)
lola: LP says that atomic proposition is always false: (2 <= p407)
lola: place invariant simplifies atomic proposition
lola: before: (p165 <= p393)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= p565)
lola: LP says that atomic proposition is always false: (3 <= p320)
lola: LP says that atomic proposition is always false: (2 <= p175)
lola: LP says that atomic proposition is always false: (3 <= p407)
lola: LP says that atomic proposition is always false: (2 <= p128)
lola: LP says that atomic proposition is always false: (2 <= p142)
lola: LP says that atomic proposition is always false: (3 <= p306)
lola: LP says that atomic proposition is always false: (2 <= p563)
lola: LP says that atomic proposition is always false: (2 <= p227)
lola: LP says that atomic proposition is always false: (3 <= p41)
lola: LP says that atomic proposition is always false: (2 <= p238)
lola: LP says that atomic proposition is always false: (2 <= p447)
lola: LP says that atomic proposition is always false: (2 <= p178)
lola: (E (F (E (F (FALSE)))) AND ((E (G (FALSE)) OR E (X ((p368 <= p152)))) OR ())) : A (G (((1 <= p88) OR (p43 <= p639)))) : (FALSE OR E (((p209 <= 0) U (p115 + 1 <= p529)))) : E (G (E (((p570 <= p358) U (p54 <= p384))))) : A (((p241 <= p354) U ((p621 + 1 <= p157) OR (p573 + 1 <= p40)))) : (E (G (A (F ((1 <= p420))))) AND ((((p154 <= 0) OR (p390 + 1 <= p425)) AND A (F ((p618 <= p488)))) AND (((p457 <= 0)) AND A (F (TRUE))))) : (() OR NOT(E (G (((p309 <= p38) OR (p257 <= p474)))))) : E ((A (X ((p620 <= p453))) U A (X (FALSE)))) : A (X ((A (G ((p13 <= p131))) OR E (G ((1 <= p275)))))) : (NOT(NOT(E (G (FALSE)))) OR A (G ((p528 <= p272)))) : ((((p625 <= 0)) OR (p378 <= 0) OR (p83 + 1 <= p328)) AND (A (X (((p308 <= p169)))) AND E (F ((p456 + 1 <= p80))))) : A (F (((((1 <= p355) OR (1 <= p519))) OR (((p270 <= p547) OR (p123 <= p503)) AND (p600 + 1 <= p212))))) : ((() AND E (F (()))) AND E (X (E (F ((p69 <= p389)))))) : (E (((p279 <= 0) U (p443 + 1 <= p115))) OR (E (X (((p225 <= p493) AND (p353 <= p365)))) AND (E (X ((p330 <= p129))) AND E (G ((1 <= p388)))))) : NOT((FALSE OR E (F (())))) : NOT(A ((TRUE U ())))
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:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
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:122
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:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
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:116
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:98
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:122
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 195 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: 50 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-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 208 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: 50 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 2 will run for 223 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: 50 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-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 240 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: 50 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

FORMULA RERS17pb113-PT-1-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (X ((p620 <= p453))) U DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: ========================================
lola: processed formula: E(AX((p620 <= p453)) U DEADLOCK)
lola: processed formula length: 32
lola: 52 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 24781 markings, 40268 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p279 <= 0) U (p443 + 1 <= p115))) OR (E (X (((p225 <= p493) AND (p353 <= p365)))) AND (E (X ((p330 <= p129))) AND E (G ((1 <= p388))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p388)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((1 <= p388)))
lola: processed formula length: 19
lola: 50 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p279 <= 0) U (p443 + 1 <= p115)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((p279 <= 0) U (p443 + 1 <= p115)))
lola: processed formula length: 38
lola: 53 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (p443 + 1 <= p115)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb113-PT-1-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RERS17pb113-PT-1-CTLCardinality-6-0.sara.
lola: sara is running 0 secs || 896 markings, 895 edges, 179 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 1372 markings, 1371 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA RERS17pb113-PT-1-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((A (G ((p13 <= p131))) OR E (G ((1 <= p275))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: AX((NOT(E(TRUE U (p131 + 1 <= p13))) OR NOT(A(TRUE U (p275 <= 0)))))
lola: processed formula length: 68
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 96 markings, 96 edges

FORMULA RERS17pb113-PT-1-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p625 <= 0)) OR (p378 <= 0) OR (p83 + 1 <= p328)) AND (A (X (((p308 <= p169)))) AND E (F ((p456 + 1 <= p80)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p625 <= 0)) OR (p378 <= 0) OR (p83 + 1 <= p328))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p625 <= 0)) OR (p378 <= 0) OR (p83 + 1 <= p328))
lola: processed formula length: 53
lola: 50 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 8 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p456 + 1 <= p80)))
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 ((p456 + 1 <= p80)))
lola: processed formula length: 25
lola: 51 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: (p456 + 1 <= p80)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb113-PT-1-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RERS17pb113-PT-1-CTLCardinality-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 899 markings, 898 edges
lola: ========================================
lola: subprocess 9 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p308 <= p169))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(((p308 <= p169)))
lola: processed formula length: 20
lola: 51 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA RERS17pb113-PT-1-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p528 <= p272)))
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 ((p528 <= p272)))
lola: processed formula length: 22
lola: 52 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: (p272 + 1 <= p528)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb113-PT-1-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RERS17pb113-PT-1-CTLCardinality-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 69 markings, 68 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 9 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p88) OR (p43 <= p639))))
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 <= p88) OR (p43 <= p639))))
lola: processed formula length: 38
lola: 52 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: ((p88 <= 0) AND (p639 + 1 <= p43))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb113-PT-1-CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RERS17pb113-PT-1-CTLCardinality-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 297 markings, 296 edges

FORMULA RERS17pb113-PT-1-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 517 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p38 + 1 <= p309) AND (p474 + 1 <= p257))))
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: ((p309 <= p38) OR (p257 <= p474))
lola: processed formula length: 34
lola: 52 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: 272 markings, 271 edges, 54 markings/sec, 0 secs
lola: 559 markings, 558 edges, 57 markings/sec, 5 secs
lola: 834 markings, 833 edges, 55 markings/sec, 10 secs
lola: 1119 markings, 1118 edges, 57 markings/sec, 15 secs
lola: 1399 markings, 1398 edges, 56 markings/sec, 20 secs
lola: 1671 markings, 1670 edges, 54 markings/sec, 25 secs
lola: 1958 markings, 1957 edges, 57 markings/sec, 30 secs
lola: 2238 markings, 2237 edges, 56 markings/sec, 35 secs
lola: 2521 markings, 2520 edges, 57 markings/sec, 40 secs
lola: 2798 markings, 2797 edges, 55 markings/sec, 45 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2819 markings, 2818 edges

FORMULA RERS17pb113-PT-1-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 611 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((((1 <= p355) OR (1 <= p519))) OR (((p270 <= p547) OR (p123 <= p503)) AND (p600 + 1 <= p212)))))
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: ((((p355 <= 0) AND (p519 <= 0))) AND (((p547 + 1 <= p270) AND (p503 + 1 <= p123)) OR (p212 <= p600)))
lola: processed formula length: 102
lola: 52 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: 309 markings, 308 edges, 62 markings/sec, 0 secs
lola: 650 markings, 649 edges, 68 markings/sec, 5 secs
lola: 936 markings, 935 edges, 57 markings/sec, 10 secs
lola: 1261 markings, 1260 edges, 65 markings/sec, 15 secs
lola: 1627 markings, 1626 edges, 73 markings/sec, 20 secs
lola: 1943 markings, 1942 edges, 63 markings/sec, 25 secs
lola: 2268 markings, 2267 edges, 65 markings/sec, 30 secs
lola: 2602 markings, 2601 edges, 67 markings/sec, 35 secs
lola: 2930 markings, 2929 edges, 66 markings/sec, 40 secs
lola: 3238 markings, 3237 edges, 62 markings/sec, 45 secs
lola: 3515 markings, 3514 edges, 55 markings/sec, 50 secs
lola: 3832 markings, 3831 edges, 63 markings/sec, 55 secs
lola: 4188 markings, 4187 edges, 71 markings/sec, 60 secs
lola: 4498 markings, 4497 edges, 62 markings/sec, 65 secs
lola: 4829 markings, 4828 edges, 66 markings/sec, 70 secs
lola: 5203 markings, 5202 edges, 75 markings/sec, 75 secs
lola: 5548 markings, 5547 edges, 69 markings/sec, 80 secs
lola: 5865 markings, 5864 edges, 63 markings/sec, 85 secs
lola: 6157 markings, 6156 edges, 58 markings/sec, 90 secs
lola: 6486 markings, 6485 edges, 66 markings/sec, 95 secs
lola: 6832 markings, 6831 edges, 69 markings/sec, 100 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 6855 markings, 6854 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 737 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (((p570 <= p358) U (p54 <= p384)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(E((p570 <= p358) U (p54 <= p384)))))
lola: processed formula length: 53
lola: 52 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 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: 1810 markings, 3633 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 13 will run for 983 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p209 <= 0) U (p115 + 1 <= p529)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((p209 <= 0) U (p115 + 1 <= p529)))
lola: processed formula length: 38
lola: 53 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (p115 + 1 <= p529)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb113-PT-1-CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RERS17pb113-PT-1-CTLCardinality-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 255 markings, 254 edges

lola: FORMULA RERS17pb113-PT-1-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 14 will run for 1474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p241 <= p354) U ((p621 + 1 <= p157) OR (p573 + 1 <= p40))))
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 (((p241 <= p354) U ((p621 + 1 <= p157) OR (p573 + 1 <= p40))))
lola: processed formula length: 65
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 /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: 274 markings, 273 edges, 55 markings/sec, 0 secs
lola: 573 markings, 572 edges, 60 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 713 markings, 712 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2936 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F ((1 <= p420))))) AND (((p154 <= 0) OR (p390 + 1 <= p425)) AND (A (F ((p618 <= p488))) AND ((p457 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2936 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p457 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p457 <= 0))
lola: processed formula length: 13
lola: 50 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: A (F ((p618 <= p488)))
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: (p488 + 1 <= p618)
lola: processed formula length: 18
lola: 52 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((1 <= p420)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (1 <= p420)))))
lola: processed formula length: 41
lola: 52 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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1810 markings, 1810 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RERS17pb113-PT-1-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes no no no yes no no yes no no yes yes yes
lola:
preliminary result: no no yes yes no no no yes no no yes no no yes yes yes
lola: memory consumption: 105900 KB
lola: time consumption: 634 seconds

BK_STOP 1527796422429

--------------------
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-5"
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-5.tgz
mv RERS17pb113-PT-5 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-5, 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-152749169900417"
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 ;