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 196K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 5.7K 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 12K 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 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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.7K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 23K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is JoinFreeModules-PT-0004, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630900234
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526807222442

info: Time: 3600 - MCC
===========================================================================================
prep: translating JoinFreeModules-PT-0004 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating JoinFreeModules-PT-0004 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ JoinFreeModules-PT-0004 @ 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: 54/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 672
lola: finding significant places
lola: 21 places, 33 transitions, 16 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 37 transition conflict sets
lola: TASK
lola: reading formula from JoinFreeModules-PT-0004-CTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p)
lola: after: (1 <= 0)
lola: always false
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p <= p20)
lola: after: (1 <= p20)
lola: place invariant simplifies atomic proposition
lola: before: (p7 <= p)
lola: after: (p7 <= 1)
lola: always true
lola: NOT(E (F (((3 <= p5) AND (2 <= p2) AND ((p13 <= p20) OR (p5 <= p7)))))) : A (G (E (F ((p18 <= 2))))) : A (G (E ((TRUE U (p2 <= p16))))) : E (F (E (X (())))) : (A (G (((1 <= p4) OR (2 <= p5) OR (3 <= p20)))) OR NOT(A (G (())))) : (A (G (E (F ((1 <= p20))))) AND E (F ((2 <= p7)))) : A (G (((1 <= p1) OR E (X ((p7 <= 1)))))) : E (G ((2 <= p13))) : E (G (((p3 <= 1) AND (p4 <= 1) AND (p13 + 1 <= p12) AND (p6 <= 2)))) : ((p17 <= 0) OR ((((p9 + 1 <= p4) AND (p11 <= 2)) OR ((p11 <= 0) AND (p16 <= 0))) AND (1 <= p18))) : (NOT(A (G (((1 <= p7))))) OR A (X (E (X ((2 <= p12)))))) : A (F (A (F ((p8 <= p19))))) : (2 <= p16) : A (((2 <= p4) U E (G ((2 <= p15))))) : A ((((p14 <= p9) AND (1 <= p6)) U ((p13 <= p15) OR (p10 <= p9) OR (p8 <= p11) OR (3 <= p15)))) : E (F (((p4 <= 0) AND (p3 <= 0) AND (1 <= p18))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
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:279
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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:392
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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 JoinFreeModules-PT-0004-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p17 <= 0) OR ((((p9 + 1 <= p4) AND (p11 <= 2)) OR ((p11 <= 0) AND (p16 <= 0))) AND (1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p17 <= 0) OR ((((p9 + 1 <= p4) AND (p11 <= 2)) OR ((p11 <= 0) AND (p16 <= 0))) AND (1 <= p18)))
lola: processed formula length: 99
lola: 18 rewrites
lola: closed formula file JoinFreeModules-PT-0004-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
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p16)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p16)
lola: processed formula length: 10
lola: 18 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges

FORMULA JoinFreeModules-PT-0004-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p7 <= 0)))) OR A (X (E (X ((2 <= p12))))))
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: E (F (((p7 <= 0))))
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 (((p7 <= 0))))
lola: processed formula length: 19
lola: 19 rewrites
lola: closed formula file JoinFreeModules-PT-0004-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: ((p7 <= 0))
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: 3 markings, 2 edges
lola: state equation: write sara problem file to JoinFreeModules-PT-0004-CTLCardinality-3-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.

lola: ========================================
FORMULA JoinFreeModules-PT-0004-CTLCardinality-10 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: A (G (((1 <= p1) OR E (X ((p7 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
sara: try reading problem file JoinFreeModules-PT-0004-CTLCardinality-3-0.sara.
lola: processed formula: NOT(E(TRUE U ((p1 <= 0) AND NOT(EX((p7 <= 1))))))
lola: processed formula length: 49
lola: 22 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 238457 markings, 1672330 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLCardinality-6 FALSE 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 (((1 <= p4) OR (2 <= p5) OR (3 <= p20))))
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 <= p4) OR (2 <= p5) OR (3 <= p20))))
lola: processed formula length: 48
lola: 20 rewrites
lola: closed formula file JoinFreeModules-PT-0004-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: ((p4 <= 0) AND (p5 <= 1) AND (p20 <= 2))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0004-CTLCardinality-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges

FORMULA JoinFreeModules-PT-0004-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p4 <= 0) AND (p3 <= 0) AND (1 <= p18))))
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 (((p4 <= 0) AND (p3 <= 0) AND (1 <= p18))))
lola: processed formula length: 48
lola: 19 rewrites
lola: closed formula file JoinFreeModules-PT-0004-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: ((p4 <= 0) AND (p3 <= 0) AND (1 <= p18))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: state equation: write sara problem file to JoinFreeModules-PT-0004-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLCardinality-15 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 (((p5 <= 2) OR (p2 <= 1) OR ((p20 + 1 <= p13) AND (p7 + 1 <= p5)))))
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:695
lola: processed formula: A (G (((p5 <= 2) OR (p2 <= 1) OR ((p20 + 1 <= p13) AND (p7 + 1 <= p5)))))
lola: processed formula length: 75
lola: 20 rewrites
lola: closed formula file JoinFreeModules-PT-0004-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 31 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLCardinality-0 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 (E (F ((p18 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (p18 <= 2)
lola: processed formula length: 10
lola: 19 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
sara: try reading problem file JoinFreeModules-PT-0004-CTLCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic

lola: 1207907 markings, 7229908 edges, 241581 markings/sec, 0 secs
lola: 2732246 markings, 13998824 edges, 304868 markings/sec, 5 secs
lola: 4109363 markings, 20724060 edges, 275423 markings/sec, 10 secs
lola: 6746595 markings, 25812141 edges, 527446 markings/sec, 15 secs
lola: 8802524 markings, 30842061 edges, 411186 markings/sec, 20 secs
lola: 10385080 markings, 35745751 edges, 316511 markings/sec, 25 secs
lola: 11762149 markings, 40996207 edges, 275414 markings/sec, 30 secs
lola: 12856718 markings, 46517098 edges, 218914 markings/sec, 35 secs
lola: 13373825 markings, 52708093 edges, 103421 markings/sec, 40 secs
lola: 13590973 markings, 58683542 edges, 43430 markings/sec, 45 secs
lola: 13643374 markings, 63884502 edges, 10480 markings/sec, 50 secs
lola: 13690047 markings, 68745607 edges, 9335 markings/sec, 55 secs
lola: 13725913 markings, 73858222 edges, 7173 markings/sec, 60 secs
lola: 13758829 markings, 79156006 edges, 6583 markings/sec, 65 secs
lola: 13788428 markings, 83903138 edges, 5920 markings/sec, 70 secs
lola: 13837521 markings, 88967709 edges, 9819 markings/sec, 75 secs
lola: 13865171 markings, 93996373 edges, 5530 markings/sec, 80 secs
lola: 13886650 markings, 99116413 edges, 4296 markings/sec, 85 secs
lola: 13913775 markings, 104528128 edges, 5425 markings/sec, 90 secs
lola: 13950769 markings, 110092332 edges, 7399 markings/sec, 95 secs
lola: 14049736 markings, 115761580 edges, 19793 markings/sec, 100 secs
lola: 14063191 markings, 122063176 edges, 2691 markings/sec, 105 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 14063494 markings, 124406602 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 493 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((2 <= p13)))
lola: processed formula length: 18
lola: 18 rewrites
lola: closed formula file JoinFreeModules-PT-0004-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: 30 markings, 30 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p2 <= p16)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (p2 <= p16)
lola: processed formula length: 11
lola: 19 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 3984 markings, 18185 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p8 <= p19)))
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: (p19 + 1 <= p8)
lola: processed formula length: 15
lola: 20 rewrites
lola: closed formula file JoinFreeModules-PT-0004-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: 10 markings, 10 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 864 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p3 <= 1) AND (p4 <= 1) AND (p13 + 1 <= p12) AND (p6 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p3 <= 1) AND (p4 <= 1) AND (p13 + 1 <= p12) AND (p6 <= 2))))
lola: processed formula length: 68
lola: 18 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1152 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p4) U E (G ((2 <= p15)))))
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((2 <= p4) U NOT(A(TRUE U (p15 <= 1))))
lola: processed formula length: 40
lola: 21 rewrites
lola: closed formula file JoinFreeModules-PT-0004-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: 1 markings, 1 edges
lola:
FORMULA JoinFreeModules-PT-0004-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 14 will run for 1728 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((1 <= p20))))) AND E (F ((2 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1728 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p7)))
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 <= p7)))
lola: processed formula length: 17
lola: 19 rewrites
lola: closed formula file JoinFreeModules-PT-0004-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: formula 0: (2 <= p7)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 15 will run for 3456 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= p20)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (1 <= p20)
lola: processed formula length: 10
lola: 19 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 1550854 markings, 6902037 edges, 310171 markings/sec, 0 secs
lola: 3264922 markings, 13811433 edges, 342814 markings/sec, 5 secs
lola: 5345248 markings, 19739398 edges, 416065 markings/sec, 10 secs
lola: 7580688 markings, 25127074 edges, 447088 markings/sec, 15 secs
lola: 9362601 markings, 30651827 edges, 356383 markings/sec, 20 secs
lola: 10991546 markings, 36448018 edges, 325789 markings/sec, 25 secs
lola: 11904662 markings, 42864310 edges, 182623 markings/sec, 30 secs
lola: 12325866 markings, 48830370 edges, 84241 markings/sec, 35 secs
lola: 12693005 markings, 54511944 edges, 73428 markings/sec, 40 secs
lola: 12946837 markings, 60279825 edges, 50766 markings/sec, 45 secs
lola: 13415274 markings, 66268358 edges, 93687 markings/sec, 50 secs
lola: 13958136 markings, 72237018 edges, 108572 markings/sec, 55 secs
lola: 14212905 markings, 78251713 edges, 50954 markings/sec, 60 secs
lola: 14299346 markings, 84840821 edges, 17288 markings/sec, 65 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 14299680 markings, 85483442 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p14 <= p9) AND (1 <= p6)) U ((p13 <= p15) OR (p10 <= p9) OR (p8 <= p11) OR (3 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((((p14 <= p9) AND (1 <= p6)) U ((p13 <= p15) OR (p10 <= p9) OR (p8 <= p11) OR (3 <= p15))))
lola: processed formula length: 97
lola: 22 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLCardinality-14 TRUE 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 yes no no yes no yes no yes yes
lola:
preliminary result: no yes no no no yes no yes no no yes no yes no yes yes
lola: memory consumption: 22276 KB
lola: time consumption: 185 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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="JoinFreeModules-PT-0004"
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/JoinFreeModules-PT-0004.tgz
mv JoinFreeModules-PT-0004 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 JoinFreeModules-PT-0004, 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 r100-smll-152658630900234"
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 ;