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 1.7M
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 1.5M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is FlexibleBarrier-PT-20b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998200222
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526696665738

info: Time: 3600 - MCC
===========================================================================================
prep: translating FlexibleBarrier-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 FlexibleBarrier-PT-20b formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ FlexibleBarrier-PT-20b @ 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: 11565/65536 symbol table entries, 3169 collisions
lola: preprocessing...
lola: Size of bit vector: 5372
lola: finding significant places
lola: 5372 places, 6193 transitions, 5350 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 6235 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-20b-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p393)
lola: LP says that atomic proposition is always false: (3 <= p5356)
lola: LP says that atomic proposition is always false: (2 <= p5002)
lola: LP says that atomic proposition is always false: (2 <= p5191)
lola: LP says that atomic proposition is always false: (2 <= p2608)
lola: LP says that atomic proposition is always false: (2 <= p3905)
lola: LP says that atomic proposition is always false: (2 <= p3402)
lola: LP says that atomic proposition is always false: (2 <= p1440)
lola: LP says that atomic proposition is always false: (2 <= p146)
lola: LP says that atomic proposition is always false: (2 <= p4866)
lola: LP says that atomic proposition is always false: (2 <= p1976)
lola: LP says that atomic proposition is always false: (3 <= p598)
lola: LP says that atomic proposition is always false: (3 <= p4789)
lola: LP says that atomic proposition is always false: (2 <= p5311)
lola: LP says that atomic proposition is always false: (2 <= p4500)
lola: LP says that atomic proposition is always false: (3 <= p3950)
lola: LP says that atomic proposition is always false: (3 <= p2654)
lola: E (F ((((p3584 + 1 <= p1282))))) : E (F (((p187 <= 0) AND (p5211 + 1 <= p4632)))) : A (G ((p2026 <= p745))) : E (F (((p3764 <= 0) AND (p3035 + 1 <= p765) AND (p723 + 1 <= p1410)))) : E (F (())) : E (F (FALSE)) : A (G (((((p576 <= p2481) AND (1 <= p753)) OR (p1103 <= p4714)) AND (p1364 <= p4145)))) : A (G (())) : A (G ((((p1282 <= p1582) AND (p2942 <= p742)) OR (p2911 <= p3106) OR ((p3078 + 1 <= p61))))) : E (F (((p3651 + 1 <= p3030)))) : A (G (((p1442 <= p2554) OR (1 <= p4214)))) : E (F (((p20 + 1 <= p165) AND (p3869 + 1 <= p883) AND (1 <= p552)))) : E (F (FALSE)) : A (G ((p1325 <= p3098))) : E (F (FALSE)) : A (G (()))
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:98
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:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 216 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: 18 rewrites
lola: closed formula file FlexibleBarrier-PT-20b-ReachabilityCardinality.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

FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 230 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: 18 rewrites
lola: closed formula file FlexibleBarrier-PT-20b-ReachabilityCardinality.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 FlexibleBarrier-PT-20b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 247 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: 18 rewrites
lola: closed formula file FlexibleBarrier-PT-20b-ReachabilityCardinality.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

FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 266 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: 18 rewrites
lola: closed formula file FlexibleBarrier-PT-20b-ReachabilityCardinality.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 FlexibleBarrier-PT-20b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 288 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: 18 rewrites
lola: closed formula file FlexibleBarrier-PT-20b-ReachabilityCardinality.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 FlexibleBarrier-PT-20b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 314 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: 18 rewrites
lola: closed formula file FlexibleBarrier-PT-20b-ReachabilityCardinality.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 FlexibleBarrier-PT-20b-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p2026 <= p745)))
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 ((p2026 <= p745)))
lola: processed formula length: 23
lola: 20 rewrites
lola: closed formula file FlexibleBarrier-PT-20b-ReachabilityCardinality.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: (p745 + 1 <= p2026)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20b-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 55 markings, 54 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p1325 <= p3098)))
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 ((p1325 <= p3098)))
lola: processed formula length: 24
lola: 20 rewrites
lola: closed formula file FlexibleBarrier-PT-20b-ReachabilityCardinality.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: (p3098 + 1 <= p1325)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20b-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-7-0.sara.
lola: sara is running 0 secs || 31423 markings, 62157 edges, 6285 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 63336 markings, 125309 edges, 6383 markings/sec, 5 secs

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

FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p3584 + 1 <= p1282)))))
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 ((((p3584 + 1 <= p1282)))))
lola: processed formula length: 32
lola: 19 rewrites
lola: closed formula file FlexibleBarrier-PT-20b-ReachabilityCardinality.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: (((p3584 + 1 <= p1282)))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20b-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-8-0.sara.
lola: sara is running 0 secs || 30183 markings, 58744 edges, 6037 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 61454 markings, 120680 edges, 6254 markings/sec, 5 secs
lola: sara is running 10 secs || 92725 markings, 182651 edges, 6254 markings/sec, 10 secs

lola: sara is running 15 secs || 123932 markings, 244485 edges, 6241 markings/sec, 15 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p3651 + 1 <= p3030))))
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 (((p3651 + 1 <= p3030))))
lola: processed formula length: 30
lola: 19 rewrites
lola: closed formula file FlexibleBarrier-PT-20b-ReachabilityCardinality.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: ((p3651 + 1 <= p3030))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20b-ReachabilityCardinality-9-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: 28 markings, 27 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 571 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p187 <= 0) AND (p5211 + 1 <= p4632))))
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 (((p187 <= 0) AND (p5211 + 1 <= p4632))))
lola: processed formula length: 46
lola: 19 rewrites
lola: closed formula file FlexibleBarrier-PT-20b-ReachabilityCardinality.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: ((p187 <= 0) AND (p5211 + 1 <= p4632))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20b-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-10-0.sara.
lola: sara is running 0 secs || 30876 markings, 60857 edges, 6175 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 62514 markings, 123588 edges, 6328 markings/sec, 5 secs
lola: sara is running 10 secs || 92536 markings, 182374 edges, 6004 markings/sec, 10 secs
lola: sara is running 15 secs || 123706 markings, 244096 edges, 6234 markings/sec, 15 secs
lola: sara is running 20 secs || 155293 markings, 306704 edges, 6317 markings/sec, 20 secs
lola: sara is running 25 secs || 186878 markings, 369325 edges, 6317 markings/sec, 25 secs
lola: sara is running 30 secs || 218424 markings, 431885 edges, 6309 markings/sec, 30 secs
lola: sara is running 35 secs || 249938 markings, 494333 edges, 6303 markings/sec, 35 secs
lola: sara is running 40 secs || 281435 markings, 556766 edges, 6299 markings/sec, 40 secs
lola: sara is running 45 secs || 313032 markings, 619437 edges, 6319 markings/sec, 45 secs
lola: sara is running 50 secs || 344607 markings, 682021 edges, 6315 markings/sec, 50 secs
lola: sara is running 55 secs || 376207 markings, 744674 edges, 6320 markings/sec, 55 secs

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

FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 673 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p1442 <= p2554) OR (1 <= p4214))))
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 (((p1442 <= p2554) OR (1 <= p4214))))
lola: processed formula length: 43
lola: 20 rewrites
lola: closed formula file FlexibleBarrier-PT-20b-ReachabilityCardinality.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: ((p2554 + 1 <= p1442) AND (p4214 <= 0))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20b-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-11-0.sara.
lola: sara is running 0 secs || 30939 markings, 61001 edges, 6188 markings/sec, 0 secs
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 FlexibleBarrier-PT-20b-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 839 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p3764 <= 0) AND (p3035 + 1 <= p765) AND (p723 + 1 <= p1410))))
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 (((p3764 <= 0) AND (p3035 + 1 <= p765) AND (p723 + 1 <= p1410))))
lola: processed formula length: 70
lola: 19 rewrites
lola: closed formula file FlexibleBarrier-PT-20b-ReachabilityCardinality.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: ((p3764 <= 0) AND (p3035 + 1 <= p765) AND (p723 + 1 <= p1410))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20b-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-12-0.sara.
lola: sara is running 0 secs || 35076 markings, 63248 edges, 7015 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 5 secs || 71572 markings, 129960 edges, 7299 markings/sec, 5 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1116 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p20 + 1 <= p165) AND (p3869 + 1 <= p883) AND (1 <= p552))))
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 (((p20 + 1 <= p165) AND (p3869 + 1 <= p883) AND (1 <= p552))))
lola: processed formula length: 67
lola: 19 rewrites
lola: closed formula file FlexibleBarrier-PT-20b-ReachabilityCardinality.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: ((p20 + 1 <= p165) AND (p3869 + 1 <= p883) AND (1 <= p552))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20b-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 84 markings, 83 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1674 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((p576 <= p2481) AND (1 <= p753)) OR (p1103 <= p4714)) AND (p1364 <= p4145))))
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 (((((p576 <= p2481) AND (1 <= p753)) OR (p1103 <= p4714)) AND (p1364 <= p4145))))
lola: processed formula length: 87
lola: 20 rewrites
lola: closed formula file FlexibleBarrier-PT-20b-ReachabilityCardinality.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: ((((p2481 + 1 <= p576) OR (p753 <= 0)) AND (p4714 + 1 <= p1103)) OR (p4145 + 1 <= p1364))
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20b-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-14-0.sara.
lola: sara is running 0 secs || 30691 markings, 60075 edges, 6138 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 59854 markings, 117283 edges, 5833 markings/sec, 5 secs
lola: sara is running 10 secs || 89735 markings, 176231 edges, 5976 markings/sec, 10 secs
lola: sara is running 15 secs || 121172 markings, 238544 edges, 6287 markings/sec, 15 secs

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

FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p1282 <= p1582) AND (p2942 <= p742)) OR (p2911 <= p3106) OR ((p3078 + 1 <= p61)))))
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 ((((p1282 <= p1582) AND (p2942 <= p742)) OR (p2911 <= p3106) OR ((p3078 + 1 <= p61)))))
lola: processed formula length: 94
lola: 20 rewrites
lola: closed formula file FlexibleBarrier-PT-20b-ReachabilityCardinality.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: (((p1582 + 1 <= p1282) OR (p742 + 1 <= p2942)) AND (p3106 + 1 <= p2911) AND ((p61 <= p3078)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20b-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-15-0.sara.
lola: sara is running 0 secs || 31189 markings, 58304 edges, 6238 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 68697 markings, 125634 edges, 7502 markings/sec, 5 secs
lola: sara is running 10 secs || 107015 markings, 193864 edges, 7664 markings/sec, 10 secs
lola: sara is running 15 secs || 144048 markings, 262064 edges, 7407 markings/sec, 15 secs
lola: sara is running 20 secs || 181274 markings, 330382 edges, 7445 markings/sec, 20 secs

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

FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no yes no no no yes no yes no yes no no no yes
lola:
preliminary result: yes yes no yes no no no yes no yes no yes no no no yes
lola: memory consumption: 32296 KB
lola: time consumption: 271 seconds

BK_STOP 1526696937957

--------------------
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="FlexibleBarrier-PT-20b"
export BK_EXAMINATION="ReachabilityCardinality"
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/FlexibleBarrier-PT-20b.tgz
mv FlexibleBarrier-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 FlexibleBarrier-PT-20b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r088-blw7-152649998200222"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;