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 264K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 91K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DES-PT-20b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r052-smll-152646380100234
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526609112180

info: Time: 3600 - MCC
===========================================================================================
prep: translating DES-PT-20b Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating DES-PT-20b formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ DES-PT-20b @ 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: 671/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 360
lola: finding significant places
lola: 360 places, 311 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 408 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-20b-CTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p261)
lola: LP says that atomic proposition is always false: (2 <= p284)
lola: LP says that atomic proposition is always false: (2 <= p265)
lola: LP says that atomic proposition is always false: (3 <= p79)
lola: LP says that atomic proposition is always false: (3 <= p23)
lola: LP says that atomic proposition is always false: (2 <= p137)
lola: LP says that atomic proposition is always false: (3 <= p358)
lola: LP says that atomic proposition is always false: (2 <= p170)
lola: LP says that atomic proposition is always false: (3 <= p163)
lola: LP says that atomic proposition is always false: (2 <= p171)
lola: LP says that atomic proposition is always false: (3 <= p265)
lola: LP says that atomic proposition is always false: (2 <= p356)
lola: LP says that atomic proposition is always false: (3 <= p65)
lola: LP says that atomic proposition is always false: (2 <= p236)
lola: LP says that atomic proposition is always false: (3 <= p66)
lola: LP says that atomic proposition is always false: (2 <= p171)
lola: LP says that atomic proposition is always false: (2 <= p79)
lola: LP says that atomic proposition is always false: (2 <= p262)
lola: NOT(((A (G ((p20 <= p309))) AND (p83 <= p36)) AND E (X ((p141 <= 0))))) : NOT((((p319 + 1 <= p162)) OR A (F ((p303 + 1 <= p95))))) : ((A (((p176 <= p84) U FALSE)) OR FALSE) OR ((p103 + 1 <= p62) AND (p69 + 1 <= p222) AND ((p78 + 1 <= p155) OR (p191 <= 0)) AND ((p144 + 1 <= p123) OR (p81 + 1 <= p151)))) : E (G (((p250 <= p89)))) : NOT(E (G (((p208 <= 0))))) : A ((E (G ((p120 <= p301))) U ((p284 + 1 <= p27) AND (p205 <= 0)))) : NOT(((E (F (FALSE)) AND E (X ((p144 <= p354)))) AND (A (F ((p143 <= p186))) AND ((p210 <= 0) OR (p45 + 1 <= p255))))) : E ((E (X (FALSE)) U E (F ((1 <= p264))))) : E ((E (X (FALSE)) U E (G ((p31 <= p272))))) : A (F (NOT(A (F ((p241 <= p355)))))) : (A (F (((p23 + 1 <= p102) AND (p244 <= 0)))) AND ()) : (((p120 + 1 <= p240) OR ((p213 <= p31) AND E (G (FALSE)))) OR ((p20 + 1 <= p336) OR E (G (((p35 <= p222) OR (p196 <= p243)))))) : (((E (X ((p183 <= p100))) OR A (X ((1 <= p119)))) AND E (X (()))) OR NOT(A (((p341 <= p227) U FALSE)))) : (A (G (((p55 <= p257) OR (p249 + 1 <= p204)))) AND A (G (()))) : E ((((p66 + 1 <= p124) AND (p296 + 1 <= p56)) U E (F ((1 <= p57))))) : E (G ((((p18 <= 0)) AND (p13 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
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:122
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:118
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:133
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:115
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:117
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:117
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:282
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:115
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p103 + 1 <= p62) AND (p69 + 1 <= p222) AND ((p78 + 1 <= p155) OR (p191 <= 0)) AND ((p144 + 1 <= p123) OR (p81 + 1 <= p151)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p103 + 1 <= p62) AND (p69 + 1 <= p222) AND ((p78 + 1 <= p155) OR (p191 <= 0)) AND ((p144 + 1 <= p123) OR (p81 + 1 <= p151)))
lola: processed formula length: 128
lola: 59 rewrites
lola: closed formula file DES-PT-20b-CTLCardinality.task
lola: processed formula with 6 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

FORMULA DES-PT-20b-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 237 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: 59 rewrites
lola: closed formula file DES-PT-20b-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 DES-PT-20b-CTLCardinality-6 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 59 rewrites
lola: closed formula file DES-PT-20b-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 DES-PT-20b-CTLCardinality-12 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: (E (F ((p309 + 1 <= p20))) OR ((p36 + 1 <= p83) OR A (X ((1 <= p141)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p36 + 1 <= p83)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p36 + 1 <= p83)
lola: processed formula length: 16
lola: 59 rewrites
lola: closed formula file DES-PT-20b-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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p309 + 1 <= p20)))
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 ((p309 + 1 <= p20)))
lola: processed formula length: 25
lola: 60 rewrites
lola: closed formula file DES-PT-20b-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: (p309 + 1 <= p20)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-CTLCardinality-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 629842 markings, 1334881 edges, 125968 markings/sec, 0 secs
lola: sara is running 5 secs || 1215315 markings, 2669157 edges, 117095 markings/sec, 5 secs
lola: sara is running 10 secs || 1795332 markings, 3990091 edges, 116003 markings/sec, 10 secs
lola: sara is running 15 secs || 2369769 markings, 5296048 edges, 114887 markings/sec, 15 secs
lola: sara is running 20 secs || 2895839 markings, 6603476 edges, 105214 markings/sec, 20 secs
lola: sara is running 25 secs || 3468658 markings, 7905674 edges, 114564 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3627238 markings, 8300331 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA DES-PT-20b-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p264)))
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 <= p264)))
lola: processed formula length: 19
lola: 60 rewrites
lola: closed formula file DES-PT-20b-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 <= p264)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-CTLCardinality-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA DES-PT-20b-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p57)))
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 <= p57)))
lola: processed formula length: 18
lola: 60 rewrites
lola: closed formula file DES-PT-20b-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 <= p57)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-CTLCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA DES-PT-20b-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p55 <= p257) OR (p249 + 1 <= p204))))
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 (((p55 <= p257) OR (p249 + 1 <= p204))))
lola: processed formula length: 46
lola: 61 rewrites
lola: closed formula file DES-PT-20b-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: ((p257 + 1 <= p55) AND (p204 <= p249))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-CTLCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA DES-PT-20b-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p208))))
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: ((p208 <= 0))
lola: processed formula length: 13
lola: 61 rewrites
lola: closed formula file DES-PT-20b-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: 5869 markings, 6885 edges
lola: ========================================

FORMULA DES-PT-20b-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p31 <= p272)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p31 <= p272)))
lola: processed formula length: 21
lola: 59 rewrites
lola: closed formula file DES-PT-20b-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 is possibly preserved.
lola: 87 markings, 86 edges
lola:
FORMULA DES-PT-20b-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p250 <= p89))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p250 <= p89))))
lola: processed formula length: 23
lola: 59 rewrites
lola: closed formula file DES-PT-20b-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: 1013325 markings, 1198282 edges, 202665 markings/sec, 0 secs
lola: 2042595 markings, 2380192 edges, 205854 markings/sec, 5 secs
lola: 3077260 markings, 3556749 edges, 206933 markings/sec, 10 secs
lola: 4228558 markings, 4832069 edges, 230260 markings/sec, 15 secs
lola: 5275066 markings, 6026246 edges, 209302 markings/sec, 20 secs
lola: 6329203 markings, 7223275 edges, 210827 markings/sec, 25 secs
lola: 7406009 markings, 8437208 edges, 215361 markings/sec, 30 secs
lola: 8517023 markings, 9658151 edges, 222203 markings/sec, 35 secs
lola: 9649254 markings, 10897684 edges, 226446 markings/sec, 40 secs
lola: 10725357 markings, 12138561 edges, 215221 markings/sec, 45 secs
lola: 11686126 markings, 13343657 edges, 192154 markings/sec, 50 secs
lola: 12598332 markings, 14549632 edges, 182441 markings/sec, 55 secs
lola: 13693787 markings, 15774468 edges, 219091 markings/sec, 60 secs
lola: 14703809 markings, 16958194 edges, 202004 markings/sec, 65 secs
lola: 15927530 markings, 18262510 edges, 244744 markings/sec, 70 secs
lola: 17066986 markings, 19523806 edges, 227891 markings/sec, 75 secs
lola: 18349078 markings, 20871623 edges, 256418 markings/sec, 80 secs
lola: 19547638 markings, 22180009 edges, 239712 markings/sec, 85 secs
lola: 20663580 markings, 23447950 edges, 223188 markings/sec, 90 secs
lola: 21816917 markings, 24714877 edges, 230667 markings/sec, 95 secs
lola: 22952209 markings, 25994020 edges, 227058 markings/sec, 100 secs
lola: 24127553 markings, 27305582 edges, 235069 markings/sec, 105 secs
lola: 25178188 markings, 28518994 edges, 210127 markings/sec, 110 secs
lola: 26153803 markings, 29707567 edges, 195123 markings/sec, 115 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 26637203 markings, 30295618 edges
lola: ========================================

FORMULA DES-PT-20b-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p18 <= 0)) AND (p13 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((((p18 <= 0)) AND (p13 <= 0))))
lola: processed formula length: 37
lola: 59 rewrites
lola: closed formula file DES-PT-20b-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 is possibly preserved.
lola: 87 markings, 86 edges
lola: ========================================

FORMULA DES-PT-20b-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p23 + 1 <= p102) AND (p244 <= 0))))
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: ((p102 <= p23) OR (1 <= p244))
lola: processed formula length: 31
lola: 61 rewrites
lola: closed formula file DES-PT-20b-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 87 markings, 86 edges
lola:
FORMULA DES-PT-20b-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 12 will run for 853 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((p355 + 1 <= p241)))))
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:300
lola: processed formula: A(TRUE U NOT(A(TRUE U (p241 <= p355))))
lola: processed formula length: 39
lola: 62 rewrites
lola: closed formula file DES-PT-20b-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: 85 markings, 169 edges
lola: ========================================

FORMULA DES-PT-20b-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1137 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (G ((p120 <= p301))) U ((p284 + 1 <= p27) AND (p205 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(NOT(A(TRUE U (p301 + 1 <= p120))) U ((p284 + 1 <= p27) AND (p205 <= 0)))
lola: processed formula length: 74
lola: 62 rewrites
lola: closed formula file DES-PT-20b-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: 85 markings, 253 edges
lola: ========================================

FORMULA DES-PT-20b-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p162 <= p319)) AND E (G ((p95 <= p303))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p162 <= p319))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p162 <= p319))
lola: processed formula length: 16
lola: 59 rewrites
lola: closed formula file DES-PT-20b-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 15 will run for 3412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p95 <= p303)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p95 <= p303)))
lola: processed formula length: 21
lola: 59 rewrites
lola: closed formula file DES-PT-20b-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: 47 markings, 46 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA DES-PT-20b-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p120 + 1 <= p240) OR ((p20 + 1 <= p336) OR E (G (((p35 <= p222) OR (p196 <= p243))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p20 + 1 <= p336)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p20 + 1 <= p336)
lola: processed formula length: 17
lola: 59 rewrites
lola: closed formula file DES-PT-20b-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: 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 (G (((p35 <= p222) OR (p196 <= p243))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p35 <= p222) OR (p196 <= p243))))
lola: processed formula length: 42
lola: 59 rewrites
lola: closed formula file DES-PT-20b-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 is possibly preserved.
lola: 87 markings, 86 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA DES-PT-20b-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no yes no yes yes yes no no yes yes no yes yes
lola:
preliminary result: yes no no no yes no yes yes yes no no yes yes no yes yes
lola: memory consumption: 27940 KB
lola: time consumption: 158 seconds

BK_STOP 1526609270793

--------------------
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="DES-PT-20b"
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/DES-PT-20b.tgz
mv DES-PT-20b 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 DES-PT-20b, 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 r052-smll-152646380100234"
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 ;