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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.1K Feb 25 12:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:42 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.6K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 25 12:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 12:42 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-MT0128DC0032-CTLCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679231505371

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-MT0128DC0032
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 13:11:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 13:11:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:11:48] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-19 13:11:48] [INFO ] Transformed 9 places.
[2023-03-19 13:11:48] [INFO ] Transformed 8 transitions.
[2023-03-19 13:11:48] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
FORMULA SmallOperatingSystem-PT-MT0128DC0032-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 15 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:11:48] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-19 13:11:48] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-19 13:11:48] [INFO ] Invariant cache hit.
[2023-03-19 13:11:48] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-19 13:11:48] [INFO ] Invariant cache hit.
[2023-03-19 13:11:48] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 13:11:48] [INFO ] Flatten gal took : 27 ms
[2023-03-19 13:11:48] [INFO ] Flatten gal took : 9 ms
[2023-03-19 13:11:49] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10019 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=47 ) properties (out of 62) seen :31
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=8 ) properties (out of 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 31) 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 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 31) 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 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
[2023-03-19 13:11:50] [INFO ] Invariant cache hit.
[2023-03-19 13:11:50] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-19 13:11:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-19 13:11:50] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :23 sat :8
[2023-03-19 13:11:50] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :23 sat :8
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-19 13:11:50] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :23 sat :8
Fused 31 Parikh solutions to 8 different solutions.
Finished Parikh walk after 250 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=125 )
Parikh walk visited 8 properties in 28 ms.
Successfully simplified 23 atomic propositions for a total of 15 simplifications.
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 13:11:50] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 7 ms
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 5 ms
[2023-03-19 13:11:50] [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 3 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 3 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:11:50] [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 4 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 4 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [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:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [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 3 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 3 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [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 3 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 3 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:11:50] [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:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [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:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:11:50] [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:11:50] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [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:11:50] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [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:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [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 3 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 3 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [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:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:11:50] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:11:50] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-19 13:11:50] [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 2917 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.679sec


RS generation: 0m 0.458sec


-> reachability set: #nodes 1577 (1.6e+03) #states 113,321,065 (8)



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

checking: EF [AX [p6<=31]]
normalized: E [true U ~ [EX [~ [p6<=31]]]]

abstracting: (p6<=31)
states: 33,277,024 (7)
.-> the formula is TRUE

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

MC time: 0m 0.069sec

checking: AX [EF [p1<=p3]]
normalized: ~ [EX [~ [E [true U p1<=p3]]]]

abstracting: (p1<=p3)
states: 27,652,625 (7)
.-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.716sec

checking: AF [AX [AG [EX [[57<=p1 & 58<=p6]]]]]
normalized: ~ [EG [EX [E [true U ~ [EX [[57<=p1 & 58<=p6]]]]]]]

abstracting: (58<=p6)
states: 21,845,901 (7)
abstracting: (57<=p1)
states: 13,818,090 (7)
..
EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.190sec

checking: EF [AX [EX [~ [p4<=p2]]]]
normalized: E [true U ~ [EX [~ [EX [~ [p4<=p2]]]]]]

abstracting: (p4<=p2)
states: 31,056,025 (7)
..-> the formula is TRUE

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

MC time: 0m 0.263sec

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

abstracting: (p5<=p3)
states: 27,652,625 (7)

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

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

MC time: 0m 0.509sec

checking: EF [AX [p6<=p7]]
normalized: E [true U ~ [EX [~ [p6<=p7]]]]

abstracting: (p6<=p7)
states: 34,921,689 (7)
.-> the formula is TRUE

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

MC time: 0m 0.006sec

checking: AF [AX [AG [[p4<=116 & [p5<=p6 | p4<=100]]]]]
normalized: ~ [EG [EX [E [true U ~ [[p4<=116 & [p5<=p6 | p4<=100]]]]]]]

abstracting: (p4<=100)
states: 113,119,689 (8)
abstracting: (p5<=p6)
states: 78,217,425 (7)
abstracting: (p4<=116)
states: 113,316,697 (8)
.
EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.189sec

checking: EX [~ [E [AX [EG [p7<=p1]] U ~ [EF [[p2<=21 & p3<=23]]]]]]
normalized: EX [~ [E [~ [EX [~ [EG [p7<=p1]]]] U ~ [E [true U [p2<=21 & p3<=23]]]]]]

abstracting: (p3<=23)
states: 106,003,690 (8)
abstracting: (p2<=21)
states: 94,853,330 (7)
abstracting: (p7<=p1)
states: 61,777,473 (7)
.
EG iterations: 1
..-> the formula is TRUE

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

MC time: 0m 1.208sec

checking: AG [[[AX [1<=0] | AF [6<=p6]] | [p4<=69 | [p5<=13 | [p1<=p7 & EG [p4<=115]]]]]]
normalized: ~ [E [true U ~ [[[p4<=69 | [p5<=13 | [p1<=p7 & EG [p4<=115]]]] | [~ [EG [~ [6<=p6]]] | ~ [EX [~ [1<=0]]]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (6<=p6)
states: 109,546,657 (8)
.
EG iterations: 1
abstracting: (p4<=115)
states: 113,314,877 (8)
.
EG iterations: 1
abstracting: (p1<=p7)
states: 53,208,385 (7)
abstracting: (p5<=13)
states: 35,310,275 (7)
abstracting: (p4<=69)
states: 107,218,507 (8)
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.135sec

checking: [EX [~ [E [[p1<=60 | [p7<=p6 | 100<=p2]] U [[5<=p6 & ~ [p4<=71]] | EX [56<=p7]]]]] | AG [AX [1<=0]]]
normalized: [~ [E [true U EX [~ [1<=0]]]] | EX [~ [E [[p1<=60 | [p7<=p6 | 100<=p2]] U [EX [56<=p7] | [5<=p6 & ~ [p4<=71]]]]]]]

abstracting: (p4<=71)
states: 108,049,348 (8)
abstracting: (5<=p6)
states: 110,242,110 (8)
abstracting: (56<=p7)
states: 6,030,189 (6)
.abstracting: (100<=p2)
states: 0
abstracting: (p7<=p6)
states: 80,044,041 (7)
abstracting: (p1<=60)
states: 102,341,194 (8)
.abstracting: (1<=0)
states: 0
.-> the formula is FALSE

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

MC time: 0m 0.529sec

checking: [AX [AX [A [AX [1<=0] U EX [53<=p1]]]] & [EF [[EX [104<=p4] | [[17<=p8 | p5<=p3] & EX [p8<=25]]]] & A [A [p1<=99 U p0<=109] U AG [AX [p5<=43]]]]]
normalized: [[[~ [EG [E [true U EX [~ [p5<=43]]]]] & ~ [E [E [true U EX [~ [p5<=43]]] U [~ [[~ [EG [~ [p0<=109]]] & ~ [E [~ [p0<=109] U [~ [p0<=109] & ~ [p1<=99]]]]]] & E [true U EX [~ [p5<=43]]]]]]] & E [true U [[EX [p8<=25] & [17<=p8 | p5<=p3]] | EX [104<=p4]]]] & ~ [EX [EX [~ [[~ [EG [~ [EX [53<=p1]]]] & ~ [E [~ [EX [53<=p1]] U [EX [~ [1<=0]] & ~ [EX [53<=p1]]]]]]]]]]]

abstracting: (53<=p1)
states: 17,117,969 (7)
.abstracting: (1<=0)
states: 0
.abstracting: (53<=p1)
states: 17,117,969 (7)
.abstracting: (53<=p1)
states: 17,117,969 (7)
..
EG iterations: 1
..abstracting: (104<=p4)
states: 118,755 (5)
.abstracting: (p5<=p3)
states: 27,652,625 (7)
abstracting: (17<=p8)
states: 23,589,540 (7)
abstracting: (p8<=25)
states: 108,852,055 (8)
.abstracting: (p5<=43)
states: 86,930,558 (7)
.abstracting: (p1<=99)
states: 113,083,729 (8)
abstracting: (p0<=109)
states: 65,878,540 (7)
abstracting: (p0<=109)
states: 65,878,540 (7)
abstracting: (p0<=109)
states: 65,878,540 (7)
.
EG iterations: 1
abstracting: (p5<=43)
states: 86,930,558 (7)
.abstracting: (p5<=43)
states: 86,930,558 (7)
.
EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 5.437sec

checking: E [[EG [[~ [EX [0<=0]] | EF [[p1<=p5 & p7<=p4]]]] & [~ [p5<=p0] | [[[AF [p1<=9] & p2<=24] & [p4<=p2 & p7<=p5]] | [p4<=p3 & p8<=22]]]] U ~ [AF [[[p4<=98 | ~ [9<=p8]] & [AF [p5<=86] | ~ [p1<=48]]]]]]
normalized: E [[[[[p4<=p3 & p8<=22] | [[p4<=p2 & p7<=p5] & [p2<=24 & ~ [EG [~ [p1<=9]]]]]] | ~ [p5<=p0]] & EG [[E [true U [p1<=p5 & p7<=p4]] | ~ [EX [0<=0]]]]] U EG [~ [[[~ [EG [~ [p5<=86]]] | ~ [p1<=48]] & [p4<=98 | ~ [9<=p8]]]]]]

abstracting: (9<=p8)
states: 55,948,750 (7)
abstracting: (p4<=98)
states: 113,042,809 (8)
abstracting: (p1<=48)
states: 92,409,637 (7)
abstracting: (p5<=86)
states: 111,967,933 (8)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=0)
states: 113,321,065 (8)
.abstracting: (p7<=p4)
states: 61,777,473 (7)
abstracting: (p1<=p5)
states: 57,354,889 (7)

EG iterations: 0
abstracting: (p5<=p0)
states: 113,321,065 (8)
abstracting: (p1<=9)
states: 25,950,925 (7)
.
EG iterations: 1
abstracting: (p2<=24)
states: 102,821,875 (8)
abstracting: (p7<=p5)
states: 61,777,473 (7)
abstracting: (p4<=p2)
states: 31,056,025 (7)
abstracting: (p8<=22)
states: 104,294,190 (8)
abstracting: (p4<=p3)
states: 27,652,625 (7)
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.580sec

totally nodes used: 824416 (8.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 65986325 1977169 67963494
used/not used/entry size/cache size: 2432345 64676519 16 1024MB
basic ops cache: hits/miss/sum: 18076538 1195067 19271605
used/not used/entry size/cache size: 1747168 15030048 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: 940009 28099 968108
used/not used/entry size/cache size: 28080 8360528 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 66568649
1 474684
2 35012
3 13023
4 4650
5 2855
6 2567
7 1993
8 476
9 481
>= 10 4474

Total processing time: 0m18.144sec


BK_STOP 1679231530376

--------------------
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:2088 (261), effective:544 (68)

initing FirstDep: 0m 0.000sec


iterations count:586 (73), effective:170 (21)

iterations count:648 (81), effective:288 (36)

iterations count:350 (43), effective:155 (19)

iterations count:281 (35), effective:72 (9)

iterations count:680 (85), effective:224 (28)

iterations count:569 (71), effective:165 (20)

iterations count:1762 (220), effective:691 (86)

iterations count:149 (18), effective:42 (5)

iterations count:920 (115), effective:368 (46)

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

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

iterations count:299 (37), effective:123 (15)

iterations count:708 (88), effective:219 (27)

iterations count:1352 (169), effective:436 (54)

iterations count:708 (88), effective:219 (27)

iterations count:50 (6), effective:28 (3)

iterations count:708 (88), effective:219 (27)

iterations count:1192 (149), effective:512 (64)

iterations count:1834 (229), effective:522 (65)

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

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