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.r266-smll-167863540400074.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 NeighborGrid-PT-d2n3m1c12, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540400074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.0K Feb 26 09:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 09:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 09:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 09:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 09:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 09:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K Feb 26 09:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 11K 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 NeighborGrid-PT-d2n3m1c12-CTLFireability-00
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-01
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-02
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-03
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-04
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-05
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-06
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-07
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-08
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-09
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-10
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-11
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-12
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-13
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-14
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678785568515

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=NeighborGrid-PT-d2n3m1c12
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 09:19:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 09:19:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:19:31] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-14 09:19:31] [INFO ] Transformed 9 places.
[2023-03-14 09:19:32] [INFO ] Transformed 40 transitions.
[2023-03-14 09:19:32] [INFO ] Parsed PT model containing 9 places and 40 transitions and 80 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Initial state reduction rules removed 2 formulas.
FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-15 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, 40/40 transitions.
Applied a total of 0 rules in 15 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2023-03-14 09:19:32] [INFO ] Computed 1 place invariants in 8 ms
[2023-03-14 09:19:32] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-14 09:19:32] [INFO ] Invariant cache hit.
[2023-03-14 09:19:32] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-03-14 09:19:32] [INFO ] Invariant cache hit.
[2023-03-14 09:19:32] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 9/9 places, 40/40 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-14 09:19:32] [INFO ] Flatten gal took : 38 ms
[2023-03-14 09:19:32] [INFO ] Flatten gal took : 13 ms
[2023-03-14 09:19:33] [INFO ] Input system was already deterministic with 40 transitions.
Finished random walk after 69 steps, including 0 resets, run visited all 32 properties in 27 ms. (steps per millisecond=2 )
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 8 ms
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 10 ms
[2023-03-14 09:19:33] [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 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 9/9 places, 40/40 transitions.
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 7 ms
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 6 ms
[2023-03-14 09:19:33] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 40/40 transitions.
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:19:33] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 40/40 transitions.
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:19:33] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 40/40 transitions.
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 3 ms
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 3 ms
[2023-03-14 09:19:33] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 40/40 transitions.
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:19:33] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 40/40 transitions.
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 3 ms
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 3 ms
[2023-03-14 09:19:33] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 40/40 transitions.
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 3 ms
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 3 ms
[2023-03-14 09:19:33] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 40/40 transitions.
Graph (trivial) has 16 edges and 9 vertex of which 7 / 9 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Applied a total of 1 rules in 13 ms. Remains 3 /9 variables (removed 6) and now considering 7/40 (removed 33) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 3/9 places, 7/40 transitions.
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 1 ms
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 1 ms
[2023-03-14 09:19:33] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 9/9 places, 40/40 transitions.
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 3 ms
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 3 ms
[2023-03-14 09:19:33] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 40/40 transitions.
Graph (trivial) has 28 edges and 9 vertex of which 7 / 9 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Applied a total of 1 rules in 2 ms. Remains 3 /9 variables (removed 6) and now considering 5/40 (removed 35) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 3/9 places, 5/40 transitions.
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 1 ms
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 1 ms
[2023-03-14 09:19:33] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 40/40 transitions.
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 3 ms
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 3 ms
[2023-03-14 09:19:33] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 40/40 transitions.
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 3 ms
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 3 ms
[2023-03-14 09:19:33] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 40/40 transitions.
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 2 ms
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 3 ms
[2023-03-14 09:19:33] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 40/40 transitions.
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 2 ms
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 3 ms
[2023-03-14 09:19:33] [INFO ] Input system was already deterministic with 40 transitions.
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 3 ms
[2023-03-14 09:19:33] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:19:33] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-14 09:19:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 40 transitions and 80 arcs took 0 ms.
Total runtime 1814 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: 40 NrArc: 80)

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

net check time: 0m 0.000sec

init dd package: 0m 3.607sec


RS generation: 0m 0.004sec


-> reachability set: #nodes 81 (8.1e+01) #states 24,310 (4)



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

checking: EF [AX [AG [p2<=0]]]
normalized: E [true U ~ [EX [E [true U ~ [p2<=0]]]]]

abstracting: (p2<=0)
states: 11,440 (4)
.-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[EG [1<=p4] | p3<=0]]
normalized: E [true U [EG [1<=p4] | p3<=0]]

abstracting: (p3<=0)
states: 11,440 (4)
abstracting: (1<=p4)
states: 12,870 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [[1<=p0 | AF [EG [1<=p8]]]]
normalized: EG [[~ [EG [~ [EG [1<=p8]]]] | 1<=p0]]

abstracting: (1<=p0)
states: 12,870 (4)
abstracting: (1<=p8)
states: 12,870 (4)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[1<=p2 | [EX [E [EG [1<=p2] U A [1<=p0 U 1<=p5]]] | AG [1<=p3]]]]
normalized: ~ [E [true U ~ [[[~ [E [true U ~ [1<=p3]]] | EX [E [EG [1<=p2] U [~ [EG [~ [1<=p5]]] & ~ [E [~ [1<=p5] U [~ [1<=p0] & ~ [1<=p5]]]]]]]] | 1<=p2]]]]

abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p5)
states: 12,870 (4)
abstracting: (1<=p0)
states: 12,870 (4)
abstracting: (1<=p5)
states: 12,870 (4)
abstracting: (1<=p5)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p2)
states: 12,870 (4)
.
EG iterations: 1
.abstracting: (1<=p3)
states: 12,870 (4)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [~ [E [[[EF [1<=p7] | E [1<=p5 U 1<=p5]] | ~ [EX [1<=p4]]] U E [[1<=p6 & [1<=p6 | 1<=p2]] U EG [1<=p1]]]]]
normalized: E [true U ~ [E [[~ [EX [1<=p4]] | [E [1<=p5 U 1<=p5] | E [true U 1<=p7]]] U E [[[1<=p6 | 1<=p2] & 1<=p6] U EG [1<=p1]]]]]

abstracting: (1<=p1)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p6)
states: 12,870 (4)
abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p6)
states: 12,870 (4)
abstracting: (1<=p7)
states: 12,870 (4)
abstracting: (1<=p5)
states: 12,870 (4)
abstracting: (1<=p5)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
.-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: [AG [EX [EF [p1<=0]]] | EF [~ [A [[[p3<=0 | p4<=0] | [1<=p1 | [1<=p3 & 1<=p2]]] U [E [1<=p0 U 1<=p4] | 1<=p4]]]]]
normalized: [E [true U ~ [[~ [EG [~ [[E [1<=p0 U 1<=p4] | 1<=p4]]]] & ~ [E [~ [[E [1<=p0 U 1<=p4] | 1<=p4]] U [~ [[[[1<=p3 & 1<=p2] | 1<=p1] | [p3<=0 | p4<=0]]] & ~ [[E [1<=p0 U 1<=p4] | 1<=p4]]]]]]]] | ~ [E [true U ~ [EX [E [true U p1<=0]]]]]]

abstracting: (p1<=0)
states: 11,440 (4)
.abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (1<=p0)
states: 12,870 (4)
abstracting: (p4<=0)
states: 11,440 (4)
abstracting: (p3<=0)
states: 11,440 (4)
abstracting: (1<=p1)
states: 12,870 (4)
abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p3)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (1<=p0)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (1<=p0)
states: 12,870 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: ~ [E [[[1<=p3 & [1<=p7 & 1<=p7]] & [[1<=p5 & EX [1<=p4]] & [EX [1<=p0] & AF [1<=p2]]]] U AG [[EF [1<=p0] | 1<=p5]]]]
normalized: ~ [E [[[[EX [1<=p0] & ~ [EG [~ [1<=p2]]]] & [EX [1<=p4] & 1<=p5]] & [[1<=p7 & 1<=p7] & 1<=p3]] U ~ [E [true U ~ [[E [true U 1<=p0] | 1<=p5]]]]]]

abstracting: (1<=p5)
states: 12,870 (4)
abstracting: (1<=p0)
states: 12,870 (4)
abstracting: (1<=p3)
states: 12,870 (4)
abstracting: (1<=p7)
states: 12,870 (4)
abstracting: (1<=p7)
states: 12,870 (4)
abstracting: (1<=p5)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
.abstracting: (1<=p2)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p0)
states: 12,870 (4)
.-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [EG [E [1<=p2 U AX [[[1<=p1 & 1<=p3] & [1<=p8 & 1<=p4]]]]] & [AX [EX [AF [1<=p8]]] & AG [E [A [[1<=p4 & 1<=p2] U p5<=0] U EX [EF [1<=p1]]]]]]
normalized: [[~ [EX [~ [EX [~ [EG [~ [1<=p8]]]]]]] & ~ [E [true U ~ [E [[~ [EG [~ [p5<=0]]] & ~ [E [~ [p5<=0] U [~ [[1<=p4 & 1<=p2]] & ~ [p5<=0]]]]] U EX [E [true U 1<=p1]]]]]]] & EG [E [1<=p2 U ~ [EX [~ [[[1<=p8 & 1<=p4] & [1<=p1 & 1<=p3]]]]]]]]

abstracting: (1<=p3)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (1<=p8)
states: 12,870 (4)
.abstracting: (1<=p2)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p1)
states: 12,870 (4)
.abstracting: (p5<=0)
states: 11,440 (4)
abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (p5<=0)
states: 11,440 (4)
abstracting: (p5<=0)
states: 11,440 (4)
.
EG iterations: 1
abstracting: (1<=p8)
states: 12,870 (4)
.
EG iterations: 1
..-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: A [~ [[AG [p8<=0] | [[[[p1<=0 | EG [1<=p5]] & [1<=p7 | 1<=p0]] & [A [1<=p5 U 1<=p2] & ~ [AF [1<=p4]]]] | EX [EG [1<=p4]]]]] U EG [EF [AG [E [1<=p1 U 1<=p5]]]]]
normalized: [~ [EG [~ [EG [E [true U ~ [E [true U ~ [E [1<=p1 U 1<=p5]]]]]]]]] & ~ [E [~ [EG [E [true U ~ [E [true U ~ [E [1<=p1 U 1<=p5]]]]]]] U [~ [EG [E [true U ~ [E [true U ~ [E [1<=p1 U 1<=p5]]]]]]] & [[EX [EG [1<=p4]] | [[EG [~ [1<=p4]] & [~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [~ [1<=p5] & ~ [1<=p2]]]]]] & [[1<=p7 | 1<=p0] & [EG [1<=p5] | p1<=0]]]] | ~ [E [true U ~ [p8<=0]]]]]]]]

abstracting: (p8<=0)
states: 11,440 (4)
abstracting: (p1<=0)
states: 11,440 (4)
abstracting: (1<=p5)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p0)
states: 12,870 (4)
abstracting: (1<=p7)
states: 12,870 (4)
abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p5)
states: 12,870 (4)
abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p2)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p4)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p4)
states: 12,870 (4)
.
EG iterations: 1
.abstracting: (1<=p5)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p5)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p5)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [[EG [[[p1<=0 & p5<=0] & [1<=p4 & 1<=p6]]] & [AG [[EX [p4<=0] | p4<=0]] & E [[EG [1<=p6] | ~ [[1<=p6 & 1<=p4]]] U A [1<=p0 U EG [1<=p0]]]]]]
normalized: E [true U [[E [[~ [[1<=p6 & 1<=p4]] | EG [1<=p6]] U [~ [EG [~ [EG [1<=p0]]]] & ~ [E [~ [EG [1<=p0]] U [~ [1<=p0] & ~ [EG [1<=p0]]]]]]] & ~ [E [true U ~ [[EX [p4<=0] | p4<=0]]]]] & EG [[[1<=p4 & 1<=p6] & [p1<=0 & p5<=0]]]]]

abstracting: (p5<=0)
states: 11,440 (4)
abstracting: (p1<=0)
states: 11,440 (4)
abstracting: (1<=p6)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (p4<=0)
states: 11,440 (4)
abstracting: (p4<=0)
states: 11,440 (4)
.abstracting: (1<=p0)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p0)
states: 12,870 (4)
abstracting: (1<=p0)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p0)
states: 12,870 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p6)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (1<=p6)
states: 12,870 (4)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

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

abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p7)
states: 12,870 (4)
abstracting: (1<=p3)
states: 12,870 (4)
abstracting: (1<=p5)
states: 12,870 (4)
abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p7)
states: 12,870 (4)
abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p7)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p8)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (1<=p3)
states: 12,870 (4)
abstracting: (1<=p0)
states: 12,870 (4)
abstracting: (1<=p5)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p6)
states: 12,870 (4)
abstracting: (1<=p0)
states: 12,870 (4)
abstracting: (1<=p5)
states: 12,870 (4)
..
EG iterations: 1
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: [~ [A [1<=p8 U AF [EX [1<=p7]]]] & [EF [AG [EX [1<=p8]]] & [A [EG [~ [AF [1<=p1]]] U ~ [EF [[1<=p1 & 1<=p8]]]] | E [[AG [EF [1<=p6]] | [~ [[1<=p7 & 1<=p6]] & [1<=p7 & A [1<=p1 U 1<=p3]]]] U [1<=p3 | 1<=p8]]]]]
normalized: [~ [[~ [EG [EG [~ [EX [1<=p7]]]]] & ~ [E [EG [~ [EX [1<=p7]]] U [EG [~ [EX [1<=p7]]] & ~ [1<=p8]]]]]] & [[E [[[[[~ [EG [~ [1<=p3]]] & ~ [E [~ [1<=p3] U [~ [1<=p1] & ~ [1<=p3]]]]] & 1<=p7] & ~ [[1<=p7 & 1<=p6]]] | ~ [E [true U ~ [E [true U 1<=p6]]]]] U [1<=p3 | 1<=p8]] | [~ [EG [E [true U [1<=p1 & 1<=p8]]]] & ~ [E [E [true U [1<=p1 & 1<=p8]] U [~ [EG [EG [~ [1<=p1]]]] & E [true U [1<=p1 & 1<=p8]]]]]]] & E [true U ~ [E [true U ~ [EX [1<=p8]]]]]]]

abstracting: (1<=p8)
states: 12,870 (4)
.abstracting: (1<=p8)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p8)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
abstracting: (1<=p8)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)

EG iterations: 0
abstracting: (1<=p8)
states: 12,870 (4)
abstracting: (1<=p3)
states: 12,870 (4)
abstracting: (1<=p6)
states: 12,870 (4)
abstracting: (1<=p6)
states: 12,870 (4)
abstracting: (1<=p7)
states: 12,870 (4)
abstracting: (1<=p7)
states: 12,870 (4)
abstracting: (1<=p3)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
abstracting: (1<=p3)
states: 12,870 (4)
abstracting: (1<=p3)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p8)
states: 12,870 (4)
abstracting: (1<=p7)
states: 12,870 (4)
..
EG iterations: 1
abstracting: (1<=p7)
states: 12,870 (4)
..
EG iterations: 1
abstracting: (1<=p7)
states: 12,870 (4)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

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

abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (1<=p6)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p0)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p8)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p2)
states: 12,870 (4)
.
EG iterations: 1
.abstracting: (1<=p7)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
.abstracting: (p2<=0)
states: 11,440 (4)
abstracting: (p1<=0)
states: 11,440 (4)
abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (p1<=0)
states: 11,440 (4)
abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p0)
states: 12,870 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

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

abstracting: (1<=p7)
states: 12,870 (4)
.abstracting: (1<=p6)
states: 12,870 (4)
abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p5)
states: 12,870 (4)
abstracting: (1<=p3)
states: 12,870 (4)
abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (1<=p3)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p0)
states: 12,870 (4)
abstracting: (1<=p3)
states: 12,870 (4)
abstracting: (p3<=0)
states: 11,440 (4)
abstracting: (1<=p8)
states: 12,870 (4)
abstracting: (1<=p0)
states: 12,870 (4)
abstracting: (1<=p8)
states: 12,870 (4)
abstracting: (1<=p8)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p6)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p4)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p7)
states: 12,870 (4)
abstracting: (p2<=0)
states: 11,440 (4)
abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (p4<=0)
states: 11,440 (4)
abstracting: (p8<=0)
states: 11,440 (4)
.-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

totally nodes used: 18282 (1.8e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 394459 114480 508939
used/not used/entry size/cache size: 125971 66982893 16 1024MB
basic ops cache: hits/miss/sum: 68049 18605 86654
used/not used/entry size/cache size: 33735 16743481 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: 2714 626 3340
used/not used/entry size/cache size: 626 8387982 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 67091563
1 16639
2 499
3 108
4 31
5 12
6 1
7 1
8 0
9 0
>= 10 10

Total processing time: 0m 5.645sec


BK_STOP 1678785580414

--------------------
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:1125 (28), effective:72 (1)

initing FirstDep: 0m 0.000sec


iterations count:156 (3), effective:8 (0)

iterations count:67 (1), effective:9 (0)

iterations count:58 (1), effective:9 (0)

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

iterations count:67 (1), effective:9 (0)

iterations count:904 (22), effective:54 (1)

iterations count:155 (3), effective:8 (0)

iterations count:156 (3), effective:8 (0)

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

iterations count:140 (3), effective:7 (0)

iterations count:49 (1), effective:9 (0)

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

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

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

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

iterations count:154 (3), effective:8 (0)

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

iterations count:932 (23), effective:75 (1)

iterations count:155 (3), effective:8 (0)

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

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

iterations count:156 (3), effective:8 (0)

iterations count:229 (5), effective:9 (0)

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

iterations count:238 (5), effective:18 (0)

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

iterations count:238 (5), effective:18 (0)

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

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

iterations count:238 (5), effective:18 (0)

iterations count:270 (6), effective:16 (0)

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

iterations count:154 (3), effective:8 (0)

iterations count:256 (6), effective:18 (0)

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

iterations count:124 (3), effective:8 (0)

iterations count:175 (4), effective:9 (0)

iterations count:778 (19), effective:36 (0)

iterations count:271 (6), effective:16 (0)

iterations count:271 (6), effective:16 (0)

iterations count:155 (3), effective:8 (0)

iterations count:271 (6), effective:16 (0)

iterations count:156 (3), effective:8 (0)

iterations count:49 (1), effective:9 (0)

iterations count:126 (3), effective:7 (0)

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

iterations count:175 (4), effective:9 (0)

iterations count:157 (3), effective:9 (0)

iterations count:156 (3), effective:8 (0)

iterations count:155 (3), effective:8 (0)

iterations count:504 (12), effective:32 (0)

iterations count:292 (7), effective:18 (0)

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

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

iterations count:58 (1), effective:9 (0)

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

iterations count:156 (3), effective:8 (0)

iterations count:103 (2), effective:9 (0)

iterations count:155 (3), effective:8 (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="NeighborGrid-PT-d2n3m1c12"
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 NeighborGrid-PT-d2n3m1c12, 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 r266-smll-167863540400074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeighborGrid-PT-d2n3m1c12.tgz
mv NeighborGrid-PT-d2n3m1c12 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;