fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r074-smll-167814399900154
Last Updated
May 14, 2023

About the Execution of Marcie+red for CircularTrains-PT-024

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5647.207 14787.00 19999.00 527.70 FFTFTFTFTTFFFTTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r074-smll-167814399900154.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 CircularTrains-PT-024, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814399900154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.5K Feb 26 04:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 04:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 04:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 04:31 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 3.7K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 04:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 04:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 19K Mar 5 18:22 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 CircularTrains-PT-024-CTLFireability-00
FORMULA_NAME CircularTrains-PT-024-CTLFireability-01
FORMULA_NAME CircularTrains-PT-024-CTLFireability-02
FORMULA_NAME CircularTrains-PT-024-CTLFireability-03
FORMULA_NAME CircularTrains-PT-024-CTLFireability-04
FORMULA_NAME CircularTrains-PT-024-CTLFireability-05
FORMULA_NAME CircularTrains-PT-024-CTLFireability-06
FORMULA_NAME CircularTrains-PT-024-CTLFireability-07
FORMULA_NAME CircularTrains-PT-024-CTLFireability-08
FORMULA_NAME CircularTrains-PT-024-CTLFireability-09
FORMULA_NAME CircularTrains-PT-024-CTLFireability-10
FORMULA_NAME CircularTrains-PT-024-CTLFireability-11
FORMULA_NAME CircularTrains-PT-024-CTLFireability-12
FORMULA_NAME CircularTrains-PT-024-CTLFireability-13
FORMULA_NAME CircularTrains-PT-024-CTLFireability-14
FORMULA_NAME CircularTrains-PT-024-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678305923159

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=CircularTrains-PT-024
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-08 20:05:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 20:05:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 20:05:26] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-08 20:05:26] [INFO ] Transformed 48 places.
[2023-03-08 20:05:26] [INFO ] Transformed 24 transitions.
[2023-03-08 20:05:26] [INFO ] Parsed PT model containing 48 places and 24 transitions and 96 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 21 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 48 cols
[2023-03-08 20:05:26] [INFO ] Computed 25 place invariants in 12 ms
[2023-03-08 20:05:26] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-08 20:05:26] [INFO ] Invariant cache hit.
[2023-03-08 20:05:26] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2023-03-08 20:05:26] [INFO ] Invariant cache hit.
[2023-03-08 20:05:27] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 687 ms. Remains : 48/48 places, 24/24 transitions.
Support contains 48 out of 48 places after structural reductions.
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 29 ms
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 13 ms
[2023-03-08 20:05:27] [INFO ] Input system was already deterministic with 24 transitions.
Finished random walk after 110 steps, including 0 resets, run visited all 41 properties in 33 ms. (steps per millisecond=3 )
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 7 ms
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 13 ms
[2023-03-08 20:05:27] [INFO ] Input system was already deterministic with 24 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 7 ms
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 8 ms
[2023-03-08 20:05:27] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 10 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 7 ms
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 7 ms
[2023-03-08 20:05:27] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 7 ms
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 7 ms
[2023-03-08 20:05:27] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 6 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 6 ms
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 6 ms
[2023-03-08 20:05:27] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 5 ms
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 5 ms
[2023-03-08 20:05:27] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:27] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 5 ms
[2023-03-08 20:05:27] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 5 ms
[2023-03-08 20:05:27] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:27] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:27] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:27] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:27] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 13 ms
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:27] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:28] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:28] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:28] [INFO ] Flatten gal took : 5 ms
[2023-03-08 20:05:28] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:28] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:05:28] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:05:28] [INFO ] Input system was already deterministic with 24 transitions.
[2023-03-08 20:05:28] [INFO ] Flatten gal took : 6 ms
[2023-03-08 20:05:28] [INFO ] Flatten gal took : 6 ms
[2023-03-08 20:05:28] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2023-03-08 20:05:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 24 transitions and 96 arcs took 1 ms.
Total runtime 2094 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: 48 NrTr: 24 NrArc: 96)

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

net check time: 0m 0.000sec

init dd package: 0m 3.461sec


RS generation: 0m 0.017sec


-> reachability set: #nodes 779 (7.8e+02) #states 86,515 (4)



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

checking: E [EG [~ [[1<=p9 & 1<=p23]]] U AX [~ [[EG [[1<=p22 & 1<=p26]] | EF [[1<=p2 & 1<=p17]]]]]]
normalized: E [EG [~ [[1<=p9 & 1<=p23]]] U ~ [EX [[E [true U [1<=p2 & 1<=p17]] | EG [[1<=p22 & 1<=p26]]]]]]

abstracting: (1<=p26)
states: 34,016 (4)
abstracting: (1<=p22)
states: 34,016 (4)
............................................................................
EG iterations: 76
abstracting: (1<=p17)
states: 34,016 (4)
abstracting: (1<=p2)
states: 34,016 (4)
.abstracting: (1<=p23)
states: 34,016 (4)
abstracting: (1<=p9)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
-> the formula is FALSE

FORMULA CircularTrains-PT-024-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.317sec

checking: EF [EG [A [AG [[1<=p3 & 1<=p32]] U A [[1<=p22 & 1<=p26] U [1<=p35 & 1<=p46]]]]]
normalized: E [true U EG [[~ [EG [~ [[~ [EG [~ [[1<=p35 & 1<=p46]]]] & ~ [E [~ [[1<=p35 & 1<=p46]] U [~ [[1<=p22 & 1<=p26]] & ~ [[1<=p35 & 1<=p46]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p35 & 1<=p46]]]] & ~ [E [~ [[1<=p35 & 1<=p46]] U [~ [[1<=p22 & 1<=p26]] & ~ [[1<=p35 & 1<=p46]]]]]]] U [E [true U ~ [[1<=p3 & 1<=p32]]] & ~ [[~ [EG [~ [[1<=p35 & 1<=p46]]]] & ~ [E [~ [[1<=p35 & 1<=p46]] U [~ [[1<=p22 & 1<=p26]] & ~ [[1<=p35 & 1<=p46]]]]]]]]]]]]]

abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p26)
states: 34,016 (4)
abstracting: (1<=p22)
states: 34,016 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
..................................................................................................
EG iterations: 98
abstracting: (1<=p32)
states: 34,016 (4)
abstracting: (1<=p3)
states: 34,016 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p26)
states: 34,016 (4)
abstracting: (1<=p22)
states: 34,016 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
..................................................................................................
EG iterations: 98
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p26)
states: 34,016 (4)
abstracting: (1<=p22)
states: 34,016 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
..................................................................................................
EG iterations: 98
..................................................................................................
EG iterations: 98
............................................................................
EG iterations: 76
-> the formula is FALSE

FORMULA CircularTrains-PT-024-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.192sec

checking: A [[1<=p13 & 1<=p21] U ~ [EG [[~ [AG [[1<=p35 & 1<=p46]]] | [1<=p4 & 1<=p43]]]]]
normalized: [~ [EG [EG [[[1<=p4 & 1<=p43] | E [true U ~ [[1<=p35 & 1<=p46]]]]]]] & ~ [E [EG [[[1<=p4 & 1<=p43] | E [true U ~ [[1<=p35 & 1<=p46]]]]] U [EG [[[1<=p4 & 1<=p43] | E [true U ~ [[1<=p35 & 1<=p46]]]]] & ~ [[1<=p13 & 1<=p21]]]]]]

abstracting: (1<=p21)
states: 34,016 (4)
abstracting: (1<=p13)
states: 34,016 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p43)
states: 18,483 (4)
abstracting: (1<=p4)
states: 74,240 (4)

EG iterations: 0
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p43)
states: 18,483 (4)
abstracting: (1<=p4)
states: 74,240 (4)

EG iterations: 0
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p43)
states: 18,483 (4)
abstracting: (1<=p4)
states: 74,240 (4)

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-024-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EG [[EX [AF [[[p14<=0 | p19<=0] & AG [[1<=p29 & 1<=p41]]]]] | [1<=p18 & 1<=p34]]]
normalized: EG [[[1<=p18 & 1<=p34] | EX [~ [EG [~ [[~ [E [true U ~ [[1<=p29 & 1<=p41]]]] & [p14<=0 | p19<=0]]]]]]]]

abstracting: (p19<=0)
states: 52,499 (4)
abstracting: (p14<=0)
states: 52,499 (4)
abstracting: (1<=p41)
states: 74,240 (4)
abstracting: (1<=p29)
states: 18,483 (4)

EG iterations: 0
.abstracting: (1<=p34)
states: 34,016 (4)
abstracting: (1<=p18)
states: 34,016 (4)
............................................................................
EG iterations: 76
-> the formula is FALSE

FORMULA CircularTrains-PT-024-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.127sec

checking: AG [AF [[EX [[[p7<=0 | p40<=0] & [p12<=0 | p27<=0]]] | [1<=p20 & 1<=p37]]]]
normalized: ~ [E [true U EG [~ [[[1<=p20 & 1<=p37] | EX [[[p12<=0 | p27<=0] & [p7<=0 | p40<=0]]]]]]]]

abstracting: (p40<=0)
states: 52,499 (4)
abstracting: (p7<=0)
states: 52,499 (4)
abstracting: (p27<=0)
states: 52,499 (4)
abstracting: (p12<=0)
states: 52,499 (4)
.abstracting: (1<=p37)
states: 34,016 (4)
abstracting: (1<=p20)
states: 34,016 (4)
........................................
EG iterations: 40
-> the formula is TRUE

FORMULA CircularTrains-PT-024-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: EG [AF [AX [[AG [[1<=p16 & 1<=p36]] & [EG [[1<=p28 & 1<=p44]] & [p0<=0 | p39<=0]]]]]]
normalized: EG [~ [EG [EX [~ [[[[p0<=0 | p39<=0] & EG [[1<=p28 & 1<=p44]]] & ~ [E [true U ~ [[1<=p16 & 1<=p36]]]]]]]]]]

abstracting: (1<=p36)
states: 34,016 (4)
abstracting: (1<=p16)
states: 34,016 (4)
abstracting: (1<=p44)
states: 34,016 (4)
abstracting: (1<=p28)
states: 34,016 (4)
............................................................................
EG iterations: 76
abstracting: (p39<=0)
states: 12,275 (4)
abstracting: (p0<=0)
states: 68,032 (4)
.
EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA CircularTrains-PT-024-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.098sec

checking: AX [[EX [[[AF [[1<=p18 & 1<=p34]] & 1<=p14] & [1<=p19 & [[p0<=0 | p39<=0] | [p20<=0 | p37<=0]]]]] | AG [AF [[1<=p1 & 1<=p11]]]]]
normalized: ~ [EX [~ [[~ [E [true U EG [~ [[1<=p1 & 1<=p11]]]]] | EX [[[1<=p19 & [[p20<=0 | p37<=0] | [p0<=0 | p39<=0]]] & [1<=p14 & ~ [EG [~ [[1<=p18 & 1<=p34]]]]]]]]]]]

abstracting: (1<=p34)
states: 34,016 (4)
abstracting: (1<=p18)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
abstracting: (1<=p14)
states: 34,016 (4)
abstracting: (p39<=0)
states: 12,275 (4)
abstracting: (p0<=0)
states: 68,032 (4)
abstracting: (p37<=0)
states: 52,499 (4)
abstracting: (p20<=0)
states: 52,499 (4)
abstracting: (1<=p19)
states: 34,016 (4)
.abstracting: (1<=p11)
states: 34,016 (4)
abstracting: (1<=p1)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
.-> the formula is TRUE

FORMULA CircularTrains-PT-024-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.388sec

checking: ~ [E [EF [[E [AX [[1<=p0 & 1<=p39]] U ~ [[1<=p0 & 1<=p39]]] | ~ [EF [[1<=p2 & 1<=p17]]]]] U AX [~ [[AX [[1<=p16 & 1<=p36]] | ~ [[[1<=p1 & 1<=p11] & [1<=p12 & 1<=p27]]]]]]]]
normalized: ~ [E [E [true U [~ [E [true U [1<=p2 & 1<=p17]]] | E [~ [EX [~ [[1<=p0 & 1<=p39]]]] U ~ [[1<=p0 & 1<=p39]]]]] U ~ [EX [[~ [[[1<=p12 & 1<=p27] & [1<=p1 & 1<=p11]]] | ~ [EX [~ [[1<=p16 & 1<=p36]]]]]]]]]

abstracting: (1<=p36)
states: 34,016 (4)
abstracting: (1<=p16)
states: 34,016 (4)
.abstracting: (1<=p11)
states: 34,016 (4)
abstracting: (1<=p1)
states: 34,016 (4)
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (1<=p12)
states: 34,016 (4)
.abstracting: (1<=p39)
states: 74,240 (4)
abstracting: (1<=p0)
states: 18,483 (4)
abstracting: (1<=p39)
states: 74,240 (4)
abstracting: (1<=p0)
states: 18,483 (4)
.abstracting: (1<=p17)
states: 34,016 (4)
abstracting: (1<=p2)
states: 34,016 (4)
-> the formula is TRUE

FORMULA CircularTrains-PT-024-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EG [[~ [A [AG [[1<=p30 & 1<=p38]] U AX [[1<=p14 & 1<=p19]]]] & E [[[[1<=p13 & 1<=p21] | [1<=p8 & 1<=p31]] & EF [[1<=p4 & 1<=p43]]] U [EF [[1<=p9 & 1<=p23]] & ~ [[1<=p35 & 1<=p46]]]]]]
normalized: EG [[E [[E [true U [1<=p4 & 1<=p43]] & [[1<=p8 & 1<=p31] | [1<=p13 & 1<=p21]]] U [~ [[1<=p35 & 1<=p46]] & E [true U [1<=p9 & 1<=p23]]]] & ~ [[~ [EG [EX [~ [[1<=p14 & 1<=p19]]]]] & ~ [E [EX [~ [[1<=p14 & 1<=p19]]] U [E [true U ~ [[1<=p30 & 1<=p38]]] & EX [~ [[1<=p14 & 1<=p19]]]]]]]]]]

abstracting: (1<=p19)
states: 34,016 (4)
abstracting: (1<=p14)
states: 34,016 (4)
.abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p19)
states: 34,016 (4)
abstracting: (1<=p14)
states: 34,016 (4)
.abstracting: (1<=p19)
states: 34,016 (4)
abstracting: (1<=p14)
states: 34,016 (4)
..
EG iterations: 1
abstracting: (1<=p23)
states: 34,016 (4)
abstracting: (1<=p9)
states: 34,016 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p21)
states: 34,016 (4)
abstracting: (1<=p13)
states: 34,016 (4)
abstracting: (1<=p31)
states: 34,016 (4)
abstracting: (1<=p8)
states: 34,016 (4)
abstracting: (1<=p43)
states: 18,483 (4)
abstracting: (1<=p4)
states: 74,240 (4)
..............................................................
EG iterations: 62
-> the formula is TRUE

FORMULA CircularTrains-PT-024-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.069sec

checking: E [[1<=p10 & 1<=p45] U AF [[AF [AX [[1<=p13 & 1<=p21]]] & [[AF [[1<=p3 & 1<=p32]] | E [[1<=p30 & 1<=p38] U [1<=p22 & 1<=p26]]] & [AG [[1<=p18 & 1<=p34]] | AG [[1<=p28 & 1<=p44]]]]]]]
normalized: E [[1<=p10 & 1<=p45] U ~ [EG [~ [[[[~ [E [true U ~ [[1<=p28 & 1<=p44]]]] | ~ [E [true U ~ [[1<=p18 & 1<=p34]]]]] & [E [[1<=p30 & 1<=p38] U [1<=p22 & 1<=p26]] | ~ [EG [~ [[1<=p3 & 1<=p32]]]]]] & ~ [EG [EX [~ [[1<=p13 & 1<=p21]]]]]]]]]]

abstracting: (1<=p21)
states: 34,016 (4)
abstracting: (1<=p13)
states: 34,016 (4)
..
EG iterations: 1
abstracting: (1<=p32)
states: 34,016 (4)
abstracting: (1<=p3)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
abstracting: (1<=p26)
states: 34,016 (4)
abstracting: (1<=p22)
states: 34,016 (4)
abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p34)
states: 34,016 (4)
abstracting: (1<=p18)
states: 34,016 (4)
abstracting: (1<=p44)
states: 34,016 (4)
abstracting: (1<=p28)
states: 34,016 (4)

EG iterations: 0
abstracting: (1<=p45)
states: 18,483 (4)
abstracting: (1<=p10)
states: 74,240 (4)
-> the formula is FALSE

FORMULA CircularTrains-PT-024-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.300sec

checking: [AF [[1<=p22 & 1<=p26]] & EG [[[[[p14<=0 | p19<=0] | [p10<=0 | p45<=0]] & EX [[p16<=0 | p36<=0]]] | [AX [[[p15<=0 | p25<=0] | [[1<=p3 & 1<=p32] | [1<=p10 & 1<=p45]]]] | EF [EG [AF [[1<=p10 & 1<=p45]]]]]]]]
normalized: [EG [[[E [true U EG [~ [EG [~ [[1<=p10 & 1<=p45]]]]]] | ~ [EX [~ [[[[1<=p10 & 1<=p45] | [1<=p3 & 1<=p32]] | [p15<=0 | p25<=0]]]]]] | [EX [[p16<=0 | p36<=0]] & [[p10<=0 | p45<=0] | [p14<=0 | p19<=0]]]]] & ~ [EG [~ [[1<=p22 & 1<=p26]]]]]

abstracting: (1<=p26)
states: 34,016 (4)
abstracting: (1<=p22)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
abstracting: (p19<=0)
states: 52,499 (4)
abstracting: (p14<=0)
states: 52,499 (4)
abstracting: (p45<=0)
states: 68,032 (4)
abstracting: (p10<=0)
states: 12,275 (4)
abstracting: (p36<=0)
states: 52,499 (4)
abstracting: (p16<=0)
states: 52,499 (4)
.abstracting: (p25<=0)
states: 52,499 (4)
abstracting: (p15<=0)
states: 52,499 (4)
abstracting: (1<=p32)
states: 34,016 (4)
abstracting: (1<=p3)
states: 34,016 (4)
abstracting: (1<=p45)
states: 18,483 (4)
abstracting: (1<=p10)
states: 74,240 (4)
.abstracting: (1<=p45)
states: 18,483 (4)
abstracting: (1<=p10)
states: 74,240 (4)
..................................................................................................
EG iterations: 98

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA CircularTrains-PT-024-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.093sec

checking: EX [A [EF [~ [[1<=p29 & 1<=p41]]] U E [[[1<=p5 & 1<=p47] & [~ [[1<=p35 & 1<=p46]] & [E [[1<=p1 & 1<=p11] U [1<=p8 & 1<=p31]] | E [[1<=p28 & 1<=p44] U [1<=p35 & 1<=p46]]]]] U [EG [[1<=p9 & 1<=p23]] & ~ [[1<=p18 & 1<=p34]]]]]]
normalized: EX [[~ [EG [~ [E [[[[E [[1<=p28 & 1<=p44] U [1<=p35 & 1<=p46]] | E [[1<=p1 & 1<=p11] U [1<=p8 & 1<=p31]]] & ~ [[1<=p35 & 1<=p46]]] & [1<=p5 & 1<=p47]] U [~ [[1<=p18 & 1<=p34]] & EG [[1<=p9 & 1<=p23]]]]]]] & ~ [E [~ [E [[[[E [[1<=p28 & 1<=p44] U [1<=p35 & 1<=p46]] | E [[1<=p1 & 1<=p11] U [1<=p8 & 1<=p31]]] & ~ [[1<=p35 & 1<=p46]]] & [1<=p5 & 1<=p47]] U [~ [[1<=p18 & 1<=p34]] & EG [[1<=p9 & 1<=p23]]]]] U [~ [E [true U ~ [[1<=p29 & 1<=p41]]]] & ~ [E [[[[E [[1<=p28 & 1<=p44] U [1<=p35 & 1<=p46]] | E [[1<=p1 & 1<=p11] U [1<=p8 & 1<=p31]]] & ~ [[1<=p35 & 1<=p46]]] & [1<=p5 & 1<=p47]] U [~ [[1<=p18 & 1<=p34]] & EG [[1<=p9 & 1<=p23]]]]]]]]]]

abstracting: (1<=p23)
states: 34,016 (4)
abstracting: (1<=p9)
states: 34,016 (4)
...........................................................................
EG iterations: 75
abstracting: (1<=p34)
states: 34,016 (4)
abstracting: (1<=p18)
states: 34,016 (4)
abstracting: (1<=p47)
states: 74,240 (4)
abstracting: (1<=p5)
states: 18,483 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p31)
states: 34,016 (4)
abstracting: (1<=p8)
states: 34,016 (4)
abstracting: (1<=p11)
states: 34,016 (4)
abstracting: (1<=p1)
states: 34,016 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p44)
states: 34,016 (4)
abstracting: (1<=p28)
states: 34,016 (4)
abstracting: (1<=p41)
states: 74,240 (4)
abstracting: (1<=p29)
states: 18,483 (4)
abstracting: (1<=p23)
states: 34,016 (4)
abstracting: (1<=p9)
states: 34,016 (4)
...........................................................................
EG iterations: 75
abstracting: (1<=p34)
states: 34,016 (4)
abstracting: (1<=p18)
states: 34,016 (4)
abstracting: (1<=p47)
states: 74,240 (4)
abstracting: (1<=p5)
states: 18,483 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p31)
states: 34,016 (4)
abstracting: (1<=p8)
states: 34,016 (4)
abstracting: (1<=p11)
states: 34,016 (4)
abstracting: (1<=p1)
states: 34,016 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p44)
states: 34,016 (4)
abstracting: (1<=p28)
states: 34,016 (4)
abstracting: (1<=p23)
states: 34,016 (4)
abstracting: (1<=p9)
states: 34,016 (4)
...........................................................................
EG iterations: 75
abstracting: (1<=p34)
states: 34,016 (4)
abstracting: (1<=p18)
states: 34,016 (4)
abstracting: (1<=p47)
states: 74,240 (4)
abstracting: (1<=p5)
states: 18,483 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p31)
states: 34,016 (4)
abstracting: (1<=p8)
states: 34,016 (4)
abstracting: (1<=p11)
states: 34,016 (4)
abstracting: (1<=p1)
states: 34,016 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p44)
states: 34,016 (4)
abstracting: (1<=p28)
states: 34,016 (4)

EG iterations: 0
.-> the formula is FALSE

FORMULA CircularTrains-PT-024-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.186sec

checking: ~ [E [[[1<=p6 & 1<=p42] | A [[[1<=p2 & 1<=p17] | [~ [[1<=p30 & 1<=p38]] | E [[1<=p18 & 1<=p34] U [1<=p14 & 1<=p19]]]] U [[~ [[1<=p15 & 1<=p25]] | ~ [[1<=p16 & 1<=p36]]] & [[1<=p35 & 1<=p46] | ~ [[1<=p28 & 1<=p44]]]]]] U EG [~ [EG [[1<=p20 & 1<=p37]]]]]]
normalized: ~ [E [[[~ [EG [~ [[[~ [[1<=p28 & 1<=p44]] | [1<=p35 & 1<=p46]] & [~ [[1<=p16 & 1<=p36]] | ~ [[1<=p15 & 1<=p25]]]]]]] & ~ [E [~ [[[~ [[1<=p28 & 1<=p44]] | [1<=p35 & 1<=p46]] & [~ [[1<=p16 & 1<=p36]] | ~ [[1<=p15 & 1<=p25]]]]] U [~ [[[E [[1<=p18 & 1<=p34] U [1<=p14 & 1<=p19]] | ~ [[1<=p30 & 1<=p38]]] | [1<=p2 & 1<=p17]]] & ~ [[[~ [[1<=p28 & 1<=p44]] | [1<=p35 & 1<=p46]] & [~ [[1<=p16 & 1<=p36]] | ~ [[1<=p15 & 1<=p25]]]]]]]]] | [1<=p6 & 1<=p42]] U EG [~ [EG [[1<=p20 & 1<=p37]]]]]]

abstracting: (1<=p37)
states: 34,016 (4)
abstracting: (1<=p20)
states: 34,016 (4)
............................................................................
EG iterations: 76

EG iterations: 0
abstracting: (1<=p42)
states: 18,483 (4)
abstracting: (1<=p6)
states: 74,240 (4)
abstracting: (1<=p25)
states: 34,016 (4)
abstracting: (1<=p15)
states: 34,016 (4)
abstracting: (1<=p36)
states: 34,016 (4)
abstracting: (1<=p16)
states: 34,016 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p44)
states: 34,016 (4)
abstracting: (1<=p28)
states: 34,016 (4)
abstracting: (1<=p17)
states: 34,016 (4)
abstracting: (1<=p2)
states: 34,016 (4)
abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p19)
states: 34,016 (4)
abstracting: (1<=p14)
states: 34,016 (4)
abstracting: (1<=p34)
states: 34,016 (4)
abstracting: (1<=p18)
states: 34,016 (4)
abstracting: (1<=p25)
states: 34,016 (4)
abstracting: (1<=p15)
states: 34,016 (4)
abstracting: (1<=p36)
states: 34,016 (4)
abstracting: (1<=p16)
states: 34,016 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p44)
states: 34,016 (4)
abstracting: (1<=p28)
states: 34,016 (4)
abstracting: (1<=p25)
states: 34,016 (4)
abstracting: (1<=p15)
states: 34,016 (4)
abstracting: (1<=p36)
states: 34,016 (4)
abstracting: (1<=p16)
states: 34,016 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p44)
states: 34,016 (4)
abstracting: (1<=p28)
states: 34,016 (4)
..........................................................................................
EG iterations: 90
-> the formula is FALSE

FORMULA CircularTrains-PT-024-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.268sec

checking: AG [[[p29<=0 | p41<=0] | [EX [AF [[1<=p16 & 1<=p36]]] | [[~ [A [~ [[1<=p14 & 1<=p19]] U ~ [[1<=p30 & 1<=p38]]]] & [p0<=0 | p39<=0]] | [[AX [[p9<=0 | p23<=0]] & 1<=p14] & [1<=p19 & [[p3<=0 | p32<=0] & [[p28<=0 | p44<=0] | [p13<=0 | p21<=0]]]]]]]]]
normalized: ~ [E [true U ~ [[[EX [~ [EG [~ [[1<=p16 & 1<=p36]]]]] | [[[1<=p19 & [[[p13<=0 | p21<=0] | [p28<=0 | p44<=0]] & [p3<=0 | p32<=0]]] & [1<=p14 & ~ [EX [~ [[p9<=0 | p23<=0]]]]]] | [[p0<=0 | p39<=0] & ~ [[~ [EG [[1<=p30 & 1<=p38]]] & ~ [E [[1<=p30 & 1<=p38] U [[1<=p14 & 1<=p19] & [1<=p30 & 1<=p38]]]]]]]]] | [p29<=0 | p41<=0]]]]]

abstracting: (p41<=0)
states: 12,275 (4)
abstracting: (p29<=0)
states: 68,032 (4)
abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p19)
states: 34,016 (4)
abstracting: (1<=p14)
states: 34,016 (4)
abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
............................................................................
EG iterations: 76
abstracting: (p39<=0)
states: 12,275 (4)
abstracting: (p0<=0)
states: 68,032 (4)
abstracting: (p23<=0)
states: 52,499 (4)
abstracting: (p9<=0)
states: 52,499 (4)
.abstracting: (1<=p14)
states: 34,016 (4)
abstracting: (p32<=0)
states: 52,499 (4)
abstracting: (p3<=0)
states: 52,499 (4)
abstracting: (p44<=0)
states: 52,499 (4)
abstracting: (p28<=0)
states: 52,499 (4)
abstracting: (p21<=0)
states: 52,499 (4)
abstracting: (p13<=0)
states: 52,499 (4)
abstracting: (1<=p19)
states: 34,016 (4)
abstracting: (1<=p36)
states: 34,016 (4)
abstracting: (1<=p16)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
.-> the formula is TRUE

FORMULA CircularTrains-PT-024-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.337sec

checking: [EG [E [[1<=p14 & 1<=p19] U E [AG [[1<=p9 & 1<=p23]] U ~ [[[1<=p16 & 1<=p36] | [1<=p24 & 1<=p33]]]]]] | EX [[[[EX [[p3<=0 | p32<=0]] | [p15<=0 | p25<=0]] & [p3<=0 | p32<=0]] & [[[p3<=0 | p32<=0] | [p24<=0 | p33<=0]] & [[[1<=p35 & 1<=p46] | ~ [A [[1<=p7 & 1<=p40] U [1<=p30 & 1<=p38]]]] & AG [[[p13<=0 | p21<=0] & [EX [[1<=p20 & 1<=p37]] & [p4<=0 | p43<=0]]]]]]]]]
normalized: [EX [[[[~ [E [true U ~ [[[[p4<=0 | p43<=0] & EX [[1<=p20 & 1<=p37]]] & [p13<=0 | p21<=0]]]]] & [~ [[~ [EG [~ [[1<=p30 & 1<=p38]]]] & ~ [E [~ [[1<=p30 & 1<=p38]] U [~ [[1<=p7 & 1<=p40]] & ~ [[1<=p30 & 1<=p38]]]]]]] | [1<=p35 & 1<=p46]]] & [[p24<=0 | p33<=0] | [p3<=0 | p32<=0]]] & [[p3<=0 | p32<=0] & [[p15<=0 | p25<=0] | EX [[p3<=0 | p32<=0]]]]]] | EG [E [[1<=p14 & 1<=p19] U E [~ [E [true U ~ [[1<=p9 & 1<=p23]]]] U ~ [[[1<=p24 & 1<=p33] | [1<=p16 & 1<=p36]]]]]]]

abstracting: (1<=p36)
states: 34,016 (4)
abstracting: (1<=p16)
states: 34,016 (4)
abstracting: (1<=p33)
states: 34,016 (4)
abstracting: (1<=p24)
states: 34,016 (4)
abstracting: (1<=p23)
states: 34,016 (4)
abstracting: (1<=p9)
states: 34,016 (4)
abstracting: (1<=p19)
states: 34,016 (4)
abstracting: (1<=p14)
states: 34,016 (4)
..................................
EG iterations: 34
abstracting: (p32<=0)
states: 52,499 (4)
abstracting: (p3<=0)
states: 52,499 (4)
.abstracting: (p25<=0)
states: 52,499 (4)
abstracting: (p15<=0)
states: 52,499 (4)
abstracting: (p32<=0)
states: 52,499 (4)
abstracting: (p3<=0)
states: 52,499 (4)
abstracting: (p32<=0)
states: 52,499 (4)
abstracting: (p3<=0)
states: 52,499 (4)
abstracting: (p33<=0)
states: 52,499 (4)
abstracting: (p24<=0)
states: 52,499 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p40)
states: 34,016 (4)
abstracting: (1<=p7)
states: 34,016 (4)
abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
..................................................................................................
EG iterations: 98
abstracting: (p21<=0)
states: 52,499 (4)
abstracting: (p13<=0)
states: 52,499 (4)
abstracting: (1<=p37)
states: 34,016 (4)
abstracting: (1<=p20)
states: 34,016 (4)
.abstracting: (p43<=0)
states: 68,032 (4)
abstracting: (p4<=0)
states: 12,275 (4)
.-> the formula is TRUE

FORMULA CircularTrains-PT-024-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.285sec

checking: A [[A [~ [[[1<=p15 & 1<=p25] | ~ [[1<=p24 & 1<=p33]]]] U [~ [EF [[1<=p4 & 1<=p43]]] & [A [[1<=p30 & 1<=p38] U [1<=p0 & 1<=p39]] | [[1<=p6 & 1<=p42] & [1<=p1 & 1<=p11]]]]] | [[E [EX [E [[1<=p14 & 1<=p19] U [1<=p6 & 1<=p42]]] U [EF [[1<=p7 & 1<=p40]] | ~ [[[1<=p0 & 1<=p39] & [1<=p20 & 1<=p37]]]]] & A [[1<=p35 & 1<=p46] U [[1<=p12 & 1<=p27] | ~ [EF [[1<=p3 & 1<=p32]]]]]] | [EX [~ [[1<=p14 & 1<=p19]]] & [~ [AG [[1<=p22 & 1<=p26]]] | ~ [EX [[1<=p12 & 1<=p27]]]]]]] U A [AX [[[1<=p14 & 1<=p19] | [AF [[1<=p3 & 1<=p32]] & [1<=p16 & 1<=p36]]]] U [[1<=p30 & 1<=p38] | [1<=p12 & 1<=p27]]]]
normalized: [~ [EG [~ [[~ [EG [~ [[[1<=p12 & 1<=p27] | [1<=p30 & 1<=p38]]]]] & ~ [E [~ [[[1<=p12 & 1<=p27] | [1<=p30 & 1<=p38]]] U [EX [~ [[[[1<=p16 & 1<=p36] & ~ [EG [~ [[1<=p3 & 1<=p32]]]]] | [1<=p14 & 1<=p19]]]] & ~ [[[1<=p12 & 1<=p27] | [1<=p30 & 1<=p38]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[1<=p12 & 1<=p27] | [1<=p30 & 1<=p38]]]]] & ~ [E [~ [[[1<=p12 & 1<=p27] | [1<=p30 & 1<=p38]]] U [EX [~ [[[[1<=p16 & 1<=p36] & ~ [EG [~ [[1<=p3 & 1<=p32]]]]] | [1<=p14 & 1<=p19]]]] & ~ [[[1<=p12 & 1<=p27] | [1<=p30 & 1<=p38]]]]]]]] U [~ [[[[[~ [EX [[1<=p12 & 1<=p27]]] | E [true U ~ [[1<=p22 & 1<=p26]]]] & EX [~ [[1<=p14 & 1<=p19]]]] | [[~ [EG [~ [[~ [E [true U [1<=p3 & 1<=p32]]] | [1<=p12 & 1<=p27]]]]] & ~ [E [~ [[~ [E [true U [1<=p3 & 1<=p32]]] | [1<=p12 & 1<=p27]]] U [~ [[1<=p35 & 1<=p46]] & ~ [[~ [E [true U [1<=p3 & 1<=p32]]] | [1<=p12 & 1<=p27]]]]]]] & E [EX [E [[1<=p14 & 1<=p19] U [1<=p6 & 1<=p42]]] U [~ [[[1<=p20 & 1<=p37] & [1<=p0 & 1<=p39]]] | E [true U [1<=p7 & 1<=p40]]]]]] | [~ [EG [~ [[[[[1<=p1 & 1<=p11] & [1<=p6 & 1<=p42]] | [~ [EG [~ [[1<=p0 & 1<=p39]]]] & ~ [E [~ [[1<=p0 & 1<=p39]] U [~ [[1<=p30 & 1<=p38]] & ~ [[1<=p0 & 1<=p39]]]]]]] & ~ [E [true U [1<=p4 & 1<=p43]]]]]]] & ~ [E [~ [[[[[1<=p1 & 1<=p11] & [1<=p6 & 1<=p42]] | [~ [EG [~ [[1<=p0 & 1<=p39]]]] & ~ [E [~ [[1<=p0 & 1<=p39]] U [~ [[1<=p30 & 1<=p38]] & ~ [[1<=p0 & 1<=p39]]]]]]] & ~ [E [true U [1<=p4 & 1<=p43]]]]] U [[~ [[1<=p24 & 1<=p33]] | [1<=p15 & 1<=p25]] & ~ [[[[[1<=p1 & 1<=p11] & [1<=p6 & 1<=p42]] | [~ [EG [~ [[1<=p0 & 1<=p39]]]] & ~ [E [~ [[1<=p0 & 1<=p39]] U [~ [[1<=p30 & 1<=p38]] & ~ [[1<=p0 & 1<=p39]]]]]]] & ~ [E [true U [1<=p4 & 1<=p43]]]]]]]]]]] & ~ [[~ [EG [~ [[[1<=p12 & 1<=p27] | [1<=p30 & 1<=p38]]]]] & ~ [E [~ [[[1<=p12 & 1<=p27] | [1<=p30 & 1<=p38]]] U [EX [~ [[[[1<=p16 & 1<=p36] & ~ [EG [~ [[1<=p3 & 1<=p32]]]]] | [1<=p14 & 1<=p19]]]] & ~ [[[1<=p12 & 1<=p27] | [1<=p30 & 1<=p38]]]]]]]]]]]]

abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (1<=p12)
states: 34,016 (4)
abstracting: (1<=p19)
states: 34,016 (4)
abstracting: (1<=p14)
states: 34,016 (4)
abstracting: (1<=p32)
states: 34,016 (4)
abstracting: (1<=p3)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
abstracting: (1<=p36)
states: 34,016 (4)
abstracting: (1<=p16)
states: 34,016 (4)
.abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (1<=p12)
states: 34,016 (4)
abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (1<=p12)
states: 34,016 (4)
......................................................
EG iterations: 54
abstracting: (1<=p43)
states: 18,483 (4)
abstracting: (1<=p4)
states: 74,240 (4)
abstracting: (1<=p39)
states: 74,240 (4)
abstracting: (1<=p0)
states: 18,483 (4)
abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p39)
states: 74,240 (4)
abstracting: (1<=p0)
states: 18,483 (4)
abstracting: (1<=p39)
states: 74,240 (4)
abstracting: (1<=p0)
states: 18,483 (4)
..................................................................................................
EG iterations: 98
abstracting: (1<=p42)
states: 18,483 (4)
abstracting: (1<=p6)
states: 74,240 (4)
abstracting: (1<=p11)
states: 34,016 (4)
abstracting: (1<=p1)
states: 34,016 (4)
abstracting: (1<=p25)
states: 34,016 (4)
abstracting: (1<=p15)
states: 34,016 (4)
abstracting: (1<=p33)
states: 34,016 (4)
abstracting: (1<=p24)
states: 34,016 (4)
abstracting: (1<=p43)
states: 18,483 (4)
abstracting: (1<=p4)
states: 74,240 (4)
abstracting: (1<=p39)
states: 74,240 (4)
abstracting: (1<=p0)
states: 18,483 (4)
abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p39)
states: 74,240 (4)
abstracting: (1<=p0)
states: 18,483 (4)
abstracting: (1<=p39)
states: 74,240 (4)
abstracting: (1<=p0)
states: 18,483 (4)
..................................................................................................
EG iterations: 98
abstracting: (1<=p42)
states: 18,483 (4)
abstracting: (1<=p6)
states: 74,240 (4)
abstracting: (1<=p11)
states: 34,016 (4)
abstracting: (1<=p1)
states: 34,016 (4)
abstracting: (1<=p43)
states: 18,483 (4)
abstracting: (1<=p4)
states: 74,240 (4)
abstracting: (1<=p39)
states: 74,240 (4)
abstracting: (1<=p0)
states: 18,483 (4)
abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p39)
states: 74,240 (4)
abstracting: (1<=p0)
states: 18,483 (4)
abstracting: (1<=p39)
states: 74,240 (4)
abstracting: (1<=p0)
states: 18,483 (4)
..................................................................................................
EG iterations: 98
abstracting: (1<=p42)
states: 18,483 (4)
abstracting: (1<=p6)
states: 74,240 (4)
abstracting: (1<=p11)
states: 34,016 (4)
abstracting: (1<=p1)
states: 34,016 (4)

EG iterations: 0
abstracting: (1<=p40)
states: 34,016 (4)
abstracting: (1<=p7)
states: 34,016 (4)
abstracting: (1<=p39)
states: 74,240 (4)
abstracting: (1<=p0)
states: 18,483 (4)
abstracting: (1<=p37)
states: 34,016 (4)
abstracting: (1<=p20)
states: 34,016 (4)
abstracting: (1<=p42)
states: 18,483 (4)
abstracting: (1<=p6)
states: 74,240 (4)
abstracting: (1<=p19)
states: 34,016 (4)
abstracting: (1<=p14)
states: 34,016 (4)
.abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (1<=p12)
states: 34,016 (4)
abstracting: (1<=p32)
states: 34,016 (4)
abstracting: (1<=p3)
states: 34,016 (4)
abstracting: (1<=p46)
states: 74,240 (4)
abstracting: (1<=p35)
states: 18,483 (4)
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (1<=p12)
states: 34,016 (4)
abstracting: (1<=p32)
states: 34,016 (4)
abstracting: (1<=p3)
states: 34,016 (4)
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (1<=p12)
states: 34,016 (4)
abstracting: (1<=p32)
states: 34,016 (4)
abstracting: (1<=p3)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
abstracting: (1<=p19)
states: 34,016 (4)
abstracting: (1<=p14)
states: 34,016 (4)
.abstracting: (1<=p26)
states: 34,016 (4)
abstracting: (1<=p22)
states: 34,016 (4)
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (1<=p12)
states: 34,016 (4)
.abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (1<=p12)
states: 34,016 (4)
abstracting: (1<=p19)
states: 34,016 (4)
abstracting: (1<=p14)
states: 34,016 (4)
abstracting: (1<=p32)
states: 34,016 (4)
abstracting: (1<=p3)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
abstracting: (1<=p36)
states: 34,016 (4)
abstracting: (1<=p16)
states: 34,016 (4)
.abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (1<=p12)
states: 34,016 (4)
abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (1<=p12)
states: 34,016 (4)
......................................................
EG iterations: 54
abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (1<=p12)
states: 34,016 (4)
abstracting: (1<=p19)
states: 34,016 (4)
abstracting: (1<=p14)
states: 34,016 (4)
abstracting: (1<=p32)
states: 34,016 (4)
abstracting: (1<=p3)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
abstracting: (1<=p36)
states: 34,016 (4)
abstracting: (1<=p16)
states: 34,016 (4)
.abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (1<=p12)
states: 34,016 (4)
abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (1<=p30)
states: 74,240 (4)
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (1<=p12)
states: 34,016 (4)
......................................................
EG iterations: 54
......................................................
EG iterations: 54
-> the formula is TRUE

FORMULA CircularTrains-PT-024-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.489sec

totally nodes used: 2932444 (2.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1269889 4774156 6044045
used/not used/entry size/cache size: 7076838 60032026 16 1024MB
basic ops cache: hits/miss/sum: 307937 866750 1174687
used/not used/entry size/cache size: 1767084 15010132 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: 7454 23334 30788
used/not used/entry size/cache size: 23304 8365304 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 64502945
1 2358829
2 205014
3 32726
4 4740
5 1160
6 981
7 588
8 296
9 288
>= 10 1297

Total processing time: 0m 8.669sec


BK_STOP 1678305937946

--------------------
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.006sec


iterations count:464 (19), effective:96 (4)

initing FirstDep: 0m 0.000sec


iterations count:111 (4), effective:23 (0)

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:111 (4), effective:23 (0)

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

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

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

iterations count:131 (5), effective:23 (0)

iterations count:131 (5), effective:23 (0)

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

iterations count:99 (4), effective:13 (0)

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

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

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

iterations count:103 (4), effective:14 (0)

iterations count:93 (3), effective:16 (0)

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

iterations count:103 (4), effective:14 (0)

iterations count:93 (3), effective:16 (0)

iterations count:103 (4), effective:14 (0)

iterations count:93 (3), effective:16 (0)

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

iterations count:235 (9), effective:44 (1)

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

iterations count:93 (3), effective:16 (0)

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

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

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

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

iterations count:175 (7), effective:51 (2)

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

iterations count:131 (5), effective:23 (0)

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

iterations count:131 (5), effective:23 (0)

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

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

iterations count:131 (5), effective:23 (0)

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

iterations count:131 (5), effective:23 (0)

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

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

iterations count:131 (5), effective:23 (0)

iterations count:131 (5), effective:23 (0)

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

iterations count:131 (5), effective:23 (0)

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

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

iterations count:98 (4), effective:12 (0)

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CircularTrains-PT-024"
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 CircularTrains-PT-024, 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 r074-smll-167814399900154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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