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.r330-tall-167889203600689.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 ResAllocation-PT-R003C010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203600689
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.8K Feb 25 15:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 15:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 15:31 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.1K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Feb 25 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 71K 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 ResAllocation-PT-R003C010-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679180781882

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:06:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 23:06:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:06:23] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-18 23:06:23] [INFO ] Transformed 60 places.
[2023-03-18 23:06:23] [INFO ] Transformed 40 transitions.
[2023-03-18 23:06:23] [INFO ] Parsed PT model containing 60 places and 40 transitions and 174 arcs in 103 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
FORMULA ResAllocation-PT-R003C010-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 10 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 60 cols
[2023-03-18 23:06:23] [INFO ] Computed 30 place invariants in 6 ms
[2023-03-18 23:06:23] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-18 23:06:23] [INFO ] Invariant cache hit.
[2023-03-18 23:06:23] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2023-03-18 23:06:23] [INFO ] Invariant cache hit.
[2023-03-18 23:06:23] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 60/60 places, 40/40 transitions.
Support contains 53 out of 60 places after structural reductions.
[2023-03-18 23:06:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 23:06:24] [INFO ] Flatten gal took : 22 ms
FORMULA ResAllocation-PT-R003C010-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:06:24] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:06:24] [INFO ] Input system was already deterministic with 40 transitions.
Incomplete random walk after 10000 steps, including 433 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 65) seen :58
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 23:06:24] [INFO ] Invariant cache hit.
[2023-03-18 23:06:25] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2023-03-18 23:06:25] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:4
[2023-03-18 23:06:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 6 ms returned sat
[2023-03-18 23:06:25] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
[2023-03-18 23:06:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 6 ms
FORMULA ResAllocation-PT-R003C010-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:06:25] [INFO ] Input system was already deterministic with 40 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 60/60 places, 40/40 transitions.
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:06:25] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 40/40 transitions.
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 60/60 places, 40/40 transitions.
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:06:25] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 60/60 places, 40/40 transitions.
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 60/60 places, 40/40 transitions.
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 40/40 transitions.
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 60/60 places, 40/40 transitions.
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 40/40 transitions.
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:06:25] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 60/60 places, 40/40 transitions.
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 40/40 transitions.
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 40/40 transitions.
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 50 transition count 31
Applied a total of 19 rules in 10 ms. Remains 50 /60 variables (removed 10) and now considering 31/40 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 50/60 places, 31/40 transitions.
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 60/60 places, 40/40 transitions.
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Input system was already deterministic with 40 transitions.
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:06:25] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:06:25] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-18 23:06:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 60 places, 40 transitions and 174 arcs took 1 ms.
Total runtime 1951 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 60 NrTr: 40 NrArc: 174)

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

net check time: 0m 0.000sec

init dd package: 0m 2.691sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 376 (3.8e+02) #states 823,552 (5)



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

checking: EF [EG [AX [~ [p31<=0]]]]
normalized: E [true U EG [~ [EX [p31<=0]]]]

abstracting: (p31<=0)
states: 418,304 (5)
...
EG iterations: 2
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: AX [1<=p47]
normalized: ~ [EX [~ [1<=p47]]]

abstracting: (1<=p47)
states: 417,664 (5)
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [AX [AX [AF [1<=p12]]]]
normalized: ~ [EG [EX [EX [EG [~ [1<=p12]]]]]]

abstracting: (1<=p12)
states: 340,864 (5)
...............
EG iterations: 15
...
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: EG [EG [p8<=p47]]
normalized: EG [EG [p8<=p47]]

abstracting: (p8<=p47)
states: 752,320 (5)
.............
EG iterations: 13
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EG [E [EX [[1<=p5 | p53<=0]] U p18<=0]]
normalized: EG [E [EX [[1<=p5 | p53<=0]] U p18<=0]]

abstracting: (p18<=0)
states: 727,552 (5)
abstracting: (p53<=0)
states: 444,288 (5)
abstracting: (1<=p5)
states: 326,784 (5)
.
EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [A [p25<=p6 U [1<=p26 | AG [p34<=p56]]] | [EX [0<=0] | AF [AG [1<=p57]]]]
normalized: [[~ [EG [E [true U ~ [1<=p57]]]] | EX [0<=0]] | [~ [EG [~ [[1<=p26 | ~ [E [true U ~ [p34<=p56]]]]]]] & ~ [E [~ [[1<=p26 | ~ [E [true U ~ [p34<=p56]]]]] U [~ [p25<=p6] & ~ [[1<=p26 | ~ [E [true U ~ [p34<=p56]]]]]]]]]]

abstracting: (p34<=p56)
states: 632,320 (5)
abstracting: (1<=p26)
states: 216,448 (5)
abstracting: (p25<=p6)
states: 467,712 (5)
abstracting: (p34<=p56)
states: 632,320 (5)
abstracting: (1<=p26)
states: 216,448 (5)
abstracting: (p34<=p56)
states: 632,320 (5)
abstracting: (1<=p26)
states: 216,448 (5)
...............
EG iterations: 15
abstracting: (0<=0)
states: 823,552 (5)
.abstracting: (1<=p57)
states: 499,712 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: EF [AG [[[AX [~ [p49<=0]] & 1<=p52] & [~ [1<=p0] & [~ [p33<=p48] & ~ [p9<=0]]]]]]
normalized: E [true U ~ [E [true U ~ [[[[~ [p9<=0] & ~ [p33<=p48]] & ~ [1<=p0]] & [1<=p52 & ~ [EX [p49<=0]]]]]]]]

abstracting: (p49<=0)
states: 496,768 (5)
.abstracting: (1<=p52)
states: 65,024 (4)
abstracting: (1<=p0)
states: 379,264 (5)
abstracting: (p33<=p48)
states: 532,736 (5)
abstracting: (p9<=0)
states: 389,632 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EX [EF [[[EF [1<=p32] & ~ [p2<=0]] & [p31<=0 & [1<=p59 & [~ [p27<=p31] | ~ [p57<=0]]]]]]]
normalized: EX [E [true U [[p31<=0 & [1<=p59 & [~ [p57<=0] | ~ [p27<=p31]]]] & [~ [p2<=0] & E [true U 1<=p32]]]]]

abstracting: (1<=p32)
states: 216,448 (5)
abstracting: (p2<=0)
states: 499,712 (5)
abstracting: (p27<=p31)
states: 620,096 (5)
abstracting: (p57<=0)
states: 323,840 (5)
abstracting: (1<=p59)
states: 444,288 (5)
abstracting: (p31<=0)
states: 418,304 (5)
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: AX [[EG [[~ [p58<=0] | 1<=p37]] | [AX [p27<=p31] | [A [~ [1<=p59] U [[p36<=p27 & p59<=p42] | A [1<=p17 U 1<=p26]]] & EF [~ [1<=p18]]]]]]
normalized: ~ [EX [~ [[[[E [true U ~ [1<=p18]] & [~ [EG [~ [[[~ [EG [~ [1<=p26]]] & ~ [E [~ [1<=p26] U [~ [1<=p17] & ~ [1<=p26]]]]] | [p36<=p27 & p59<=p42]]]]] & ~ [E [~ [[[~ [EG [~ [1<=p26]]] & ~ [E [~ [1<=p26] U [~ [1<=p17] & ~ [1<=p26]]]]] | [p36<=p27 & p59<=p42]]] U [1<=p59 & ~ [[[~ [EG [~ [1<=p26]]] & ~ [E [~ [1<=p26] U [~ [1<=p17] & ~ [1<=p26]]]]] | [p36<=p27 & p59<=p42]]]]]]]] | ~ [EX [~ [p27<=p31]]]] | EG [[1<=p37 | ~ [p58<=0]]]]]]]

abstracting: (p58<=0)
states: 444,288 (5)
abstracting: (1<=p37)
states: 379,392 (5)
..............
EG iterations: 14
abstracting: (p27<=p31)
states: 620,096 (5)
.abstracting: (p59<=p42)
states: 448,128 (5)
abstracting: (p36<=p27)
states: 664,640 (5)
abstracting: (1<=p26)
states: 216,448 (5)
abstracting: (1<=p17)
states: 379,392 (5)
abstracting: (1<=p26)
states: 216,448 (5)
abstracting: (1<=p26)
states: 216,448 (5)
..............
EG iterations: 14
abstracting: (1<=p59)
states: 444,288 (5)
abstracting: (p59<=p42)
states: 448,128 (5)
abstracting: (p36<=p27)
states: 664,640 (5)
abstracting: (1<=p26)
states: 216,448 (5)
abstracting: (1<=p17)
states: 379,392 (5)
abstracting: (1<=p26)
states: 216,448 (5)
abstracting: (1<=p26)
states: 216,448 (5)
..............
EG iterations: 14
abstracting: (p59<=p42)
states: 448,128 (5)
abstracting: (p36<=p27)
states: 664,640 (5)
abstracting: (1<=p26)
states: 216,448 (5)
abstracting: (1<=p17)
states: 379,392 (5)
abstracting: (1<=p26)
states: 216,448 (5)
abstracting: (1<=p26)
states: 216,448 (5)
..............
EG iterations: 14
..................
EG iterations: 18
abstracting: (1<=p18)
states: 96,000 (4)
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

checking: [EX [~ [1<=p1]] | [AG [p33<=p51] | AF [~ [A [AF [1<=p21] U [[AX [p16<=p13] | [1<=p0 & p17<=p21]] | [~ [p40<=1] | [p44<=p11 | p35<=p40]]]]]]]]
normalized: [[~ [EG [[~ [EG [~ [[[[p44<=p11 | p35<=p40] | ~ [p40<=1]] | [[1<=p0 & p17<=p21] | ~ [EX [~ [p16<=p13]]]]]]]] & ~ [E [~ [[[[p44<=p11 | p35<=p40] | ~ [p40<=1]] | [[1<=p0 & p17<=p21] | ~ [EX [~ [p16<=p13]]]]]] U [EG [~ [1<=p21]] & ~ [[[[p44<=p11 | p35<=p40] | ~ [p40<=1]] | [[1<=p0 & p17<=p21] | ~ [EX [~ [p16<=p13]]]]]]]]]]]] | ~ [E [true U ~ [p33<=p51]]]] | EX [~ [1<=p1]]]

abstracting: (1<=p1)
states: 379,264 (5)
.abstracting: (p33<=p51)
states: 593,664 (5)
abstracting: (p16<=p13)
states: 754,688 (5)
.abstracting: (p17<=p21)
states: 626,560 (5)
abstracting: (1<=p0)
states: 379,264 (5)
abstracting: (p40<=1)
states: 823,552 (5)
abstracting: (p35<=p40)
states: 418,560 (5)
abstracting: (p44<=p11)
states: 707,072 (5)
abstracting: (1<=p21)
states: 412,800 (5)
.
EG iterations: 1
abstracting: (p16<=p13)
states: 754,688 (5)
.abstracting: (p17<=p21)
states: 626,560 (5)
abstracting: (1<=p0)
states: 379,264 (5)
abstracting: (p40<=1)
states: 823,552 (5)
abstracting: (p35<=p40)
states: 418,560 (5)
abstracting: (p44<=p11)
states: 707,072 (5)
abstracting: (p16<=p13)
states: 754,688 (5)
.abstracting: (p17<=p21)
states: 626,560 (5)
abstracting: (1<=p0)
states: 379,264 (5)
abstracting: (p40<=1)
states: 823,552 (5)
abstracting: (p35<=p40)
states: 418,560 (5)
abstracting: (p44<=p11)
states: 707,072 (5)
.............
EG iterations: 13
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: AF [[AF [~ [p4<=p41]] | [EF [[EX [~ [1<=p53]] & AG [~ [p45<=p19]]]] | [~ [A [[1<=p25 | 1<=p2] U AF [p8<=p41]]] & [~ [1<=p5] & [~ [p37<=p38] | [~ [p15<=0] | [~ [1<=p22] & ~ [1<=p55]]]]]]]]]
normalized: ~ [EG [~ [[[[[[[[~ [1<=p55] & ~ [1<=p22]] | ~ [p15<=0]] | ~ [p37<=p38]] & ~ [1<=p5]] & ~ [[~ [EG [EG [~ [p8<=p41]]]] & ~ [E [EG [~ [p8<=p41]] U [~ [[1<=p25 | 1<=p2]] & EG [~ [p8<=p41]]]]]]]] | E [true U [~ [E [true U p45<=p19]] & EX [~ [1<=p53]]]]] | ~ [EG [p4<=p41]]]]]]

abstracting: (p4<=p41)
states: 696,064 (5)
.
EG iterations: 1
abstracting: (1<=p53)
states: 379,264 (5)
.abstracting: (p45<=p19)
states: 601,408 (5)
abstracting: (p8<=p41)
states: 748,480 (5)
.............
EG iterations: 13
abstracting: (1<=p2)
states: 323,840 (5)
abstracting: (1<=p25)
states: 389,120 (5)
abstracting: (p8<=p41)
states: 748,480 (5)
.............
EG iterations: 13
abstracting: (p8<=p41)
states: 748,480 (5)
.............
EG iterations: 13
.
EG iterations: 1
abstracting: (1<=p5)
states: 326,784 (5)
abstracting: (p37<=p38)
states: 541,312 (5)
abstracting: (p15<=0)
states: 440,576 (5)
abstracting: (1<=p22)
states: 306,432 (5)
abstracting: (1<=p55)
states: 584,704 (5)
..........
EG iterations: 10
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.065sec

checking: E [[EF [~ [[EG [1<=p24] & [~ [1<=p7] & [p40<=p34 | [1<=p24 & 1<=p42]]]]]] & [~ [p12<=p15] | E [EG [[1<=p52 | p51<=p53]] U [AG [1<=p47] & p55<=0]]]] U AG [AX [~ [EF [p10<=p31]]]]]
normalized: E [[[E [EG [[1<=p52 | p51<=p53]] U [p55<=0 & ~ [E [true U ~ [1<=p47]]]]] | ~ [p12<=p15]] & E [true U ~ [[[[p40<=p34 | [1<=p24 & 1<=p42]] & ~ [1<=p7]] & EG [1<=p24]]]]] U ~ [E [true U EX [E [true U p10<=p31]]]]]

abstracting: (p10<=p31)
states: 690,944 (5)
.abstracting: (1<=p24)
states: 322,560 (5)
.............
EG iterations: 13
abstracting: (1<=p7)
states: 417,664 (5)
abstracting: (1<=p42)
states: 137,728 (5)
abstracting: (1<=p24)
states: 322,560 (5)
abstracting: (p40<=p34)
states: 727,552 (5)
abstracting: (p12<=p15)
states: 635,392 (5)
abstracting: (1<=p47)
states: 417,664 (5)
abstracting: (p55<=0)
states: 238,848 (5)
abstracting: (p51<=p53)
states: 629,120 (5)
abstracting: (1<=p52)
states: 65,024 (4)
..............
EG iterations: 14
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.072sec

checking: A [[p33<=p28 & [p24<=p31 & [EG [AF [p41<=p17]] | [[AG [[1<=p0 | 1<=p42]] & [AF [p16<=p48] & 1<=p43]] & [AG [p11<=0] & [AF [p7<=p31] & E [AF [1<=p42] U AX [p25<=0]]]]]]]] U E [A [EG [p3<=0] U [EX [p22<=p24] & [1<=p39 & [1<=p14 | p1<=1]]]] U EX [[p43<=1 & [[1<=p9 & p47<=1] | [p53<=1 & p26<=p32]]]]]]
normalized: [~ [EG [~ [E [[~ [EG [~ [[[[1<=p14 | p1<=1] & 1<=p39] & EX [p22<=p24]]]]] & ~ [E [~ [[[[1<=p14 | p1<=1] & 1<=p39] & EX [p22<=p24]]] U [~ [EG [p3<=0]] & ~ [[[[1<=p14 | p1<=1] & 1<=p39] & EX [p22<=p24]]]]]]] U EX [[[[p53<=1 & p26<=p32] | [1<=p9 & p47<=1]] & p43<=1]]]]]] & ~ [E [~ [E [[~ [EG [~ [[[[1<=p14 | p1<=1] & 1<=p39] & EX [p22<=p24]]]]] & ~ [E [~ [[[[1<=p14 | p1<=1] & 1<=p39] & EX [p22<=p24]]] U [~ [EG [p3<=0]] & ~ [[[[1<=p14 | p1<=1] & 1<=p39] & EX [p22<=p24]]]]]]] U EX [[[[p53<=1 & p26<=p32] | [1<=p9 & p47<=1]] & p43<=1]]]] U [~ [[p33<=p28 & [p24<=p31 & [[[~ [E [true U ~ [[1<=p0 | 1<=p42]]]] & [1<=p43 & ~ [EG [~ [p16<=p48]]]]] & [~ [E [true U ~ [p11<=0]]] & [E [~ [EG [~ [1<=p42]]] U ~ [EX [~ [p25<=0]]]] & ~ [EG [~ [p7<=p31]]]]]] | EG [~ [EG [~ [p41<=p17]]]]]]]] & ~ [E [[~ [EG [~ [[[[1<=p14 | p1<=1] & 1<=p39] & EX [p22<=p24]]]]] & ~ [E [~ [[[[1<=p14 | p1<=1] & 1<=p39] & EX [p22<=p24]]] U [~ [EG [p3<=0]] & ~ [[[[1<=p14 | p1<=1] & 1<=p39] & EX [p22<=p24]]]]]]] U EX [[[[p53<=1 & p26<=p32] | [1<=p9 & p47<=1]] & p43<=1]]]]]]]]

abstracting: (p43<=1)
states: 823,552 (5)
abstracting: (p47<=1)
states: 823,552 (5)
abstracting: (1<=p9)
states: 433,920 (5)
abstracting: (p26<=p32)
states: 607,104 (5)
abstracting: (p53<=1)
states: 823,552 (5)
.abstracting: (p22<=p24)
states: 628,672 (5)
.abstracting: (1<=p39)
states: 382,976 (5)
abstracting: (p1<=1)
states: 823,552 (5)
abstracting: (1<=p14)
states: 246,272 (5)
abstracting: (p3<=0)
states: 467,200 (5)
.
EG iterations: 1
abstracting: (p22<=p24)
states: 628,672 (5)
.abstracting: (1<=p39)
states: 382,976 (5)
abstracting: (p1<=1)
states: 823,552 (5)
abstracting: (1<=p14)
states: 246,272 (5)
abstracting: (p22<=p24)
states: 628,672 (5)
.abstracting: (1<=p39)
states: 382,976 (5)
abstracting: (p1<=1)
states: 823,552 (5)
abstracting: (1<=p14)
states: 246,272 (5)
...........
EG iterations: 11
abstracting: (p41<=p17)
states: 613,376 (5)
..................
EG iterations: 18
.
EG iterations: 1
abstracting: (p7<=p31)
states: 608,640 (5)
..................
EG iterations: 18
abstracting: (p25<=0)
states: 434,432 (5)
.abstracting: (1<=p42)
states: 137,728 (5)
.
EG iterations: 1
abstracting: (p11<=0)
states: 395,648 (5)
abstracting: (p16<=p48)
states: 730,112 (5)
.
EG iterations: 1
abstracting: (1<=p43)
states: 427,904 (5)
abstracting: (1<=p42)
states: 137,728 (5)
abstracting: (1<=p0)
states: 379,264 (5)
abstracting: (p24<=p31)
states: 684,416 (5)
abstracting: (p33<=p28)
states: 481,408 (5)
abstracting: (p43<=1)
states: 823,552 (5)
abstracting: (p47<=1)
states: 823,552 (5)
abstracting: (1<=p9)
states: 433,920 (5)
abstracting: (p26<=p32)
states: 607,104 (5)
abstracting: (p53<=1)
states: 823,552 (5)
.abstracting: (p22<=p24)
states: 628,672 (5)
.abstracting: (1<=p39)
states: 382,976 (5)
abstracting: (p1<=1)
states: 823,552 (5)
abstracting: (1<=p14)
states: 246,272 (5)
abstracting: (p3<=0)
states: 467,200 (5)
.
EG iterations: 1
abstracting: (p22<=p24)
states: 628,672 (5)
.abstracting: (1<=p39)
states: 382,976 (5)
abstracting: (p1<=1)
states: 823,552 (5)
abstracting: (1<=p14)
states: 246,272 (5)
abstracting: (p22<=p24)
states: 628,672 (5)
.abstracting: (1<=p39)
states: 382,976 (5)
abstracting: (p1<=1)
states: 823,552 (5)
abstracting: (1<=p14)
states: 246,272 (5)
...........
EG iterations: 11
abstracting: (p43<=1)
states: 823,552 (5)
abstracting: (p47<=1)
states: 823,552 (5)
abstracting: (1<=p9)
states: 433,920 (5)
abstracting: (p26<=p32)
states: 607,104 (5)
abstracting: (p53<=1)
states: 823,552 (5)
.abstracting: (p22<=p24)
states: 628,672 (5)
.abstracting: (1<=p39)
states: 382,976 (5)
abstracting: (p1<=1)
states: 823,552 (5)
abstracting: (1<=p14)
states: 246,272 (5)
abstracting: (p3<=0)
states: 467,200 (5)
.
EG iterations: 1
abstracting: (p22<=p24)
states: 628,672 (5)
.abstracting: (1<=p39)
states: 382,976 (5)
abstracting: (p1<=1)
states: 823,552 (5)
abstracting: (1<=p14)
states: 246,272 (5)
abstracting: (p22<=p24)
states: 628,672 (5)
.abstracting: (1<=p39)
states: 382,976 (5)
abstracting: (p1<=1)
states: 823,552 (5)
abstracting: (1<=p14)
states: 246,272 (5)
...........
EG iterations: 11
............
EG iterations: 12
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.142sec

totally nodes used: 689910 (6.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 237261 1074862 1312123
used/not used/entry size/cache size: 1645063 65463801 16 1024MB
basic ops cache: hits/miss/sum: 71999 293804 365803
used/not used/entry size/cache size: 589099 16188117 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: 2241 10981 13222
used/not used/entry size/cache size: 10977 8377631 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 66466980
1 599255
2 37780
3 4338
4 476
5 33
6 2
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.853sec


BK_STOP 1679180791270

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLCardinality -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:306 (7), effective:60 (1)

initing FirstDep: 0m 0.000sec


iterations count:436 (10), effective:73 (1)

iterations count:47 (1), effective:1 (0)

iterations count:70 (1), effective:5 (0)

iterations count:70 (1), effective:5 (0)

iterations count:51 (1), effective:2 (0)

iterations count:70 (1), effective:5 (0)

iterations count:75 (1), effective:5 (0)

iterations count:40 (1), effective:0 (0)

iterations count:94 (2), effective:8 (0)

iterations count:179 (4), effective:24 (0)

iterations count:98 (2), effective:11 (0)

iterations count:98 (2), effective:11 (0)

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

iterations count:98 (2), effective:11 (0)

iterations count:47 (1), effective:1 (0)

iterations count:117 (2), effective:12 (0)

iterations count:70 (1), effective:5 (0)

iterations count:122 (3), effective:14 (0)

iterations count:241 (6), effective:32 (0)

iterations count:93 (2), effective:8 (0)

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

iterations count:40 (1), effective:0 (0)

iterations count:151 (3), effective:18 (0)

iterations count:51 (1), effective:2 (0)

iterations count:206 (5), effective:31 (0)

iterations count:53 (1), effective:4 (0)

iterations count:62 (1), effective:3 (0)

iterations count:102 (2), effective:10 (0)

iterations count:64 (1), effective:4 (0)

iterations count:54 (1), effective:4 (0)

iterations count:53 (1), effective:4 (0)

iterations count:62 (1), effective:3 (0)

iterations count:56 (1), effective:4 (0)

iterations count:53 (1), effective:4 (0)

iterations count:62 (1), effective:3 (0)

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="ResAllocation-PT-R003C010"
export BK_EXAMINATION="CTLCardinality"
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 ResAllocation-PT-R003C010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889203600689"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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