Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r490-tall-167912708600409.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 Szymanski-PT-a04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708600409
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K Feb 26 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 16:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 16:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 101K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-00
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-01
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-02
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-03
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-04
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-05
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-06
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-07
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-08
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-09
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-10
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-11
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-12
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-13
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-14
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679253867855

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=Szymanski-PT-a04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 19:24:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 19:24:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:24:29] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-19 19:24:29] [INFO ] Transformed 61 places.
[2023-03-19 19:24:29] [INFO ] Transformed 224 transitions.
[2023-03-19 19:24:29] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 115 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Szymanski-PT-a04-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a04-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a04-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Applied a total of 0 rules in 12 ms. Remains 49 /49 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-19 19:24:29] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2023-03-19 19:24:29] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-19 19:24:29] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-19 19:24:29] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:24:29] [INFO ] Invariant cache hit.
[2023-03-19 19:24:29] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:24:29] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-19 19:24:29] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:24:29] [INFO ] Invariant cache hit.
[2023-03-19 19:24:29] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 351 ms. Remains : 49/49 places, 216/216 transitions.
Support contains 39 out of 49 places after structural reductions.
[2023-03-19 19:24:29] [INFO ] Flatten gal took : 39 ms
[2023-03-19 19:24:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Szymanski-PT-a04-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 19:24:29] [INFO ] Flatten gal took : 17 ms
[2023-03-19 19:24:30] [INFO ] Input system was already deterministic with 216 transitions.
Incomplete random walk after 10002 steps, including 20 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 48) seen :40
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 19:24:30] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:24:30] [INFO ] Invariant cache hit.
[2023-03-19 19:24:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:24:30] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 19:24:30] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:2
[2023-03-19 19:24:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:24:30] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:24:30] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
FORMULA Szymanski-PT-a04-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 19:24:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-19 19:24:30] [INFO ] Flatten gal took : 11 ms
FORMULA Szymanski-PT-a04-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 19:24:30] [INFO ] Flatten gal took : 11 ms
[2023-03-19 19:24:30] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 27 out of 49 places (down from 38) after GAL structural reductions.
Computed a total of 9 stabilizing places and 36 stable transitions
Graph (complete) has 384 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 42 transition count 196
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 42 transition count 196
Applied a total of 12 rules in 7 ms. Remains 42 /49 variables (removed 7) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 42/49 places, 196/216 transitions.
[2023-03-19 19:24:30] [INFO ] Flatten gal took : 9 ms
[2023-03-19 19:24:30] [INFO ] Flatten gal took : 10 ms
[2023-03-19 19:24:30] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 42 transition count 196
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 42 transition count 196
Applied a total of 12 rules in 5 ms. Remains 42 /49 variables (removed 7) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 42/49 places, 196/216 transitions.
[2023-03-19 19:24:30] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:24:30] [INFO ] Flatten gal took : 9 ms
[2023-03-19 19:24:30] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 42 transition count 196
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 42 transition count 196
Applied a total of 12 rules in 5 ms. Remains 42 /49 variables (removed 7) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 42/49 places, 196/216 transitions.
[2023-03-19 19:24:30] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:24:30] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:24:30] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 43 transition count 200
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 43 transition count 200
Applied a total of 10 rules in 4 ms. Remains 43 /49 variables (removed 6) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 43/49 places, 200/216 transitions.
[2023-03-19 19:24:31] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:24:31] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:24:31] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 42 transition count 196
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 42 transition count 196
Applied a total of 12 rules in 4 ms. Remains 42 /49 variables (removed 7) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 42/49 places, 196/216 transitions.
[2023-03-19 19:24:31] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:24:31] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:24:31] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Graph (complete) has 384 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 200
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 25 place count 43 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 26 place count 42 transition count 180
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 42 transition count 180
Applied a total of 27 rules in 24 ms. Remains 42 /49 variables (removed 7) and now considering 180/216 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 42/49 places, 180/216 transitions.
[2023-03-19 19:24:31] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:24:31] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:24:31] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 43 transition count 200
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 43 transition count 200
Applied a total of 10 rules in 3 ms. Remains 43 /49 variables (removed 6) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 43/49 places, 200/216 transitions.
[2023-03-19 19:24:31] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:24:31] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:24:31] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 42 transition count 196
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 42 transition count 196
Applied a total of 12 rules in 3 ms. Remains 42 /49 variables (removed 7) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/49 places, 196/216 transitions.
[2023-03-19 19:24:31] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:24:31] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:24:31] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 42 transition count 196
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 42 transition count 196
Applied a total of 12 rules in 3 ms. Remains 42 /49 variables (removed 7) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/49 places, 196/216 transitions.
[2023-03-19 19:24:31] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:24:31] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:24:31] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 43 transition count 200
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 43 transition count 200
Applied a total of 10 rules in 2 ms. Remains 43 /49 variables (removed 6) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/49 places, 200/216 transitions.
[2023-03-19 19:24:31] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:24:31] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:24:31] [INFO ] Input system was already deterministic with 200 transitions.
[2023-03-19 19:24:31] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:24:31] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:24:31] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-19 19:24:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 49 places, 216 transitions and 868 arcs took 1 ms.
Total runtime 2383 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: 49 NrTr: 216 NrArc: 868)

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

net check time: 0m 0.000sec

init dd package: 0m 2.729sec


RS generation: 0m 1.144sec


-> reachability set: #nodes 1969 (2.0e+03) #states 87,423,102 (7)



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

checking: EF [EX [AG [p37<=1]]]
normalized: E [true U EX [~ [E [true U ~ [p37<=1]]]]]

abstracting: (p37<=1)
states: 85,246,915 (7)
.-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.195sec

checking: EF [EX [AG [AX [~ [p36<=p7]]]]]
normalized: E [true U EX [~ [E [true U EX [p36<=p7]]]]]

abstracting: (p36<=p7)
states: 71,821,366 (7)
..-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.156sec

checking: E [~ [AX [AX [~ [p26<=0]]]] U 1<=p43]
normalized: E [EX [EX [p26<=0]] U 1<=p43]

abstracting: (1<=p43)
states: 15,607,057 (7)
abstracting: (p26<=0)
states: 71,041,505 (7)
..-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.636sec

checking: EF [[AX [AX [[~ [p6<=0] | ~ [p40<=p3]]]] & AX [1<=0]]]
normalized: E [true U [~ [EX [~ [1<=0]]] & ~ [EX [EX [~ [[~ [p40<=p3] | ~ [p6<=0]]]]]]]]

abstracting: (p6<=0)
states: 86,210,710 (7)
abstracting: (p40<=p3)
states: 72,131,038 (7)
..abstracting: (1<=0)
states: 0
.-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.881sec

checking: A [p34<=3 U ~ [[AG [[3<=p11 | AG [p32<=2]]] & EF [~ [AX [p16<=3]]]]]]
normalized: [~ [EG [[~ [E [true U ~ [[3<=p11 | ~ [E [true U ~ [p32<=2]]]]]]] & E [true U EX [~ [p16<=3]]]]]] & ~ [E [[~ [E [true U ~ [[3<=p11 | ~ [E [true U ~ [p32<=2]]]]]]] & E [true U EX [~ [p16<=3]]]] U [[~ [E [true U ~ [[3<=p11 | ~ [E [true U ~ [p32<=2]]]]]]] & E [true U EX [~ [p16<=3]]]] & ~ [p34<=3]]]]]

abstracting: (p34<=3)
states: 87,412,443 (7)
abstracting: (p16<=3)
states: 87,409,993 (7)
.abstracting: (p32<=2)
states: 87,212,217 (7)
abstracting: (3<=p11)
states: 1,279 (3)
abstracting: (p16<=3)
states: 87,409,993 (7)
.abstracting: (p32<=2)
states: 87,212,217 (7)
abstracting: (3<=p11)
states: 1,279 (3)
abstracting: (p16<=3)
states: 87,409,993 (7)
.abstracting: (p32<=2)
states: 87,212,217 (7)
abstracting: (3<=p11)
states: 1,279 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.353sec

checking: AG [[p14<=p41 | EF [p19<=p20]]]
normalized: ~ [E [true U ~ [[p14<=p41 | E [true U p19<=p20]]]]]

abstracting: (p19<=p20)
states: 73,211,997 (7)
abstracting: (p14<=p41)
states: 73,613,111 (7)
-> the formula is FALSE

FORMULA Szymanski-PT-a04-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.754sec

checking: ~ [E [EF [AX [AX [p32<=0]]] U A [AF [p41<=p36] U ~ [AG [[p32<=2 | 1<=p10]]]]]]
normalized: ~ [E [E [true U ~ [EX [EX [~ [p32<=0]]]]] U [~ [EG [~ [E [true U ~ [[p32<=2 | 1<=p10]]]]]] & ~ [E [~ [E [true U ~ [[p32<=2 | 1<=p10]]]] U [EG [~ [p41<=p36]] & ~ [E [true U ~ [[p32<=2 | 1<=p10]]]]]]]]]]

abstracting: (1<=p10)
states: 5,318,769 (6)
abstracting: (p32<=2)
states: 87,212,217 (7)
abstracting: (p41<=p36)
states: 73,792,006 (7)
.
EG iterations: 1
abstracting: (1<=p10)
states: 5,318,769 (6)
abstracting: (p32<=2)
states: 87,212,217 (7)
abstracting: (1<=p10)
states: 5,318,769 (6)
abstracting: (p32<=2)
states: 87,212,217 (7)
.
EG iterations: 1
abstracting: (p32<=0)
states: 71,816,045 (7)
..-> the formula is FALSE

FORMULA Szymanski-PT-a04-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.608sec

checking: [EF [[[AX [~ [p30<=3]] & ~ [p47<=p14]] | AF [AG [p35<=3]]]] | EG [p10<=0]]
normalized: [EG [p10<=0] | E [true U [~ [EG [E [true U ~ [p35<=3]]]] | [~ [p47<=p14] & ~ [EX [p30<=3]]]]]]

abstracting: (p30<=3)
states: 87,418,257 (7)
.abstracting: (p47<=p14)
states: 74,409,631 (7)
abstracting: (p35<=3)
states: 87,412,443 (7)
.
EG iterations: 1
abstracting: (p10<=0)
states: 82,104,333 (7)
..
EG iterations: 2
-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.430sec

checking: EG [[p25<=p24 & EX [A [AG [p6<=p37] U [[2<=p11 | p16<=p34] & ~ [4<=p9]]]]]]
normalized: EG [[p25<=p24 & EX [[~ [EG [~ [[~ [4<=p9] & [2<=p11 | p16<=p34]]]]] & ~ [E [~ [[~ [4<=p9] & [2<=p11 | p16<=p34]]] U [E [true U ~ [p6<=p37]] & ~ [[~ [4<=p9] & [2<=p11 | p16<=p34]]]]]]]]]]

abstracting: (p16<=p34)
states: 73,613,111 (7)
abstracting: (2<=p11)
states: 116,629 (5)
abstracting: (4<=p9)
states: 1
abstracting: (p6<=p37)
states: 86,387,595 (7)
abstracting: (p16<=p34)
states: 73,613,111 (7)
abstracting: (2<=p11)
states: 116,629 (5)
abstracting: (4<=p9)
states: 1
abstracting: (p16<=p34)
states: 73,613,111 (7)
abstracting: (2<=p11)
states: 116,629 (5)
abstracting: (4<=p9)
states: 1
..
EG iterations: 2
.abstracting: (p25<=p24)
states: 73,211,997 (7)
..
EG iterations: 2
-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.494sec

checking: EG [[[[[[1<=p35 & AF [p29<=0]] & ~ [E [EX [p21<=2] U [2<=p21 & 3<=p40]]]] | p38<=0] | [EX [p35<=p37] | ~ [2<=p39]]] | [EG [~ [3<=p36]] | [EX [p32<=0] | EG [EX [~ [p41<=p10]]]]]]]
normalized: EG [[[[EG [EX [~ [p41<=p10]]] | EX [p32<=0]] | EG [~ [3<=p36]]] | [[~ [2<=p39] | EX [p35<=p37]] | [p38<=0 | [~ [E [EX [p21<=2] U [2<=p21 & 3<=p40]]] & [1<=p35 & ~ [EG [~ [p29<=0]]]]]]]]]

abstracting: (p29<=0)
states: 71,041,505 (7)
.
EG iterations: 1
abstracting: (1<=p35)
states: 15,607,057 (7)
abstracting: (3<=p40)
states: 210,885 (5)
abstracting: (2<=p21)
states: 2,402,859 (6)
abstracting: (p21<=2)
states: 87,177,626 (7)
.abstracting: (p38<=0)
states: 71,816,045 (7)
abstracting: (p35<=p37)
states: 73,792,006 (7)
.abstracting: (2<=p39)
states: 2,176,187 (6)
abstracting: (3<=p36)
states: 210,885 (5)
.
EG iterations: 1
abstracting: (p32<=0)
states: 71,816,045 (7)
.abstracting: (p41<=p10)
states: 72,504,334 (7)
..
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.566sec

totally nodes used: 1813851 (1.8e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 44312606 28046621 72359227
used/not used/entry size/cache size: 23543526 43565338 16 1024MB
basic ops cache: hits/miss/sum: 3578175 1553718 5131893
used/not used/entry size/cache size: 2669640 14107576 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: 30938 19127 50065
used/not used/entry size/cache size: 19103 8369505 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 65368548
1 1689523
2 45947
3 2736
4 565
5 269
6 155
7 92
8 112
9 43
>= 10 874

Total processing time: 0m14.805sec


BK_STOP 1679253894701

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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

2387
iterations count:154815 (716), effective:3975 (18)

initing FirstDep: 0m 0.000sec


iterations count:46426 (214), effective:508 (2)

iterations count:26874 (124), effective:320 (1)

iterations count:5270 (24), effective:48 (0)

iterations count:24276 (112), effective:261 (1)

iterations count:29585 (136), effective:322 (1)

iterations count:63019 (291), effective:705 (3)

iterations count:16413 (75), effective:333 (1)

iterations count:71152 (329), effective:793 (3)

iterations count:1246 (5), effective:15 (0)

iterations count:16413 (75), effective:333 (1)

iterations count:71152 (329), effective:793 (3)

iterations count:1246 (5), effective:15 (0)

iterations count:16413 (75), effective:333 (1)

iterations count:71152 (329), effective:793 (3)

iterations count:1246 (5), effective:15 (0)

iterations count:9950 (46), effective:151 (0)

iterations count:90707 (419), effective:1266 (5)

iterations count:71250 (329), effective:796 (3)

iterations count:71250 (329), effective:796 (3)

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

iterations count:71250 (329), effective:796 (3)

iterations count:12970 (60), effective:166 (0)

iterations count:216 (1), effective:0 (0)
1684
iterations count:101141 (468), effective:1108 (5)
4143
iterations count:132870 (615), effective:1375 (6)

iterations count:6181 (28), effective:67 (0)

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

iterations count:78991 (365), effective:1016 (4)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Szymanski-PT-a04"
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 Szymanski-PT-a04, 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 r490-tall-167912708600409"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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