fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r033-smll-155225133700086
Last Updated
Apr 15, 2019

About the Execution of 2018-Gold for ClientsAndServers-PT-N0005P0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8310.300 188766.00 190781.00 354.30 TTFTFFFTFTTFTTTT normal

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-155225133700086.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-N0005P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r033-smll-155225133700086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.6K Feb 9 08:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 9 08:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 07:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 5 07:20 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:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.8K Feb 4 22:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 2 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 2 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jan 29 15:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Jan 29 15:26 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.1K 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-N0005P0-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552314627839

info: Time: 3600 - MCC
===========================================================================================
prep: translating ClientsAndServers-PT-N0005P0 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating ClientsAndServers-PT-N0005P0 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ ClientsAndServers-PT-N0005P0 @ 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-N0005P0-LTLCardinality.task
lola: LP says that atomic proposition is always true: (MpA <= SwA)
lola: A (X ((CwA <= SpA))) : A (F (X ((1 <= Uf)))) : A ((X (F ((2 <= SwG))) U F (G ((3 <= SwG))))) : A (F (X (X ((MpA <= Cb))))) : A (F (X (((2 <= Ci) U (3 <= SR))))) : A ((1 <= MpG)) : A (G (G (F ((CwG <= CwA))))) : A (X ((CwG <= CR))) : A (G (F (((2 <= CA) U (3 <= Cb))))) : A (F (G (((SpA <= Uf) U (1 <= CwA))))) : A ((G ((SA <= CR)) U ((SwG <= Uf) U (1 <= Si)))) : A (G (F (G ((MtF <= CR))))) : A ((2 <= Si)) : A (F (F (((MpA <= SR) U (1 <= Cb))))) : A ((X (X ((3 <= Cb))) U (CA <= MtF))) : A (X (G (X (G (TRUE)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:142
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 <= MpG)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= MpG)
lola: processed formula length: 10
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0005P0-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-N0005P0-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= Si)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Si)
lola: processed formula length: 9
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0005P0-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-N0005P0-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((MpA <= Cb)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((MpA <= Cb)))))
lola: processed formula length: 27
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0005P0-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: 4 markings, 3 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0005P0-LTLCardinality-3 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: A (X (F ((3 <= SR))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((3 <= SR))))
lola: processed formula length: 21
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0005P0-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: 251 markings, 251 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0005P0-LTLCardinality-4 FALSE 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 ((CwA <= SpA)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((CwA <= SpA)))
lola: processed formula length: 20
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0005P0-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: 2 markings, 1 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0005P0-LTLCardinality-0 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 ((CwG <= CR)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((CwG <= CR)))
lola: processed formula length: 19
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0005P0-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: 2 markings, 1 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0005P0-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= Uf))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= Uf))))
lola: processed formula length: 21
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0005P0-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: 2 markings, 1 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0005P0-LTLCardinality-1 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 ((X (X ((3 <= Cb))) U (CA <= MtF)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((3 <= Cb))) U (CA <= MtF)))
lola: processed formula length: 37
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0005P0-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: 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-N0005P0-LTLCardinality-14 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 (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0005P0-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: 2 markings, 1 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0005P0-LTLCardinality-15 TRUE 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 (F ((1 <= Cb)))
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: (Cb <= 0)
lola: processed formula length: 9
lola: 24 rewrites
lola: closed formula file ClientsAndServers-PT-N0005P0-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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1327 markings, 1542 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0005P0-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((3 <= SwG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((3 <= SwG))))
lola: processed formula length: 22
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0005P0-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: 4003 markings, 4497 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0005P0-LTLCardinality-2 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 (G (F ((3 <= Cb))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= Cb))))
lola: processed formula length: 21
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0005P0-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: 60 markings, 60 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0005P0-LTLCardinality-8 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 (G (F ((CwG <= CwA))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((CwG <= CwA))))
lola: processed formula length: 24
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0005P0-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: 355 markings, 355 edges
lola: ========================================

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

FORMULA ClientsAndServers-PT-N0005P0-LTLCardinality-11 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 (F (G ((F ((1 <= CwA)) AND ((SpA <= Uf) OR (1 <= CwA))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((1 <= CwA)) AND ((SpA <= Uf) OR (1 <= CwA))))))
lola: processed formula length: 60
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0005P0-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: 2825991 markings, 4319647 edges, 565198 markings/sec, 0 secs
lola: 5203822 markings, 7862819 edges, 475566 markings/sec, 5 secs
lola: 7395992 markings, 11148637 edges, 438434 markings/sec, 10 secs
lola: 9497044 markings, 14310008 edges, 420210 markings/sec, 15 secs
lola: 11552841 markings, 17407369 edges, 411159 markings/sec, 20 secs
lola: 13554428 markings, 20433555 edges, 400317 markings/sec, 25 secs
lola: 15545393 markings, 23443971 edges, 398193 markings/sec, 30 secs
lola: 17496126 markings, 26404271 edges, 390147 markings/sec, 35 secs
lola: 19428958 markings, 29339245 edges, 386566 markings/sec, 40 secs
lola: 21340747 markings, 32243125 edges, 382358 markings/sec, 45 secs
lola: 23256930 markings, 35156468 edges, 383237 markings/sec, 50 secs
lola: 25172832 markings, 38069118 edges, 383180 markings/sec, 55 secs
lola: 27075230 markings, 40962401 edges, 380480 markings/sec, 60 secs
lola: 28979950 markings, 43863591 edges, 380944 markings/sec, 65 secs
lola: 30893799 markings, 46781409 edges, 382770 markings/sec, 70 secs
lola: 32790453 markings, 49676783 edges, 379331 markings/sec, 75 secs
lola: 34704012 markings, 52597003 edges, 382712 markings/sec, 80 secs
lola: 36628019 markings, 55540667 edges, 384801 markings/sec, 85 secs
lola: 38580389 markings, 58528213 edges, 390474 markings/sec, 90 secs
lola: 40565283 markings, 61573304 edges, 396979 markings/sec, 95 secs
lola: 42605050 markings, 64713516 edges, 407953 markings/sec, 100 secs
lola: 44099440 markings, 67610945 edges, 298878 markings/sec, 105 secs
lola: 45245573 markings, 70110733 edges, 229227 markings/sec, 110 secs
lola: 46356642 markings, 72531033 edges, 222214 markings/sec, 115 secs
lola: 47443385 markings, 74900410 edges, 217349 markings/sec, 120 secs
lola: 48509413 markings, 77238320 edges, 213206 markings/sec, 125 secs
lola: 49567257 markings, 79562036 edges, 211569 markings/sec, 130 secs
lola: 50631881 markings, 81889102 edges, 212925 markings/sec, 135 secs
lola: 51693185 markings, 84205418 edges, 212261 markings/sec, 140 secs
lola: 52746618 markings, 86518853 edges, 210687 markings/sec, 145 secs
lola: 53805091 markings, 88849433 edges, 211695 markings/sec, 150 secs
lola: 54865982 markings, 91207314 edges, 212178 markings/sec, 155 secs
lola: 55914862 markings, 93574103 edges, 209776 markings/sec, 160 secs
lola: 56962382 markings, 95965412 edges, 209504 markings/sec, 165 secs
lola: 58020972 markings, 98418550 edges, 211718 markings/sec, 170 secs
lola: 59090891 markings, 100958382 edges, 213984 markings/sec, 175 secs
lola: 60143122 markings, 103646174 edges, 210446 markings/sec, 180 secs
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: 60671621 markings, 105008824 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0005P0-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((SwG <= Uf) U (1 <= Si)) OR (G ((SA <= CR)) AND F ((1 <= Si)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((SwG <= Uf) U (1 <= Si)) OR (G ((SA <= CR)) AND F ((1 <= Si)))))
lola: processed formula length: 69
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0005P0-LTLCardinality.task
lola: the resulting Büchi automaton has 7 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-N0005P0-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no yes no no no yes no yes yes no yes yes yes yes
lola:
preliminary result: yes yes no yes no no no yes no yes yes no yes yes yes yes
lola: memory consumption: 19224 KB
lola: time consumption: 189 seconds

BK_STOP 1552314816605

--------------------
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="ClientsAndServers-PT-N0005P0"
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-N0005P0, 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-155225133700086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0005P0.tgz
mv ClientsAndServers-PT-N0005P0 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 ;