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.r490-tall-167912708500338.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 SwimmingPool-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708500338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 5.6K Feb 26 03:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 26 03:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 03:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 03:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 03:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 03:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 03:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 03:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.9K 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 SwimmingPool-PT-03-CTLFireability-00
FORMULA_NAME SwimmingPool-PT-03-CTLFireability-01
FORMULA_NAME SwimmingPool-PT-03-CTLFireability-02
FORMULA_NAME SwimmingPool-PT-03-CTLFireability-03
FORMULA_NAME SwimmingPool-PT-03-CTLFireability-04
FORMULA_NAME SwimmingPool-PT-03-CTLFireability-05
FORMULA_NAME SwimmingPool-PT-03-CTLFireability-06
FORMULA_NAME SwimmingPool-PT-03-CTLFireability-07
FORMULA_NAME SwimmingPool-PT-03-CTLFireability-08
FORMULA_NAME SwimmingPool-PT-03-CTLFireability-09
FORMULA_NAME SwimmingPool-PT-03-CTLFireability-10
FORMULA_NAME SwimmingPool-PT-03-CTLFireability-11
FORMULA_NAME SwimmingPool-PT-03-CTLFireability-12
FORMULA_NAME SwimmingPool-PT-03-CTLFireability-13
FORMULA_NAME SwimmingPool-PT-03-CTLFireability-14
FORMULA_NAME SwimmingPool-PT-03-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679241246953

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=SwimmingPool-PT-03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 15:54:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 15:54:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 15:54:08] [INFO ] Load time of PNML (sax parser for PT used): 17 ms
[2023-03-19 15:54:08] [INFO ] Transformed 9 places.
[2023-03-19 15:54:08] [INFO ] Transformed 7 transitions.
[2023-03-19 15:54:08] [INFO ] Parsed PT model containing 9 places and 7 transitions and 20 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 1 formulas.
FORMULA SwimmingPool-PT-03-CTLFireability-00 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, 7/7 transitions.
Applied a total of 0 rules in 7 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 15:54:08] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-19 15:54:09] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-19 15:54:09] [INFO ] Invariant cache hit.
[2023-03-19 15:54:09] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-03-19 15:54:09] [INFO ] Invariant cache hit.
[2023-03-19 15:54:09] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 488 ms. Remains : 9/9 places, 7/7 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 12 ms
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 3 ms
[2023-03-19 15:54:09] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 1121 steps, including 0 resets, run visited all 21 properties in 193 ms. (steps per millisecond=5 )
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 3 ms
[2023-03-19 15:54:09] [INFO ] Input system was already deterministic with 7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:54:09] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 6 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 6/9 places, 4/7 transitions.
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:54:09] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 8 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 1 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 6/9 places, 4/7 transitions.
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:54:09] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 8/9 places, 6/7 transitions.
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:54:09] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:54:09] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-19 15:54:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 7 transitions and 20 arcs took 0 ms.
Total runtime 1218 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: 7 NrArc: 20)

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

net check time: 0m 0.000sec

init dd package: 0m 2.786sec


RS generation: 0m15.500sec


-> reachability set: #nodes 141394 (1.4e+05) #states 32,209,356 (7)



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

checking: AG [AF [1<=p2]]
normalized: ~ [E [true U EG [~ [1<=p2]]]]

abstracting: (1<=p2)
states: 28,034,128 (7)
..................................................................................................................................................................................................................................................
EG iterations: 242
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m42.737sec

checking: AG [EF [EX [[p1<=0 | p8<=0]]]]
normalized: ~ [E [true U ~ [E [true U EX [[p1<=0 | p8<=0]]]]]]

abstracting: (p8<=0)
states: 240,720 (5)
abstracting: (p1<=0)
states: 3,983,264 (6)
.-> the formula is TRUE

FORMULA SwimmingPool-PT-03-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.733sec

checking: EF [[EX [EX [p6<=0]] & p4<=0]]
normalized: E [true U [p4<=0 & EX [EX [p6<=0]]]]

abstracting: (p6<=0)
states: 1,507,628 (6)
..abstracting: (p4<=0)
states: 4,175,228 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.835sec

checking: EF [AG [[1<=p3 & 1<=p7]]]
normalized: E [true U ~ [E [true U ~ [[1<=p3 & 1<=p7]]]]]

abstracting: (1<=p7)
states: 29,580,904 (7)
abstracting: (1<=p3)
states: 30,493,444 (7)
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.162sec

checking: EG [E [EF [~ [[1<=p4 & AF [1<=p5]]]] U A [EX [1<=p6] U AG [1<=p2]]]]
normalized: EG [E [E [true U ~ [[1<=p4 & ~ [EG [~ [1<=p5]]]]]] U [~ [EG [E [true U ~ [1<=p2]]]] & ~ [E [E [true U ~ [1<=p2]] U [~ [EX [1<=p6]] & E [true U ~ [1<=p2]]]]]]]]

abstracting: (1<=p2)
states: 28,034,128 (7)
abstracting: (1<=p6)
states: 30,701,728 (7)
.abstracting: (1<=p2)
states: 28,034,128 (7)
abstracting: (1<=p2)
states: 28,034,128 (7)

EG iterations: 0
abstracting: (1<=p5)
states: 28,226,092 (7)
...................................................................................................................................................................................................................................
EG iterations: 227
abstracting: (1<=p4)
states: 28,034,128 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m57.828sec

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

abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (1<=p4)
states: 28,034,128 (7)
abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (1<=p5)
states: 28,226,092 (7)
...................................................................................................................................................................................................................................
EG iterations: 227
abstracting: (p8<=0)
states: 240,720 (5)
abstracting: (p1<=0)
states: 3,983,264 (6)
.-> the formula is FALSE

FORMULA SwimmingPool-PT-03-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.785sec

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

abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
abstracting: (1<=p7)
states: 29,580,904 (7)
abstracting: (1<=p3)
states: 30,493,444 (7)
..........................................................................................................................
EG iterations: 122

EG iterations: 0
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.096sec

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

abstracting: (1<=p2)
states: 28,034,128 (7)
.abstracting: (1<=p4)
states: 28,034,128 (7)
abstracting: (1<=p6)
states: 30,701,728 (7)
abstracting: (1<=p7)
states: 29,580,904 (7)
abstracting: (1<=p0)
states: 30,701,728 (7)
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.192sec

checking: AX [EX [[~ [E [[1<=p6 | 1<=p5] U p6<=0]] | AG [EF [[p1<=0 | p8<=0]]]]]]
normalized: ~ [EX [~ [EX [[~ [E [true U ~ [E [true U [p1<=0 | p8<=0]]]]] | ~ [E [[1<=p6 | 1<=p5] U p6<=0]]]]]]]

abstracting: (p6<=0)
states: 1,507,628 (6)
abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (1<=p6)
states: 30,701,728 (7)
abstracting: (p8<=0)
states: 240,720 (5)
abstracting: (p1<=0)
states: 3,983,264 (6)
..-> the formula is TRUE

FORMULA SwimmingPool-PT-03-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.350sec

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

abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
.
EG iterations: 1
abstracting: (p7<=0)
states: 2,628,452 (6)
abstracting: (p0<=0)
states: 1,507,628 (6)
abstracting: (1<=p6)
states: 30,701,728 (7)
abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (1<=p2)
states: 28,034,128 (7)
abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (1<=p6)
states: 30,701,728 (7)
.abstracting: (1<=p2)
states: 28,034,128 (7)
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.207sec

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

abstracting: (1<=p4)
states: 28,034,128 (7)
abstracting: (1<=p6)
states: 30,701,728 (7)
.abstracting: (1<=p7)
states: 29,580,904 (7)
abstracting: (1<=p0)
states: 30,701,728 (7)
abstracting: (1<=p6)
states: 30,701,728 (7)
.
EG iterations: 1
......................................................................................................................................................
EG iterations: 150
abstracting: (1<=p2)
states: 28,034,128 (7)

EG iterations: 0
.abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
.-> the formula is TRUE

FORMULA SwimmingPool-PT-03-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.529sec

checking: A [[1<=p2 | [1<=p6 | [~ [[E [1<=p5 U 1<=p2] & [[1<=p3 & 1<=p7] | 1<=p4]]] & [1<=p5 | ~ [[1<=p5 | 1<=p4]]]]]] U 1<=p4]
normalized: [~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [[1<=p2 | [1<=p6 | [[1<=p5 | ~ [[1<=p5 | 1<=p4]]] & ~ [[[1<=p4 | [1<=p3 & 1<=p7]] & E [1<=p5 U 1<=p2]]]]]]] & ~ [1<=p4]]]]]

abstracting: (1<=p4)
states: 28,034,128 (7)
abstracting: (1<=p2)
states: 28,034,128 (7)
abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (1<=p7)
states: 29,580,904 (7)
abstracting: (1<=p3)
states: 30,493,444 (7)
abstracting: (1<=p4)
states: 28,034,128 (7)
abstracting: (1<=p4)
states: 28,034,128 (7)
abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (1<=p6)
states: 30,701,728 (7)
abstracting: (1<=p2)
states: 28,034,128 (7)
abstracting: (1<=p4)
states: 28,034,128 (7)
abstracting: (1<=p4)
states: 28,034,128 (7)
..................................................................................................................................................................................................................................................
EG iterations: 242
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m48.086sec

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

abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (1<=p7)
states: 29,580,904 (7)
abstracting: (1<=p0)
states: 30,701,728 (7)
abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (1<=p5)
states: 28,226,092 (7)
...................................................................................................................................................................................................................................
EG iterations: 227
abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (p7<=0)
states: 2,628,452 (6)
abstracting: (p0<=0)
states: 1,507,628 (6)
abstracting: (1<=p7)
states: 29,580,904 (7)
abstracting: (1<=p0)
states: 30,701,728 (7)
abstracting: (1<=p2)
states: 28,034,128 (7)
abstracting: (1<=p4)
states: 28,034,128 (7)
abstracting: (1<=p7)
states: 29,580,904 (7)
abstracting: (1<=p0)
states: 30,701,728 (7)
abstracting: (1<=p2)
states: 28,034,128 (7)
abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (p4<=0)
states: 4,175,228 (6)
abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
abstracting: (1<=p4)
states: 28,034,128 (7)
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.025sec

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

abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
abstracting: (1<=p7)
states: 29,580,904 (7)
abstracting: (1<=p3)
states: 30,493,444 (7)
abstracting: (1<=p4)
states: 28,034,128 (7)
abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
...................................................................................................................................................................................................................................
EG iterations: 227
.abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
abstracting: (1<=p2)
states: 28,034,128 (7)
abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (p2<=0)
states: 4,175,228 (6)
abstracting: (1<=p2)
states: 28,034,128 (7)
abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (1<=p2)
states: 28,034,128 (7)
abstracting: (1<=p5)
states: 28,226,092 (7)
............................................................................................
EG iterations: 92
abstracting: (1<=p7)
states: 29,580,904 (7)
abstracting: (1<=p0)
states: 30,701,728 (7)
abstracting: (1<=p7)
states: 29,580,904 (7)
abstracting: (1<=p3)
states: 30,493,444 (7)
abstracting: (1<=p7)
states: 29,580,904 (7)
abstracting: (1<=p3)
states: 30,493,444 (7)
abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
...................................................................................................................................................................................................................................
EG iterations: 227
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m41.862sec

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

abstracting: (1<=p5)
states: 28,226,092 (7)
...................................................................................................................................................................................................................................
EG iterations: 227
abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
abstracting: (1<=p6)
states: 30,701,728 (7)
.
EG iterations: 1
abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
...................................................................................................................................................................................................................................
EG iterations: 227
abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
...................................................................................................................................................................................................................................
EG iterations: 227
abstracting: (1<=p7)
states: 29,580,904 (7)
abstracting: (1<=p0)
states: 30,701,728 (7)
abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
.abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
abstracting: (1<=p7)
states: 29,580,904 (7)
abstracting: (1<=p0)
states: 30,701,728 (7)
abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
abstracting: (1<=p8)
states: 31,968,636 (7)
abstracting: (1<=p1)
states: 28,226,092 (7)
...................................................................................................................................................................................................................................
EG iterations: 227
abstracting: (1<=p5)
states: 28,226,092 (7)
.abstracting: (1<=p5)
states: 28,226,092 (7)
abstracting: (p4<=0)
states: 4,175,228 (6)
abstracting: (1<=p7)
states: 29,580,904 (7)
abstracting: (1<=p3)
states: 30,493,444 (7)
abstracting: (1<=p5)
states: 28,226,092 (7)
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.161sec

totally nodes used: 25200782 (2.5e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 943350906 97366383 1040717289
used/not used/entry size/cache size: 50325954 16782910 16 1024MB
basic ops cache: hits/miss/sum: 282693692 35908765 318602457
used/not used/entry size/cache size: 15387773 1389443 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: 7960400 787139 8747539
used/not used/entry size/cache size: 734045 7654563 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 49232622
1 13321304
2 3144401
3 927914
4 252504
5 86915
6 38098
7 26531
8 22577
9 12509
>= 10 43489

Total processing time: 5m29.143sec


BK_STOP 1679241579951

--------------------
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:1507 (215), effective:360 (51)

initing FirstDep: 0m 0.000sec


iterations count:105 (15), effective:31 (4)

iterations count:476 (68), effective:89 (12)

iterations count:67 (9), effective:30 (4)

iterations count:97 (13), effective:30 (4)

iterations count:97 (13), effective:30 (4)

iterations count:397 (56), effective:90 (12)

iterations count:97 (13), effective:30 (4)

iterations count:127 (18), effective:30 (4)

iterations count:30 (4), effective:7 (1)

iterations count:31 (4), effective:10 (1)

iterations count:34 (4), effective:8 (1)

iterations count:23 (3), effective:6 (0)

iterations count:367 (52), effective:60 (8)

iterations count:97 (13), effective:30 (4)

iterations count:277 (39), effective:60 (8)

iterations count:367 (52), effective:60 (8)

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

iterations count:37 (5), effective:30 (4)

iterations count:27 (3), effective:6 (0)

iterations count:30 (4), effective:7 (1)

iterations count:426 (60), effective:119 (17)

iterations count:97 (13), effective:30 (4)

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

iterations count:468 (66), effective:193 (27)

iterations count:35 (5), effective:8 (1)

iterations count:460 (65), effective:92 (13)

iterations count:277 (39), effective:60 (8)

iterations count:277 (39), effective:60 (8)

iterations count:30 (4), effective:8 (1)

iterations count:127 (18), effective:30 (4)

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

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

iterations count:35 (5), effective:8 (1)

iterations count:35 (5), effective:8 (1)

iterations count:35 (5), effective:8 (1)

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

iterations count:352 (50), effective:105 (15)

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

iterations count:37 (5), effective:30 (4)

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

iterations count:37 (5), effective:10 (1)

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

iterations count:67 (9), effective:30 (4)

iterations count:37 (5), effective:30 (4)

iterations count:37 (5), effective:30 (4)

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="SwimmingPool-PT-03"
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 SwimmingPool-PT-03, 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 r490-tall-167912708500338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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