About the Execution of Marcie+red for SmallOperatingSystem-PT-MT0032DC0016
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.331 | 13615.00 | 17968.00 | 1082.50 | TTTFTTFTFTFFTTFF | 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.r458-smll-167912649700018.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 SmallOperatingSystem-PT-MT0032DC0016, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912649700018
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 12:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 12:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 12:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Feb 25 12:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 8.2K Mar 5 18:23 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 SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-00
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-01
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-02
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-03
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-04
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-05
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-06
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-07
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-08
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-09
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-10
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-11
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-12
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-13
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-14
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679231204813
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=SmallOperatingSystem-PT-MT0032DC0016
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 13:06:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 13:06:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:06:49] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-03-19 13:06:49] [INFO ] Transformed 9 places.
[2023-03-19 13:06:49] [INFO ] Transformed 8 transitions.
[2023-03-19 13:06:49] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Initial state reduction rules removed 3 formulas.
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 12 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-19 13:06:49] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-19 13:06:49] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-19 13:06:49] [INFO ] Invariant cache hit.
[2023-03-19 13:06:49] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-19 13:06:49] [INFO ] Invariant cache hit.
[2023-03-19 13:06:49] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 13:06:49] [INFO ] Flatten gal took : 26 ms
[2023-03-19 13:06:49] [INFO ] Flatten gal took : 15 ms
[2023-03-19 13:06:49] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10027 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 22) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 13:06:50] [INFO ] Invariant cache hit.
[2023-03-19 13:06:50] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-19 13:06:50] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 5 ms
[2023-03-19 13:06:50] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 3 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:50] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Applied a total of 2 rules in 5 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 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 1 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
Applied a total of 5 rules in 5 ms. Remains 5 /9 variables (removed 4) and now considering 6/8 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 5/9 places, 6/8 transitions.
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:50] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
Applied a total of 5 rules in 2 ms. Remains 5 /9 variables (removed 4) and now considering 6/8 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 5/9 places, 6/8 transitions.
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:50] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 7/8 transitions.
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:50] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 7/8 transitions.
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:50] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:50] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-19 13:06:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 8 transitions and 27 arcs took 0 ms.
Total runtime 1521 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: 9 NrTr: 8 NrArc: 27)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.003sec
init dd package: 0m 3.851sec
RS generation: 0m 0.055sec
-> reachability set: #nodes 473 (4.7e+02) #states 354,501 (5)
starting MCC model checker
--------------------------
checking: EG [EF [1<=p4]]
normalized: EG [E [true U 1<=p4]]
abstracting: (1<=p4)
states: 313,344 (5)
EG iterations: 0
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: AG [EF [EG [AX [[1<=p6 & 1<=p5]]]]]
normalized: ~ [E [true U ~ [E [true U EG [~ [EX [~ [[1<=p6 & 1<=p5]]]]]]]]]
abstracting: (1<=p5)
states: 313,344 (5)
abstracting: (1<=p6)
states: 354,500 (5)
...
EG iterations: 2
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: AG [EF [[p4<=0 | p6<=0]]]
normalized: ~ [E [true U ~ [E [true U [p4<=0 | p6<=0]]]]]
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 41,157 (4)
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: ~ [A [AX [1<=p7] U EG [EX [EX [1<=p8]]]]]
normalized: ~ [[~ [EG [~ [EG [EX [EX [1<=p8]]]]]] & ~ [E [~ [EG [EX [EX [1<=p8]]]] U [EX [~ [1<=p7]] & ~ [EG [EX [EX [1<=p8]]]]]]]]]
abstracting: (1<=p8)
states: 299,472 (5)
...
EG iterations: 1
abstracting: (1<=p7)
states: 313,344 (5)
.abstracting: (1<=p8)
states: 299,472 (5)
...
EG iterations: 1
abstracting: (1<=p8)
states: 299,472 (5)
...
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: [AX [EG [p3<=0]] & EG [[EG [~ [A [1<=p4 U [1<=p0 & [1<=p2 & 1<=p5]]]]] | [p4<=0 | p6<=0]]]]
normalized: [EG [[EG [~ [[~ [EG [~ [[[1<=p2 & 1<=p5] & 1<=p0]]]] & ~ [E [~ [[[1<=p2 & 1<=p5] & 1<=p0]] U [~ [1<=p4] & ~ [[[1<=p2 & 1<=p5] & 1<=p0]]]]]]]] | [p4<=0 | p6<=0]]] & ~ [EX [~ [EG [p3<=0]]]]]
abstracting: (p3<=0)
states: 55,029 (4)
.
EG iterations: 1
.abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 41,157 (4)
abstracting: (1<=p0)
states: 354,501 (5)
abstracting: (1<=p5)
states: 313,344 (5)
abstracting: (1<=p2)
states: 338,028 (5)
abstracting: (1<=p4)
states: 313,344 (5)
abstracting: (1<=p0)
states: 354,501 (5)
abstracting: (1<=p5)
states: 313,344 (5)
abstracting: (1<=p2)
states: 338,028 (5)
abstracting: (1<=p0)
states: 354,501 (5)
abstracting: (1<=p5)
states: 313,344 (5)
abstracting: (1<=p2)
states: 338,028 (5)
..
EG iterations: 2
..
EG iterations: 2
.
EG iterations: 1
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: AF [[1<=p7 & [AX [AF [1<=p8]] | [A [EX [1<=p8] U [[1<=p0 & 1<=p1] & [1<=p2 & 1<=p7]]] | [1<=p5 & 1<=p6]]]]]
normalized: ~ [EG [~ [[[[[1<=p5 & 1<=p6] | [~ [EG [~ [[[1<=p2 & 1<=p7] & [1<=p0 & 1<=p1]]]]] & ~ [E [~ [[[1<=p2 & 1<=p7] & [1<=p0 & 1<=p1]]] U [~ [EX [1<=p8]] & ~ [[[1<=p2 & 1<=p7] & [1<=p0 & 1<=p1]]]]]]]] | ~ [EX [EG [~ [1<=p8]]]]] & 1<=p7]]]]
abstracting: (1<=p7)
states: 313,344 (5)
abstracting: (1<=p8)
states: 299,472 (5)
..
EG iterations: 2
.abstracting: (1<=p1)
states: 313,344 (5)
abstracting: (1<=p0)
states: 354,501 (5)
abstracting: (1<=p7)
states: 313,344 (5)
abstracting: (1<=p2)
states: 338,028 (5)
abstracting: (1<=p8)
states: 299,472 (5)
.abstracting: (1<=p1)
states: 313,344 (5)
abstracting: (1<=p0)
states: 354,501 (5)
abstracting: (1<=p7)
states: 313,344 (5)
abstracting: (1<=p2)
states: 338,028 (5)
abstracting: (1<=p1)
states: 313,344 (5)
abstracting: (1<=p0)
states: 354,501 (5)
abstracting: (1<=p7)
states: 313,344 (5)
abstracting: (1<=p2)
states: 338,028 (5)
.
EG iterations: 1
abstracting: (1<=p6)
states: 354,500 (5)
abstracting: (1<=p5)
states: 313,344 (5)
................................................
EG iterations: 48
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.050sec
checking: AG [E [~ [EF [1<=p7]] U EG [[[EG [[1<=p5 & 1<=p6]] | p8<=0] | [E [1<=p4 U 1<=p8] | A [[1<=p0 & [1<=p1 & 1<=p2]] U 1<=p7]]]]]]
normalized: ~ [E [true U ~ [E [~ [E [true U 1<=p7]] U EG [[[[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [[[1<=p1 & 1<=p2] & 1<=p0]] & ~ [1<=p7]]]]] | E [1<=p4 U 1<=p8]] | [p8<=0 | EG [[1<=p5 & 1<=p6]]]]]]]]]
abstracting: (1<=p6)
states: 354,500 (5)
abstracting: (1<=p5)
states: 313,344 (5)
.
EG iterations: 1
abstracting: (p8<=0)
states: 55,029 (4)
abstracting: (1<=p8)
states: 299,472 (5)
abstracting: (1<=p4)
states: 313,344 (5)
abstracting: (1<=p7)
states: 313,344 (5)
abstracting: (1<=p0)
states: 354,501 (5)
abstracting: (1<=p2)
states: 338,028 (5)
abstracting: (1<=p1)
states: 313,344 (5)
abstracting: (1<=p7)
states: 313,344 (5)
abstracting: (1<=p7)
states: 313,344 (5)
.
EG iterations: 1
EG iterations: 0
abstracting: (1<=p7)
states: 313,344 (5)
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: EF [[EG [[[[p0<=0 | [p2<=0 | p5<=0]] & p8<=0] | 1<=p4]] | [EF [[1<=p4 & 1<=p6]] & [p0<=0 | [p1<=0 | p2<=0]]]]]
normalized: E [true U [[[[p1<=0 | p2<=0] | p0<=0] & E [true U [1<=p4 & 1<=p6]]] | EG [[[[[p2<=0 | p5<=0] | p0<=0] & p8<=0] | 1<=p4]]]]
abstracting: (1<=p4)
states: 313,344 (5)
abstracting: (p8<=0)
states: 55,029 (4)
abstracting: (p0<=0)
states: 0
abstracting: (p5<=0)
states: 41,157 (4)
abstracting: (p2<=0)
states: 16,473 (4)
..
EG iterations: 2
abstracting: (1<=p6)
states: 354,500 (5)
abstracting: (1<=p4)
states: 313,344 (5)
abstracting: (p0<=0)
states: 0
abstracting: (p2<=0)
states: 16,473 (4)
abstracting: (p1<=0)
states: 41,157 (4)
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: EX [[A [[[1<=p5 & 1<=p6] | A [[1<=p7 | [1<=p0 & [1<=p1 & 1<=p2]]] U [1<=p4 | 1<=p7]]] U 1<=p7] & [[AX [[1<=p5 & 1<=p6]] | p0<=0] | [p2<=0 | p5<=0]]]]
normalized: EX [[[[p2<=0 | p5<=0] | [~ [EX [~ [[1<=p5 & 1<=p6]]]] | p0<=0]] & [~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [[[~ [EG [~ [[1<=p4 | 1<=p7]]]] & ~ [E [~ [[1<=p4 | 1<=p7]] U [~ [[[[1<=p1 & 1<=p2] & 1<=p0] | 1<=p7]] & ~ [[1<=p4 | 1<=p7]]]]]] | [1<=p5 & 1<=p6]]] & ~ [1<=p7]]]]]]]
abstracting: (1<=p7)
states: 313,344 (5)
abstracting: (1<=p6)
states: 354,500 (5)
abstracting: (1<=p5)
states: 313,344 (5)
abstracting: (1<=p7)
states: 313,344 (5)
abstracting: (1<=p4)
states: 313,344 (5)
abstracting: (1<=p7)
states: 313,344 (5)
abstracting: (1<=p0)
states: 354,501 (5)
abstracting: (1<=p2)
states: 338,028 (5)
abstracting: (1<=p1)
states: 313,344 (5)
abstracting: (1<=p7)
states: 313,344 (5)
abstracting: (1<=p4)
states: 313,344 (5)
abstracting: (1<=p7)
states: 313,344 (5)
abstracting: (1<=p4)
states: 313,344 (5)
..................
EG iterations: 18
abstracting: (1<=p7)
states: 313,344 (5)
abstracting: (1<=p7)
states: 313,344 (5)
.
EG iterations: 1
abstracting: (p0<=0)
states: 0
abstracting: (1<=p6)
states: 354,500 (5)
abstracting: (1<=p5)
states: 313,344 (5)
.abstracting: (p5<=0)
states: 41,157 (4)
abstracting: (p2<=0)
states: 16,473 (4)
.-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: AX [[EF [[EG [[1<=p5 & 1<=p6]] | [AG [[p0<=0 | [p1<=0 | p2<=0]]] & [1<=p5 & 1<=p6]]]] | [AX [[[p0<=0 | [p1<=0 | p2<=0]] & [[p4<=0 | p6<=0] & [p4<=0 | [p5<=0 | p6<=0]]]]] & AG [EX [p4<=0]]]]]
normalized: ~ [EX [~ [[[~ [E [true U ~ [EX [p4<=0]]]] & ~ [EX [~ [[[[[p5<=0 | p6<=0] | p4<=0] & [p4<=0 | p6<=0]] & [[p1<=0 | p2<=0] | p0<=0]]]]]] | E [true U [[[1<=p5 & 1<=p6] & ~ [E [true U ~ [[[p1<=0 | p2<=0] | p0<=0]]]]] | EG [[1<=p5 & 1<=p6]]]]]]]]
abstracting: (1<=p6)
states: 354,500 (5)
abstracting: (1<=p5)
states: 313,344 (5)
.
EG iterations: 1
abstracting: (p0<=0)
states: 0
abstracting: (p2<=0)
states: 16,473 (4)
abstracting: (p1<=0)
states: 41,157 (4)
abstracting: (1<=p6)
states: 354,500 (5)
abstracting: (1<=p5)
states: 313,344 (5)
abstracting: (p0<=0)
states: 0
abstracting: (p2<=0)
states: 16,473 (4)
abstracting: (p1<=0)
states: 41,157 (4)
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 41,157 (4)
abstracting: (p4<=0)
states: 41,157 (4)
abstracting: (p6<=0)
states: 1
abstracting: (p5<=0)
states: 41,157 (4)
.abstracting: (p4<=0)
states: 41,157 (4)
..-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: [~ [E [EX [EG [[1<=p0 & [1<=p2 & 1<=p5]]]] U ~ [A [p8<=0 U p4<=0]]]] | [E [~ [A [AF [1<=p4] U [[1<=p4 & 1<=p6] | p7<=0]]] U [1<=p0 & [1<=p1 & 1<=p2]]] & AF [AX [A [[[1<=p0 & 1<=p1] & [1<=p2 & [1<=p4 & 1<=p6]]] U ~ [[1<=p5 & 1<=p6]]]]]]]
normalized: [[~ [EG [EX [~ [[~ [EG [[1<=p5 & 1<=p6]]] & ~ [E [[1<=p5 & 1<=p6] U [~ [[[[1<=p4 & 1<=p6] & 1<=p2] & [1<=p0 & 1<=p1]]] & [1<=p5 & 1<=p6]]]]]]]]] & E [~ [[~ [EG [~ [[[1<=p4 & 1<=p6] | p7<=0]]]] & ~ [E [~ [[[1<=p4 & 1<=p6] | p7<=0]] U [EG [~ [1<=p4]] & ~ [[[1<=p4 & 1<=p6] | p7<=0]]]]]]] U [[1<=p1 & 1<=p2] & 1<=p0]]] | ~ [E [EX [EG [[[1<=p2 & 1<=p5] & 1<=p0]]] U ~ [[~ [EG [~ [p4<=0]]] & ~ [E [~ [p4<=0] U [~ [p8<=0] & ~ [p4<=0]]]]]]]]]
abstracting: (p4<=0)
states: 41,157 (4)
abstracting: (p8<=0)
states: 55,029 (4)
abstracting: (p4<=0)
states: 41,157 (4)
abstracting: (p4<=0)
states: 41,157 (4)
.
EG iterations: 1
abstracting: (1<=p0)
states: 354,501 (5)
abstracting: (1<=p5)
states: 313,344 (5)
abstracting: (1<=p2)
states: 338,028 (5)
.
EG iterations: 1
.abstracting: (1<=p0)
states: 354,501 (5)
abstracting: (1<=p2)
states: 338,028 (5)
abstracting: (1<=p1)
states: 313,344 (5)
abstracting: (p7<=0)
states: 41,157 (4)
abstracting: (1<=p6)
states: 354,500 (5)
abstracting: (1<=p4)
states: 313,344 (5)
abstracting: (1<=p4)
states: 313,344 (5)
..................
EG iterations: 18
abstracting: (p7<=0)
states: 41,157 (4)
abstracting: (1<=p6)
states: 354,500 (5)
abstracting: (1<=p4)
states: 313,344 (5)
abstracting: (p7<=0)
states: 41,157 (4)
abstracting: (1<=p6)
states: 354,500 (5)
abstracting: (1<=p4)
states: 313,344 (5)
..................
EG iterations: 18
abstracting: (1<=p6)
states: 354,500 (5)
abstracting: (1<=p5)
states: 313,344 (5)
abstracting: (1<=p1)
states: 313,344 (5)
abstracting: (1<=p0)
states: 354,501 (5)
abstracting: (1<=p2)
states: 338,028 (5)
abstracting: (1<=p6)
states: 354,500 (5)
abstracting: (1<=p4)
states: 313,344 (5)
abstracting: (1<=p6)
states: 354,500 (5)
abstracting: (1<=p5)
states: 313,344 (5)
abstracting: (1<=p6)
states: 354,500 (5)
abstracting: (1<=p5)
states: 313,344 (5)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.028sec
checking: [EX [AX [EF [[[1<=p5 & 1<=p6] & [1<=p0 & [1<=p1 & 1<=p2]]]]]] & [EX [AG [[1<=p0 & [1<=p2 & 1<=p5]]]] & E [[EX [E [[1<=p4 | 1<=p8] U 1<=p3]] | EX [~ [[p4<=0 | p6<=0]]]] U [[AX [[AF [[1<=p5 & 1<=p6]] & EX [[1<=p5 & 1<=p6]]]] & AX [[EG [~ [[p4<=0 | p6<=0]]] & ~ [[1<=p0 & [1<=p1 & 1<=p2]]]]]] & [1<=p4 & 1<=p6]]]]]
normalized: [[E [[EX [~ [[p4<=0 | p6<=0]]] | EX [E [[1<=p4 | 1<=p8] U 1<=p3]]] U [[1<=p4 & 1<=p6] & [~ [EX [~ [[~ [[[1<=p1 & 1<=p2] & 1<=p0]] & EG [~ [[p4<=0 | p6<=0]]]]]]] & ~ [EX [~ [[EX [[1<=p5 & 1<=p6]] & ~ [EG [~ [[1<=p5 & 1<=p6]]]]]]]]]]] & EX [~ [E [true U ~ [[[1<=p2 & 1<=p5] & 1<=p0]]]]]] & EX [~ [EX [~ [E [true U [[[1<=p1 & 1<=p2] & 1<=p0] & [1<=p5 & 1<=p6]]]]]]]]
abstracting: (1<=p6)
states: 354,500 (5)
abstracting: (1<=p5)
states: 313,344 (5)
abstracting: (1<=p0)
states: 354,501 (5)
abstracting: (1<=p2)
states: 338,028 (5)
abstracting: (1<=p1)
states: 313,344 (5)
..abstracting: (1<=p0)
states: 354,501 (5)
abstracting: (1<=p5)
states: 313,344 (5)
abstracting: (1<=p2)
states: 338,028 (5)
.abstracting: (1<=p6)
states: 354,500 (5)
abstracting: (1<=p5)
states: 313,344 (5)
..
EG iterations: 2
abstracting: (1<=p6)
states: 354,500 (5)
abstracting: (1<=p5)
states: 313,344 (5)
..abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 41,157 (4)
.
EG iterations: 1
abstracting: (1<=p0)
states: 354,501 (5)
abstracting: (1<=p2)
states: 338,028 (5)
abstracting: (1<=p1)
states: 313,344 (5)
.abstracting: (1<=p6)
states: 354,500 (5)
abstracting: (1<=p4)
states: 313,344 (5)
abstracting: (1<=p3)
states: 299,472 (5)
abstracting: (1<=p8)
states: 299,472 (5)
abstracting: (1<=p4)
states: 313,344 (5)
.abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 41,157 (4)
.-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.045sec
totally nodes used: 41307 (4.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 851584 131081 982665
used/not used/entry size/cache size: 146904 66961960 16 1024MB
basic ops cache: hits/miss/sum: 253259 41826 295085
used/not used/entry size/cache size: 81413 16695803 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: 13388 1741 15129
used/not used/entry size/cache size: 1741 8386867 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 67072602
1 33983
2 1439
3 507
4 196
5 25
6 34
7 4
8 1
9 1
>= 10 72
Total processing time: 0m 6.064sec
BK_STOP 1679231218428
--------------------
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:568 (71), effective:144 (18)
initing FirstDep: 0m 0.000sec
iterations count:23 (2), effective:5 (0)
iterations count:40 (5), effective:10 (1)
iterations count:136 (17), effective:32 (4)
iterations count:132 (16), effective:31 (3)
iterations count:136 (17), effective:32 (4)
iterations count:244 (30), effective:95 (11)
iterations count:26 (3), effective:6 (0)
iterations count:56 (7), effective:16 (2)
iterations count:25 (3), effective:5 (0)
iterations count:8 (1), effective:0 (0)
iterations count:23 (2), effective:5 (0)
iterations count:14 (1), effective:3 (0)
iterations count:56 (7), effective:16 (2)
iterations count:344 (43), effective:96 (12)
iterations count:27 (3), effective:7 (0)
iterations count:24 (3), effective:5 (0)
iterations count:38 (4), effective:10 (1)
iterations count:26 (3), effective:6 (0)
iterations count:23 (2), effective:5 (0)
iterations count:8 (1), effective:0 (0)
iterations count:11 (1), effective:2 (0)
iterations count:56 (7), effective:16 (2)
iterations count:43 (5), effective:12 (1)
iterations count:200 (25), effective:48 (6)
iterations count:30 (3), effective:6 (0)
iterations count:400 (50), effective:123 (15)
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="SmallOperatingSystem-PT-MT0032DC0016"
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 SmallOperatingSystem-PT-MT0032DC0016, 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 r458-smll-167912649700018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT0032DC0016.tgz
mv SmallOperatingSystem-PT-MT0032DC0016 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 '
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 ;