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-167912708600417.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-a06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708600417
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.9K Feb 26 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 16:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 12K Feb 26 16:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 16:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 16:59 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-a06-CTLCardinality-00
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-01
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-02
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-03
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-04
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-05
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-06
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-07
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-08
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-09
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-10
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-11
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-12
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-13
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-14
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679254227261

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-a06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 19:30:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 19:30:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:30:28] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-19 19:30:28] [INFO ] Transformed 61 places.
[2023-03-19 19:30:28] [INFO ] Transformed 224 transitions.
[2023-03-19 19:30:28] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 8 transitions.
Support contains 45 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:30:28] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2023-03-19 19:30:28] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-19 19:30:29] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-19 19:30:29] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:30:29] [INFO ] Invariant cache hit.
[2023-03-19 19:30:29] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:30:29] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2023-03-19 19:30:29] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:30:29] [INFO ] Invariant cache hit.
[2023-03-19 19:30:29] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 49/49 places, 216/216 transitions.
Support contains 45 out of 49 places after structural reductions.
[2023-03-19 19:30:29] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-19 19:30:29] [INFO ] Flatten gal took : 37 ms
[2023-03-19 19:30:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Szymanski-PT-a06-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a06-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a06-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a06-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 19:30:29] [INFO ] Flatten gal took : 16 ms
[2023-03-19 19:30:29] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 41 out of 49 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10001 steps, including 18 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 49) seen :41
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 19:30:29] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:30:29] [INFO ] Invariant cache hit.
[2023-03-19 19:30:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:30:30] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 19:30:30] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 7 atomic propositions for a total of 11 simplifications.
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 11 ms
[2023-03-19 19:30:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Szymanski-PT-a06-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 12 ms
[2023-03-19 19:30:30] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 36 out of 49 places (down from 37) 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.2 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 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 7 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 7 ms. Remains : 43/49 places, 200/216 transitions.
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 9 ms
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 10 ms
[2023-03-19 19:30:30] [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 6 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 6 ms. Remains : 42/49 places, 196/216 transitions.
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 9 ms
[2023-03-19 19:30: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 5 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 5 ms. Remains : 43/49 places, 200/216 transitions.
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:30:30] [INFO ] Input system was already deterministic with 200 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 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 27 place count 42 transition count 180
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 41 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 41 transition count 176
Applied a total of 29 rules in 23 ms. Remains 41 /49 variables (removed 8) and now considering 176/216 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 41/49 places, 176/216 transitions.
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:30:30] [INFO ] Input system was already deterministic with 176 transitions.
Finished random walk after 105 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=105 )
FORMULA Szymanski-PT-a06-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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:30:30] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:30: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 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:30:30] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:30: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 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 44 transition count 204
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 44 transition count 204
Applied a total of 8 rules in 3 ms. Remains 44 /49 variables (removed 5) and now considering 204/216 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 44/49 places, 204/216 transitions.
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:30:30] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 48 transition count 216
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 45 transition count 204
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 45 transition count 204
Applied a total of 7 rules in 2 ms. Remains 45 /49 variables (removed 4) and now considering 204/216 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 45/49 places, 204/216 transitions.
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:30:30] [INFO ] Input system was already deterministic with 204 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 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 44 transition count 204
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 44 transition count 204
Applied a total of 8 rules in 3 ms. Remains 44 /49 variables (removed 5) and now considering 204/216 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 44/49 places, 204/216 transitions.
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:30:30] [INFO ] Input system was already deterministic with 204 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:30:30] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:30:30] [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 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:30:30] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:30:30] [INFO ] Input system was already deterministic with 200 transitions.
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:30:30] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:30:30] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-19 19:30:30] [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 1961 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.711sec


RS generation: 0m 3.216sec


-> reachability set: #nodes 4002 (4.0e+03) #states 29,158,928,706 (10)



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

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

abstracting: (0<=0)
states: 29,158,928,706 (10)
.-> the formula is FALSE

FORMULA Szymanski-PT-a06-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.578sec

checking: AG [EX [p31<=3]]
normalized: ~ [E [true U ~ [EX [p31<=3]]]]

abstracting: (p31<=3)
states: 29,122,797,603 (10)
.-> the formula is FALSE

FORMULA Szymanski-PT-a06-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.670sec

checking: EG [[EG [E [[EX [p26<=2] & ~ [2<=p47]] U p32<=1]] & EF [~ [p25<=0]]]]
normalized: EG [[EG [E [[~ [2<=p47] & EX [p26<=2]] U p32<=1]] & E [true U ~ [p25<=0]]]]

abstracting: (p25<=0)
states: 21,714,414,343 (10)
abstracting: (p32<=1)
states: 27,655,586,882 (10)
abstracting: (p26<=2)
states: 28,855,413,913 (10)
.abstracting: (2<=p47)
states: 1,503,341,824 (9)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 1.195sec

checking: [[EF [p1<=p21] & AG [EX [p25<=0]]] | AG [[AX [1<=0] & ~ [p19<=3]]]]
normalized: [~ [E [true U ~ [[~ [p19<=3] & ~ [EX [~ [1<=0]]]]]]] | [~ [E [true U ~ [EX [p25<=0]]]] & E [true U p1<=p21]]]

abstracting: (p1<=p21)
states: 21,796,732,378 (10)
abstracting: (p25<=0)
states: 21,714,414,343 (10)
.abstracting: (1<=0)
states: 0
.abstracting: (p19<=3)
states: 29,115,227,475 (10)
-> the formula is FALSE

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

MC time: 0m 1.065sec

checking: EG [[A [[4<=p24 | EG [~ [p31<=0]]] U A [p45<=4 U EG [5<=p28]]] | EX [EF [EG [3<=p23]]]]]
normalized: EG [[EX [E [true U EG [3<=p23]]] | [~ [EG [~ [[~ [EG [~ [EG [5<=p28]]]] & ~ [E [~ [EG [5<=p28]] U [~ [p45<=4] & ~ [EG [5<=p28]]]]]]]]] & ~ [E [~ [[~ [EG [~ [EG [5<=p28]]]] & ~ [E [~ [EG [5<=p28]] U [~ [p45<=4] & ~ [EG [5<=p28]]]]]]] U [~ [[4<=p24 | EG [~ [p31<=0]]]] & ~ [[~ [EG [~ [EG [5<=p28]]]] & ~ [E [~ [EG [5<=p28]] U [~ [p45<=4] & ~ [EG [5<=p28]]]]]]]]]]]]]

abstracting: (5<=p28)
states: 4,373,416 (6)
.
EG iterations: 1
abstracting: (p45<=4)
states: 29,155,497,477 (10)
abstracting: (5<=p28)
states: 4,373,416 (6)
.
EG iterations: 1
abstracting: (5<=p28)
states: 4,373,416 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p31<=0)
states: 22,040,540,614 (10)
.
EG iterations: 1
abstracting: (4<=p24)
states: 43,701,231 (7)
abstracting: (5<=p28)
states: 4,373,416 (6)
.
EG iterations: 1
abstracting: (p45<=4)
states: 29,155,497,477 (10)
abstracting: (5<=p28)
states: 4,373,416 (6)
.
EG iterations: 1
abstracting: (5<=p28)
states: 4,373,416 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (5<=p28)
states: 4,373,416 (6)
.
EG iterations: 1
abstracting: (p45<=4)
states: 29,155,497,477 (10)
abstracting: (5<=p28)
states: 4,373,416 (6)
.
EG iterations: 1
abstracting: (5<=p28)
states: 4,373,416 (6)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (3<=p23)
states: 303,514,793 (8)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 3.718sec

checking: AG [A [~ [p12<=p9] U AX [[A [p4<=p1 U p15<=5] & ~ [4<=p33]]]]]
normalized: ~ [E [true U ~ [[~ [EG [EX [~ [[~ [4<=p33] & [~ [EG [~ [p15<=5]]] & ~ [E [~ [p15<=5] U [~ [p4<=p1] & ~ [p15<=5]]]]]]]]]] & ~ [E [EX [~ [[~ [4<=p33] & [~ [EG [~ [p15<=5]]] & ~ [E [~ [p15<=5] U [~ [p4<=p1] & ~ [p15<=5]]]]]]]] U [p12<=p9 & EX [~ [[~ [4<=p33] & [~ [EG [~ [p15<=5]]] & ~ [E [~ [p15<=5] U [~ [p4<=p1] & ~ [p15<=5]]]]]]]]]]]]]]]

abstracting: (p15<=5)
states: 29,158,700,479 (10)
abstracting: (p4<=p1)
states: 29,092,773,598 (10)
abstracting: (p15<=5)
states: 29,158,700,479 (10)
abstracting: (p15<=5)
states: 29,158,700,479 (10)
.
EG iterations: 1
abstracting: (4<=p33)
states: 36,131,103 (7)
.abstracting: (p12<=p9)
states: 26,094,204,849 (10)
abstracting: (p15<=5)
states: 29,158,700,479 (10)
abstracting: (p4<=p1)
states: 29,092,773,598 (10)
abstracting: (p15<=5)
states: 29,158,700,479 (10)
abstracting: (p15<=5)
states: 29,158,700,479 (10)
.
EG iterations: 1
abstracting: (4<=p33)
states: 36,131,103 (7)
.abstracting: (p15<=5)
states: 29,158,700,479 (10)
abstracting: (p4<=p1)
states: 29,092,773,598 (10)
abstracting: (p15<=5)
states: 29,158,700,479 (10)
abstracting: (p15<=5)
states: 29,158,700,479 (10)
.
EG iterations: 1
abstracting: (4<=p33)
states: 36,131,103 (7)
..
EG iterations: 1
-> the formula is FALSE

FORMULA Szymanski-PT-a06-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.798sec

checking: [EX [[~ [E [p10<=2 U 4<=p22]] | ~ [A [p6<=p3 U p13<=0]]]] | EX [EF [AX [2<=p42]]]]
normalized: [EX [E [true U ~ [EX [~ [2<=p42]]]]] | EX [[~ [[~ [EG [~ [p13<=0]]] & ~ [E [~ [p13<=0] U [~ [p6<=p3] & ~ [p13<=0]]]]]] | ~ [E [p10<=2 U 4<=p22]]]]]

abstracting: (4<=p22)
states: 43,701,231 (7)
abstracting: (p10<=2)
states: 29,153,609,937 (10)
abstracting: (p13<=0)
states: 20,586,176,071 (10)
abstracting: (p6<=p3)
states: 28,495,488,214 (10)
abstracting: (p13<=0)
states: 20,586,176,071 (10)
abstracting: (p13<=0)
states: 20,586,176,071 (10)
.
EG iterations: 1
.abstracting: (2<=p42)
states: 1,503,341,824 (9)
..-> the formula is TRUE

FORMULA Szymanski-PT-a06-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.097sec

checking: AG [[[[AG [AX [3<=p10]] & EF [[4<=p18 | p13<=0]]] & [6<=p37 & 1<=p18]] | [p26<=2 & p14<=6]]]
normalized: ~ [E [true U ~ [[[p26<=2 & p14<=6] | [[~ [E [true U EX [~ [3<=p10]]]] & E [true U [4<=p18 | p13<=0]]] & [6<=p37 & 1<=p18]]]]]]

abstracting: (1<=p18)
states: 7,444,514,363 (9)
abstracting: (6<=p37)
states: 169,575 (5)
abstracting: (p13<=0)
states: 20,586,176,071 (10)
abstracting: (4<=p18)
states: 43,701,231 (7)
abstracting: (3<=p10)
states: 5,318,769 (6)
.abstracting: (p14<=6)
states: 29,158,928,706 (10)
abstracting: (p26<=2)
states: 28,855,413,913 (10)
-> the formula is FALSE

FORMULA Szymanski-PT-a06-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.768sec

checking: [[EX [[[[EX [~ [1<=p29]] & 1<=p2] | AX [~ [p41<=3]]] & EX [0<=0]]] | AX [1<=0]] & AF [E [[~ [4<=p26] & p39<=p41] U 2<=p16]]]
normalized: [[~ [EX [~ [1<=0]]] | EX [[EX [0<=0] & [~ [EX [p41<=3]] | [1<=p2 & EX [~ [1<=p29]]]]]]] & ~ [EG [~ [E [[p39<=p41 & ~ [4<=p26]] U 2<=p16]]]]]

abstracting: (2<=p16)
states: 1,647,184,612 (9)
abstracting: (4<=p26)
states: 43,701,231 (7)
abstracting: (p39<=p41)
states: 23,312,842,646 (10)
.
EG iterations: 1
abstracting: (1<=p29)
states: 7,444,514,363 (9)
.abstracting: (1<=p2)
states: 9,988,440,149 (9)
abstracting: (p41<=3)
states: 29,122,797,603 (10)
.abstracting: (0<=0)
states: 29,158,928,706 (10)
..abstracting: (1<=0)
states: 0
.-> the formula is TRUE

FORMULA Szymanski-PT-a06-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.775sec

checking: E [~ [[6<=p13 & ~ [A [p32<=p48 U EX [0<=0]]]]] U [AF [[E [AG [6<=p13] U p43<=p18] & [EG [3<=p13] | EF [p46<=p32]]]] & [[AX [[p3<=5 & p23<=p26]] | EX [1<=p24]] & [~ [EF [p20<=0]] | p29<=0]]]]
normalized: E [~ [[6<=p13 & ~ [[~ [EG [~ [EX [0<=0]]]] & ~ [E [~ [EX [0<=0]] U [~ [p32<=p48] & ~ [EX [0<=0]]]]]]]]] U [[[p29<=0 | ~ [E [true U p20<=0]]] & [EX [1<=p24] | ~ [EX [~ [[p3<=5 & p23<=p26]]]]]] & ~ [EG [~ [[[E [true U p46<=p32] | EG [3<=p13]] & E [~ [E [true U ~ [6<=p13]]] U p43<=p18]]]]]]]

abstracting: (p43<=p18)
states: 23,555,306,572 (10)
abstracting: (6<=p13)
states: 280,894 (5)
abstracting: (3<=p13)
states: 356,890,353 (8)
.
EG iterations: 1
abstracting: (p46<=p32)
states: 23,312,842,646 (10)
.
EG iterations: 1
abstracting: (p23<=p26)
states: 23,097,640,204 (10)
abstracting: (p3<=5)
states: 29,158,928,706 (10)
.abstracting: (1<=p24)
states: 7,444,514,363 (9)
.abstracting: (p20<=0)
states: 21,714,414,343 (10)
abstracting: (p29<=0)
states: 21,714,414,343 (10)
abstracting: (0<=0)
states: 29,158,928,706 (10)
.abstracting: (p32<=p48)
states: 23,006,506,850 (10)
abstracting: (0<=0)
states: 29,158,928,706 (10)
.abstracting: (0<=0)
states: 29,158,928,706 (10)
..
EG iterations: 1
abstracting: (6<=p13)
states: 280,894 (5)
-> the formula is TRUE

FORMULA Szymanski-PT-a06-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.946sec

totally nodes used: 4524400 (4.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 176081755 71483442 247565197
used/not used/entry size/cache size: 43885839 23223025 16 1024MB
basic ops cache: hits/miss/sum: 10857646 3851251 14708897
used/not used/entry size/cache size: 5793564 10983652 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: 89990 39666 129656
used/not used/entry size/cache size: 39567 8349041 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 62860237
1 4050957
2 174122
3 13943
4 3326
5 1747
6 1167
7 629
8 443
9 345
>= 10 1948

Total processing time: 0m31.708sec


BK_STOP 1679254267169

--------------------
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

3291 4692
iterations count:289159 (1338), effective:7823 (36)

initing FirstDep: 0m 0.000sec


iterations count:63019 (291), effective:705 (3)
5306
iterations count:128101 (593), effective:1466 (6)

iterations count:5644 (26), effective:103 (0)

iterations count:6909 (31), effective:73 (0)

iterations count:3148 (14), effective:20 (0)

iterations count:8142 (37), effective:162 (0)

iterations count:216 (1), effective:0 (0)
6492
iterations count:126078 (583), effective:1366 (6)
6492
iterations count:126078 (583), effective:1366 (6)

iterations count:7849 (36), effective:96 (0)
6492
iterations count:126078 (583), effective:1366 (6)

iterations count:9798 (45), effective:319 (1)

iterations count:4193 (19), effective:36 (0)

iterations count:29800 (137), effective:642 (2)

iterations count:13868 (64), effective:517 (2)

iterations count:5209 (24), effective:44 (0)

iterations count:98109 (454), effective:1013 (4)

iterations count:3709 (17), effective:38 (0)

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

iterations count:11818 (54), effective:342 (1)

iterations count:9725 (45), effective:169 (0)

iterations count:562 (2), effective:4 (0)

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

iterations count:6448 (29), effective:69 (0)

iterations count:2743 (12), effective:43 (0)

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

iterations count:34194 (158), effective:790 (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="Szymanski-PT-a06"
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-a06, 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-167912708600417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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