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 236K
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K 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.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 57K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is JoinFreeModules-PT-0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732257600333
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527948617302

info: Time: 3600 - MCC
===========================================================================================
prep: translating JoinFreeModules-PT-0010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating JoinFreeModules-PT-0010 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ JoinFreeModules-PT-0010 @ 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: 132/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1632
lola: finding significant places
lola: 51 places, 81 transitions, 40 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 91 transition conflict sets
lola: TASK
lola: reading formula from JoinFreeModules-PT-0010-LTLCardinality.task
lola: A (F (X (F (X ((2 <= p11)))))) : A (X ((p1 <= p48))) : A ((1 <= p39)) : A (F (X ((p10 <= p37)))) : A (X (F (X ((p34 <= p3))))) : A (X (G (((2 <= p12) U (p21 <= p9))))) : A (F (G (F (X ((2 <= p46)))))) : A (F (X (X (G ((1 <= p35)))))) : A (G ((G ((3 <= p23)) U F ((1 <= p28))))) : A ((X (F ((p3 <= p24))) U (3 <= p24))) : A ((((1 <= p31) U (3 <= p29)) U G (G ((2 <= p41))))) : A (X ((3 <= p47))) : A ((p14 <= p37)) : A ((1 <= p13)) : A ((((p7 <= p16) U (1 <= p46)) U X (X ((p2 <= p41))))) : A ((p3 <= p18))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p39)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p39)
lola: processed formula length: 10
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-0010-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-LTLCardinality-2 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: (p14 <= p37)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p14 <= p37)
lola: processed formula length: 12
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-0010-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-LTLCardinality-12 TRUE 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: (1 <= p13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p13)
lola: processed formula length: 10
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-0010-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p3 <= p18)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p3 <= p18)
lola: processed formula length: 11
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-0010-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-LTLCardinality-15 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 (X (X (F ((p34 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((p34 <= p3)))))
lola: processed formula length: 27
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-0010-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 263 markings, 452 edges
lola: ========================================
FORMULA JoinFreeModules-PT-0010-LTLCardinality-4 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 (X (G ((F ((p21 <= p9)) AND ((2 <= p12) OR (p21 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((p21 <= p9)) AND ((2 <= p12) OR (p21 <= p9))))))
lola: processed formula length: 61
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-0010-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((p3 <= p24))) U (3 <= p24)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((p3 <= p24))) U (3 <= p24)))
lola: processed formula length: 38
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-0010-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola:
FORMULA JoinFreeModules-PT-0010-LTLCardinality-9 FALSE 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 (X ((3 <= p47)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((3 <= p47)))
lola: processed formula length: 18
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-0010-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-LTLCardinality-11 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 (X ((p1 <= p48)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p1 <= p48)))
lola: processed formula length: 19
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-0010-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 22 markings, 21 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((2 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((2 <= p11)))))
lola: processed formula length: 26
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-0010-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 263 markings, 452 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p7 <= p16) U (1 <= p46)) U X (X ((p2 <= p41)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p7 <= p16) U (1 <= p46)) U X (X ((p2 <= p41)))))
lola: processed formula length: 54
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-0010-LTLCardinality.task
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 29 markings, 30 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p10 <= p37))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p10 <= p37))))
lola: processed formula length: 24
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-0010-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 22 markings, 21 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-LTLCardinality-3 TRUE 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: A (G (F ((2 <= p46))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= p46))))
lola: processed formula length: 22
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-0010-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 87672 markings, 142152 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= p35))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= p35))))
lola: processed formula length: 22
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-0010-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 151 markings, 152 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((1 <= p28)) OR (G ((3 <= p23)) AND F ((1 <= p28))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((1 <= p28)) OR (G ((3 <= p23)) AND F ((1 <= p28))))))
lola: processed formula length: 63
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-0010-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1624433 markings, 1945083 edges, 324887 markings/sec, 0 secs
lola: 3167552 markings, 3745931 edges, 308624 markings/sec, 5 secs
lola: 4615828 markings, 5436612 edges, 289655 markings/sec, 10 secs
lola: 6122598 markings, 7196015 edges, 301354 markings/sec, 15 secs
lola: 7529526 markings, 8837651 edges, 281386 markings/sec, 20 secs
lola: 8896535 markings, 10434864 edges, 273402 markings/sec, 25 secs
lola: 10347229 markings, 12130742 edges, 290139 markings/sec, 30 secs
lola: 11740955 markings, 13756945 edges, 278745 markings/sec, 35 secs
lola: 13117267 markings, 15363682 edges, 275262 markings/sec, 40 secs
lola: 14600991 markings, 17098264 edges, 296745 markings/sec, 45 secs
lola: 16006202 markings, 18737891 edges, 281042 markings/sec, 50 secs
lola: 17381002 markings, 20344289 edges, 274960 markings/sec, 55 secs
lola: 18792711 markings, 21992965 edges, 282342 markings/sec, 60 secs
lola: 20167601 markings, 23597541 edges, 274978 markings/sec, 65 secs
lola: 21479318 markings, 25128033 edges, 262343 markings/sec, 70 secs
lola: 22759023 markings, 26622555 edges, 255941 markings/sec, 75 secs
lola: 24033265 markings, 28109298 edges, 254848 markings/sec, 80 secs
lola: 25286494 markings, 29572414 edges, 250646 markings/sec, 85 secs
lola: 26642417 markings, 31155828 edges, 271185 markings/sec, 90 secs
lola: 28031270 markings, 32776690 edges, 277771 markings/sec, 95 secs
lola: 29342583 markings, 34307553 edges, 262263 markings/sec, 100 secs
lola: 30621370 markings, 35800909 edges, 255757 markings/sec, 105 secs
lola: 31907667 markings, 37303374 edges, 257259 markings/sec, 110 secs
lola: 33137060 markings, 38738757 edges, 245879 markings/sec, 115 secs
lola: 34339297 markings, 40142124 edges, 240447 markings/sec, 120 secs
lola: 35597434 markings, 41613952 edges, 251627 markings/sec, 125 secs
lola: 36887901 markings, 43120674 edges, 258093 markings/sec, 130 secs
lola: 38112375 markings, 44550746 edges, 244895 markings/sec, 135 secs
lola: 39296911 markings, 45932889 edges, 236907 markings/sec, 140 secs
lola: 40659216 markings, 47523684 edges, 272461 markings/sec, 145 secs
lola: 42026311 markings, 49119962 edges, 273419 markings/sec, 150 secs
lola: 43312718 markings, 50620901 edges, 257281 markings/sec, 155 secs
lola: 44634421 markings, 52163453 edges, 264341 markings/sec, 160 secs
lola: 45943217 markings, 53691441 edges, 261759 markings/sec, 165 secs
lola: 47223539 markings, 55187370 edges, 256064 markings/sec, 170 secs
lola: 48491702 markings, 56667748 edges, 253633 markings/sec, 175 secs
lola: 49838086 markings, 58239844 edges, 269277 markings/sec, 180 secs
lola: 51084825 markings, 59694510 edges, 249348 markings/sec, 185 secs
lola: 52298287 markings, 61110437 edges, 242692 markings/sec, 190 secs
lola: 53710930 markings, 62759392 edges, 282529 markings/sec, 195 secs
lola: 55027045 markings, 64295294 edges, 263223 markings/sec, 200 secs
lola: 56299724 markings, 65781698 edges, 254536 markings/sec, 205 secs
lola: 57559644 markings, 67252479 edges, 251984 markings/sec, 210 secs
lola: 58785842 markings, 68683250 edges, 245240 markings/sec, 215 secs
lola: 60001960 markings, 70103525 edges, 243224 markings/sec, 220 secs
lola: 61217503 markings, 71522701 edges, 243109 markings/sec, 225 secs
lola: 62486132 markings, 73003226 edges, 253726 markings/sec, 230 secs
lola: 63689818 markings, 74407594 edges, 240737 markings/sec, 235 secs
lola: 64875341 markings, 75790961 edges, 237105 markings/sec, 240 secs
lola: 66318403 markings, 77475464 edges, 288612 markings/sec, 245 secs
lola: 67712995 markings, 79104011 edges, 278918 markings/sec, 250 secs
lola: 69048626 markings, 80662757 edges, 267126 markings/sec, 255 secs
lola: 70453302 markings, 82303175 edges, 280935 markings/sec, 260 secs
lola: 71814007 markings, 83891544 edges, 272141 markings/sec, 265 secs
lola: 73139191 markings, 85438085 edges, 265037 markings/sec, 270 secs
lola: 74530895 markings, 87062639 edges, 278341 markings/sec, 275 secs
lola: 75879215 markings, 88637238 edges, 269664 markings/sec, 280 secs
lola: 77170212 markings, 90143545 edges, 258199 markings/sec, 285 secs
lola: 78215143 markings, 91363456 edges, 208986 markings/sec, 290 secs
lola: 78223958 markings, 91373747 edges, 1763 markings/sec, 295 secs
lola: 78237146 markings, 91389158 edges, 2638 markings/sec, 300 secs
lola: 78247017 markings, 91400658 edges, 1974 markings/sec, 305 secs
lola: 78256765 markings, 91412053 edges, 1950 markings/sec, 310 secs
lola: 78262053 markings, 91418223 edges, 1058 markings/sec, 315 secs
lola: 78278648 markings, 91437578 edges, 3319 markings/sec, 320 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p31) U (3 <= p29)) U G ((2 <= p41))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= p31) U (3 <= p29)) U G ((2 <= p41))))
lola: processed formula length: 48
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-0010-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 122827 markings, 144766 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G ((F ((1 <= p28)) OR (G ((3 <= p23)) AND F ((1 <= p28))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((1 <= p28)) OR (G ((3 <= p23)) AND F ((1 <= p28))))))
lola: processed formula length: 63
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-0010-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1645017 markings, 1969099 edges, 329003 markings/sec, 0 secs
lola: 3212150 markings, 3797960 edges, 313427 markings/sec, 5 secs
lola: 4798729 markings, 5650298 edges, 317316 markings/sec, 10 secs
lola: 6330984 markings, 7439168 edges, 306451 markings/sec, 15 secs
lola: 7781565 markings, 9131753 edges, 290116 markings/sec, 20 secs
lola: 9142217 markings, 10724728 edges, 272130 markings/sec, 25 secs
lola: 10510149 markings, 12320836 edges, 273586 markings/sec, 30 secs
lola: 11824578 markings, 13854565 edges, 262886 markings/sec, 35 secs
lola: 13139115 markings, 15389173 edges, 262907 markings/sec, 40 secs
lola: 14507391 markings, 16989062 edges, 273655 markings/sec, 45 secs
lola: 15729464 markings, 18415017 edges, 244415 markings/sec, 50 secs
lola: 16923343 markings, 19809367 edges, 238776 markings/sec, 55 secs
lola: 18106006 markings, 21191014 edges, 236533 markings/sec, 60 secs
lola: 19368053 markings, 22664270 edges, 252409 markings/sec, 65 secs
lola: 20716771 markings, 24238311 edges, 269744 markings/sec, 70 secs
lola: 22141005 markings, 25901491 edges, 284847 markings/sec, 75 secs
lola: 23619605 markings, 27626668 edges, 295720 markings/sec, 80 secs
lola: 25060560 markings, 29308480 edges, 288191 markings/sec, 85 secs
lola: 26292928 markings, 30748077 edges, 246474 markings/sec, 90 secs
lola: 27639126 markings, 32319136 edges, 269240 markings/sec, 95 secs
lola: 28719985 markings, 33580266 edges, 216172 markings/sec, 100 secs
lola: 29789075 markings, 34828620 edges, 213818 markings/sec, 105 secs
lola: 30930110 markings, 36161694 edges, 228207 markings/sec, 110 secs
lola: 32133173 markings, 37567003 edges, 240613 markings/sec, 115 secs
lola: 33360356 markings, 38999286 edges, 245437 markings/sec, 120 secs
lola: 34562461 markings, 40402483 edges, 240421 markings/sec, 125 secs
lola: 35852038 markings, 41911586 edges, 257915 markings/sec, 130 secs
lola: 37126512 markings, 43399369 edges, 254895 markings/sec, 135 secs
lola: 38344508 markings, 44821660 edges, 243599 markings/sec, 140 secs
lola: 39442258 markings, 46102500 edges, 219550 markings/sec, 145 secs
lola: 40871149 markings, 47770974 edges, 285778 markings/sec, 150 secs
lola: 42227509 markings, 49354700 edges, 271272 markings/sec, 155 secs
lola: 43587525 markings, 50941522 edges, 272003 markings/sec, 160 secs
lola: 44860102 markings, 52426750 edges, 254515 markings/sec, 165 secs
lola: 46191902 markings, 53982021 edges, 266360 markings/sec, 170 secs
lola: 47475633 markings, 55481489 edges, 256746 markings/sec, 175 secs
lola: 48745142 markings, 56963433 edges, 253902 markings/sec, 180 secs
lola: 50039541 markings, 58474896 edges, 258880 markings/sec, 185 secs
lola: 51248147 markings, 59885106 edges, 241721 markings/sec, 190 secs
lola: 52436641 markings, 61272573 edges, 237699 markings/sec, 195 secs
lola: 53816131 markings, 62882163 edges, 275898 markings/sec, 200 secs
lola: 55090990 markings, 64369897 edges, 254972 markings/sec, 205 secs
lola: 56316863 markings, 65801692 edges, 245175 markings/sec, 210 secs
lola: 57537001 markings, 67226062 edges, 244028 markings/sec, 215 secs
lola: 58728807 markings, 68616670 edges, 238361 markings/sec, 220 secs
lola: 59908513 markings, 69994336 edges, 235941 markings/sec, 225 secs
lola: 61083727 markings, 71366242 edges, 235043 markings/sec, 230 secs
lola: 62307121 markings, 72793992 edges, 244679 markings/sec, 235 secs
lola: 63475919 markings, 74158029 edges, 233760 markings/sec, 240 secs
lola: 64629328 markings, 75503943 edges, 230682 markings/sec, 245 secs
lola: 65970094 markings, 77069043 edges, 268153 markings/sec, 250 secs
lola: 67354379 markings, 78685617 edges, 276857 markings/sec, 255 secs
lola: 68680393 markings, 80233098 edges, 265203 markings/sec, 260 secs
lola: 70036534 markings, 81816898 edges, 271228 markings/sec, 265 secs
lola: 71394857 markings, 83402484 edges, 271665 markings/sec, 270 secs
lola: 72703169 markings, 84929320 edges, 261662 markings/sec, 275 secs
lola: 74045994 markings, 86496851 edges, 268565 markings/sec, 280 secs
lola: 75400283 markings, 88078457 edges, 270858 markings/sec, 285 secs
lola: 76680598 markings, 89572263 edges, 256063 markings/sec, 290 secs
lola: 78112476 markings, 91243676 edges, 286376 markings/sec, 295 secs
lola: 78231305 markings, 91382324 edges, 23766 markings/sec, 300 secs
lola: 78247038 markings, 91400711 edges, 3147 markings/sec, 305 secs
lola: 78264130 markings, 91420656 edges, 3418 markings/sec, 310 secs
lola: 78277816 markings, 91436623 edges, 2737 markings/sec, 315 secs
lola: 78298919 markings, 91461246 edges, 4221 markings/sec, 320 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA JoinFreeModules-PT-0010-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no yes yes no no no unknown no no no yes yes no yes
lola:
preliminary result: yes yes no yes yes no no no unknown no no no yes yes no yes
lola: memory consumption: 16584 KB
lola: time consumption: 660 seconds

BK_STOP 1527949277513

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