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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 11K Feb 25 12:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:45 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.3K 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.8K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 12:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 12:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 25 12:46 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-MT0016DC0008-CTLCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679231001224

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-MT0016DC0008
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 13:03:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 13:03:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:03:24] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-03-19 13:03:24] [INFO ] Transformed 9 places.
[2023-03-19 13:03:24] [INFO ] Transformed 8 transitions.
[2023-03-19 13:03:24] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 35 ms.
Initial state reduction rules removed 1 formulas.
FORMULA SmallOperatingSystem-PT-MT0016DC0008-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:03:24] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-19 13:03:25] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-19 13:03:25] [INFO ] Invariant cache hit.
[2023-03-19 13:03:25] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-19 13:03:25] [INFO ] Invariant cache hit.
[2023-03-19 13:03:25] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 13:03:25] [INFO ] Flatten gal took : 30 ms
[2023-03-19 13:03:25] [INFO ] Flatten gal took : 10 ms
[2023-03-19 13:03:25] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 546 ms. (steps per millisecond=18 ) properties (out of 84) seen :56
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) 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 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 28) 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 28) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) 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 27) seen :0
Running SMT prover for 27 properties.
[2023-03-19 13:03:27] [INFO ] Invariant cache hit.
[2023-03-19 13:03:27] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-19 13:03:27] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :23 sat :0 real:4
[2023-03-19 13:03:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-19 13:03:27] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :27 sat :0
Fused 27 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 27 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 13:03:27] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-19 13:03:27] [INFO ] Flatten gal took : 6 ms
[2023-03-19 13:03:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 13:03:27] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:03:27] [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
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 5 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 5 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:03:27] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:03:27] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:27] [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
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 5 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 5 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:03:27] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:27] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:27] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:03:27] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:27] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:27] [INFO ] Input system was already deterministic with 8 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:03:27] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:27] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:27] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 5 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:03:27] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:27] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:27] [INFO ] Input system was already deterministic with 8 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:03:27] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:27] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:27] [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 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:03:27] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:27] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:27] [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:03:27] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:27] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:27] [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
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:03:27] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:03:27] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:03:27] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-19 13:03:27] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:03:27] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:03:27] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-19 13:03:27] [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 3104 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 4.491sec


RS generation: 0m 0.004sec


-> reachability set: #nodes 177 (1.8e+02) #states 16,587 (4)



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

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

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

FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: AF [[EX [[[9<=p5 | 10<=p5] & 7<=p2]] | EG [EF [16<=p4]]]]
normalized: ~ [EG [~ [[EG [E [true U 16<=p4]] | EX [[[9<=p5 | 10<=p5] & 7<=p2]]]]]]

abstracting: (7<=p2)
states: 2,601 (3)
abstracting: (10<=p5)
states: 462
abstracting: (9<=p5)
states: 792
.abstracting: (16<=p4)
states: 1

EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: A [AX [p3<=5] U ~ [AX [EX [[p1<=p3 & p7<=14]]]]]
normalized: [~ [EG [~ [EX [~ [EX [[p1<=p3 & p7<=14]]]]]]] & ~ [E [~ [EX [~ [EX [[p1<=p3 & p7<=14]]]]] U [EX [~ [p3<=5]] & ~ [EX [~ [EX [[p1<=p3 & p7<=14]]]]]]]]]

abstracting: (p7<=14)
states: 16,581 (4)
abstracting: (p1<=p3)
states: 8,217 (3)
..abstracting: (p3<=5)
states: 15,366 (4)
.abstracting: (p7<=14)
states: 16,581 (4)
abstracting: (p1<=p3)
states: 8,217 (3)
..abstracting: (p7<=14)
states: 16,581 (4)
abstracting: (p1<=p3)
states: 8,217 (3)
....
EG iterations: 2
-> the formula is TRUE

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

MC time: 0m 0.018sec

checking: E [EX [[AF [~ [10<=p6]] | AX [AF [p5<=p2]]]] U AG [[p8<=15 & p6<=11]]]
normalized: E [EX [[~ [EX [EG [~ [p5<=p2]]]] | ~ [EG [10<=p6]]]] U ~ [E [true U ~ [[p8<=15 & p6<=11]]]]]

abstracting: (p6<=11)
states: 4,212 (3)
abstracting: (p8<=15)
states: 16,587 (4)
abstracting: (10<=p6)
states: 14,595 (4)
.
EG iterations: 1
abstracting: (p5<=p2)
states: 11,187 (4)
..
EG iterations: 2
..-> the formula is FALSE

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

MC time: 0m 0.007sec

checking: AG [[AG [[~ [p1<=5] & [EG [p5<=11] & EG [~ [p4<=p5]]]]] | EG [p7<=p6]]]
normalized: ~ [E [true U ~ [[EG [p7<=p6] | ~ [E [true U ~ [[[EG [~ [p4<=p5]] & EG [p5<=11]] & ~ [p1<=5]]]]]]]]]

abstracting: (p1<=5)
states: 13,635 (4)
abstracting: (p5<=11)
states: 16,461 (4)
.
EG iterations: 1
abstracting: (p4<=p5)
states: 9,221 (3)
..
EG iterations: 2
abstracting: (p7<=p6)
states: 15,795 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: [EF [[EF [5<=p6] & AG [8<=p3]]] | AG [[E [6<=p5 U EF [p0<=p6]] & ~ [p7<=p5]]]]
normalized: [~ [E [true U ~ [[~ [p7<=p5] & E [6<=p5 U E [true U p0<=p6]]]]]] | E [true U [~ [E [true U ~ [8<=p3]]] & E [true U 5<=p6]]]]

abstracting: (5<=p6)
states: 16,461 (4)
abstracting: (8<=p3)
states: 165
abstracting: (p0<=p6)
states: 11,571 (4)
abstracting: (6<=p5)
states: 2,952 (3)
abstracting: (p7<=p5)
states: 9,221 (3)
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: [~ [E [~ [[AF [p1<=15] & [p6<=p2 & ~ [AF [p0<=p4]]]]] U [AX [1<=0] | E [EG [p0<=p8] U [EX [p6<=p4] & EF [7<=p3]]]]]] & ~ [E [[~ [EF [p1<=14]] & [~ [p6<=13] & ~ [p3<=p4]]] U ~ [EF [p8<=0]]]]]
normalized: [~ [E [[[~ [p3<=p4] & ~ [p6<=13]] & ~ [E [true U p1<=14]]] U ~ [E [true U p8<=0]]]] & ~ [E [~ [[[p6<=p2 & EG [~ [p0<=p4]]] & ~ [EG [~ [p1<=15]]]]] U [E [EG [p0<=p8] U [E [true U 7<=p3] & EX [p6<=p4]]] | ~ [EX [~ [1<=0]]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (p6<=p4)
states: 17
.abstracting: (7<=p3)
states: 550
abstracting: (p0<=p8)
states: 165
..
EG iterations: 2
abstracting: (p1<=15)
states: 16,586 (4)
..
EG iterations: 2
abstracting: (p0<=p4)
states: 45
.
EG iterations: 1
abstracting: (p6<=p2)
states: 483
abstracting: (p8<=0)
states: 4,515 (3)
abstracting: (p1<=14)
states: 16,581 (4)
abstracting: (p6<=13)
states: 7,812 (3)
abstracting: (p3<=p4)
states: 10,725 (4)
-> the formula is FALSE

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

MC time: 0m 0.023sec

checking: E [AX [[~ [EG [[p6<=p3 & p2<=12]]] | p3<=p5]] U [p2<=p5 & [AG [[EG [p3<=p4] | 13<=p0]] & [~ [EF [[AF [p2<=p5] & [p0<=p1 & p4<=p5]]]] | AX [6<=p3]]]]]
normalized: E [~ [EX [~ [[p3<=p5 | ~ [EG [[p6<=p3 & p2<=12]]]]]]] U [p2<=p5 & [[~ [EX [~ [6<=p3]]] | ~ [E [true U [[p0<=p1 & p4<=p5] & ~ [EG [~ [p2<=p5]]]]]]] & ~ [E [true U ~ [[13<=p0 | EG [p3<=p4]]]]]]]]

abstracting: (p3<=p4)
states: 10,725 (4)
.
EG iterations: 1
abstracting: (13<=p0)
states: 6,881 (3)
abstracting: (p2<=p5)
states: 7,425 (3)
.
EG iterations: 1
abstracting: (p4<=p5)
states: 9,221 (3)
abstracting: (p0<=p1)
states: 45
abstracting: (6<=p3)
states: 1,221 (3)
.abstracting: (p2<=p5)
states: 7,425 (3)
abstracting: (p2<=12)
states: 16,587 (4)
abstracting: (p6<=p3)
states: 9
..
EG iterations: 2
abstracting: (p3<=p5)
states: 10,725 (4)
.-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: E [[EG [p7<=p8] | [AG [[A [p6<=p3 U p7<=p4] & EF [p4<=p1]]] & [p4<=p8 & ~ [[9<=p7 & ~ [[14<=p2 | p6<=p2]]]]]]] U [EG [EF [p3<=p2]] & [A [~ [p4<=p5] U 7<=p7] & [AG [p0<=p4] | [p7<=12 | A [[p5<=p8 | 13<=p6] U EG [p4<=p2]]]]]]]
normalized: E [[[[p4<=p8 & ~ [[9<=p7 & ~ [[14<=p2 | p6<=p2]]]]] & ~ [E [true U ~ [[E [true U p4<=p1] & [~ [EG [~ [p7<=p4]]] & ~ [E [~ [p7<=p4] U [~ [p6<=p3] & ~ [p7<=p4]]]]]]]]]] | EG [p7<=p8]] U [[[[p7<=12 | [~ [EG [~ [EG [p4<=p2]]]] & ~ [E [~ [EG [p4<=p2]] U [~ [[p5<=p8 | 13<=p6]] & ~ [EG [p4<=p2]]]]]]] | ~ [E [true U ~ [p0<=p4]]]] & [~ [EG [~ [7<=p7]]] & ~ [E [~ [7<=p7] U [p4<=p5 & ~ [7<=p7]]]]]] & EG [E [true U p3<=p2]]]]

abstracting: (p3<=p2)
states: 12,075 (4)

EG iterations: 0
abstracting: (7<=p7)
states: 1,992 (3)
abstracting: (p4<=p5)
states: 9,221 (3)
abstracting: (7<=p7)
states: 1,992 (3)
abstracting: (7<=p7)
states: 1,992 (3)
.
EG iterations: 1
abstracting: (p0<=p4)
states: 45
abstracting: (p4<=p2)
states: 11,187 (4)
.
EG iterations: 1
abstracting: (13<=p6)
states: 10,770 (4)
abstracting: (p5<=p8)
states: 8,217 (3)
abstracting: (p4<=p2)
states: 11,187 (4)
.
EG iterations: 1
abstracting: (p4<=p2)
states: 11,187 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p7<=12)
states: 16,531 (4)
abstracting: (p7<=p8)
states: 8,217 (3)
.
EG iterations: 1
abstracting: (p7<=p4)
states: 9,221 (3)
abstracting: (p6<=p3)
states: 9
abstracting: (p7<=p4)
states: 9,221 (3)
abstracting: (p7<=p4)
states: 9,221 (3)
..........
EG iterations: 10
abstracting: (p4<=p1)
states: 9,221 (3)
abstracting: (p6<=p2)
states: 483
abstracting: (14<=p2)
states: 0
abstracting: (9<=p7)
states: 792
abstracting: (p4<=p8)
states: 8,217 (3)
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0016DC0008-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

totally nodes used: 17046 (1.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 175527 46635 222162
used/not used/entry size/cache size: 55773 67053091 16 1024MB
basic ops cache: hits/miss/sum: 74907 29009 103916
used/not used/entry size/cache size: 47102 16730114 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: 9457 2030 11487
used/not used/entry size/cache size: 2030 8386578 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 67094715
1 13186
2 620
3 197
4 37
5 18
6 2
7 15
8 2
9 3
>= 10 69

Total processing time: 0m 6.496sec


BK_STOP 1679231017190

--------------------
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:288 (36), effective:72 (9)

initing FirstDep: 0m 0.000sec


iterations count:272 (34), effective:96 (12)

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

iterations count:56 (7), effective:12 (1)

iterations count:44 (5), effective:14 (1)

iterations count:161 (20), effective:45 (5)

iterations count:28 (3), effective:5 (0)

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

iterations count:136 (17), effective:32 (4)

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

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

iterations count:162 (20), effective:42 (5)

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

iterations count:208 (26), effective:79 (9)

iterations count:24 (3), effective:8 (1)

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

iterations count:126 (15), effective:30 (3)

iterations count:264 (33), effective:72 (9)

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

iterations count:72 (9), effective:16 (2)

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

iterations count:120 (15), effective:41 (5)

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

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

iterations count:85 (10), effective:20 (2)

iterations count:211 (26), effective:65 (8)

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

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