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.r170-tall-167838856600009.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 ERK-PT-000010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856600009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 8.2K Feb 26 16:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 16:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 16:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 16:35 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 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 6.7K 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 ERK-PT-000010-CTLCardinality-00
FORMULA_NAME ERK-PT-000010-CTLCardinality-01
FORMULA_NAME ERK-PT-000010-CTLCardinality-02
FORMULA_NAME ERK-PT-000010-CTLCardinality-03
FORMULA_NAME ERK-PT-000010-CTLCardinality-04
FORMULA_NAME ERK-PT-000010-CTLCardinality-05
FORMULA_NAME ERK-PT-000010-CTLCardinality-06
FORMULA_NAME ERK-PT-000010-CTLCardinality-07
FORMULA_NAME ERK-PT-000010-CTLCardinality-08
FORMULA_NAME ERK-PT-000010-CTLCardinality-09
FORMULA_NAME ERK-PT-000010-CTLCardinality-10
FORMULA_NAME ERK-PT-000010-CTLCardinality-11
FORMULA_NAME ERK-PT-000010-CTLCardinality-12
FORMULA_NAME ERK-PT-000010-CTLCardinality-13
FORMULA_NAME ERK-PT-000010-CTLCardinality-14
FORMULA_NAME ERK-PT-000010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678463935032

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=ERK-PT-000010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 15:58:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 15:58:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 15:58:56] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-03-10 15:58:56] [INFO ] Transformed 11 places.
[2023-03-10 15:58:56] [INFO ] Transformed 11 transitions.
[2023-03-10 15:58:56] [INFO ] Parsed PT model containing 11 places and 11 transitions and 34 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 8 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-10 15:58:56] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-10 15:58:57] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-10 15:58:57] [INFO ] Invariant cache hit.
[2023-03-10 15:58:57] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2023-03-10 15:58:57] [INFO ] Invariant cache hit.
[2023-03-10 15:58:57] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 525 ms. Remains : 11/11 places, 11/11 transitions.
Support contains 11 out of 11 places after structural reductions.
[2023-03-10 15:58:57] [INFO ] Flatten gal took : 15 ms
[2023-03-10 15:58:57] [INFO ] Flatten gal took : 4 ms
[2023-03-10 15:58:57] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 89) seen :77
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-10 15:58:58] [INFO ] Invariant cache hit.
[2023-03-10 15:58:58] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 15:58:58] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:9
[2023-03-10 15:58:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 15:58:58] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :0
Fused 11 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2023-03-10 15:58:58] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 3 ms
[2023-03-10 15:58:58] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA ERK-PT-000010-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-000010-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-000010-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-000010-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 2 ms
[2023-03-10 15:58:58] [INFO ] Input system was already deterministic with 11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 2 ms
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 2 ms
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 0 ms
[2023-03-10 15:58:58] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 0 ms
[2023-03-10 15:58:58] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 0 ms
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Input system was already deterministic with 11 transitions.
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 2 ms
[2023-03-10 15:58:58] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:58] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-10 15:58:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 11 places, 11 transitions and 34 arcs took 1 ms.
Total runtime 2200 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: 11 NrTr: 11 NrArc: 34)

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

net check time: 0m 0.000sec

init dd package: 0m 2.803sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 111 (1.1e+02) #states 47,047 (4)



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

checking: EX [[2<=p4 | EF [AG [EX [7<=p2]]]]]
normalized: EX [[2<=p4 | E [true U ~ [E [true U ~ [EX [7<=p2]]]]]]]

abstracting: (7<=p2)
states: 2,086 (3)
.abstracting: (2<=p4)
states: 30,030 (4)
.-> the formula is FALSE

FORMULA ERK-PT-000010-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [AX [EX [[p6<=9 | p8<=p1]]]]
normalized: ~ [E [true U EX [~ [EX [[p6<=9 | p8<=p1]]]]]]

abstracting: (p8<=p1)
states: 23,023 (4)
abstracting: (p6<=9)
states: 46,981 (4)
..-> the formula is TRUE

FORMULA ERK-PT-000010-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [EX [EX [0<=0]] & EF [[p0<=5 & AG [[8<=p8 & 9<=p10]]]]]
normalized: [E [true U [~ [E [true U ~ [[8<=p8 & 9<=p10]]]] & p0<=5]] & EX [EX [0<=0]]]

abstracting: (0<=0)
states: 47,047 (4)
..abstracting: (p0<=5)
states: 14,854 (4)
abstracting: (9<=p10)
states: 22,165 (4)
abstracting: (8<=p8)
states: 2,541 (3)
-> the formula is FALSE

FORMULA ERK-PT-000010-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EF [~ [p3<=p4]] & AF [EX [A [p1<=p4 U 4<=p10]]]]
normalized: [~ [EG [~ [EX [[~ [EG [~ [4<=p10]]] & ~ [E [~ [4<=p10] U [~ [p1<=p4] & ~ [4<=p10]]]]]]]]] & E [true U ~ [p3<=p4]]]

abstracting: (p3<=p4)
states: 25,921 (4)
abstracting: (4<=p10)
states: 44,961 (4)
abstracting: (p1<=p4)
states: 31,031 (4)
abstracting: (4<=p10)
states: 44,961 (4)
abstracting: (4<=p10)
states: 44,961 (4)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE

FORMULA ERK-PT-000010-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EG [AX [[3<=p8 & [EF [AG [p5<=2]] & [p10<=p9 | ~ [A [p9<=p6 U 5<=p3]]]]]]]
normalized: EG [~ [EX [~ [[[[~ [[~ [EG [~ [5<=p3]]] & ~ [E [~ [5<=p3] U [~ [p9<=p6] & ~ [5<=p3]]]]]] | p10<=p9] & E [true U ~ [E [true U ~ [p5<=2]]]]] & 3<=p8]]]]]

abstracting: (3<=p8)
states: 23,022 (4)
abstracting: (p5<=2)
states: 38,401 (4)
abstracting: (p10<=p9)
states: 726
abstracting: (5<=p3)
states: 11,984 (4)
abstracting: (p9<=p6)
states: 26,922 (4)
abstracting: (5<=p3)
states: 11,984 (4)
abstracting: (5<=p3)
states: 11,984 (4)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is FALSE

FORMULA ERK-PT-000010-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

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

abstracting: (p6<=p3)
states: 31,031 (4)
abstracting: (p2<=p3)
states: 31,031 (4)
abstracting: (p6<=5)
states: 43,015 (4)
.abstracting: (p0<=p7)
states: 29,771 (4)
-> the formula is TRUE

FORMULA ERK-PT-000010-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EX [[AF [[AF [9<=p10] | ~ [p6<=p3]]] & E [A [[8<=p8 & p5<=9] U E [p2<=p1 U 3<=p6]] U EF [EX [0<=0]]]]]
normalized: EX [[E [[~ [EG [~ [E [p2<=p1 U 3<=p6]]]] & ~ [E [~ [E [p2<=p1 U 3<=p6]] U [~ [[8<=p8 & p5<=9]] & ~ [E [p2<=p1 U 3<=p6]]]]]] U E [true U EX [0<=0]]] & ~ [EG [~ [[~ [p6<=p3] | ~ [EG [~ [9<=p10]]]]]]]]]

abstracting: (9<=p10)
states: 22,165 (4)
.
EG iterations: 1
abstracting: (p6<=p3)
states: 31,031 (4)
.
EG iterations: 1
abstracting: (0<=0)
states: 47,047 (4)
.abstracting: (3<=p6)
states: 17,160 (4)
abstracting: (p2<=p1)
states: 26,922 (4)
abstracting: (p5<=9)
states: 47,046 (4)
abstracting: (8<=p8)
states: 2,541 (3)
abstracting: (3<=p6)
states: 17,160 (4)
abstracting: (p2<=p1)
states: 26,922 (4)
abstracting: (3<=p6)
states: 17,160 (4)
abstracting: (p2<=p1)
states: 26,922 (4)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA ERK-PT-000010-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EG [EF [[[A [EF [p10<=6] U AX [p9<=9]] & ~ [A [p9<=p3 U p3<=p6]]] & [4<=p1 & AX [p8<=5]]]]]
normalized: EG [E [true U [[~ [EX [~ [p8<=5]]] & 4<=p1] & [~ [[~ [EG [~ [p3<=p6]]] & ~ [E [~ [p3<=p6] U [~ [p9<=p3] & ~ [p3<=p6]]]]]] & [~ [EG [EX [~ [p9<=9]]]] & ~ [E [EX [~ [p9<=9]] U [~ [E [true U p10<=6]] & EX [~ [p9<=9]]]]]]]]]]

abstracting: (p9<=9)
states: 46,981 (4)
.abstracting: (p10<=6)
states: 11,298 (4)
abstracting: (p9<=9)
states: 46,981 (4)
.abstracting: (p9<=9)
states: 46,981 (4)
...
EG iterations: 2
abstracting: (p3<=p6)
states: 23,023 (4)
abstracting: (p9<=p3)
states: 31,031 (4)
abstracting: (p3<=p6)
states: 23,023 (4)
abstracting: (p3<=p6)
states: 23,023 (4)
.
EG iterations: 1
abstracting: (4<=p1)
states: 11,298 (4)
abstracting: (p8<=5)
states: 39,123 (4)
.
EG iterations: 0
-> the formula is TRUE

FORMULA ERK-PT-000010-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: ~ [E [[EF [p8<=p3] | p5<=p0] U [10<=p0 & [AG [p7<=p6] & AX [EX [p3<=p8]]]]]]
normalized: ~ [E [[p5<=p0 | E [true U p8<=p3]] U [10<=p0 & [~ [EX [~ [EX [p3<=p8]]]] & ~ [E [true U ~ [p7<=p6]]]]]]]

abstracting: (p7<=p6)
states: 4,900 (3)
abstracting: (p3<=p8)
states: 25,921 (4)
..abstracting: (10<=p0)
states: 4,356 (3)
abstracting: (p8<=p3)
states: 25,921 (4)
abstracting: (p5<=p0)
states: 44,359 (4)
-> the formula is TRUE

FORMULA ERK-PT-000010-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: ~ [E [[AG [[~ [A [p3<=2 U p4<=p9]] | AF [8<=p5]]] | p8<=p0] U AG [[EX [p10<=p3] & [p6<=p8 | 3<=p5]]]]]
normalized: ~ [E [[p8<=p0 | ~ [E [true U ~ [[~ [EG [~ [8<=p5]]] | ~ [[~ [EG [~ [p4<=p9]]] & ~ [E [~ [p4<=p9] U [~ [p3<=2] & ~ [p4<=p9]]]]]]]]]]] U ~ [E [true U ~ [[[p6<=p8 | 3<=p5] & EX [p10<=p3]]]]]]]

abstracting: (p10<=p3)
states: 4,900 (3)
.abstracting: (3<=p5)
states: 8,646 (3)
abstracting: (p6<=p8)
states: 31,031 (4)
abstracting: (p4<=p9)
states: 23,023 (4)
abstracting: (p3<=2)
states: 24,025 (4)
abstracting: (p4<=p9)
states: 23,023 (4)
abstracting: (p4<=p9)
states: 23,023 (4)
.
EG iterations: 1
abstracting: (8<=p5)
states: 73
.
EG iterations: 1
abstracting: (p8<=p0)
states: 42,042 (4)
-> the formula is TRUE

FORMULA ERK-PT-000010-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: [EX [EG [~ [9<=p8]]] | [~ [E [[A [[p7<=p5 & p5<=8] U p9<=p2] | [EF [p5<=2] & AF [1<=p2]]] U [AF [p1<=p4] & ~ [EF [5<=p1]]]]] & [~ [A [A [EF [5<=p5] U ~ [1<=p4]] U AG [p4<=p5]]] | EF [[[~ [p1<=p10] | ~ [3<=p1]] | [~ [8<=p3] | ~ [10<=p7]]]]]]]
normalized: [[[E [true U [[~ [10<=p7] | ~ [8<=p3]] | [~ [3<=p1] | ~ [p1<=p10]]]] | ~ [[~ [EG [E [true U ~ [p4<=p5]]]] & ~ [E [E [true U ~ [p4<=p5]] U [~ [[~ [EG [1<=p4]] & ~ [E [1<=p4 U [1<=p4 & ~ [E [true U 5<=p5]]]]]]] & E [true U ~ [p4<=p5]]]]]]]] & ~ [E [[[~ [EG [~ [1<=p2]]] & E [true U p5<=2]] | [~ [EG [~ [p9<=p2]]] & ~ [E [~ [p9<=p2] U [~ [[p7<=p5 & p5<=8]] & ~ [p9<=p2]]]]]] U [~ [E [true U 5<=p1]] & ~ [EG [~ [p1<=p4]]]]]]] | EX [EG [~ [9<=p8]]]]

abstracting: (9<=p8)
states: 1,078 (3)
.
EG iterations: 1
.abstracting: (p1<=p4)
states: 31,031 (4)
.
EG iterations: 1
abstracting: (5<=p1)
states: 7,014 (3)
abstracting: (p9<=p2)
states: 26,922 (4)
abstracting: (p5<=8)
states: 47,034 (4)
abstracting: (p7<=p5)
states: 1,001 (3)
abstracting: (p9<=p2)
states: 26,922 (4)
abstracting: (p9<=p2)
states: 26,922 (4)
..
EG iterations: 2
abstracting: (p5<=2)
states: 38,401 (4)
abstracting: (1<=p2)
states: 34,749 (4)
..
EG iterations: 2
abstracting: (p4<=p5)
states: 18,480 (4)
abstracting: (5<=p5)
states: 1,974 (3)
abstracting: (1<=p4)
states: 38,038 (4)
abstracting: (1<=p4)
states: 38,038 (4)
abstracting: (1<=p4)
states: 38,038 (4)
.
EG iterations: 1
abstracting: (p4<=p5)
states: 18,480 (4)
abstracting: (p4<=p5)
states: 18,480 (4)

EG iterations: 0
abstracting: (p1<=p10)
states: 47,047 (4)
abstracting: (3<=p1)
states: 17,160 (4)
abstracting: (8<=p3)
states: 2,541 (3)
abstracting: (10<=p7)
states: 9,009 (3)
-> the formula is TRUE

FORMULA ERK-PT-000010-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

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

abstracting: (7<=p7)
states: 30,037 (4)
.
EG iterations: 1
abstracting: (p10<=2)
states: 925
abstracting: (p3<=p1)
states: 23,023 (4)
abstracting: (p3<=4)
states: 35,063 (4)
.
EG iterations: 1
abstracting: (p6<=8)
states: 46,728 (4)
abstracting: (4<=p0)
states: 41,454 (4)
abstracting: (p7<=7)
states: 23,022 (4)
.abstracting: (10<=p8)
states: 286
abstracting: (0<=0)
states: 47,047 (4)
..abstracting: (2<=p4)
states: 30,030 (4)
abstracting: (p9<=6)
states: 44,961 (4)
abstracting: (5<=p9)
states: 7,014 (3)
abstracting: (p0<=p6)
states: 2,431 (3)
abstracting: (p3<=3)
states: 30,037 (4)
abstracting: (10<=p10)
states: 12,298 (4)
abstracting: (p0<=4)
states: 9,583 (3)
abstracting: (p3<=6)
states: 42,252 (4)
abstracting: (2<=p8)
states: 30,030 (4)
abstracting: (p0<=p9)
states: 2,431 (3)
abstracting: (2<=p8)
states: 30,030 (4)
abstracting: (2<=p8)
states: 30,030 (4)
.
EG iterations: 1
abstracting: (10<=p2)
states: 66
.abstracting: (p2<=p3)
states: 31,031 (4)
abstracting: (p6<=p3)
states: 31,031 (4)
-> the formula is TRUE

FORMULA ERK-PT-000010-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

totally nodes used: 34189 (3.4e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 183217 78032 261249
used/not used/entry size/cache size: 104157 67004707 16 1024MB
basic ops cache: hits/miss/sum: 96030 45774 141804
used/not used/entry size/cache size: 83799 16693417 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: 10094 3938 14032
used/not used/entry size/cache size: 3938 8384670 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 67079271
1 27817
2 1108
3 296
4 129
5 66
6 32
7 24
8 19
9 15
>= 10 87

Total processing time: 0m 4.454sec


BK_STOP 1678463944440

--------------------
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:251 (22), effective:80 (7)

initing FirstDep: 0m 0.000sec


iterations count:41 (3), effective:15 (1)

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

iterations count:36 (3), effective:12 (1)

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

iterations count:59 (5), effective:18 (1)

iterations count:120 (10), effective:31 (2)

iterations count:108 (9), effective:34 (3)

iterations count:51 (4), effective:20 (1)

iterations count:110 (10), effective:35 (3)

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

iterations count:71 (6), effective:18 (1)

iterations count:71 (6), effective:18 (1)

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

iterations count:71 (6), effective:18 (1)

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

iterations count:91 (8), effective:24 (2)

iterations count:176 (16), effective:52 (4)

iterations count:100 (9), effective:35 (3)

iterations count:35 (3), effective:11 (1)

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

iterations count:39 (3), effective:12 (1)

iterations count:41 (3), effective:12 (1)

iterations count:40 (3), effective:13 (1)

iterations count:81 (7), effective:20 (1)

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

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

iterations count:63 (5), effective:19 (1)

iterations count:91 (8), effective:30 (2)

iterations count:63 (5), effective:19 (1)

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

iterations count:63 (5), effective:19 (1)

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

iterations count:242 (22), effective:65 (5)

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

iterations count:74 (6), effective:18 (1)

iterations count:231 (21), effective:60 (5)

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

iterations count:39 (3), effective:12 (1)

iterations count:59 (5), effective:16 (1)

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

iterations count:132 (12), effective:39 (3)

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="ERK-PT-000010"
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 ERK-PT-000010, 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 r170-tall-167838856600009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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