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-167814399900145.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-012, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814399900145
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.7K Feb 26 04:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 04:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 04:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 04:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 04:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 04:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 04:30 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 9.2K 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-012-CTLCardinality-00
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-01
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-02
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-03
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-04
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-05
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-06
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-07
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-08
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-09
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-10
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-11
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-12
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-13
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-14
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678305719571

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-012
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-08 20:02:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 20:02:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 20:02:02] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-08 20:02:02] [INFO ] Transformed 24 places.
[2023-03-08 20:02:02] [INFO ] Transformed 12 transitions.
[2023-03-08 20:02:02] [INFO ] Parsed PT model containing 24 places and 12 transitions and 48 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-012-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-012-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 17 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2023-03-08 20:02:02] [INFO ] Computed 13 place invariants in 11 ms
[2023-03-08 20:02:03] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-08 20:02:03] [INFO ] Invariant cache hit.
[2023-03-08 20:02:03] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2023-03-08 20:02:03] [INFO ] Invariant cache hit.
[2023-03-08 20:02:03] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 590 ms. Remains : 24/24 places, 12/12 transitions.
Support contains 24 out of 24 places after structural reductions.
[2023-03-08 20:02:03] [INFO ] Flatten gal took : 25 ms
[2023-03-08 20:02:03] [INFO ] Flatten gal took : 9 ms
[2023-03-08 20:02:03] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 826 ms. (steps per millisecond=12 ) properties (out of 57) seen :48
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-08 20:02:05] [INFO ] Invariant cache hit.
[2023-03-08 20:02:05] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-08 20:02:05] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-08 20:02:05] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:5
[2023-03-08 20:02:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-08 20:02:05] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-08 20:02:05] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :0
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
FORMULA CircularTrains-PT-012-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 7 ms
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 7 ms
[2023-03-08 20:02:05] [INFO ] Input system was already deterministic with 12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:02:05] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:05] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:05] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:02:05] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:05] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 6 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:05] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:05] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:02:05] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:02:05] [INFO ] Input system was already deterministic with 12 transitions.
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
FORMULA CircularTrains-PT-012-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:02:05] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:05] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:05] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:05] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:05] [INFO ] Input system was already deterministic with 12 transitions.
[2023-03-08 20:02:06] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:06] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:06] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-08 20:02:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 12 transitions and 48 arcs took 1 ms.
Total runtime 3690 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 24 NrTr: 12 NrArc: 48)

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

net check time: 0m 0.000sec

init dd package: 0m 3.549sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 203 (2.0e+02) #states 195



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

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 195
.-> the formula is TRUE

FORMULA CircularTrains-PT-012-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (0<=0)
states: 195
.-> the formula is TRUE

FORMULA CircularTrains-PT-012-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [EG [EF [p23<=p8]]]
normalized: EX [EG [E [true U p23<=p8]]]

abstracting: (p23<=p8)
states: 167

EG iterations: 0
.-> the formula is TRUE

FORMULA CircularTrains-PT-012-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [AG [~ [p3<=p8]]]
normalized: ~ [EX [E [true U p3<=p8]]]

abstracting: (p3<=p8)
states: 154
.-> the formula is FALSE

FORMULA CircularTrains-PT-012-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [[AF [EX [p11<=p12]] & ~ [p4<=0]]]
normalized: ~ [EX [~ [[~ [p4<=0] & ~ [EG [~ [EX [p11<=p12]]]]]]]]

abstracting: (p11<=p12)
states: 144
...........
EG iterations: 10
abstracting: (p4<=0)
states: 120
.-> the formula is FALSE

FORMULA CircularTrains-PT-012-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [EF [[EG [p14<=0] & [1<=p1 & p7<=p11]]]]
normalized: EG [E [true U [[1<=p1 & p7<=p11] & EG [p14<=0]]]]

abstracting: (p14<=0)
states: 150
..........................
EG iterations: 26
abstracting: (p7<=p11)
states: 144
abstracting: (1<=p1)
states: 75
.
EG iterations: 1
-> the formula is FALSE

FORMULA CircularTrains-PT-012-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AX [[E [EF [1<=p14] U [1<=p7 | 1<=p20]] & AG [[AX [~ [1<=p17]] & [p0<=0 | 1<=p22]]]]]
normalized: ~ [EX [~ [[~ [E [true U ~ [[[p0<=0 | 1<=p22] & ~ [EX [1<=p17]]]]]] & E [E [true U 1<=p14] U [1<=p7 | 1<=p20]]]]]]

abstracting: (1<=p20)
states: 171
abstracting: (1<=p7)
states: 75
abstracting: (1<=p14)
states: 45
abstracting: (1<=p17)
states: 75
.abstracting: (1<=p22)
states: 75
abstracting: (p0<=0)
states: 150
.-> the formula is FALSE

FORMULA CircularTrains-PT-012-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [AG [EF [[[p12<=p4 | 1<=p3] & [p11<=p1 | p2<=0]]]] & EX [~ [p16<=p3]]]
normalized: [EX [~ [p16<=p3]] & ~ [E [true U ~ [E [true U [[p11<=p1 | p2<=0] & [p12<=p4 | 1<=p3]]]]]]]

abstracting: (1<=p3)
states: 75
abstracting: (p12<=p4)
states: 154
abstracting: (p2<=0)
states: 120
abstracting: (p11<=p1)
states: 150
abstracting: (p16<=p3)
states: 165
.-> the formula is FALSE

FORMULA CircularTrains-PT-012-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [E [[E [1<=p16 U 1<=p23] & 1<=p2] U EG [E [[1<=p19 & p19<=1] U [p10<=p8 & 1<=p14]]]]]
normalized: ~ [EG [~ [E [[E [1<=p16 U 1<=p23] & 1<=p2] U EG [E [[1<=p19 & p19<=1] U [p10<=p8 & 1<=p14]]]]]]]

abstracting: (1<=p14)
states: 45
abstracting: (p10<=p8)
states: 144
abstracting: (p19<=1)
states: 195
abstracting: (1<=p19)
states: 45
.............
EG iterations: 13
abstracting: (1<=p2)
states: 75
abstracting: (1<=p23)
states: 45
abstracting: (1<=p16)
states: 75

EG iterations: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-012-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AX [[EF [[p16<=p20 | E [p13<=p18 U ~ [1<=p15]]]] | [p13<=p21 & ~ [p1<=p13]]]]
normalized: ~ [EX [~ [[[p13<=p21 & ~ [p1<=p13]] | E [true U [p16<=p20 | E [p13<=p18 U ~ [1<=p15]]]]]]]]

abstracting: (1<=p15)
states: 171
abstracting: (p13<=p18)
states: 144
abstracting: (p16<=p20)
states: 182
abstracting: (p1<=p13)
states: 154
abstracting: (p13<=p21)
states: 189
.-> the formula is TRUE

FORMULA CircularTrains-PT-012-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AF [[[A [EX [0<=0] U A [1<=p15 U 1<=p16]] & AX [[EX [1<=p6] | E [p15<=p5 U 1<=p10]]]] & [AX [1<=0] & [EG [1<=p4] & AG [[p17<=0 & 1<=p11]]]]]]
normalized: ~ [EG [~ [[[[~ [E [true U ~ [[p17<=0 & 1<=p11]]]] & EG [1<=p4]] & ~ [EX [~ [1<=0]]]] & [~ [EX [~ [[E [p15<=p5 U 1<=p10] | EX [1<=p6]]]]] & [~ [EG [~ [[~ [EG [~ [1<=p16]]] & ~ [E [~ [1<=p16] U [~ [1<=p15] & ~ [1<=p16]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=p16]]] & ~ [E [~ [1<=p16] U [~ [1<=p15] & ~ [1<=p16]]]]]] U [~ [EX [0<=0]] & ~ [[~ [EG [~ [1<=p16]]] & ~ [E [~ [1<=p16] U [~ [1<=p15] & ~ [1<=p16]]]]]]]]]]]]]]]

abstracting: (1<=p16)
states: 75
abstracting: (1<=p15)
states: 171
abstracting: (1<=p16)
states: 75
abstracting: (1<=p16)
states: 75
.....................
EG iterations: 21
abstracting: (0<=0)
states: 195
.abstracting: (1<=p16)
states: 75
abstracting: (1<=p15)
states: 171
abstracting: (1<=p16)
states: 75
abstracting: (1<=p16)
states: 75
.....................
EG iterations: 21
abstracting: (1<=p16)
states: 75
abstracting: (1<=p15)
states: 171
abstracting: (1<=p16)
states: 75
abstracting: (1<=p16)
states: 75
.....................
EG iterations: 21
.....................
EG iterations: 21
abstracting: (1<=p6)
states: 75
.abstracting: (1<=p10)
states: 75
abstracting: (p15<=p5)
states: 132
.abstracting: (1<=0)
states: 0
.abstracting: (1<=p4)
states: 75
....................
EG iterations: 20
abstracting: (1<=p11)
states: 75
abstracting: (p17<=0)
states: 120

EG iterations: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-012-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.052sec

checking: E [[~ [[[p13<=0 & ~ [1<=p20]] | [p1<=0 & [[[E [p18<=0 U p4<=p0] & [p3<=1 & p5<=p2]] | AX [p15<=1]] | [1<=p3 | p9<=0]]]]] & AF [~ [EG [p3<=p13]]]] U [AF [E [p20<=1 U 1<=p19]] & 1<=p19]]
normalized: E [[~ [EG [EG [p3<=p13]]] & ~ [[[p1<=0 & [[1<=p3 | p9<=0] | [~ [EX [~ [p15<=1]]] | [[p3<=1 & p5<=p2] & E [p18<=0 U p4<=p0]]]]] | [p13<=0 & ~ [1<=p20]]]]] U [1<=p19 & ~ [EG [~ [E [p20<=1 U 1<=p19]]]]]]

abstracting: (1<=p19)
states: 45
abstracting: (p20<=1)
states: 126
...............
EG iterations: 15
abstracting: (1<=p19)
states: 45
abstracting: (1<=p20)
states: 171
abstracting: (p13<=0)
states: 120
abstracting: (p4<=p0)
states: 137
abstracting: (p18<=0)
states: 120
abstracting: (p5<=p2)
states: 75
abstracting: (p3<=1)
states: 195
abstracting: (p15<=1)
states: 126
.abstracting: (p9<=0)
states: 120
abstracting: (1<=p3)
states: 75
abstracting: (p1<=0)
states: 120
abstracting: (p3<=p13)
states: 144
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA CircularTrains-PT-012-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

totally nodes used: 13280 (1.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 10624 35053 45677
used/not used/entry size/cache size: 45350 67063514 16 1024MB
basic ops cache: hits/miss/sum: 4249 16830 21079
used/not used/entry size/cache size: 31402 16745814 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: 784 2415 3199
used/not used/entry size/cache size: 2415 8386193 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 67096279
1 12334
2 132
3 55
4 18
5 8
6 10
7 4
8 3
9 6
>= 10 15

Total processing time: 0m 5.458sec


BK_STOP 1678305732628

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


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

initing FirstDep: 0m 0.000sec


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

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

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

iterations count:59 (4), effective:11 (0)

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

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

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

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

iterations count:34 (2), effective:5 (0)

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

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

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

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

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

iterations count:39 (3), effective:4 (0)

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

iterations count:31 (2), effective:6 (0)

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

iterations count:20 (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-012"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is CircularTrains-PT-012, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r074-smll-167814399900145"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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