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 384K
-rw-r--r-- 1 mcc users 3.3K May 30 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 30 22:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.2K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 28 11:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 11:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 28 09:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 6.8K May 28 09:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.6K May 28 07:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 28 07:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 26 06:33 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 26 06:33 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 27 05:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 27 05:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 7 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 217K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RefineWMG-PT-100100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170400754
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527826843201

info: Time: 3600 - MCC
===========================================================================================
prep: translating RefineWMG-PT-100100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RefineWMG-PT-100100 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ RefineWMG-PT-100100 @ 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: 907/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16128
lola: finding significant places
lola: 504 places, 403 transitions, 302 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 504 transition conflict sets
lola: TASK
lola: reading formula from RefineWMG-PT-100-100-ReachabilityCardinality.task
lola: A (G ((p30 <= p474))) : E (F (((3 <= p490) AND ((3 <= p34) OR ((2 <= p294) AND (p142 <= p493)))))) : A (G ((p426 <= p361))) : A (G ((((1 <= p402) AND (3 <= p53) AND (p115 <= 0)) OR (2 <= p48)))) : A (G (((p268 <= p303) AND (p486 <= 1)))) : E (F ((2 <= p27))) : A (G (((p241 <= p226) OR (p105 <= p350) OR ((3 <= p268) AND (1 <= p330) AND ((3 <= p301) OR (1 <= p185)))))) : A (G (((p369 + 1 <= p3) OR (p321 + 1 <= p143) OR ((p314 + 1 <= p115) AND (p429 + 1 <= p185))))) : E (F (((p71 + 1 <= p152) AND (p429 + 1 <= p233) AND (3 <= p484)))) : E (F (((p104 <= p11) AND ((2 <= pterce) OR (p223 <= p56) OR ((p165 <= p88) AND (2 <= p354)))))) : A (G (((p121 + 1 <= p141) OR (p375 <= 2) OR (3 <= p7)))) : A (G (((p333 <= p8) OR (1 <= p113) OR (p110 <= p470)))) : A (G (((((p110 <= p283) AND (p294 <= p10)) OR (p236 <= 0)) AND (((2 <= p444) AND (1 <= p344)) OR ((p267 <= p324) AND (2 <= p496)))))) : E (F ((((2 <= p84) OR (2 <= p94)) AND (p43 <= 0) AND (3 <= p76)))) : E (F (((3 <= p475) AND (3 <= p40)))) : E (F ((p399 + 1 <= p5)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p27)))
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 ((2 <= p27)))
lola: processed formula length: 18
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: (2 <= p27)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 192 markings, 191 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p426 <= p361)))
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 ((p426 <= p361)))
lola: processed formula length: 22
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: (p361 + 1 <= p426)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-100-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-ReachabilityCardinality-2 FALSE 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: A (G ((p30 <= p474)))
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 ((p30 <= p474)))
lola: processed formula length: 21
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: (p474 + 1 <= p30)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-100-ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 102 markings, 101 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-ReachabilityCardinality-0 FALSE 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 (((3 <= p475) AND (3 <= p40))))
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 (((3 <= p475) AND (3 <= p40))))
lola: processed formula length: 36
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: ((3 <= p475) AND (3 <= p40))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-100-ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-100-ReachabilityCardinality-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p399 + 1 <= p5)))
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 ((p399 + 1 <= p5)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: (p399 + 1 <= p5)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-100-ReachabilityCardinality-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: 102 markings, 101 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p268 <= p303) AND (p486 <= 1))))
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 (((p268 <= p303) AND (p486 <= 1))))
lola: processed formula length: 40
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file RefineWMG-PT-100-100-ReachabilityCardinality-4-0.sara.
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p84) OR (2 <= p94)) AND (p43 <= 0) AND (3 <= p76))))
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 ((((2 <= p84) OR (2 <= p94)) AND (p43 <= 0) AND (3 <= p76))))
lola: processed formula length: 67
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: (((2 <= p84) OR (2 <= p94)) AND (p43 <= 0) AND (3 <= p76))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-100-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-100-ReachabilityCardinality-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10873 markings, 10872 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p402) AND (3 <= p53) AND (p115 <= 0)) OR (2 <= p48))))
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 <= p402) AND (3 <= p53) AND (p115 <= 0)) OR (2 <= p48))))
lola: processed formula length: 69
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: (((p402 <= 0) OR (p53 <= 2) OR (1 <= p115)) AND (p48 <= 1))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-100-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-100-ReachabilityCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9967 markings, 9966 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p121 + 1 <= p141) OR (p375 <= 2) OR (3 <= p7))))
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 (((p121 + 1 <= p141) OR (p375 <= 2) OR (3 <= p7))))
lola: processed formula length: 58
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: formula 0: ((p141 <= p121) AND (3 <= p375) AND (p7 <= 2))
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: 4 markings, 3 edges
lola: state equation: write sara problem file to RefineWMG-PT-100-100-ReachabilityCardinality-8-0.sara
lola: ========================================

FORMULA RefineWMG-PT-100-100-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p71 + 1 <= p152) AND (p429 + 1 <= p233) AND (3 <= p484))))
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 (((p71 + 1 <= p152) AND (p429 + 1 <= p233) AND (3 <= p484))))
lola: processed formula length: 66
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: ((p71 + 1 <= p152) AND (p429 + 1 <= p233) AND (3 <= p484))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-100-ReachabilityCardinality-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 73 markings, 72 edges
lola: ========================================
lola: state equation: calling and running sara

FORMULA RefineWMG-PT-100-100-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file RefineWMG-PT-100-100-ReachabilityCardinality-9-0.sara.
lola: ...considering subproblem: E (F (((3 <= p490) AND ((3 <= p34) OR ((2 <= p294) AND (p142 <= p493))))))
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 (((3 <= p490) AND ((3 <= p34) OR ((2 <= p294) AND (p142 <= p493))))))
lola: processed formula length: 75
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: ((3 <= p490) AND ((3 <= p34) OR ((2 <= p294) AND (p142 <= p493))))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: state equation: write sara problem file to RefineWMG-PT-100-100-ReachabilityCardinality-10-0.sara
lola: ========================================

FORMULA RefineWMG-PT-100-100-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p333 <= p8) OR (1 <= p113) OR (p110 <= p470))))
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 (((p333 <= p8) OR (1 <= p113) OR (p110 <= p470))))
lola: processed formula length: 57
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: ((p8 + 1 <= p333) AND (p113 <= 0) AND (p470 + 1 <= p110))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-100-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-100-ReachabilityCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10006 markings, 10005 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p104 <= p11) AND ((2 <= pterce) OR (p223 <= p56) OR ((p165 <= p88) AND (2 <= p354))))))
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 (((p104 <= p11) AND ((2 <= pterce) OR (p223 <= p56) OR ((p165 <= p88) AND (2 <= p354))))))
lola: processed formula length: 97
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: ((p104 <= p11) AND ((2 <= pterce) OR (p223 <= p56) OR ((p165 <= p88) AND (2 <= p354))))
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-100-ReachabilityCardinality-12-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 101 markings, 100 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p369 + 1 <= p3) OR (p321 + 1 <= p143) OR ((p314 + 1 <= p115) AND (p429 + 1 <= p185)))))
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 (((p369 + 1 <= p3) OR (p321 + 1 <= p143) OR ((p314 + 1 <= p115) AND (p429 + 1 <= p185)))))
lola: processed formula length: 97
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: ((p3 <= p369) AND (p143 <= p321) AND ((p115 <= p314) OR (p185 <= p429)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-100-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-100-ReachabilityCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10027 markings, 10026 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p241 <= p226) OR (p105 <= p350) OR ((3 <= p268) AND (1 <= p330) AND ((3 <= p301) OR (1 <= p185))))))
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 (((p241 <= p226) OR (p105 <= p350) OR ((3 <= p268) AND (1 <= p330) AND ((3 <= p301) OR (1 <= p185))))))
lola: processed formula length: 111
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: ((p226 + 1 <= p241) AND (p350 + 1 <= p105) AND ((p268 <= 2) OR (p330 <= 0) OR ((p301 <= 2) AND (p185 <= 0))))
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-100-ReachabilityCardinality-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 56 markings, 55 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((p110 <= p283) AND (p294 <= p10)) OR (p236 <= 0)) AND (((2 <= p444) AND (1 <= p344)) OR ((p267 <= p324) AND (2 <= p496))))))
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 (((((p110 <= p283) AND (p294 <= p10)) OR (p236 <= 0)) AND (((2 <= p444) AND (1 <= p344)) OR ((p267 <= p324) AND (2 <= p496))))))
lola: processed formula length: 135
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: ((((p283 + 1 <= p110) OR (p10 + 1 <= p294)) AND (1 <= p236)) OR (((p444 <= 1) OR (p344 <= 0)) AND ((p324 + 1 <= p267) OR (p496 <= 1))))
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-100-ReachabilityCardinality-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 100 markings, 99 edges

FORMULA RefineWMG-PT-100-100-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no no yes no no yes yes no no no yes yes yes
lola:
preliminary result: no yes no no no yes no no yes yes no no no yes yes yes
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-100-ReachabilityCardinality-15-0.sara.lola: memory consumption: 25428 KB
lola: time consumption: 2 seconds

sara: place or transition ordering is non-deterministic


BK_STOP 1527826845619

--------------------
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="RefineWMG-PT-100100"
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/RefineWMG-PT-100100.tgz
mv RefineWMG-PT-100100 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 RefineWMG-PT-100100, 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 r280-csrt-152749170400754"
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 ;