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.r099-smll-155246598200023.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 Kanban-PT-01000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r099-smll-155246598200023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.3K Feb 11 22:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 11 22:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 7 23:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 7 23:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 102 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 340 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 00:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 5 00:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 4 06:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 06:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Jan 31 23:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Jan 31 23:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-01000-LTLCardinality-00
FORMULA_NAME Kanban-PT-01000-LTLCardinality-01
FORMULA_NAME Kanban-PT-01000-LTLCardinality-02
FORMULA_NAME Kanban-PT-01000-LTLCardinality-03
FORMULA_NAME Kanban-PT-01000-LTLCardinality-04
FORMULA_NAME Kanban-PT-01000-LTLCardinality-05
FORMULA_NAME Kanban-PT-01000-LTLCardinality-06
FORMULA_NAME Kanban-PT-01000-LTLCardinality-07
FORMULA_NAME Kanban-PT-01000-LTLCardinality-08
FORMULA_NAME Kanban-PT-01000-LTLCardinality-09
FORMULA_NAME Kanban-PT-01000-LTLCardinality-10
FORMULA_NAME Kanban-PT-01000-LTLCardinality-11
FORMULA_NAME Kanban-PT-01000-LTLCardinality-12
FORMULA_NAME Kanban-PT-01000-LTLCardinality-13
FORMULA_NAME Kanban-PT-01000-LTLCardinality-14
FORMULA_NAME Kanban-PT-01000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552762328660

info: Time: 3600 - MCC
===========================================================================================
prep: translating Kanban-PT-01000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Kanban-PT-01000 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ Kanban-PT-01000 @ 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: 32/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from Kanban-PT-01000-LTLCardinality.task
lola: A (F (((2 <= Pback4) U G ((Pback2 <= P2))))) : A ((F (G ((Pm2 <= Pback2))) U (P4 <= Pback1))) : A (G (F (F (G ((Pm3 <= Pout3)))))) : A (F (((3 <= P4) U F ((Pback1 <= Pout4))))) : A (F (G (G (F ((2 <= Pback2)))))) : A ((((Pback4 <= Pm3) U (3 <= Pm1)) U ((2 <= Pm4) U (3 <= P3)))) : A ((2 <= Pout2)) : A (F (F (F (G ((Pout4 <= Pback4)))))) : A ((X (X ((1 <= P4))) U G ((Pout1 <= Pout2)))) : A ((2 <= Pm3)) : A (G ((3 <= Pm1))) : A (F (((Pout2 <= Pback4) U X ((2 <= Pm1))))) : A (X ((G ((3 <= Pout2)) U G ((2 <= Pout2))))) : A (X (X (((P3 <= Pback1) U (Pout3 <= Pm4))))) : A ((X (F ((3 <= Pout4))) U G (G ((Pback3 <= Pm3))))) : A (F (((1 <= Pout2) U F ((Pm1 <= Pback1)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= Pout2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Pout2)
lola: processed formula length: 12
lola: 18 rewrites
lola: closed formula file Kanban-PT-01000-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 Kanban-PT-01000-LTLCardinality-6 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: (2 <= Pm3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Pm3)
lola: processed formula length: 10
lola: 18 rewrites
lola: closed formula file Kanban-PT-01000-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 Kanban-PT-01000-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((1 <= P4))) U G ((Pout1 <= Pout2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((1 <= P4))) U G ((Pout1 <= Pout2))))
lola: processed formula length: 46
lola: 18 rewrites
lola: closed formula file Kanban-PT-01000-LTLCardinality.task
lola: the resulting Büchi automaton has 8 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: 3608129 markings, 6891875 edges, 721626 markings/sec, 0 secs
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: 4522989 markings, 8785478 edges

FORMULA Kanban-PT-01000-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= Pm1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= Pm1))))
lola: processed formula length: 22
lola: 18 rewrites
lola: closed formula file Kanban-PT-01000-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: 3 markings, 3 edges
lola: ========================================

FORMULA Kanban-PT-01000-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((2 <= Pout2)) OR (G ((3 <= Pout2)) AND F (G ((2 <= Pout2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((2 <= Pout2)) OR (G ((3 <= Pout2)) AND F (G ((2 <= Pout2)))))))
lola: processed formula length: 73
lola: 18 rewrites
lola: closed formula file Kanban-PT-01000-LTLCardinality.task
lola: the resulting Büchi automaton has 8 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 Kanban-PT-01000-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((P3 <= Pback1) U (Pout3 <= Pm4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((P3 <= Pback1) U (Pout3 <= Pm4)))))
lola: processed formula length: 45
lola: 18 rewrites
lola: closed formula file Kanban-PT-01000-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: 5 markings, 4 edges
lola: ========================================

FORMULA Kanban-PT-01000-LTLCardinality-13 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 ((3 <= Pout4))) U G ((Pback3 <= Pm3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((3 <= Pout4))) U G ((Pback3 <= Pm3))))
lola: processed formula length: 48
lola: 18 rewrites
lola: closed formula file Kanban-PT-01000-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: 4004 markings, 6004 edges
lola: ========================================

FORMULA Kanban-PT-01000-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= Pm1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((3 <= Pm1)))
lola: processed formula length: 18
lola: 20 rewrites
lola: closed formula file Kanban-PT-01000-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (Pm1 <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Kanban-PT-01000-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Pback1 <= Pout4)))
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: (Pout4 + 1 <= Pback1)
lola: processed formula length: 21
lola: 20 rewrites
lola: closed formula file Kanban-PT-01000-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: 1 markings, 0 edges
lola: ========================================

FORMULA Kanban-PT-01000-LTLCardinality-3 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 ((Pm1 <= Pback1)))
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: (Pback1 + 1 <= Pm1)
lola: processed formula length: 19
lola: 20 rewrites
lola: closed formula file Kanban-PT-01000-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: 1 markings, 0 edges
lola: ========================================

FORMULA Kanban-PT-01000-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= Pback2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= Pback2))))
lola: processed formula length: 25
lola: 18 rewrites
lola: closed formula file Kanban-PT-01000-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: 1002 markings, 1002 edges
lola: ========================================

FORMULA Kanban-PT-01000-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Pout4 <= Pback4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Pout4 <= Pback4))))
lola: processed formula length: 29
lola: 18 rewrites
lola: closed formula file Kanban-PT-01000-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: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
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: 3002 markings, 4003 edges
lola: ========================================

FORMULA Kanban-PT-01000-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Pm3 <= Pout3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Pm3 <= Pout3))))
lola: processed formula length: 26
lola: 18 rewrites
lola: closed formula file Kanban-PT-01000-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: add low 9
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: 3005 markings, 4006 edges
lola: ========================================

FORMULA Kanban-PT-01000-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Pback2 <= P2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Pback2 <= P2))))
lola: processed formula length: 26
lola: 18 rewrites
lola: closed formula file Kanban-PT-01000-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: add low 9
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: 6505 markings, 9006 edges

FORMULA Kanban-PT-01000-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((P4 <= Pback1) OR (F ((P4 <= Pback1)) AND F (G ((Pm2 <= Pback2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((P4 <= Pback1) OR (F ((P4 <= Pback1)) AND F (G ((Pm2 <= Pback2))))))
lola: processed formula length: 72
lola: 18 rewrites
lola: closed formula file Kanban-PT-01000-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: 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: 3004 markings, 4004 edges

FORMULA Kanban-PT-01000-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((Pback4 <= Pm3) U (3 <= Pm1)) U ((2 <= Pm4) U (3 <= P3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((Pback4 <= Pm3) U (3 <= Pm1)) U ((2 <= Pm4) U (3 <= P3))))
lola: processed formula length: 63
lola: 18 rewrites
lola: closed formula file Kanban-PT-01000-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: 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 Kanban-PT-01000-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no yes no no no no no no no yes no yes
lola:
preliminary result: no no no yes no yes no no no no no no no yes no yes
lola: memory consumption: 20048 KB
lola: time consumption: 7 seconds

BK_STOP 1552762335621

--------------------
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="Kanban-PT-01000"
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 Kanban-PT-01000, 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 r099-smll-155246598200023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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