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.r522-tall-167987247400433.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 PGCD-PT-D02N005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247400433
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.2K Mar 23 15:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 23 15:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 23 15:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 23 15:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 19K Mar 23 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 220K Mar 23 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 23 15:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Mar 23 15:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 5.6K Mar 31 16:48 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 PGCD-PT-D02N005-CTLCardinality-00
FORMULA_NAME PGCD-PT-D02N005-CTLCardinality-01
FORMULA_NAME PGCD-PT-D02N005-CTLCardinality-02
FORMULA_NAME PGCD-PT-D02N005-CTLCardinality-03
FORMULA_NAME PGCD-PT-D02N005-CTLCardinality-04
FORMULA_NAME PGCD-PT-D02N005-CTLCardinality-05
FORMULA_NAME PGCD-PT-D02N005-CTLCardinality-06
FORMULA_NAME PGCD-PT-D02N005-CTLCardinality-07
FORMULA_NAME PGCD-PT-D02N005-CTLCardinality-08
FORMULA_NAME PGCD-PT-D02N005-CTLCardinality-09
FORMULA_NAME PGCD-PT-D02N005-CTLCardinality-10
FORMULA_NAME PGCD-PT-D02N005-CTLCardinality-11
FORMULA_NAME PGCD-PT-D02N005-CTLCardinality-12
FORMULA_NAME PGCD-PT-D02N005-CTLCardinality-13
FORMULA_NAME PGCD-PT-D02N005-CTLCardinality-14
FORMULA_NAME PGCD-PT-D02N005-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680818068714

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=PGCD-PT-D02N005
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 21:54:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-06 21:54:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 21:54:30] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-04-06 21:54:30] [INFO ] Transformed 9 places.
[2023-04-06 21:54:30] [INFO ] Transformed 9 transitions.
[2023-04-06 21:54:30] [INFO ] Parsed PT model containing 9 places and 9 transitions and 42 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PGCD-PT-D02N005-CTLCardinality-14 TRUE 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, 9/9 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-04-06 21:54:30] [INFO ] Computed 4 invariants in 10 ms
[2023-04-06 21:54:30] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
[2023-04-06 21:54:30] [INFO ] Invariant cache hit.
[2023-04-06 21:54:30] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-06 21:54:30] [INFO ] Invariant cache hit.
[2023-04-06 21:54:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 21:54:30] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-06 21:54:30] [INFO ] Invariant cache hit.
[2023-04-06 21:54:30] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 9/9 places, 9/9 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-04-06 21:54:30] [INFO ] Flatten gal took : 12 ms
[2023-04-06 21:54:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-06 21:54:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PGCD-PT-D02N005-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-PT-D02N005-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-06 21:54:30] [INFO ] Flatten gal took : 3 ms
[2023-04-06 21:54:30] [INFO ] Input system was already deterministic with 9 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 68) seen :66
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-06 21:54:30] [INFO ] Invariant cache hit.
[2023-04-06 21:54:30] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 21:54:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-04-06 21:54:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-06 21:54:30] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2023-04-06 21:54:30] [INFO ] Flatten gal took : 4 ms
[2023-04-06 21:54:30] [INFO ] Flatten gal took : 3 ms
[2023-04-06 21:54:30] [INFO ] Input system was already deterministic with 9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:54:30] [INFO ] Invariant cache hit.
[2023-04-06 21:54:31] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:54:31] [INFO ] Invariant cache hit.
[2023-04-06 21:54:31] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:54:31] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:54:31] [INFO ] Invariant cache hit.
[2023-04-06 21:54:31] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:54:31] [INFO ] Invariant cache hit.
[2023-04-06 21:54:31] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:54:31] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:54:31] [INFO ] Invariant cache hit.
[2023-04-06 21:54:31] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:54:31] [INFO ] Invariant cache hit.
[2023-04-06 21:54:31] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 4 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:54:31] [INFO ] Invariant cache hit.
[2023-04-06 21:54:31] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Input system was already deterministic with 9 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
FORMULA PGCD-PT-D02N005-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:54:31] [INFO ] Invariant cache hit.
[2023-04-06 21:54:31] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 0 ms
[2023-04-06 21:54:31] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:54:31] [INFO ] Invariant cache hit.
[2023-04-06 21:54:31] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:54:31] [INFO ] Invariant cache hit.
[2023-04-06 21:54:31] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:54:31] [INFO ] Invariant cache hit.
[2023-04-06 21:54:31] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:54:31] [INFO ] Invariant cache hit.
[2023-04-06 21:54:31] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:54:31] [INFO ] Invariant cache hit.
[2023-04-06 21:54:31] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Input system was already deterministic with 9 transitions.
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:54:31] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:31] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-04-06 21:54:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 9 transitions and 42 arcs took 0 ms.
Total runtime 1286 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: 9 NrTr: 9 NrArc: 42)

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

net check time: 0m 0.000sec

init dd package: 0m 2.740sec


RS generation: 0m 0.004sec


-> reachability set: #nodes 377 (3.8e+02) #states 8,484 (3)



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

checking: AG [EF [EX [~ [p5<=3]]]]
normalized: ~ [E [true U ~ [E [true U EX [~ [p5<=3]]]]]]

abstracting: (p5<=3)
states: 5,558 (3)
.-> the formula is FALSE

FORMULA PGCD-PT-D02N005-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EX [~ [4<=p4]]
normalized: EX [~ [4<=p4]]

abstracting: (4<=p4)
states: 2,926 (3)
.-> the formula is FALSE

FORMULA PGCD-PT-D02N005-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [AX [~ [p0<=p7]]]
normalized: EX [~ [EX [p0<=p7]]]

abstracting: (p0<=p7)
states: 4,710 (3)
..-> the formula is FALSE

FORMULA PGCD-PT-D02N005-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [~ [E [[~ [AG [5<=p7]] | ~ [EG [p1<=5]]] U AX [p1<=1]]]]
normalized: E [true U ~ [E [[~ [EG [p1<=5]] | E [true U ~ [5<=p7]]] U ~ [EX [~ [p1<=1]]]]]]

abstracting: (p1<=1)
states: 3,192 (3)
.abstracting: (5<=p7)
states: 2,184 (3)
abstracting: (p1<=5)
states: 6,832 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PGCD-PT-D02N005-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AX [AF [[~ [A [p3<=2 U p4<=p2]] & EG [~ [4<=p4]]]]]
normalized: ~ [EX [EG [~ [[EG [~ [4<=p4]] & ~ [[~ [EG [~ [p4<=p2]]] & ~ [E [~ [p4<=p2] U [~ [p3<=2] & ~ [p4<=p2]]]]]]]]]]]

abstracting: (p4<=p2)
states: 4,833 (3)
abstracting: (p3<=2)
states: 4,690 (3)
abstracting: (p4<=p2)
states: 4,833 (3)
abstracting: (p4<=p2)
states: 4,833 (3)
..
EG iterations: 2
abstracting: (4<=p4)
states: 2,926 (3)
.
EG iterations: 1
...
EG iterations: 3
.-> the formula is FALSE

FORMULA PGCD-PT-D02N005-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EX [[AF [~ [p7<=0]] & [AX [AF [p2<=p5]] | [AG [~ [3<=p1]] & [~ [p5<=4] | ~ [p2<=2]]]]]]
normalized: EX [[[[[~ [p2<=2] | ~ [p5<=4]] & ~ [E [true U 3<=p1]]] | ~ [EX [EG [~ [p2<=p5]]]]] & ~ [EG [p7<=0]]]]

abstracting: (p7<=0)
states: 1,872 (3)
.
EG iterations: 1
abstracting: (p2<=p5)
states: 5,160 (3)
.
EG iterations: 1
.abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (p5<=4)
states: 6,410 (3)
abstracting: (p2<=2)
states: 4,548 (3)
.-> the formula is TRUE

FORMULA PGCD-PT-D02N005-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [A [[AG [EF [p5<=p4]] | [EF [[AF [4<=p4] | ~ [p6<=0]]] | EF [[p4<=0 | EG [p2<=2]]]]] U 5<=p7] & AG [~ [p5<=3]]]
normalized: [~ [E [true U p5<=3]] & [~ [EG [~ [5<=p7]]] & ~ [E [~ [5<=p7] U [~ [[[E [true U [EG [p2<=2] | p4<=0]] | E [true U [~ [p6<=0] | ~ [EG [~ [4<=p4]]]]]] | ~ [E [true U ~ [E [true U p5<=p4]]]]]] & ~ [5<=p7]]]]]]

abstracting: (5<=p7)
states: 2,184 (3)
abstracting: (p5<=p4)
states: 4,758 (3)
abstracting: (4<=p4)
states: 2,926 (3)
.
EG iterations: 1
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p2<=2)
states: 4,548 (3)
.
EG iterations: 1
abstracting: (5<=p7)
states: 2,184 (3)
abstracting: (5<=p7)
states: 2,184 (3)
.
EG iterations: 1
abstracting: (p5<=3)
states: 5,558 (3)
-> the formula is FALSE

FORMULA PGCD-PT-D02N005-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EX [[EX [[A [~ [p1<=p2] U [3<=p7 | p3<=5]] | EF [2<=p3]]] & [EX [[AG [3<=p4] | [p6<=p0 & ~ [5<=p8]]]] | [1<=p2 & AG [5<=p6]]]]]
normalized: EX [[[[~ [E [true U ~ [5<=p6]]] & 1<=p2] | EX [[[~ [5<=p8] & p6<=p0] | ~ [E [true U ~ [3<=p4]]]]]] & EX [[E [true U 2<=p3] | [~ [EG [~ [[3<=p7 | p3<=5]]]] & ~ [E [~ [[3<=p7 | p3<=5]] U [~ [[3<=p7 | p3<=5]] & p1<=p2]]]]]]]]

abstracting: (p1<=p2)
states: 4,710 (3)
abstracting: (p3<=5)
states: 6,935 (3)
abstracting: (3<=p7)
states: 3,936 (3)
abstracting: (p3<=5)
states: 6,935 (3)
abstracting: (3<=p7)
states: 3,936 (3)
abstracting: (p3<=5)
states: 6,935 (3)
abstracting: (3<=p7)
states: 3,936 (3)
...
EG iterations: 3
abstracting: (2<=p3)
states: 5,132 (3)
.abstracting: (3<=p4)
states: 3,794 (3)
abstracting: (p6<=p0)
states: 8,484 (3)
abstracting: (5<=p8)
states: 2,184 (3)
.abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (5<=p6)
states: 2,184 (3)
.-> the formula is TRUE

FORMULA PGCD-PT-D02N005-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: AX [[p6<=1 | [[AX [p7<=2] & EX [0<=0]] & [AG [A [5<=p8 U p2<=5]] & [p1<=1 & [[AF [~ [5<=p2]] | E [p5<=p3 U p8<=4]] | [~ [3<=p1] | ~ [p1<=p0]]]]]]]]
normalized: ~ [EX [~ [[p6<=1 | [[[p1<=1 & [[~ [p1<=p0] | ~ [3<=p1]] | [E [p5<=p3 U p8<=4] | ~ [EG [5<=p2]]]]] & ~ [E [true U ~ [[~ [EG [~ [p2<=5]]] & ~ [E [~ [p2<=5] U [~ [5<=p8] & ~ [p2<=5]]]]]]]]] & [EX [0<=0] & ~ [EX [~ [p7<=2]]]]]]]]]

abstracting: (p7<=2)
states: 4,548 (3)
.abstracting: (0<=0)
states: 8,484 (3)
.abstracting: (p2<=5)
states: 6,832 (3)
abstracting: (5<=p8)
states: 2,184 (3)
abstracting: (p2<=5)
states: 6,832 (3)
abstracting: (p2<=5)
states: 6,832 (3)
..
EG iterations: 2
abstracting: (5<=p2)
states: 2,184 (3)
.
EG iterations: 1
abstracting: (p8<=4)
states: 6,300 (3)
abstracting: (p5<=p3)
states: 4,758 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (p1<=p0)
states: 4,710 (3)
abstracting: (p1<=1)
states: 3,192 (3)
abstracting: (p6<=1)
states: 3,192 (3)
.-> the formula is FALSE

FORMULA PGCD-PT-D02N005-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AX [[[EF [[E [4<=p0 U p8<=p4] & ~ [p3<=3]]] & [EG [A [4<=p1 U 1<=p3]] & p0<=5]] & [EX [p1<=p2] & [EF [EG [p1<=p3]] & AG [[[1<=p3 & 5<=p5] | p0<=3]]]]]]
normalized: ~ [EX [~ [[[[~ [E [true U ~ [[p0<=3 | [1<=p3 & 5<=p5]]]]] & E [true U EG [p1<=p3]]] & EX [p1<=p2]] & [[p0<=5 & EG [[~ [EG [~ [1<=p3]]] & ~ [E [~ [1<=p3] U [~ [4<=p1] & ~ [1<=p3]]]]]]] & E [true U [~ [p3<=3] & E [4<=p0 U p8<=p4]]]]]]]]

abstracting: (p8<=p4)
states: 4,666 (3)
abstracting: (4<=p0)
states: 3,060 (3)
abstracting: (p3<=3)
states: 5,558 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (4<=p1)
states: 3,060 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p3)
states: 6,488 (3)
....
EG iterations: 4
..
EG iterations: 2
abstracting: (p0<=5)
states: 6,832 (3)
abstracting: (p1<=p2)
states: 4,710 (3)
.abstracting: (p1<=p3)
states: 4,666 (3)
...
EG iterations: 3
abstracting: (5<=p5)
states: 2,074 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (p0<=3)
states: 5,424 (3)
.-> the formula is FALSE

FORMULA PGCD-PT-D02N005-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: [[AG [[AF [~ [p5<=p7]] | p2<=p5]] | A [p5<=p6 U [EG [AF [4<=p8]] | ~ [[4<=p3 | p8<=p5]]]]] | [EF [EX [A [A [5<=p4 U 4<=p1] U p1<=5]]] | [EX [~ [3<=p0]] & [AX [EF [~ [p1<=4]]] & AF [[[~ [p6<=2] & ~ [5<=p1]] | ~ [A [p2<=p1 U 4<=p2]]]]]]]]
normalized: [[[[~ [EG [~ [[~ [[~ [EG [~ [4<=p2]]] & ~ [E [~ [4<=p2] U [~ [p2<=p1] & ~ [4<=p2]]]]]] | [~ [5<=p1] & ~ [p6<=2]]]]]] & ~ [EX [~ [E [true U ~ [p1<=4]]]]]] & EX [~ [3<=p0]]] | E [true U EX [[~ [EG [~ [p1<=5]]] & ~ [E [~ [p1<=5] U [~ [[~ [EG [~ [4<=p1]]] & ~ [E [~ [4<=p1] U [~ [5<=p4] & ~ [4<=p1]]]]]] & ~ [p1<=5]]]]]]]] | [[~ [EG [~ [[~ [[4<=p3 | p8<=p5]] | EG [~ [EG [~ [4<=p8]]]]]]]] & ~ [E [~ [[~ [[4<=p3 | p8<=p5]] | EG [~ [EG [~ [4<=p8]]]]]] U [~ [p5<=p6] & ~ [[~ [[4<=p3 | p8<=p5]] | EG [~ [EG [~ [4<=p8]]]]]]]]]] | ~ [E [true U ~ [[p2<=p5 | ~ [EG [p5<=p7]]]]]]]]

abstracting: (p5<=p7)
states: 4,833 (3)
..
EG iterations: 2
abstracting: (p2<=p5)
states: 5,160 (3)
abstracting: (4<=p8)
states: 3,060 (3)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (p8<=p5)
states: 5,160 (3)
abstracting: (4<=p3)
states: 2,926 (3)
abstracting: (p5<=p6)
states: 4,833 (3)
abstracting: (4<=p8)
states: 3,060 (3)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (p8<=p5)
states: 5,160 (3)
abstracting: (4<=p3)
states: 2,926 (3)
abstracting: (4<=p8)
states: 3,060 (3)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (p8<=p5)
states: 5,160 (3)
abstracting: (4<=p3)
states: 2,926 (3)
..
EG iterations: 2
abstracting: (p1<=5)
states: 6,832 (3)
abstracting: (4<=p1)
states: 3,060 (3)
abstracting: (5<=p4)
states: 2,074 (3)
abstracting: (4<=p1)
states: 3,060 (3)
abstracting: (4<=p1)
states: 3,060 (3)
.
EG iterations: 1
abstracting: (p1<=5)
states: 6,832 (3)
abstracting: (p1<=5)
states: 6,832 (3)
..
EG iterations: 2
.abstracting: (3<=p0)
states: 3,936 (3)
.abstracting: (p1<=4)
states: 6,300 (3)
.abstracting: (p6<=2)
states: 4,548 (3)
abstracting: (5<=p1)
states: 2,184 (3)
abstracting: (4<=p2)
states: 3,060 (3)
abstracting: (p2<=p1)
states: 4,710 (3)
abstracting: (4<=p2)
states: 3,060 (3)
abstracting: (4<=p2)
states: 3,060 (3)
.
EG iterations: 1
..
EG iterations: 2
-> the formula is TRUE

FORMULA PGCD-PT-D02N005-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: E [[AX [[[[5<=p7 & ~ [[1<=p1 | 5<=p6]]] | p0<=p1] | [p8<=p0 | 3<=p5]]] & [~ [[p5<=1 & [[[4<=p6 | 5<=p4] & [p7<=p4 | p6<=p7]] | EF [p7<=2]]]] | [A [[EF [2<=p3] | [p1<=p5 & p3<=1]] U [[p8<=p5 | p4<=5] & 1<=p4]] & [EF [p4<=3] & 5<=p5]]]] U [~ [AG [[A [p0<=2 U 1<=p0] & [p0<=4 & [p4<=p8 | p1<=4]]]]] | [~ [p4<=5] & [EF [[AF [p3<=2] & [2<=p7 | p0<=p8]]] | [AX [[p7<=5 & p5<=2]] & E [~ [p5<=p7] U AG [p2<=1]]]]]]]
normalized: E [[[[[5<=p5 & E [true U p4<=3]] & [~ [EG [~ [[1<=p4 & [p8<=p5 | p4<=5]]]]] & ~ [E [~ [[1<=p4 & [p8<=p5 | p4<=5]]] U [~ [[[p1<=p5 & p3<=1] | E [true U 2<=p3]]] & ~ [[1<=p4 & [p8<=p5 | p4<=5]]]]]]]] | ~ [[p5<=1 & [E [true U p7<=2] | [[p7<=p4 | p6<=p7] & [4<=p6 | 5<=p4]]]]]] & ~ [EX [~ [[[p8<=p0 | 3<=p5] | [p0<=p1 | [5<=p7 & ~ [[1<=p1 | 5<=p6]]]]]]]]] U [[[[E [~ [p5<=p7] U ~ [E [true U ~ [p2<=1]]]] & ~ [EX [~ [[p7<=5 & p5<=2]]]]] | E [true U [[2<=p7 | p0<=p8] & ~ [EG [~ [p3<=2]]]]]] & ~ [p4<=5]] | E [true U ~ [[[p0<=4 & [p4<=p8 | p1<=4]] & [~ [EG [~ [1<=p0]]] & ~ [E [~ [1<=p0] U [~ [p0<=2] & ~ [1<=p0]]]]]]]]]]

abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (p0<=2)
states: 4,548 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p0)
states: 6,612 (3)
.
EG iterations: 1
abstracting: (p1<=4)
states: 6,300 (3)
abstracting: (p4<=p8)
states: 4,833 (3)
abstracting: (p0<=4)
states: 6,300 (3)
abstracting: (p4<=5)
states: 6,935 (3)
abstracting: (p3<=2)
states: 4,690 (3)
..
EG iterations: 2
abstracting: (p0<=p8)
states: 4,710 (3)
abstracting: (2<=p7)
states: 5,292 (3)
abstracting: (p5<=2)
states: 4,690 (3)
abstracting: (p7<=5)
states: 6,832 (3)
.abstracting: (p2<=1)
states: 3,192 (3)
abstracting: (p5<=p7)
states: 4,833 (3)
abstracting: (5<=p6)
states: 2,184 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (5<=p7)
states: 2,184 (3)
abstracting: (p0<=p1)
states: 4,710 (3)
abstracting: (3<=p5)
states: 3,794 (3)
abstracting: (p8<=p0)
states: 4,710 (3)
.abstracting: (5<=p4)
states: 2,074 (3)
abstracting: (4<=p6)
states: 3,060 (3)
abstracting: (p6<=p7)
states: 4,710 (3)
abstracting: (p7<=p4)
states: 5,160 (3)
abstracting: (p7<=2)
states: 4,548 (3)
abstracting: (p5<=1)
states: 3,352 (3)
abstracting: (p4<=5)
states: 6,935 (3)
abstracting: (p8<=p5)
states: 5,160 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (2<=p3)
states: 5,132 (3)
abstracting: (p3<=1)
states: 3,352 (3)
abstracting: (p1<=p5)
states: 4,666 (3)
abstracting: (p4<=5)
states: 6,935 (3)
abstracting: (p8<=p5)
states: 5,160 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (p4<=5)
states: 6,935 (3)
abstracting: (p8<=p5)
states: 5,160 (3)
abstracting: (1<=p4)
states: 6,488 (3)
....
EG iterations: 4
abstracting: (p4<=3)
states: 5,558 (3)
abstracting: (5<=p5)
states: 2,074 (3)
-> the formula is TRUE

FORMULA PGCD-PT-D02N005-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

totally nodes used: 51300 (5.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 308685 126179 434864
used/not used/entry size/cache size: 163162 66945702 16 1024MB
basic ops cache: hits/miss/sum: 132486 78902 211388
used/not used/entry size/cache size: 137750 16639466 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: 13926 5808 19734
used/not used/entry size/cache size: 5808 8382800 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 67066774
1 38188
2 2437
3 614
4 323
5 144
6 87
7 61
8 40
9 51
>= 10 145

Total processing time: 0m 4.422sec


BK_STOP 1680818076911

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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:486 (54), effective:159 (17)

initing FirstDep: 0m 0.000sec


iterations count:120 (13), effective:33 (3)

iterations count:348 (38), effective:104 (11)

iterations count:72 (8), effective:14 (1)

iterations count:116 (12), effective:26 (2)

iterations count:160 (17), effective:45 (5)

iterations count:95 (10), effective:27 (3)

iterations count:121 (13), effective:37 (4)

iterations count:420 (46), effective:120 (13)

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

iterations count:51 (5), effective:14 (1)

iterations count:59 (6), effective:17 (1)

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

iterations count:51 (5), effective:12 (1)

iterations count:151 (16), effective:38 (4)

iterations count:37 (4), effective:14 (1)

iterations count:131 (14), effective:38 (4)

iterations count:64 (7), effective:20 (2)

iterations count:86 (9), effective:24 (2)

iterations count:106 (11), effective:31 (3)

iterations count:76 (8), effective:15 (1)

iterations count:116 (12), effective:34 (3)

iterations count:58 (6), effective:21 (2)

iterations count:69 (7), effective:21 (2)

iterations count:137 (15), effective:52 (5)

iterations count:129 (14), effective:32 (3)

iterations count:63 (7), effective:12 (1)

iterations count:173 (19), effective:52 (5)

iterations count:123 (13), effective:30 (3)

iterations count:60 (6), effective:18 (2)

iterations count:87 (9), effective:37 (4)

iterations count:28 (3), effective:5 (0)

iterations count:519 (57), effective:148 (16)

iterations count:81 (9), effective:16 (1)

iterations count:51 (5), effective:12 (1)

iterations count:146 (16), effective:37 (4)

iterations count:9 (1), effective:0 (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="PGCD-PT-D02N005"
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 PGCD-PT-D02N005, 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 r522-tall-167987247400433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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