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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 11K Feb 25 12:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 12:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 12:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 12:48 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.2K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 12:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Feb 25 12:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K 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-MT0032DC0008-CTLCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679231093594

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-MT0032DC0008
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 13:04:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 13:04:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:04:58] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-19 13:04:58] [INFO ] Transformed 9 places.
[2023-03-19 13:04:58] [INFO ] Transformed 8 transitions.
[2023-03-19 13:04:58] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
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 40 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:04:58] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-19 13:04:58] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-19 13:04:58] [INFO ] Invariant cache hit.
[2023-03-19 13:04:58] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-19 13:04:58] [INFO ] Invariant cache hit.
[2023-03-19 13:04:58] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 418 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 13:04:58] [INFO ] Flatten gal took : 22 ms
[2023-03-19 13:04:58] [INFO ] Flatten gal took : 7 ms
[2023-03-19 13:04:58] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10013 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 95) seen :54
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 41) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 39) seen :0
Running SMT prover for 39 properties.
[2023-03-19 13:05:00] [INFO ] Invariant cache hit.
[2023-03-19 13:05:00] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-19 13:05:00] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:32
[2023-03-19 13:05:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-19 13:05:00] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :39 sat :0
Fused 39 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 39 atomic propositions for a total of 16 simplifications.
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 13:05:00] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 5 ms
[2023-03-19 13:05:00] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:05:00] [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:05:00] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:00] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Applied a total of 2 rules in 8 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:00] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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:05:00] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:00] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Applied a total of 2 rules in 3 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:00] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 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 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:00] [INFO ] Input system was already deterministic with 8 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:00] [INFO ] Input system was already deterministic with 7 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:05:00] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:00] [INFO ] Input system was already deterministic with 8 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:00] [INFO ] Input system was already deterministic with 7 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:00] [INFO ] Input system was already deterministic with 7 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:05:00] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:00] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:00] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:05:00] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-19 13:05:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 8 transitions and 27 arcs took 1 ms.
Total runtime 2751 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.385sec


RS generation: 0m 0.013sec


-> reachability set: #nodes 209 (2.1e+02) #states 166,515 (5)



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

checking: EG [EF [AX [1<=0]]]
normalized: EG [E [true U ~ [EX [~ [1<=0]]]]]

abstracting: (1<=0)
states: 0
..
EG iterations: 1
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: EX [AX [EF [[AX [p1<=10] & EX [0<=0]]]]]
normalized: EX [~ [EX [~ [E [true U [EX [0<=0] & ~ [EX [~ [p1<=10]]]]]]]]]

abstracting: (p1<=10)
states: 123,429 (5)
.abstracting: (0<=0)
states: 166,515 (5)
...-> the formula is TRUE

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

MC time: 0m 0.009sec

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

abstracting: (p6<=p2)
states: 20,889 (4)
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: [EF [AG [p6<=7]] | EX [[EX [~ [p4<=28]] & EX [0<=0]]]]
normalized: [EX [[EX [0<=0] & EX [~ [p4<=28]]]] | E [true U ~ [E [true U ~ [p6<=7]]]]]

abstracting: (p6<=7)
states: 45,960 (4)
abstracting: (p4<=28)
states: 166,459 (5)
.abstracting: (0<=0)
states: 166,515 (5)
..-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [EX [EF [EX [p1<=p8]]]]
normalized: ~ [EG [~ [EX [E [true U EX [p1<=p8]]]]]]

abstracting: (p1<=p8)
states: 47,685 (4)
...
EG iterations: 1
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AX [AG [A [[p3<=0 & 29<=p1] U A [13<=p4 U p5<=24]]]]
normalized: ~ [EX [E [true U ~ [[~ [EG [~ [[~ [EG [~ [p5<=24]]] & ~ [E [~ [p5<=24] U [~ [13<=p4] & ~ [p5<=24]]]]]]]] & ~ [E [~ [[~ [EG [~ [p5<=24]]] & ~ [E [~ [p5<=24] U [~ [13<=p4] & ~ [p5<=24]]]]]] U [~ [[p3<=0 & 29<=p1]] & ~ [[~ [EG [~ [p5<=24]]] & ~ [E [~ [p5<=24] U [~ [13<=p4] & ~ [p5<=24]]]]]]]]]]]]]]

abstracting: (p5<=24)
states: 165,723 (5)
abstracting: (13<=p4)
states: 30,471 (4)
abstracting: (p5<=24)
states: 165,723 (5)
abstracting: (p5<=24)
states: 165,723 (5)
.
EG iterations: 1
abstracting: (29<=p1)
states: 56
abstracting: (p3<=0)
states: 37,689 (4)
abstracting: (p5<=24)
states: 165,723 (5)
abstracting: (13<=p4)
states: 30,471 (4)
abstracting: (p5<=24)
states: 165,723 (5)
abstracting: (p5<=24)
states: 165,723 (5)
.
EG iterations: 1
abstracting: (p5<=24)
states: 165,723 (5)
abstracting: (13<=p4)
states: 30,471 (4)
abstracting: (p5<=24)
states: 165,723 (5)
abstracting: (p5<=24)
states: 165,723 (5)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.011sec

checking: AG [[EG [[p7<=p1 | p4<=p2]] | ~ [E [AX [4<=p1] U A [[6<=p8 & p6<=24] U AF [p7<=p8]]]]]]
normalized: ~ [E [true U ~ [[~ [E [~ [EX [~ [4<=p1]]] U [~ [EG [EG [~ [p7<=p8]]]] & ~ [E [EG [~ [p7<=p8]] U [~ [[6<=p8 & p6<=24]] & EG [~ [p7<=p8]]]]]]]] | EG [[p7<=p1 | p4<=p2]]]]]]

abstracting: (p4<=p2)
states: 53,295 (4)
abstracting: (p7<=p1)
states: 94,481 (4)
.
EG iterations: 1
abstracting: (p7<=p8)
states: 54,417 (4)
..
EG iterations: 2
abstracting: (p6<=24)
states: 166,515 (5)
abstracting: (6<=p8)
states: 18,071 (4)
abstracting: (p7<=p8)
states: 54,417 (4)
..
EG iterations: 2
abstracting: (p7<=p8)
states: 54,417 (4)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (4<=p1)
states: 110,925 (5)
.-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.098sec

checking: [AG [EF [AG [[~ [p8<=p4] | ~ [32<=p1]]]]] & [A [EF [~ [27<=p1]] U [~ [AX [p5<=p4]] & [p5<=p8 & [[p0<=18 & 17<=p1] | [~ [19<=p0] | ~ [p1<=21]]]]]] | EG [p5<=p3]]]
normalized: [[EG [p5<=p3] | [~ [EG [~ [[[p5<=p8 & [[~ [p1<=21] | ~ [19<=p0]] | [p0<=18 & 17<=p1]]] & EX [~ [p5<=p4]]]]]] & ~ [E [~ [[[p5<=p8 & [[~ [p1<=21] | ~ [19<=p0]] | [p0<=18 & 17<=p1]]] & EX [~ [p5<=p4]]]] U [~ [E [true U ~ [27<=p1]]] & ~ [[[p5<=p8 & [[~ [p1<=21] | ~ [19<=p0]] | [p0<=18 & 17<=p1]]] & EX [~ [p5<=p4]]]]]]]]] & ~ [E [true U ~ [E [true U ~ [E [true U ~ [[~ [32<=p1] | ~ [p8<=p4]]]]]]]]]]

abstracting: (p8<=p4)
states: 131,835 (5)
abstracting: (32<=p1)
states: 1
abstracting: (p5<=p4)
states: 87,115 (4)
.abstracting: (17<=p1)
states: 13,152 (4)
abstracting: (p0<=18)
states: 0
abstracting: (19<=p0)
states: 166,515 (5)
abstracting: (p1<=21)
states: 163,563 (5)
abstracting: (p5<=p8)
states: 47,685 (4)
abstracting: (27<=p1)
states: 252
abstracting: (p5<=p4)
states: 87,115 (4)
.abstracting: (17<=p1)
states: 13,152 (4)
abstracting: (p0<=18)
states: 0
abstracting: (19<=p0)
states: 166,515 (5)
abstracting: (p1<=21)
states: 163,563 (5)
abstracting: (p5<=p8)
states: 47,685 (4)
abstracting: (p5<=p4)
states: 87,115 (4)
.abstracting: (17<=p1)
states: 13,152 (4)
abstracting: (p0<=18)
states: 0
abstracting: (19<=p0)
states: 166,515 (5)
abstracting: (p1<=21)
states: 163,563 (5)
abstracting: (p5<=p8)
states: 47,685 (4)
..
EG iterations: 2
abstracting: (p5<=p3)
states: 47,685 (4)
..
EG iterations: 2
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: E [[EF [[AX [1<=0] & ~ [AX [p1<=p2]]]] | [p5<=12 & A [p1<=p4 U [[AG [p6<=p3] | EF [p3<=p4]] | [p8<=p4 | 7<=p7]]]]] U [EX [[25<=p2 | ~ [p2<=p6]]] & [EX [EG [[p8<=3 & p6<=p1]]] & [~ [p3<=p2] | AX [13<=p4]]]]]
normalized: E [[[p5<=12 & [~ [EG [~ [[[p8<=p4 | 7<=p7] | [~ [E [true U ~ [p6<=p3]]] | E [true U p3<=p4]]]]]] & ~ [E [~ [[[p8<=p4 | 7<=p7] | [~ [E [true U ~ [p6<=p3]]] | E [true U p3<=p4]]]] U [~ [p1<=p4] & ~ [[[p8<=p4 | 7<=p7] | [~ [E [true U ~ [p6<=p3]]] | E [true U p3<=p4]]]]]]]]] | E [true U [EX [~ [p1<=p2]] & ~ [EX [~ [1<=0]]]]]] U [[[~ [EX [~ [13<=p4]]] | ~ [p3<=p2]] & EX [EG [[p8<=3 & p6<=p1]]]] & EX [[25<=p2 | ~ [p2<=p6]]]]]

abstracting: (p2<=p6)
states: 151,011 (5)
abstracting: (25<=p2)
states: 0
.abstracting: (p6<=p1)
states: 58,395 (4)
abstracting: (p8<=3)
states: 118,065 (5)
.
EG iterations: 1
.abstracting: (p3<=p2)
states: 104,125 (5)
abstracting: (13<=p4)
states: 30,471 (4)
.abstracting: (1<=0)
states: 0
.abstracting: (p1<=p2)
states: 53,295 (4)
.abstracting: (p3<=p4)
states: 131,835 (5)
abstracting: (p6<=p3)
states: 15,411 (4)
abstracting: (7<=p7)
states: 65,400 (4)
abstracting: (p8<=p4)
states: 131,835 (5)
abstracting: (p1<=p4)
states: 87,115 (4)
abstracting: (p3<=p4)
states: 131,835 (5)
abstracting: (p6<=p3)
states: 15,411 (4)
abstracting: (7<=p7)
states: 65,400 (4)
abstracting: (p8<=p4)
states: 131,835 (5)
abstracting: (p3<=p4)
states: 131,835 (5)
abstracting: (p6<=p3)
states: 15,411 (4)
abstracting: (7<=p7)
states: 65,400 (4)
abstracting: (p8<=p4)
states: 131,835 (5)
.
EG iterations: 1
abstracting: (p5<=12)
states: 136,044 (5)
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

totally nodes used: 43288 (4.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 810192 101896 912088
used/not used/entry size/cache size: 125189 66983675 16 1024MB
basic ops cache: hits/miss/sum: 281375 65026 346401
used/not used/entry size/cache size: 112566 16664650 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: 29998 3441 33439
used/not used/entry size/cache size: 3441 8385167 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 67079940
1 23941
2 2253
3 1718
4 270
5 160
6 145
7 90
8 66
9 45
>= 10 236

Total processing time: 0m 5.151sec


BK_STOP 1679231106994

--------------------
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:528 (66), effective:136 (17)

initing FirstDep: 0m 0.000sec


iterations count:122 (15), effective:53 (6)

iterations count:168 (21), effective:56 (7)

iterations count:40 (5), effective:8 (1)

iterations count:125 (15), effective:55 (6)

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

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

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

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

iterations count:408 (51), effective:125 (15)

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

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

iterations count:322 (40), effective:124 (15)

iterations count:456 (57), effective:144 (18)

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

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

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

iterations count:20 (2), effective:9 (1)

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

iterations count:20 (2), effective:9 (1)

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

iterations count:20 (2), effective:9 (1)

iterations count:294 (36), effective:112 (14)

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-MT0032DC0008"
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-MT0032DC0008, 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-167912649700009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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