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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 19K Feb 26 14:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 14:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 26 14:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 14:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Feb 25 17:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 17:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 17:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 65K Feb 26 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 340K Feb 26 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 75K Feb 26 14:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 324K Feb 26 14:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 17:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Feb 25 17:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K 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 UtilityControlRoom-PT-Z2T3N08-CTLCardinality-00
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-CTLCardinality-01
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-CTLCardinality-02
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-CTLCardinality-03
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-CTLCardinality-04
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-CTLCardinality-05
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-CTLCardinality-06
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-CTLCardinality-07
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-CTLCardinality-08
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-CTLCardinality-09
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-CTLCardinality-10
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-CTLCardinality-11
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-CTLCardinality-12
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-CTLCardinality-13
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-CTLCardinality-14
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679374980965

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=UtilityControlRoom-PT-Z2T3N08
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 05:03:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 05:03:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 05:03:02] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2023-03-21 05:03:02] [INFO ] Transformed 140 places.
[2023-03-21 05:03:02] [INFO ] Transformed 216 transitions.
[2023-03-21 05:03:02] [INFO ] Parsed PT model containing 140 places and 216 transitions and 680 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
FORMULA UtilityControlRoom-PT-Z2T3N08-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 140 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 8 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2023-03-21 05:03:02] [INFO ] Computed 19 place invariants in 17 ms
[2023-03-21 05:03:02] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-21 05:03:02] [INFO ] Invariant cache hit.
[2023-03-21 05:03:02] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-21 05:03:02] [INFO ] Invariant cache hit.
[2023-03-21 05:03:02] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 453 ms. Remains : 140/140 places, 184/184 transitions.
Support contains 140 out of 140 places after structural reductions.
[2023-03-21 05:03:03] [INFO ] Flatten gal took : 34 ms
[2023-03-21 05:03:03] [INFO ] Flatten gal took : 15 ms
[2023-03-21 05:03:03] [INFO ] Input system was already deterministic with 184 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=18 ) properties (out of 71) seen :21
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) 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 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Running SMT prover for 50 properties.
[2023-03-21 05:03:04] [INFO ] Invariant cache hit.
[2023-03-21 05:03:04] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-21 05:03:04] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :26 sat :0 real:24
[2023-03-21 05:03:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-21 05:03:04] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :49 sat :1
[2023-03-21 05:03:04] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :49 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-21 05:03:04] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :49 sat :1
Fused 50 Parikh solutions to 1 different solutions.
Finished Parikh walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 49 atomic propositions for a total of 15 simplifications.
FORMULA UtilityControlRoom-PT-Z2T3N08-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N08-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N08-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N08-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N08-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N08-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 05:03:04] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-21 05:03:04] [INFO ] Flatten gal took : 10 ms
FORMULA UtilityControlRoom-PT-Z2T3N08-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N08-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 05:03:04] [INFO ] Flatten gal took : 17 ms
[2023-03-21 05:03:04] [INFO ] Input system was already deterministic with 184 transitions.
Support contains 51 out of 140 places (down from 62) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 8 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 124/140 places, 168/184 transitions.
[2023-03-21 05:03:04] [INFO ] Flatten gal took : 8 ms
[2023-03-21 05:03:04] [INFO ] Flatten gal took : 8 ms
[2023-03-21 05:03:04] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 125 transition count 169
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 125 transition count 169
Applied a total of 30 rules in 8 ms. Remains 125 /140 variables (removed 15) and now considering 169/184 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 125/140 places, 169/184 transitions.
[2023-03-21 05:03:04] [INFO ] Flatten gal took : 8 ms
[2023-03-21 05:03:04] [INFO ] Flatten gal took : 9 ms
[2023-03-21 05:03:04] [INFO ] Input system was already deterministic with 169 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 6 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 124/140 places, 168/184 transitions.
[2023-03-21 05:03:04] [INFO ] Flatten gal took : 8 ms
[2023-03-21 05:03:04] [INFO ] Flatten gal took : 8 ms
[2023-03-21 05:03:04] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 6 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 124/140 places, 168/184 transitions.
[2023-03-21 05:03:04] [INFO ] Flatten gal took : 7 ms
[2023-03-21 05:03:04] [INFO ] Flatten gal took : 7 ms
[2023-03-21 05:03:04] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 4 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 124/140 places, 168/184 transitions.
[2023-03-21 05:03:04] [INFO ] Flatten gal took : 6 ms
[2023-03-21 05:03:04] [INFO ] Flatten gal took : 7 ms
[2023-03-21 05:03:04] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 126 transition count 170
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 126 transition count 170
Applied a total of 28 rules in 3 ms. Remains 126 /140 variables (removed 14) and now considering 170/184 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 126/140 places, 170/184 transitions.
[2023-03-21 05:03:04] [INFO ] Flatten gal took : 7 ms
[2023-03-21 05:03:04] [INFO ] Flatten gal took : 7 ms
[2023-03-21 05:03:04] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 126 transition count 170
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 126 transition count 170
Applied a total of 28 rules in 4 ms. Remains 126 /140 variables (removed 14) and now considering 170/184 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 126/140 places, 170/184 transitions.
[2023-03-21 05:03:04] [INFO ] Flatten gal took : 8 ms
[2023-03-21 05:03:04] [INFO ] Flatten gal took : 8 ms
[2023-03-21 05:03:04] [INFO ] Input system was already deterministic with 170 transitions.
[2023-03-21 05:03:04] [INFO ] Flatten gal took : 8 ms
[2023-03-21 05:03:04] [INFO ] Flatten gal took : 7 ms
[2023-03-21 05:03:04] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-21 05:03:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 140 places, 184 transitions and 552 arcs took 1 ms.
Total runtime 2529 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: 140 NrTr: 184 NrArc: 552)

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

net check time: 0m 0.000sec

init dd package: 0m 2.724sec


RS generation: 0m24.712sec


-> reachability set: #nodes 285072 (2.9e+05) #states 2,607,925,383 (9)



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

checking: AX [EF [AG [~ [p86<=p16]]]]
normalized: ~ [EX [~ [E [true U ~ [E [true U p86<=p16]]]]]]

abstracting: (p86<=p16)
states: 2,559,348,351 (9)
.-> the formula is FALSE

FORMULA UtilityControlRoom-PT-Z2T3N08-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.684sec

checking: AX [EG [p89<=p94]]
normalized: ~ [EX [~ [EG [p89<=p94]]]]

abstracting: (p89<=p94)
states: 2,559,348,351 (9)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z2T3N08-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.725sec

checking: EX [AF [p114<=p107]]
normalized: EX [~ [EG [~ [p114<=p107]]]]

abstracting: (p114<=p107)
states: 1,630,396,649 (9)
...........................
EG iterations: 27
.-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z2T3N08-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.608sec

checking: A [p55<=p68 U AF [AX [1<=0]]]
normalized: [~ [EG [EG [EX [~ [1<=0]]]]] & ~ [E [EG [EX [~ [1<=0]]] U [~ [p55<=p68] & EG [EX [~ [1<=0]]]]]]]

abstracting: (1<=0)
states: 0
.
EG iterations: 0
abstracting: (p55<=p68)
states: 2,545,739,483 (9)
abstracting: (1<=0)
states: 0
.
EG iterations: 0
abstracting: (1<=0)
states: 0
.
EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA UtilityControlRoom-PT-Z2T3N08-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.070sec

checking: EG [AX [[p48<=2 & p37<=p71]]]
normalized: EG [~ [EX [~ [[p48<=2 & p37<=p71]]]]]

abstracting: (p37<=p71)
states: 2,545,739,483 (9)
abstracting: (p48<=2)
states: 2,607,925,383 (9)
............................
EG iterations: 27
-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z2T3N08-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.593sec

checking: AG [E [p44<=p24 U EX [p14<=p96]]]
normalized: ~ [E [true U ~ [E [p44<=p24 U EX [p14<=p96]]]]]

abstracting: (p14<=p96)
states: 2,179,416,855 (9)
.abstracting: (p44<=p24)
states: 2,559,348,351 (9)
-> the formula is FALSE

FORMULA UtilityControlRoom-PT-Z2T3N08-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.159sec

checking: EX [EG [A [~ [5<=sum(p25, p24, p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10)] U ~ [[81<=sum(p123, p122, p121, p120, p119, p118, p117, p116, p115, p114, p113, p112, p111, p110, p109, p108, p9, p8, p7, p6, p5, p4, p3, p2) | sum(p115, p114, p113, p112, p111, p110, p109, p108)<=sum(p25, p24, p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10)]]]]]
normalized: EX [EG [[~ [EG [[81<=sum(p123, p122, p121, p120, p119, p118, p117, p116, p115, p114, p113, p112, p111, p110, p109, p108, p9, p8, p7, p6, p5, p4, p3, p2) | sum(p115, p114, p113, p112, p111, p110, p109, p108)<=sum(p25, p24, p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10)]]] & ~ [E [[81<=sum(p123, p122, p121, p120, p119, p118, p117, p116, p115, p114, p113, p112, p111, p110, p109, p108, p9, p8, p7, p6, p5, p4, p3, p2) | sum(p115, p114, p113, p112, p111, p110, p109, p108)<=sum(p25, p24, p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10)] U [5<=sum(p25, p24, p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10) & [81<=sum(p123, p122, p121, p120, p119, p118, p117, p116, p115, p114, p113, p112, p111, p110, p109, p108, p9, p8, p7, p6, p5, p4, p3, p2) | sum(p115, p114, p113, p112, p111, p110, p109, p108)<=sum(p25, p24, p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10)]]]]]]]

abstracting: (sum(p115, p114, p113, p112, p111, p110, p109, p108)<=sum(p25, p24, p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10))
states: 1,640,223,456 (9)
abstracting: (81<=sum(p123, p122, p121, p120, p119, p118, p117, p116, p115, p114, p113, p112, p111, p110, p109, p108, p9, p8, p7, p6, p5, p4, p3, p2))
states: 0
abstracting: (5<=sum(p25, p24, p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10))
states: 415,236,096 (8)
abstracting: (sum(p115, p114, p113, p112, p111, p110, p109, p108)<=sum(p25, p24, p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10))
states: 1,640,223,456 (9)
abstracting: (81<=sum(p123, p122, p121, p120, p119, p118, p117, p116, p115, p114, p113, p112, p111, p110, p109, p108, p9, p8, p7, p6, p5, p4, p3, p2))
states: 0
abstracting: (sum(p115, p114, p113, p112, p111, p110, p109, p108)<=sum(p25, p24, p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10))
states: 1,640,223,456 (9)
abstracting: (81<=sum(p123, p122, p121, p120, p119, p118, p117, p116, p115, p114, p113, p112, p111, p110, p109, p108, p9, p8, p7, p6, p5, p4, p3, p2))
states: 0
.............
EG iterations: 13
......
EG iterations: 6
.-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z2T3N08-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m55.715sec

totally nodes used: 62303182 (6.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 125507368 453354417 578861785
used/not used/entry size/cache size: 67059912 48952 16 1024MB
basic ops cache: hits/miss/sum: 7639411 24925142 32564553
used/not used/entry size/cache size: 14850061 1927155 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 33619965 33619965
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 349156 1184663 1533819
used/not used/entry size/cache size: 1105139 7283469 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 26971656
1 24105341
2 11292520
3 3626213
4 892593
5 179673
6 31663
7 5381
8 1059
9 1159
>= 10 1606

Total processing time: 3m59.403sec


BK_STOP 1679375225210

--------------------
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:22746 (123), effective:417 (2)

initing FirstDep: 0m 0.000sec


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

iterations count:4382 (23), effective:196 (1)

iterations count:2087 (11), effective:84 (0)

iterations count:7128 (38), effective:344 (1)

iterations count:2756 (14), effective:137 (0)

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="UtilityControlRoom-PT-Z2T3N08"
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 UtilityControlRoom-PT-Z2T3N08, 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-167912709501105"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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