Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r033-smll-155225133800131.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
Input is ClientsAndServers-PT-N2000P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r033-smll-155225133800131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.0K Feb 9 08:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 9 08:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 07:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 5 07:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 115 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 353 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 23:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K Feb 4 22:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 2 01:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 2 01:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Jan 29 15:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Jan 29 15:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 8 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552331817719

info: Time: 3600 - MCC
===========================================================================================
prep: translating ClientsAndServers-PT-N2000P0 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating ClientsAndServers-PT-N2000P0 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ ClientsAndServers-PT-N2000P0 @ 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: 43/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: A (F (X (F ((2 <= MwU))))) : A (F (X (G (F ((CF <= CwG)))))) : A ((((1 <= CA) U (1 <= Si)) U X ((2 <= MwU)))) : A ((CwG <= CF)) : A (X (X (((2 <= StF) U (3 <= CwA))))) : A (X ((G ((2 <= MpG)) U X ((3 <= SpG))))) : A (G (X (G (X ((1 <= StF)))))) : A (F (X (G (X ((CR <= Cb)))))) : A ((2 <= Ci)) : A ((X ((2 <= SA)) U ((2 <= SF) U (CR <= StR)))) : A ((2 <= MtF)) : A ((F ((SR <= StF)) U ((1 <= SwA) U (SG <= CA)))) : A ((MpG <= StF)) : A (G (G (X ((3 <= SA))))) : A ((MpA <= CG)) : A (((3 <= MtF) U F (F ((3 <= CwG)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (CwG <= CF)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (CwG <= CF)
lola: processed formula length: 11
lola: 25 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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 ClientsAndServers-PT-N2000P0-LTLCardinality-3 TRUE 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: (2 <= Ci)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Ci)
lola: processed formula length: 9
lola: 25 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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 ClientsAndServers-PT-N2000P0-LTLCardinality-8 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: (2 <= MtF)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= MtF)
lola: processed formula length: 10
lola: 25 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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 ClientsAndServers-PT-N2000P0-LTLCardinality-10 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: (MpG <= StF)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (MpG <= StF)
lola: processed formula length: 12
lola: 25 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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 ClientsAndServers-PT-N2000P0-LTLCardinality-12 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: (MpA <= CG)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (MpA <= CG)
lola: processed formula length: 11
lola: 25 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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 ClientsAndServers-PT-N2000P0-LTLCardinality-14 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 (X (G ((1 <= StF)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((1 <= StF)))))
lola: processed formula length: 26
lola: 25 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 100001 markings, 100001 edges

FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-6 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: A ((((1 <= CA) U (1 <= Si)) U X ((2 <= MwU))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= CA) U (1 <= Si)) U X ((2 <= MwU))))
lola: processed formula length: 46
lola: 25 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 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: 100001 markings, 100001 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-2 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 ((2 <= SA)) U ((2 <= SF) U (CR <= StR))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((2 <= SA)) U ((2 <= SF) U (CR <= StR))))
lola: processed formula length: 47
lola: 25 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: the resulting Büchi automaton has 5 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: 1 markings, 0 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-9 TRUE 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 (F ((2 <= MwU))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= MwU))))
lola: processed formula length: 22
lola: 25 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 120022 markings, 120022 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-0 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: A (X (X (((2 <= StF) U (3 <= CwA)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((2 <= StF) U (3 <= CwA)))))
lola: processed formula length: 37
lola: 25 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 100001 markings, 100001 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-4 FALSE 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: ========================================
lola: ...considering subproblem: A (X (G ((3 <= SA))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((3 <= SA))))
lola: processed formula length: 21
lola: 25 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 100001 markings, 100001 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-13 FALSE 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 (X ((X ((3 <= SpG)) OR (G ((2 <= MpG)) AND X (F ((3 <= SpG)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((3 <= SpG)) OR (G ((2 <= MpG)) AND X (F ((3 <= SpG)))))))
lola: processed formula length: 67
lola: 25 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: the resulting Büchi automaton has 9 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: 100001 markings, 100001 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-5 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: A (F ((3 <= CwG)))
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: (CwG <= 2)
lola: processed formula length: 10
lola: 27 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.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: 21 markings, 21 edges

FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((CR <= Cb))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((CR <= Cb))))
lola: processed formula length: 22
lola: 25 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 100002 markings, 100003 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-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 (F ((CF <= CwG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((CF <= CwG))))
lola: processed formula length: 23
lola: 25 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 3045065 markings, 4089331 edges, 609013 markings/sec, 0 secs
lola: 6436659 markings, 8712354 edges, 678319 markings/sec, 5 secs
lola: 9616219 markings, 13048882 edges, 635912 markings/sec, 10 secs
lola: 12777802 markings, 17360841 edges, 632317 markings/sec, 15 secs
lola: 15771299 markings, 21440922 edges, 598699 markings/sec, 20 secs
lola: 18810747 markings, 25587674 edges, 607890 markings/sec, 25 secs
lola: 21760552 markings, 29607903 edges, 589961 markings/sec, 30 secs
lola: 24752675 markings, 33689754 edges, 598425 markings/sec, 35 secs
lola: 27514628 markings, 37456907 edges, 552391 markings/sec, 40 secs
lola: 30534530 markings, 41574633 edges, 603980 markings/sec, 45 secs
lola: 33431926 markings, 45523429 edges, 579479 markings/sec, 50 secs
lola: 36195514 markings, 49293469 edges, 552718 markings/sec, 55 secs
lola: 38894324 markings, 52974251 edges, 539762 markings/sec, 60 secs
lola: 41633769 markings, 56708477 edges, 547889 markings/sec, 65 secs
lola: 44432932 markings, 60525388 edges, 559833 markings/sec, 70 secs
lola: 47192968 markings, 64288492 edges, 552007 markings/sec, 75 secs
lola: 50060992 markings, 68200938 edges, 573605 markings/sec, 80 secs
lola: 52740982 markings, 71853941 edges, 535998 markings/sec, 85 secs
lola: 55603551 markings, 75759294 edges, 572514 markings/sec, 90 secs
lola: 58092609 markings, 79151856 edges, 497812 markings/sec, 95 secs
lola: 60387202 markings, 82281622 edges, 458919 markings/sec, 100 secs
lola: 63150518 markings, 86050520 edges, 552663 markings/sec, 105 secs
lola: 65977370 markings, 89904631 edges, 565370 markings/sec, 110 secs
lola: 68750988 markings, 93685474 edges, 554724 markings/sec, 115 secs
lola: 71516499 markings, 97458090 edges, 553102 markings/sec, 120 secs
lola: 74228244 markings, 101156046 edges, 542349 markings/sec, 125 secs
lola: 76866487 markings, 104753987 edges, 527649 markings/sec, 130 secs
lola: 79610824 markings, 108495340 edges, 548867 markings/sec, 135 secs
lola: 82335454 markings, 112209725 edges, 544926 markings/sec, 140 secs
lola: 84947487 markings, 115771525 edges, 522407 markings/sec, 145 secs
lola: 87758997 markings, 119606364 edges, 562302 markings/sec, 150 secs
lola: 90495325 markings, 123337633 edges, 547266 markings/sec, 155 secs
lola: 93030581 markings, 126794092 edges, 507051 markings/sec, 160 secs
lola: 94862452 markings, 129292465 edges, 366374 markings/sec, 165 secs
lola: 94901851 markings, 129346873 edges, 7880 markings/sec, 170 secs
lola: 94909165 markings, 129356972 edges, 1463 markings/sec, 175 secs
lola: 94939030 markings, 129398212 edges, 5973 markings/sec, 180 secs
lola: 94950830 markings, 129411900 edges, 2360 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((SR <= StF)) U ((1 <= SwA) U (SG <= CA))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((SR <= StF)) U ((1 <= SwA) U (SG <= CA))))
lola: processed formula length: 49
lola: 25 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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: using ltl preserving stubborn set method (--stubborn)
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: 1 markings, 0 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G (F ((CF <= CwG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((CF <= CwG))))
lola: processed formula length: 23
lola: 25 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 3536137 markings, 4758368 edges, 707227 markings/sec, 0 secs
lola: 6835579 markings, 9257197 edges, 659888 markings/sec, 5 secs
lola: 9978856 markings, 13543652 edges, 628655 markings/sec, 10 secs
lola: 13002710 markings, 17665437 edges, 604771 markings/sec, 15 secs
lola: 16170592 markings, 21986364 edges, 633576 markings/sec, 20 secs
lola: 19311052 markings, 26269670 edges, 628092 markings/sec, 25 secs
lola: 22358153 markings, 30424296 edges, 609420 markings/sec, 30 secs
lola: 25433905 markings, 34618738 edges, 615150 markings/sec, 35 secs
lola: 28441253 markings, 38718964 edges, 601470 markings/sec, 40 secs
lola: 31375230 markings, 42721026 edges, 586795 markings/sec, 45 secs
lola: 34313428 markings, 46726236 edges, 587640 markings/sec, 50 secs
lola: 37280235 markings, 50771203 edges, 593361 markings/sec, 55 secs
lola: 40223405 markings, 54786649 edges, 588634 markings/sec, 60 secs
lola: 43116250 markings, 58729955 edges, 578569 markings/sec, 65 secs
lola: 46041717 markings, 62718564 edges, 585093 markings/sec, 70 secs
lola: 48907760 markings, 66628183 edges, 573209 markings/sec, 75 secs
lola: 51752778 markings, 70506170 edges, 569004 markings/sec, 80 secs
lola: 54579052 markings, 74361328 edges, 565255 markings/sec, 85 secs
lola: 57425495 markings, 78241766 edges, 569289 markings/sec, 90 secs
lola: 60243802 markings, 82086369 edges, 563661 markings/sec, 95 secs
lola: 63012356 markings, 85861350 edges, 553711 markings/sec, 100 secs
lola: 65821817 markings, 89692568 edges, 561892 markings/sec, 105 secs
lola: 68587759 markings, 93462798 edges, 553188 markings/sec, 110 secs
lola: 71370892 markings, 97259739 edges, 556627 markings/sec, 115 secs
lola: 74129084 markings, 101019747 edges, 551638 markings/sec, 120 secs
lola: 76926137 markings, 104833664 edges, 559411 markings/sec, 125 secs
lola: 79639162 markings, 108534472 edges, 542605 markings/sec, 130 secs
lola: 82360654 markings, 112244525 edges, 544298 markings/sec, 135 secs
lola: 85138029 markings, 116031996 edges, 555475 markings/sec, 140 secs
lola: 87962973 markings, 119885404 edges, 564989 markings/sec, 145 secs
lola: 90779912 markings, 123725375 edges, 563388 markings/sec, 150 secs
lola: 93519010 markings, 127460739 edges, 547820 markings/sec, 155 secs
lola: 94928726 markings, 129383985 edges, 281943 markings/sec, 160 secs
lola: 94957939 markings, 129421720 edges, 5843 markings/sec, 165 secs
lola: 94967326 markings, 129434683 edges, 1877 markings/sec, 170 secs

BK_STOP 1552332189067

--------------------
content from stderr:

Killed

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="ClientsAndServers-PT-N2000P0"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool win2018"
echo " Input is ClientsAndServers-PT-N2000P0, 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 r033-smll-155225133800131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N2000P0.tgz
mv ClientsAndServers-PT-N2000P0 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;