fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r234-tall-167856420000250
Last Updated
May 14, 2023

About the Execution of Marcie+red for Kanban-PT-00020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5449.336 8135.00 10344.00 325.10 FTTFFFFFFTTTTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r234-tall-167856420000250.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Kanban-PT-00020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420000250
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 25 11:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 11:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 25 11:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14K Mar 5 18:22 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-00020-CTLFireability-00
FORMULA_NAME Kanban-PT-00020-CTLFireability-01
FORMULA_NAME Kanban-PT-00020-CTLFireability-02
FORMULA_NAME Kanban-PT-00020-CTLFireability-03
FORMULA_NAME Kanban-PT-00020-CTLFireability-04
FORMULA_NAME Kanban-PT-00020-CTLFireability-05
FORMULA_NAME Kanban-PT-00020-CTLFireability-06
FORMULA_NAME Kanban-PT-00020-CTLFireability-07
FORMULA_NAME Kanban-PT-00020-CTLFireability-08
FORMULA_NAME Kanban-PT-00020-CTLFireability-09
FORMULA_NAME Kanban-PT-00020-CTLFireability-10
FORMULA_NAME Kanban-PT-00020-CTLFireability-11
FORMULA_NAME Kanban-PT-00020-CTLFireability-12
FORMULA_NAME Kanban-PT-00020-CTLFireability-13
FORMULA_NAME Kanban-PT-00020-CTLFireability-14
FORMULA_NAME Kanban-PT-00020-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679466490964

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Kanban-PT-00020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 06:28:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 06:28:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:28:12] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-22 06:28:12] [INFO ] Transformed 16 places.
[2023-03-22 06:28:12] [INFO ] Transformed 16 transitions.
[2023-03-22 06:28:12] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 80 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Kanban-PT-00020-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00020-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 8 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-22 06:28:12] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-22 06:28:12] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-22 06:28:12] [INFO ] Invariant cache hit.
[2023-03-22 06:28:12] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-22 06:28:12] [INFO ] Invariant cache hit.
[2023-03-22 06:28:12] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 269 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 16 out of 16 places after structural reductions.
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 14 ms
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 3 ms
[2023-03-22 06:28:13] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 25) seen :24
Finished Best-First random walk after 1211 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=201 )
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 3 ms
[2023-03-22 06:28:13] [INFO ] Input system was already deterministic with 16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 12 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 10 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 10/16 places, 11/16 transitions.
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 16/16 transitions.
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 5 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
Applied a total of 1 rules in 1 ms. Remains 13 /16 variables (removed 3) and now considering 14/16 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 13/16 places, 14/16 transitions.
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 15 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 15
Applied a total of 2 rules in 2 ms. Remains 15 /16 variables (removed 1) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 15/16 places, 15/16 transitions.
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 15 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 15
Applied a total of 2 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/16 places, 15/16 transitions.
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:28:13] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 3 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 10/16 places, 11/16 transitions.
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 106 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=106 )
FORMULA Kanban-PT-00020-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 15 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 15
Applied a total of 2 rules in 0 ms. Remains 15 /16 variables (removed 1) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 15/16 places, 15/16 transitions.
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 16/16 transitions.
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Input system was already deterministic with 16 transitions.
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:28:13] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2023-03-22 06:28:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 16 places, 16 transitions and 40 arcs took 0 ms.
Total runtime 1035 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 16 NrTr: 16 NrArc: 40)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.723sec


RS generation: 0m 0.011sec


-> reachability set: #nodes 696 (7.0e+02) #states 805,422,366,595 (11)



starting MCC model checker
--------------------------

checking: EF [AG [1<=p11]]
normalized: E [true U ~ [E [true U ~ [1<=p11]]]]

abstracting: (1<=p11)
states: 700,367,275,300 (11)
-> the formula is FALSE

FORMULA Kanban-PT-00020-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AX [[EF [p12<=0] & EF [p4<=0]]]
normalized: ~ [EX [~ [[E [true U p4<=0] & E [true U p12<=0]]]]]

abstracting: (p12<=0)
states: 88,874,192,176 (10)
abstracting: (p4<=0)
states: 105,055,091,295 (11)
.-> the formula is TRUE

FORMULA Kanban-PT-00020-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EX [[p5<=0 & [p3<=0 | [p9<=0 | p14<=0]]]]
normalized: EX [[[[p9<=0 | p14<=0] | p3<=0] & p5<=0]]

abstracting: (p5<=0)
states: 105,055,091,295 (11)
abstracting: (p3<=0)
states: 88,874,192,176 (10)
abstracting: (p14<=0)
states: 88,874,192,176 (10)
abstracting: (p9<=0)
states: 105,055,091,295 (11)
.-> the formula is FALSE

FORMULA Kanban-PT-00020-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [AX [AX [EG [AX [[p0<=0 | [p7<=0 | p13<=0]]]]]] & EG [AG [AF [1<=p8]]]]
normalized: [EG [~ [E [true U EG [~ [1<=p8]]]]] & ~ [EX [EX [~ [EG [~ [EX [~ [[[p7<=0 | p13<=0] | p0<=0]]]]]]]]]]

abstracting: (p0<=0)
states: 167,363,628,201 (11)
abstracting: (p13<=0)
states: 167,363,628,201 (11)
abstracting: (p7<=0)
states: 105,055,091,295 (11)
.......................
EG iterations: 22
..abstracting: (1<=p8)
states: 700,367,275,300 (11)
......................
EG iterations: 22
.
EG iterations: 1
-> the formula is FALSE

FORMULA Kanban-PT-00020-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: EF [AG [A [~ [[[[1<=p12 & 1<=p3] & [1<=p9 & 1<=p14]] | 1<=p6]] U p5<=0]]]
normalized: E [true U ~ [E [true U ~ [[~ [EG [~ [p5<=0]]] & ~ [E [~ [p5<=0] U [[[[1<=p9 & 1<=p14] & [1<=p12 & 1<=p3]] | 1<=p6] & ~ [p5<=0]]]]]]]]]

abstracting: (p5<=0)
states: 105,055,091,295 (11)
abstracting: (1<=p6)
states: 700,367,275,300 (11)
abstracting: (1<=p3)
states: 716,548,174,419 (11)
abstracting: (1<=p12)
states: 716,548,174,419 (11)
abstracting: (1<=p14)
states: 716,548,174,419 (11)
abstracting: (1<=p9)
states: 700,367,275,300 (11)
abstracting: (p5<=0)
states: 105,055,091,295 (11)
abstracting: (p5<=0)
states: 105,055,091,295 (11)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Kanban-PT-00020-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: EF [EX [[EF [[1<=p0 & [1<=p7 & 1<=p13]]] & AG [[1<=p3 & [1<=p9 & 1<=p14]]]]]]
normalized: E [true U EX [[~ [E [true U ~ [[1<=p3 & [1<=p9 & 1<=p14]]]]] & E [true U [1<=p0 & [1<=p7 & 1<=p13]]]]]]

abstracting: (1<=p13)
states: 638,058,738,394 (11)
abstracting: (1<=p7)
states: 700,367,275,300 (11)
abstracting: (1<=p0)
states: 638,058,738,394 (11)
abstracting: (1<=p14)
states: 716,548,174,419 (11)
abstracting: (1<=p9)
states: 700,367,275,300 (11)
abstracting: (1<=p3)
states: 716,548,174,419 (11)
.-> the formula is FALSE

FORMULA Kanban-PT-00020-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: [AX [[p1<=0 | [[p15<=0 & p5<=0] | 1<=p8]]] | [AG [1<=p1] & AF [p8<=0]]]
normalized: [[~ [EG [~ [p8<=0]]] & ~ [E [true U ~ [1<=p1]]]] | ~ [EX [~ [[p1<=0 | [1<=p8 | [p15<=0 & p5<=0]]]]]]]

abstracting: (p5<=0)
states: 105,055,091,295 (11)
abstracting: (p15<=0)
states: 88,874,192,176 (10)
abstracting: (1<=p8)
states: 700,367,275,300 (11)
abstracting: (p1<=0)
states: 88,874,192,176 (10)
.abstracting: (1<=p1)
states: 716,548,174,419 (11)
abstracting: (p8<=0)
states: 105,055,091,295 (11)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Kanban-PT-00020-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: AX [[E [~ [[[1<=p5 | [1<=p1 | 1<=p1]] & ~ [EF [1<=p1]]]] U 1<=p8] | [1<=p11 & 1<=p12]]]
normalized: ~ [EX [~ [[[1<=p11 & 1<=p12] | E [~ [[~ [E [true U 1<=p1]] & [1<=p5 | [1<=p1 | 1<=p1]]]] U 1<=p8]]]]]

abstracting: (1<=p8)
states: 700,367,275,300 (11)
abstracting: (1<=p1)
states: 716,548,174,419 (11)
abstracting: (1<=p1)
states: 716,548,174,419 (11)
abstracting: (1<=p5)
states: 700,367,275,300 (11)
abstracting: (1<=p1)
states: 716,548,174,419 (11)
abstracting: (1<=p12)
states: 716,548,174,419 (11)
abstracting: (1<=p11)
states: 700,367,275,300 (11)
.-> the formula is TRUE

FORMULA Kanban-PT-00020-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: [EG [[1<=p15 | p5<=0]] & [EG [EF [[1<=p2 | AX [p5<=0]]]] | [A [EF [1<=p2] U E [1<=p15 U 1<=p8]] & AF [1<=p12]]]]
normalized: [[[~ [EG [~ [1<=p12]]] & [~ [EG [~ [E [1<=p15 U 1<=p8]]]] & ~ [E [~ [E [1<=p15 U 1<=p8]] U [~ [E [true U 1<=p2]] & ~ [E [1<=p15 U 1<=p8]]]]]]] | EG [E [true U [1<=p2 | ~ [EX [~ [p5<=0]]]]]]] & EG [[1<=p15 | p5<=0]]]

abstracting: (p5<=0)
states: 105,055,091,295 (11)
abstracting: (1<=p15)
states: 716,548,174,419 (11)
......................
EG iterations: 22
abstracting: (p5<=0)
states: 105,055,091,295 (11)
.abstracting: (1<=p2)
states: 716,548,174,419 (11)

EG iterations: 0
abstracting: (1<=p8)
states: 700,367,275,300 (11)
abstracting: (1<=p15)
states: 716,548,174,419 (11)
abstracting: (1<=p2)
states: 716,548,174,419 (11)
abstracting: (1<=p8)
states: 700,367,275,300 (11)
abstracting: (1<=p15)
states: 716,548,174,419 (11)
abstracting: (1<=p8)
states: 700,367,275,300 (11)
abstracting: (1<=p15)
states: 716,548,174,419 (11)
..........................................
EG iterations: 42
abstracting: (1<=p12)
states: 716,548,174,419 (11)
......................
EG iterations: 22
-> the formula is FALSE

FORMULA Kanban-PT-00020-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.082sec

checking: E [[1<=p5 | A [[~ [[[1<=p1 | 1<=p8] & [1<=p8 & 1<=p1]]] & AF [p5<=0]] U E [1<=p12 U EG [1<=p4]]]] U 1<=p1]
normalized: E [[1<=p5 | [~ [EG [~ [E [1<=p12 U EG [1<=p4]]]]] & ~ [E [~ [E [1<=p12 U EG [1<=p4]]] U [~ [[~ [EG [~ [p5<=0]]] & ~ [[[1<=p8 & 1<=p1] & [1<=p1 | 1<=p8]]]]] & ~ [E [1<=p12 U EG [1<=p4]]]]]]]] U 1<=p1]

abstracting: (1<=p1)
states: 716,548,174,419 (11)
abstracting: (1<=p4)
states: 700,367,275,300 (11)
.
EG iterations: 1
abstracting: (1<=p12)
states: 716,548,174,419 (11)
abstracting: (1<=p8)
states: 700,367,275,300 (11)
abstracting: (1<=p1)
states: 716,548,174,419 (11)
abstracting: (1<=p1)
states: 716,548,174,419 (11)
abstracting: (1<=p8)
states: 700,367,275,300 (11)
abstracting: (p5<=0)
states: 105,055,091,295 (11)
.
EG iterations: 1
abstracting: (1<=p4)
states: 700,367,275,300 (11)
.
EG iterations: 1
abstracting: (1<=p12)
states: 716,548,174,419 (11)
abstracting: (1<=p4)
states: 700,367,275,300 (11)
.
EG iterations: 1
abstracting: (1<=p12)
states: 716,548,174,419 (11)
......................
EG iterations: 22
abstracting: (1<=p5)
states: 700,367,275,300 (11)
-> the formula is TRUE

FORMULA Kanban-PT-00020-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: A [EG [AF [[~ [[[1<=p3 & [1<=p9 & 1<=p14]] | 1<=p1]] | [EX [1<=p12] | p5<=0]]]] U E [[1<=p0 & [1<=p7 & 1<=p13]] U AX [AX [EG [1<=p6]]]]]
normalized: [~ [EG [~ [E [[1<=p0 & [1<=p7 & 1<=p13]] U ~ [EX [EX [~ [EG [1<=p6]]]]]]]]] & ~ [E [~ [E [[1<=p0 & [1<=p7 & 1<=p13]] U ~ [EX [EX [~ [EG [1<=p6]]]]]]] U [~ [EG [~ [EG [~ [[[p5<=0 | EX [1<=p12]] | ~ [[1<=p1 | [1<=p3 & [1<=p9 & 1<=p14]]]]]]]]]] & ~ [E [[1<=p0 & [1<=p7 & 1<=p13]] U ~ [EX [EX [~ [EG [1<=p6]]]]]]]]]]]

abstracting: (1<=p6)
states: 700,367,275,300 (11)
.
EG iterations: 1
..abstracting: (1<=p13)
states: 638,058,738,394 (11)
abstracting: (1<=p7)
states: 700,367,275,300 (11)
abstracting: (1<=p0)
states: 638,058,738,394 (11)
abstracting: (1<=p14)
states: 716,548,174,419 (11)
abstracting: (1<=p9)
states: 700,367,275,300 (11)
abstracting: (1<=p3)
states: 716,548,174,419 (11)
abstracting: (1<=p1)
states: 716,548,174,419 (11)
abstracting: (1<=p12)
states: 716,548,174,419 (11)
.abstracting: (p5<=0)
states: 105,055,091,295 (11)
.....................
EG iterations: 21
.
EG iterations: 1
abstracting: (1<=p6)
states: 700,367,275,300 (11)
.
EG iterations: 1
..abstracting: (1<=p13)
states: 638,058,738,394 (11)
abstracting: (1<=p7)
states: 700,367,275,300 (11)
abstracting: (1<=p0)
states: 638,058,738,394 (11)
abstracting: (1<=p6)
states: 700,367,275,300 (11)
.
EG iterations: 1
..abstracting: (1<=p13)
states: 638,058,738,394 (11)
abstracting: (1<=p7)
states: 700,367,275,300 (11)
abstracting: (1<=p0)
states: 638,058,738,394 (11)
......................
EG iterations: 22
-> the formula is FALSE

FORMULA Kanban-PT-00020-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.078sec

checking: [AG [[EF [EX [p12<=0]] | [[[p0<=0 | [p7<=0 | p13<=0]] & [EG [p15<=0] | [[p3<=0 | [p9<=0 | p14<=0]] & p1<=0]]] | p11<=0]]] | EF [[p10<=0 & [[1<=p5 & p2<=0] | AG [[p0<=0 | [p7<=0 | p13<=0]]]]]]]
normalized: [E [true U [p10<=0 & [~ [E [true U ~ [[p0<=0 | [p7<=0 | p13<=0]]]]] | [1<=p5 & p2<=0]]]] | ~ [E [true U ~ [[[p11<=0 | [[[p1<=0 & [p3<=0 | [p9<=0 | p14<=0]]] | EG [p15<=0]] & [p0<=0 | [p7<=0 | p13<=0]]]] | E [true U EX [p12<=0]]]]]]]

abstracting: (p12<=0)
states: 88,874,192,176 (10)
.abstracting: (p13<=0)
states: 167,363,628,201 (11)
abstracting: (p7<=0)
states: 105,055,091,295 (11)
abstracting: (p0<=0)
states: 167,363,628,201 (11)
abstracting: (p15<=0)
states: 88,874,192,176 (10)
.
EG iterations: 1
abstracting: (p14<=0)
states: 88,874,192,176 (10)
abstracting: (p9<=0)
states: 105,055,091,295 (11)
abstracting: (p3<=0)
states: 88,874,192,176 (10)
abstracting: (p1<=0)
states: 88,874,192,176 (10)
abstracting: (p11<=0)
states: 105,055,091,295 (11)
abstracting: (p2<=0)
states: 88,874,192,176 (10)
abstracting: (1<=p5)
states: 700,367,275,300 (11)
abstracting: (p13<=0)
states: 167,363,628,201 (11)
abstracting: (p7<=0)
states: 105,055,091,295 (11)
abstracting: (p0<=0)
states: 167,363,628,201 (11)
abstracting: (p10<=0)
states: 105,055,091,295 (11)
-> the formula is TRUE

FORMULA Kanban-PT-00020-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EX [[E [AX [1<=p12] U [[1<=p6 & 1<=p3] & [1<=p9 & 1<=p14]]] | [AG [[1<=p15 & 1<=p8]] | [AG [EF [p10<=0]] & [[[p5<=0 | p12<=0] | [p10<=0 | p0<=0]] | [[p7<=0 | p13<=0] | [p1<=0 | [p2<=0 | [[1<=p0 & 1<=p7] & [1<=p13 & [1<=p5 & [[p3<=0 | [p9<=0 | p14<=0]] | [[p8<=0 | p0<=0] | [p7<=0 | p13<=0]]]]]]]]]]]]]]
normalized: EX [[[[[[[p1<=0 | [p2<=0 | [[1<=p13 & [1<=p5 & [[[p7<=0 | p13<=0] | [p8<=0 | p0<=0]] | [p3<=0 | [p9<=0 | p14<=0]]]]] & [1<=p0 & 1<=p7]]]] | [p7<=0 | p13<=0]] | [[p10<=0 | p0<=0] | [p5<=0 | p12<=0]]] & ~ [E [true U ~ [E [true U p10<=0]]]]] | ~ [E [true U ~ [[1<=p15 & 1<=p8]]]]] | E [~ [EX [~ [1<=p12]]] U [[1<=p9 & 1<=p14] & [1<=p6 & 1<=p3]]]]]

abstracting: (1<=p3)
states: 716,548,174,419 (11)
abstracting: (1<=p6)
states: 700,367,275,300 (11)
abstracting: (1<=p14)
states: 716,548,174,419 (11)
abstracting: (1<=p9)
states: 700,367,275,300 (11)
abstracting: (1<=p12)
states: 716,548,174,419 (11)
.abstracting: (1<=p8)
states: 700,367,275,300 (11)
abstracting: (1<=p15)
states: 716,548,174,419 (11)
abstracting: (p10<=0)
states: 105,055,091,295 (11)
abstracting: (p12<=0)
states: 88,874,192,176 (10)
abstracting: (p5<=0)
states: 105,055,091,295 (11)
abstracting: (p0<=0)
states: 167,363,628,201 (11)
abstracting: (p10<=0)
states: 105,055,091,295 (11)
abstracting: (p13<=0)
states: 167,363,628,201 (11)
abstracting: (p7<=0)
states: 105,055,091,295 (11)
abstracting: (1<=p7)
states: 700,367,275,300 (11)
abstracting: (1<=p0)
states: 638,058,738,394 (11)
abstracting: (p14<=0)
states: 88,874,192,176 (10)
abstracting: (p9<=0)
states: 105,055,091,295 (11)
abstracting: (p3<=0)
states: 88,874,192,176 (10)
abstracting: (p0<=0)
states: 167,363,628,201 (11)
abstracting: (p8<=0)
states: 105,055,091,295 (11)
abstracting: (p13<=0)
states: 167,363,628,201 (11)
abstracting: (p7<=0)
states: 105,055,091,295 (11)
abstracting: (1<=p5)
states: 700,367,275,300 (11)
abstracting: (1<=p13)
states: 638,058,738,394 (11)
abstracting: (p2<=0)
states: 88,874,192,176 (10)
abstracting: (p1<=0)
states: 88,874,192,176 (10)
.-> the formula is TRUE

FORMULA Kanban-PT-00020-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

totally nodes used: 215463 (2.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1784800 558369 2343169
used/not used/entry size/cache size: 751246 66357618 16 1024MB
basic ops cache: hits/miss/sum: 673866 221964 895830
used/not used/entry size/cache size: 425897 16351319 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 25000 8610 33610
used/not used/entry size/cache size: 8607 8380001 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66901327
1 203477
2 3330
3 228
4 154
5 79
6 56
7 6
8 42
9 39
>= 10 126

Total processing time: 0m 4.658sec


BK_STOP 1679466499099

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:1436 (89), effective:440 (27)

initing FirstDep: 0m 0.000sec


iterations count:96 (6), effective:20 (1)

iterations count:56 (3), effective:20 (1)

iterations count:76 (4), effective:20 (1)

iterations count:91 (5), effective:24 (1)

iterations count:60 (3), effective:15 (0)

iterations count:53 (3), effective:11 (0)

iterations count:51 (3), effective:11 (0)

iterations count:156 (9), effective:20 (1)

iterations count:56 (3), effective:20 (1)

iterations count:54 (3), effective:11 (0)

iterations count:54 (3), effective:11 (0)

iterations count:196 (12), effective:60 (3)

iterations count:54 (3), effective:11 (0)

iterations count:55 (3), effective:11 (0)

iterations count:54 (3), effective:11 (0)

iterations count:54 (3), effective:11 (0)

iterations count:54 (3), effective:11 (0)

iterations count:54 (3), effective:11 (0)

iterations count:35 (2), effective:7 (0)

iterations count:54 (3), effective:11 (0)

iterations count:57 (3), effective:12 (0)

iterations count:172 (10), effective:46 (2)

iterations count:172 (10), effective:46 (2)

iterations count:170 (10), effective:46 (2)

iterations count:172 (10), effective:46 (2)

iterations count:63 (3), effective:21 (1)

iterations count:51 (3), effective:11 (0)

iterations count:93 (5), effective:51 (3)

iterations count:103 (6), effective:29 (1)

iterations count:76 (4), effective:20 (1)

iterations count:36 (2), effective:20 (1)

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-00020"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-5348"
echo " Executing tool marciexred"
echo " Input is Kanban-PT-00020, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420000250"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-00020.tgz
mv Kanban-PT-00020 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; 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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;