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.r458-smll-167912649700017.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 SmallOperatingSystem-PT-MT0032DC0016, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912649700017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 12:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 12:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 12:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Feb 25 12:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 8.2K 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 SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679231191676

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=SmallOperatingSystem-PT-MT0032DC0016
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 13:06:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 13:06:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:06:35] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-19 13:06:35] [INFO ] Transformed 9 places.
[2023-03-19 13:06:35] [INFO ] Transformed 8 transitions.
[2023-03-19 13:06:35] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Initial state reduction rules removed 2 formulas.
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 19 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-19 13:06:35] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-19 13:06:35] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-19 13:06:35] [INFO ] Invariant cache hit.
[2023-03-19 13:06:35] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-19 13:06:35] [INFO ] Invariant cache hit.
[2023-03-19 13:06:35] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 438 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 13:06:36] [INFO ] Flatten gal took : 29 ms
[2023-03-19 13:06:36] [INFO ] Flatten gal took : 8 ms
[2023-03-19 13:06:36] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 57) seen :47
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) 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 10) 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 10) seen :0
Running SMT prover for 10 properties.
[2023-03-19 13:06:37] [INFO ] Invariant cache hit.
[2023-03-19 13:06:37] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 13:06:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-19 13:06:37] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :0
Fused 10 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 10 atomic propositions for a total of 14 simplifications.
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 13:06:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 5 ms
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:06:37] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:37] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 6 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 8/9 places, 7/8 transitions.
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 8 ms
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:37] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 7 transition count 6
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 2 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 6 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7 place count 4 transition count 5
Applied a total of 7 rules in 9 ms. Remains 4 /9 variables (removed 5) and now considering 5/8 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 4/9 places, 5/8 transitions.
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:37] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 3 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 4 transition count 5
Applied a total of 7 rules in 2 ms. Remains 4 /9 variables (removed 5) and now considering 5/8 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 4/9 places, 5/8 transitions.
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:37] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
Applied a total of 5 rules in 2 ms. Remains 5 /9 variables (removed 4) and now considering 6/8 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 5/9 places, 6/8 transitions.
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:37] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 149 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=149 )
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:06:37] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 7/8 transitions.
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:37] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
Applied a total of 5 rules in 1 ms. Remains 5 /9 variables (removed 4) and now considering 6/8 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 5/9 places, 6/8 transitions.
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:37] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 7 transition count 6
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 2 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 6 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7 place count 4 transition count 5
Applied a total of 7 rules in 2 ms. Remains 4 /9 variables (removed 5) and now considering 5/8 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 4/9 places, 5/8 transitions.
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 0 ms
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 0 ms
[2023-03-19 13:06:37] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
Applied a total of 5 rules in 2 ms. Remains 5 /9 variables (removed 4) and now considering 6/8 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 5/9 places, 6/8 transitions.
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 0 ms
[2023-03-19 13:06:37] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:37] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:37] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:06:37] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-19 13:06:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 8 transitions and 27 arcs took 0 ms.
Total runtime 2921 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: 9 NrTr: 8 NrArc: 27)

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

net check time: 0m 0.000sec

init dd package: 0m 3.775sec


RS generation: 0m 0.021sec


-> reachability set: #nodes 473 (4.7e+02) #states 354,501 (5)



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

checking: AG [EF [~ [p6<=3]]]
normalized: ~ [E [true U ~ [E [true U ~ [p6<=3]]]]]

abstracting: (p6<=3)
states: 56
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [AG [EF [AX [p0<=24]]]]
normalized: EG [~ [E [true U ~ [E [true U ~ [EX [~ [p0<=24]]]]]]]]

abstracting: (p0<=24)
states: 201,159 (5)
.
EG iterations: 0
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: E [~ [p6<=p5] U AG [~ [17<=p7]]]
normalized: E [~ [p6<=p5] U ~ [E [true U 17<=p7]]]

abstracting: (17<=p7)
states: 15,504 (4)
abstracting: (p6<=p5)
states: 33
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [~ [A [16<=p7 U [~ [14<=p5] & EF [3<=p7]]]]]
normalized: E [true U ~ [[~ [EG [~ [[E [true U 3<=p7] & ~ [14<=p5]]]]] & ~ [E [~ [[E [true U 3<=p7] & ~ [14<=p5]]] U [~ [16<=p7] & ~ [[E [true U 3<=p7] & ~ [14<=p5]]]]]]]]]

abstracting: (14<=p5)
states: 33,558 (4)
abstracting: (3<=p7)
states: 241,128 (5)
abstracting: (16<=p7)
states: 20,349 (4)
abstracting: (14<=p5)
states: 33,558 (4)
abstracting: (3<=p7)
states: 241,128 (5)
abstracting: (14<=p5)
states: 33,558 (4)
abstracting: (3<=p7)
states: 241,128 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: AF [[AG [p1<=10] | [6<=p1 & EF [~ [p3<=15]]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [p1<=10]]] | [E [true U ~ [p3<=15]] & 6<=p1]]]]]

abstracting: (6<=p1)
states: 155,754 (5)
abstracting: (p3<=15)
states: 353,532 (5)
abstracting: (p1<=10)
states: 290,037 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: EF [[EF [[~ [A [4<=p4 U p5<=15]] & AG [~ [p6<=22]]]] & ~ [20<=p0]]]
normalized: E [true U [~ [20<=p0] & E [true U [~ [E [true U p6<=22]] & ~ [[~ [EG [~ [p5<=15]]] & ~ [E [~ [p5<=15] U [~ [4<=p4] & ~ [p5<=15]]]]]]]]]]

abstracting: (p5<=15)
states: 334,152 (5)
abstracting: (4<=p4)
states: 209,763 (5)
abstracting: (p5<=15)
states: 334,152 (5)
abstracting: (p5<=15)
states: 334,152 (5)
.
EG iterations: 1
abstracting: (p6<=22)
states: 78,336 (4)
abstracting: (20<=p0)
states: 278,278 (5)
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AF [[EF [~ [5<=p7]] & [~ [p5<=15] & AX [[p3<=p0 & 17<=p1]]]]]
normalized: ~ [EG [~ [[[~ [EX [~ [[p3<=p0 & 17<=p1]]]] & ~ [p5<=15]] & E [true U ~ [5<=p7]]]]]]

abstracting: (5<=p7)
states: 181,356 (5)
abstracting: (p5<=15)
states: 334,152 (5)
abstracting: (17<=p1)
states: 15,504 (4)
abstracting: (p3<=p0)
states: 354,501 (5)
.
EG iterations: 0
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: A [AX [AF [E [p7<=24 U [p5<=6 & p8<=21]]]] U E [E [~ [[8<=p5 & p7<=21]] U ~ [[~ [p2<=p7] | [p8<=12 | 3<=p4]]]] U [A [EX [11<=p7] U ~ [[p5<=24 | 4<=p1]]] & ~ [p6<=9]]]]
normalized: [~ [EG [~ [E [E [~ [[8<=p5 & p7<=21]] U ~ [[[p8<=12 | 3<=p4] | ~ [p2<=p7]]]] U [~ [p6<=9] & [~ [EG [[p5<=24 | 4<=p1]]] & ~ [E [[p5<=24 | 4<=p1] U [~ [EX [11<=p7]] & [p5<=24 | 4<=p1]]]]]]]]]] & ~ [E [~ [E [E [~ [[8<=p5 & p7<=21]] U ~ [[[p8<=12 | 3<=p4] | ~ [p2<=p7]]]] U [~ [p6<=9] & [~ [EG [[p5<=24 | 4<=p1]]] & ~ [E [[p5<=24 | 4<=p1] U [~ [EX [11<=p7]] & [p5<=24 | 4<=p1]]]]]]]] U [EX [EG [~ [E [p7<=24 U [p5<=6 & p8<=21]]]]] & ~ [E [E [~ [[8<=p5 & p7<=21]] U ~ [[[p8<=12 | 3<=p4] | ~ [p2<=p7]]]] U [~ [p6<=9] & [~ [EG [[p5<=24 | 4<=p1]]] & ~ [E [[p5<=24 | 4<=p1] U [~ [EX [11<=p7]] & [p5<=24 | 4<=p1]]]]]]]]]]]]

abstracting: (4<=p1)
states: 209,763 (5)
abstracting: (p5<=24)
states: 353,709 (5)
abstracting: (11<=p7)
states: 64,464 (4)
.abstracting: (4<=p1)
states: 209,763 (5)
abstracting: (p5<=24)
states: 353,709 (5)
abstracting: (4<=p1)
states: 209,763 (5)
abstracting: (p5<=24)
states: 353,709 (5)
.
EG iterations: 1
abstracting: (p6<=9)
states: 2,002 (3)
abstracting: (p2<=p7)
states: 148,257 (5)
abstracting: (3<=p4)
states: 241,128 (5)
abstracting: (p8<=12)
states: 343,005 (5)
abstracting: (p7<=21)
states: 351,498 (5)
abstracting: (8<=p5)
states: 112,353 (5)
abstracting: (p8<=21)
states: 354,501 (5)
abstracting: (p5<=6)
states: 221,697 (5)
abstracting: (p7<=24)
states: 353,709 (5)
..
EG iterations: 2
.abstracting: (4<=p1)
states: 209,763 (5)
abstracting: (p5<=24)
states: 353,709 (5)
abstracting: (11<=p7)
states: 64,464 (4)
.abstracting: (4<=p1)
states: 209,763 (5)
abstracting: (p5<=24)
states: 353,709 (5)
abstracting: (4<=p1)
states: 209,763 (5)
abstracting: (p5<=24)
states: 353,709 (5)
.
EG iterations: 1
abstracting: (p6<=9)
states: 2,002 (3)
abstracting: (p2<=p7)
states: 148,257 (5)
abstracting: (3<=p4)
states: 241,128 (5)
abstracting: (p8<=12)
states: 343,005 (5)
abstracting: (p7<=21)
states: 351,498 (5)
abstracting: (8<=p5)
states: 112,353 (5)
abstracting: (4<=p1)
states: 209,763 (5)
abstracting: (p5<=24)
states: 353,709 (5)
abstracting: (11<=p7)
states: 64,464 (4)
.abstracting: (4<=p1)
states: 209,763 (5)
abstracting: (p5<=24)
states: 353,709 (5)
abstracting: (4<=p1)
states: 209,763 (5)
abstracting: (p5<=24)
states: 353,709 (5)
.
EG iterations: 1
abstracting: (p6<=9)
states: 2,002 (3)
abstracting: (p2<=p7)
states: 148,257 (5)
abstracting: (3<=p4)
states: 241,128 (5)
abstracting: (p8<=12)
states: 343,005 (5)
abstracting: (p7<=21)
states: 351,498 (5)
abstracting: (8<=p5)
states: 112,353 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: [E [AF [[E [EX [0<=0] U EG [p2<=p3]] | A [~ [p0<=p8] U 13<=p1]]] U [[~ [AX [p8<=p5]] & AG [8<=p7]] & [AG [4<=p1] & [~ [AG [p1<=30]] & [[[EX [3<=p6] & E [p3<=4 U p7<=6]] & [13<=p3 & [p0<=19 & [8<=p6 | 12<=p1]]]] | [~ [25<=p5] | ~ [p6<=p5]]]]]]] | [AG [~ [p5<=7]] & EX [[[AF [[19<=p8 | p4<=17]] | [AG [~ [p2<=0]] & [29<=p8 | p8<=6]]] & [AG [p6<=p7] | AX [~ [25<=p4]]]]]]]
normalized: [[EX [[[~ [EX [25<=p4]] | ~ [E [true U ~ [p6<=p7]]]] & [[[29<=p8 | p8<=6] & ~ [E [true U p2<=0]]] | ~ [EG [~ [[19<=p8 | p4<=17]]]]]]] & ~ [E [true U p5<=7]]] | E [~ [EG [~ [[[~ [EG [~ [13<=p1]]] & ~ [E [~ [13<=p1] U [p0<=p8 & ~ [13<=p1]]]]] | E [EX [0<=0] U EG [p2<=p3]]]]]] U [[[[[~ [p6<=p5] | ~ [25<=p5]] | [[13<=p3 & [p0<=19 & [8<=p6 | 12<=p1]]] & [E [p3<=4 U p7<=6] & EX [3<=p6]]]] & E [true U ~ [p1<=30]]] & ~ [E [true U ~ [4<=p1]]]] & [~ [E [true U ~ [8<=p7]]] & EX [~ [p8<=p5]]]]]]

abstracting: (p8<=p5)
states: 218,025 (5)
.abstracting: (8<=p7)
states: 112,353 (5)
abstracting: (4<=p1)
states: 209,763 (5)
abstracting: (p1<=30)
states: 354,495 (5)
abstracting: (3<=p6)
states: 354,480 (5)
.abstracting: (p7<=6)
states: 221,697 (5)
abstracting: (p3<=4)
states: 215,141 (5)
abstracting: (12<=p1)
states: 52,479 (4)
abstracting: (8<=p6)
states: 353,709 (5)
abstracting: (p0<=19)
states: 76,223 (4)
abstracting: (13<=p3)
states: 11,496 (4)
abstracting: (25<=p5)
states: 792
abstracting: (p6<=p5)
states: 33
abstracting: (p2<=p3)
states: 120,135 (5)
..
EG iterations: 2
abstracting: (0<=0)
states: 354,501 (5)
.abstracting: (13<=p1)
states: 42,228 (4)
abstracting: (p0<=p8)
states: 969
abstracting: (13<=p1)
states: 42,228 (4)
abstracting: (13<=p1)
states: 42,228 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p5<=7)
states: 242,148 (5)
abstracting: (p4<=17)
states: 342,873 (5)
abstracting: (19<=p8)
states: 0
.
EG iterations: 1
abstracting: (p2<=0)
states: 16,473 (4)
abstracting: (p8<=6)
states: 266,259 (5)
abstracting: (29<=p8)
states: 0
abstracting: (p6<=p7)
states: 20,349 (4)
abstracting: (25<=p4)
states: 792
..-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.098sec

totally nodes used: 42301 (4.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 961241 133994 1095235
used/not used/entry size/cache size: 156648 66952216 16 1024MB
basic ops cache: hits/miss/sum: 286871 51879 338750
used/not used/entry size/cache size: 93491 16683725 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: 31192 3650 34842
used/not used/entry size/cache size: 3650 8384958 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 67073426
1 32329
2 2061
3 687
4 57
5 74
6 29
7 36
8 34
9 25
>= 10 106

Total processing time: 0m 5.555sec


BK_STOP 1679231205154

--------------------
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:568 (71), effective:144 (18)

initing FirstDep: 0m 0.000sec


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

iterations count:152 (19), effective:36 (4)

iterations count:297 (37), effective:85 (10)

iterations count:59 (7), effective:15 (1)

iterations count:59 (7), effective:15 (1)

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

iterations count:59 (7), effective:15 (1)

iterations count:232 (29), effective:70 (8)

iterations count:360 (45), effective:96 (12)

iterations count:184 (23), effective:55 (6)

iterations count:60 (7), effective:13 (1)

iterations count:178 (22), effective:50 (6)

iterations count:120 (15), effective:28 (3)

iterations count:312 (39), effective:78 (9)

iterations count:308 (38), effective:87 (10)

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

iterations count:168 (21), effective:46 (5)

iterations count:312 (39), effective:78 (9)

iterations count:308 (38), effective:87 (10)

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

iterations count:312 (39), effective:78 (9)

iterations count:308 (38), effective:87 (10)

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

iterations count:108 (13), effective:25 (3)

iterations count:134 (16), effective:55 (6)

iterations count:504 (63), effective:155 (19)

iterations count:112 (14), effective:26 (3)

iterations count:197 (24), effective:50 (6)

iterations count:296 (37), effective:96 (12)

iterations count:160 (20), effective:43 (5)

iterations count:264 (33), effective:64 (8)

iterations count:76 (9), effective:17 (2)

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="SmallOperatingSystem-PT-MT0032DC0016"
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 SmallOperatingSystem-PT-MT0032DC0016, 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 r458-smll-167912649700017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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