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.r170-tall-167838856900209.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 FMS-PT-00020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856900209
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 7.8K Feb 25 20:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 20:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 20:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 20:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 20:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 20:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16K Mar 5 18:22 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 FMS-PT-00020-CTLCardinality-00
FORMULA_NAME FMS-PT-00020-CTLCardinality-01
FORMULA_NAME FMS-PT-00020-CTLCardinality-02
FORMULA_NAME FMS-PT-00020-CTLCardinality-03
FORMULA_NAME FMS-PT-00020-CTLCardinality-04
FORMULA_NAME FMS-PT-00020-CTLCardinality-05
FORMULA_NAME FMS-PT-00020-CTLCardinality-06
FORMULA_NAME FMS-PT-00020-CTLCardinality-07
FORMULA_NAME FMS-PT-00020-CTLCardinality-08
FORMULA_NAME FMS-PT-00020-CTLCardinality-09
FORMULA_NAME FMS-PT-00020-CTLCardinality-10
FORMULA_NAME FMS-PT-00020-CTLCardinality-11
FORMULA_NAME FMS-PT-00020-CTLCardinality-12
FORMULA_NAME FMS-PT-00020-CTLCardinality-13
FORMULA_NAME FMS-PT-00020-CTLCardinality-14
FORMULA_NAME FMS-PT-00020-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678493997588

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=FMS-PT-00020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:19:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 00:19:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:19:59] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-03-11 00:19:59] [INFO ] Transformed 22 places.
[2023-03-11 00:19:59] [INFO ] Transformed 20 transitions.
[2023-03-11 00:19:59] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 87 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 00:19:59] [INFO ] Computed 6 place invariants in 9 ms
[2023-03-11 00:19:59] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-11 00:19:59] [INFO ] Invariant cache hit.
[2023-03-11 00:19:59] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-11 00:19:59] [INFO ] Invariant cache hit.
[2023-03-11 00:19:59] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-03-11 00:19:59] [INFO ] Flatten gal took : 15 ms
[2023-03-11 00:19:59] [INFO ] Flatten gal took : 5 ms
[2023-03-11 00:19:59] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 96) seen :62
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) 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 33) 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 33) 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 33) 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 33) 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 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) 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 33) 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 33) 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 33) 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 33) 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 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) 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 33) 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 33) 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 33) 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 33) seen :0
Running SMT prover for 33 properties.
[2023-03-11 00:20:00] [INFO ] Invariant cache hit.
[2023-03-11 00:20:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 00:20:00] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:31
[2023-03-11 00:20:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 00:20:00] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :14 sat :19
[2023-03-11 00:20:00] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :14 sat :19
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-11 00:20:00] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :19
Fused 33 Parikh solutions to 19 different solutions.
Finished Parikh walk after 188 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=94 )
Parikh walk visited 19 properties in 61 ms.
Successfully simplified 14 atomic propositions for a total of 16 simplifications.
[2023-03-11 00:20:00] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 12 ms
[2023-03-11 00:20:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FMS-PT-00020-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00020-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00020-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:20:00] [INFO ] Input system was already deterministic with 20 transitions.
FORMULA FMS-PT-00020-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:20:00] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 19
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 5 rules applied. Total rules applied 6 place count 20 transition count 16
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 4 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 12 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 15 place count 12 transition count 14
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 16 place count 12 transition count 14
Applied a total of 16 rules in 8 ms. Remains 12 /22 variables (removed 10) and now considering 14/20 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 12/22 places, 14/20 transitions.
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 20 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 11 place count 16 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 15 transition count 14
Applied a total of 13 rules in 2 ms. Remains 15 /22 variables (removed 7) and now considering 14/20 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 15/22 places, 14/20 transitions.
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Input system was already deterministic with 20 transitions.
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:20:00] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:20:00] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-11 00:20:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 20 transitions and 50 arcs took 0 ms.
Total runtime 1605 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: 22 NrTr: 20 NrArc: 50)

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

net check time: 0m 0.000sec

init dd package: 0m 2.730sec


RS generation: 0m 1.147sec


-> reachability set: #nodes 25410 (2.5e+04) #states 6,029,168,852,784 (12)



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

checking: EG [AX [EF [10<=p14]]]
normalized: EG [~ [EX [~ [E [true U 10<=p14]]]]]

abstracting: (10<=p14)
states: 8,754,946,200 (9)
.
EG iterations: 0
-> the formula is TRUE

FORMULA FMS-PT-00020-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.329sec

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

abstracting: (p0<=p7)
states: 3,107,441,661,324 (12)
.-> the formula is TRUE

FORMULA FMS-PT-00020-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.971sec

checking: AX [AX [E [p13<=p21 U 11<=p1]]]
normalized: ~ [EX [EX [~ [E [p13<=p21 U 11<=p1]]]]]

abstracting: (11<=p1)
states: 100,162,725,432 (11)
abstracting: (p13<=p21)
states: 4,474,086,660,120 (12)
..-> the formula is TRUE

FORMULA FMS-PT-00020-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.530sec

checking: EX [[[~ [16<=p19] | ~ [20<=p1]] & [p18<=9 | p19<=13]]]
normalized: EX [[[p18<=9 | p19<=13] & [~ [20<=p1] | ~ [16<=p19]]]]

abstracting: (16<=p19)
states: 3,629,130,120 (9)
abstracting: (20<=p1)
states: 4,500,111 (6)
abstracting: (p19<=13)
states: 6,009,629,135,202 (12)
abstracting: (p18<=9)
states: 5,821,574,405,724 (12)
.-> the formula is TRUE

FORMULA FMS-PT-00020-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.202sec

checking: EF [[AG [[E [15<=p4 U p13<=p8] | [p21<=p1 & 12<=p8]]] & ~ [p18<=7]]]
normalized: E [true U [~ [p18<=7] & ~ [E [true U ~ [[[p21<=p1 & 12<=p8] | E [15<=p4 U p13<=p8]]]]]]]

abstracting: (p13<=p8)
states: 4,474,086,660,120 (12)
abstracting: (15<=p4)
states: 6,141,748,998 (9)
abstracting: (12<=p8)
states: 72,105,539,583 (10)
abstracting: (p21<=p1)
states: 3,357,035,509,674 (12)
abstracting: (p18<=7)
states: 5,527,642,267,224 (12)
-> the formula is FALSE

FORMULA FMS-PT-00020-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.829sec

checking: AF [~ [A [[~ [[19<=p9 & [11<=p0 & p14<=p8]]] & p1<=p2] U AG [AX [p14<=12]]]]]
normalized: ~ [EG [[~ [EG [E [true U EX [~ [p14<=12]]]]] & ~ [E [E [true U EX [~ [p14<=12]]] U [~ [[p1<=p2 & ~ [[19<=p9 & [11<=p0 & p14<=p8]]]]] & E [true U EX [~ [p14<=12]]]]]]]]]

abstracting: (p14<=12)
states: 6,028,746,079,356 (12)
.abstracting: (p14<=p8)
states: 4,474,086,660,120 (12)
abstracting: (11<=p0)
states: 100,162,725,432 (11)
abstracting: (19<=p9)
states: 70,382,466 (7)
abstracting: (p1<=p2)
states: 3,396,001,327,950 (12)
abstracting: (p14<=12)
states: 6,028,746,079,356 (12)
.abstracting: (p14<=12)
states: 6,028,746,079,356 (12)
.
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00020-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.920sec

checking: EF [[[AF [p9<=p21] & AX [[~ [5<=p3] & ~ [6<=p0]]]] & [p11<=p2 & p15<=p1]]]
normalized: E [true U [[p11<=p2 & p15<=p1] & [~ [EX [~ [[~ [6<=p0] & ~ [5<=p3]]]]] & ~ [EG [~ [p9<=p21]]]]]]

abstracting: (p9<=p21)
states: 3,377,140,895,205 (12)
.
EG iterations: 1
abstracting: (5<=p3)
states: 367,739,422,512 (11)
abstracting: (6<=p0)
states: 965,364,682,128 (11)
.abstracting: (p15<=p1)
states: 4,361,585,458,923 (12)
abstracting: (p11<=p2)
states: 5,423,142,995,424 (12)
-> the formula is TRUE

FORMULA FMS-PT-00020-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.246sec

checking: E [AG [[[p2<=p16 | ~ [6<=p1]] | [~ [[[p15<=11 & p18<=5] & [p19<=2 & p16<=4]]] | ~ [p0<=20]]]] U 5<=p17]
normalized: E [~ [E [true U ~ [[[~ [p0<=20] | ~ [[[p19<=2 & p16<=4] & [p15<=11 & p18<=5]]]] | [p2<=p16 | ~ [6<=p1]]]]]] U 5<=p17]

abstracting: (5<=p17)
states: 3,549,640,536,704 (12)
abstracting: (6<=p1)
states: 965,364,682,128 (11)
abstracting: (p2<=p16)
states: 4,664,582,459,690 (12)
abstracting: (p18<=5)
states: 4,965,369,449,964 (12)
abstracting: (p15<=11)
states: 6,029,168,852,784 (12)
abstracting: (p16<=4)
states: 2,479,528,316,080 (12)
abstracting: (p19<=2)
states: 3,285,873,603,474 (12)
abstracting: (p0<=20)
states: 6,029,168,852,784 (12)
-> the formula is FALSE

FORMULA FMS-PT-00020-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.157sec

checking: A [AX [EG [p7<=p0]] U [AG [p3<=13] | [AF [~ [AX [p19<=p8]]] & [p21<=5 | ~ [[AF [p11<=p12] | [p4<=p0 | p8<=16]]]]]]]
normalized: [~ [EG [~ [[[[p21<=5 | ~ [[[p4<=p0 | p8<=16] | ~ [EG [~ [p11<=p12]]]]]] & ~ [EG [~ [EX [~ [p19<=p8]]]]]] | ~ [E [true U ~ [p3<=13]]]]]]] & ~ [E [~ [[[[p21<=5 | ~ [[[p4<=p0 | p8<=16] | ~ [EG [~ [p11<=p12]]]]]] & ~ [EG [~ [EX [~ [p19<=p8]]]]]] | ~ [E [true U ~ [p3<=13]]]]] U [EX [~ [EG [p7<=p0]]] & ~ [[[[p21<=5 | ~ [[[p4<=p0 | p8<=16] | ~ [EG [~ [p11<=p12]]]]]] & ~ [EG [~ [EX [~ [p19<=p8]]]]]] | ~ [E [true U ~ [p3<=13]]]]]]]]]

abstracting: (p3<=13)
states: 6,029,044,059,654 (12)
abstracting: (p19<=p8)
states: 3,377,140,895,205 (12)
..
EG iterations: 1
abstracting: (p11<=p12)
states: 4,683,696,099,159 (12)
...................................................................................................
EG iterations: 99
abstracting: (p8<=16)
states: 6,027,908,086,200 (12)
abstracting: (p4<=p0)
states: 3,396,001,327,950 (12)
abstracting: (p21<=5)
states: 4,965,369,449,964 (12)
abstracting: (p7<=p0)
states: 3,902,713,985,940 (12)
.
EG iterations: 1
.abstracting: (p3<=13)
states: 6,029,044,059,654 (12)
abstracting: (p19<=p8)
states: 3,377,140,895,205 (12)
..
EG iterations: 1
abstracting: (p11<=p12)
states: 4,683,696,099,159 (12)
...................................................................................................
EG iterations: 99
abstracting: (p8<=16)
states: 6,027,908,086,200 (12)
abstracting: (p4<=p0)
states: 3,396,001,327,950 (12)
abstracting: (p21<=5)
states: 4,965,369,449,964 (12)
abstracting: (p3<=13)
states: 6,029,044,059,654 (12)
abstracting: (p19<=p8)
states: 3,377,140,895,205 (12)
..
EG iterations: 1
abstracting: (p11<=p12)
states: 4,683,696,099,159 (12)
...................................................................................................
EG iterations: 99
abstracting: (p8<=16)
states: 6,027,908,086,200 (12)
abstracting: (p4<=p0)
states: 3,396,001,327,950 (12)
abstracting: (p21<=5)
states: 4,965,369,449,964 (12)
.
EG iterations: 1
-> the formula is FALSE

FORMULA FMS-PT-00020-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.780sec

checking: A [[~ [[p20<=p13 & [15<=p2 | ~ [A [p11<=p1 U p20<=p9]]]]] | p12<=p14] U AG [[p5<=p9 | E [~ [EF [p17<=p2]] U AX [14<=p8]]]]]
normalized: [~ [EG [E [true U ~ [[p5<=p9 | E [~ [E [true U p17<=p2]] U ~ [EX [~ [14<=p8]]]]]]]]] & ~ [E [E [true U ~ [[p5<=p9 | E [~ [E [true U p17<=p2]] U ~ [EX [~ [14<=p8]]]]]]] U [~ [[p12<=p14 | ~ [[p20<=p13 & [15<=p2 | ~ [[~ [EG [~ [p20<=p9]]] & ~ [E [~ [p20<=p9] U [~ [p11<=p1] & ~ [p20<=p9]]]]]]]]]]] & E [true U ~ [[p5<=p9 | E [~ [E [true U p17<=p2]] U ~ [EX [~ [14<=p8]]]]]]]]]]]

abstracting: (14<=p8)
states: 19,539,717,582 (10)
.abstracting: (p17<=p2)
states: 1,839,892,059,620 (12)
abstracting: (p5<=p9)
states: 3,518,954,295,780 (12)
abstracting: (p20<=p9)
states: 1,900,384,486,005 (12)
abstracting: (p11<=p1)
states: 5,423,142,995,424 (12)
abstracting: (p20<=p9)
states: 1,900,384,486,005 (12)
abstracting: (p20<=p9)
states: 1,900,384,486,005 (12)
.
EG iterations: 1
abstracting: (15<=p2)
states: 6,141,748,998 (9)
abstracting: (p20<=p13)
states: 1,232,469,654,105 (12)
abstracting: (p12<=p14)
states: 4,533,491,787,825 (12)
abstracting: (14<=p8)
states: 19,539,717,582 (10)
.abstracting: (p17<=p2)
states: 1,839,892,059,620 (12)
abstracting: (p5<=p9)
states: 3,518,954,295,780 (12)
abstracting: (14<=p8)
states: 19,539,717,582 (10)
.abstracting: (p17<=p2)
states: 1,839,892,059,620 (12)
abstracting: (p5<=p9)
states: 3,518,954,295,780 (12)

EG iterations: 0
-> the formula is FALSE

FORMULA FMS-PT-00020-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.314sec

checking: EF [[EF [[E [p6<=p17 U AG [p17<=11]] & [EG [p20<=p10] | [AX [p5<=5] | [13<=p21 & 14<=p17]]]]] | [EX [3<=p13] & [AG [~ [18<=p2]] & [EG [~ [p16<=4]] | [AX [~ [p5<=p11]] & [EF [~ [p0<=p2]] & [~ [p12<=20] | ~ [10<=p5]]]]]]]]]
normalized: E [true U [[[[[[[~ [10<=p5] | ~ [p12<=20]] & E [true U ~ [p0<=p2]]] & ~ [EX [p5<=p11]]] | EG [~ [p16<=4]]] & ~ [E [true U 18<=p2]]] & EX [3<=p13]] | E [true U [[[[13<=p21 & 14<=p17] | ~ [EX [~ [p5<=5]]]] | EG [p20<=p10]] & E [p6<=p17 U ~ [E [true U ~ [p17<=11]]]]]]]]

abstracting: (p17<=11)
states: 4,854,655,439,904 (12)
abstracting: (p6<=p17)
states: 5,397,628,708,380 (12)
abstracting: (p20<=p10)
states: 840,499,410,444 (11)
.
EG iterations: 1
abstracting: (p5<=5)
states: 5,063,804,170,656 (12)
.abstracting: (14<=p17)
states: 730,808,345,792 (11)
abstracting: (13<=p21)
states: 38,960,194,350 (10)
abstracting: (3<=p13)
states: 1,226,112,110,916 (12)
.abstracting: (18<=p2)
states: 214,871,811 (8)
abstracting: (p16<=4)
states: 2,479,528,316,080 (12)
.
EG iterations: 1
abstracting: (p5<=p11)
states: 1,875,651,407,784 (12)
.abstracting: (p0<=p2)
states: 3,396,001,327,950 (12)
abstracting: (p12<=20)
states: 6,029,168,852,784 (12)
abstracting: (10<=p5)
states: 170,774,023,035 (11)
-> the formula is FALSE

FORMULA FMS-PT-00020-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.172sec

checking: [[~ [A [~ [AG [~ [p17<=p19]]] U ~ [A [[p7<=20 & p19<=15] U ~ [p10<=p0]]]]] & A [~ [p19<=p10] U [~ [2<=p13] | ~ [[~ [9<=p0] | [p9<=3 & 12<=p2]]]]]] & [AG [[[AX [~ [20<=p21]] & ~ [20<=p17]] | ~ [E [p9<=9 U 5<=p21]]]] & A [EF [p12<=p0] U E [EG [[p0<=p5 & [1<=p6 | p3<=p19]]] U [[AF [p2<=14] & AX [p21<=18]] | AX [~ [13<=p18]]]]]]]
normalized: [[[~ [EG [~ [E [EG [[p0<=p5 & [1<=p6 | p3<=p19]]] U [~ [EX [13<=p18]] | [~ [EX [~ [p21<=18]]] & ~ [EG [~ [p2<=14]]]]]]]]] & ~ [E [~ [E [EG [[p0<=p5 & [1<=p6 | p3<=p19]]] U [~ [EX [13<=p18]] | [~ [EX [~ [p21<=18]]] & ~ [EG [~ [p2<=14]]]]]]] U [~ [E [true U p12<=p0]] & ~ [E [EG [[p0<=p5 & [1<=p6 | p3<=p19]]] U [~ [EX [13<=p18]] | [~ [EX [~ [p21<=18]]] & ~ [EG [~ [p2<=14]]]]]]]]]]] & ~ [E [true U ~ [[~ [E [p9<=9 U 5<=p21]] | [~ [20<=p17] & ~ [EX [20<=p21]]]]]]]] & [[~ [EG [~ [[~ [[[p9<=3 & 12<=p2] | ~ [9<=p0]]] | ~ [2<=p13]]]]] & ~ [E [~ [[~ [[[p9<=3 & 12<=p2] | ~ [9<=p0]]] | ~ [2<=p13]]] U [p19<=p10 & ~ [[~ [[[p9<=3 & 12<=p2] | ~ [9<=p0]]] | ~ [2<=p13]]]]]]] & ~ [[~ [EG [[~ [EG [p10<=p0]] & ~ [E [p10<=p0 U [p10<=p0 & ~ [[p7<=20 & p19<=15]]]]]]]] & ~ [E [[~ [EG [p10<=p0]] & ~ [E [p10<=p0 U [p10<=p0 & ~ [[p7<=20 & p19<=15]]]]]] U [~ [E [true U p17<=p19]] & [~ [EG [p10<=p0]] & ~ [E [p10<=p0 U [p10<=p0 & ~ [[p7<=20 & p19<=15]]]]]]]]]]]]]

abstracting: (p19<=15)
states: 6,025,539,722,664 (12)
abstracting: (p7<=20)
states: 6,029,168,852,784 (12)
abstracting: (p10<=p0)
states: 5,251,034,789,154 (12)
abstracting: (p10<=p0)
states: 5,251,034,789,154 (12)
abstracting: (p10<=p0)
states: 5,251,034,789,154 (12)
................................................................................
EG iterations: 80
abstracting: (p17<=p19)
states: 1,900,384,486,005 (12)
abstracting: (p19<=15)
states: 6,025,539,722,664 (12)
abstracting: (p7<=20)
states: 6,029,168,852,784 (12)
abstracting: (p10<=p0)
states: 5,251,034,789,154 (12)
abstracting: (p10<=p0)
states: 5,251,034,789,154 (12)
abstracting: (p10<=p0)
states: 5,251,034,789,154 (12)
................................................................................
EG iterations: 80
abstracting: (p19<=15)
states: 6,025,539,722,664 (12)
abstracting: (p7<=20)
states: 6,029,168,852,784 (12)
abstracting: (p10<=p0)
states: 5,251,034,789,154 (12)
abstracting: (p10<=p0)
states: 5,251,034,789,154 (12)
abstracting: (p10<=p0)
states: 5,251,034,789,154 (12)
................................................................................
EG iterations: 80
.
EG iterations: 1
abstracting: (2<=p13)
states: 2,139,295,219,446 (12)
abstracting: (9<=p0)
states: 278,070,352,560 (11)
abstracting: (12<=p2)
states: 55,660,807,587 (10)
abstracting: (p9<=3)
states: 3,987,406,267,845 (12)
abstracting: (p19<=p10)
states: 1,920,576,892,542 (12)
abstracting: (2<=p13)
states: 2,139,295,219,446 (12)
abstracting: (9<=p0)
states: 278,070,352,560 (11)
abstracting: (12<=p2)
states: 55,660,807,587 (10)
abstracting: (p9<=3)
states: 3,987,406,267,845 (12)
abstracting: (2<=p13)
states: 2,139,295,219,446 (12)
abstracting: (9<=p0)
states: 278,070,352,560 (11)
abstracting: (12<=p2)
states: 55,660,807,587 (10)
abstracting: (p9<=3)
states: 3,987,406,267,845 (12)
.
EG iterations: 1
abstracting: (20<=p21)
states: 7,572,411 (6)
.abstracting: (20<=p17)
states: 26,100,298,064 (10)
abstracting: (5<=p21)
states: 1,490,099,505,972 (12)
abstracting: (p9<=9)
states: 5,821,574,405,724 (12)
abstracting: (p2<=14)
states: 6,023,027,103,786 (12)
.
EG iterations: 1
abstracting: (p21<=18)
states: 6,029,098,470,318 (12)
.abstracting: (13<=p18)
states: 38,960,194,350 (10)
.abstracting: (p3<=p19)
states: 4,474,086,660,120 (12)
abstracting: (1<=p6)
states: 3,914,577,133,929 (12)
abstracting: (p0<=p5)
states: 3,396,001,327,950 (12)
.
EG iterations: 1
abstracting: (p12<=p0)
states: 5,108,245,755,690 (12)
abstracting: (p2<=14)
states: 6,023,027,103,786 (12)
.
EG iterations: 1
abstracting: (p21<=18)
states: 6,029,098,470,318 (12)
.abstracting: (13<=p18)
states: 38,960,194,350 (10)
.abstracting: (p3<=p19)
states: 4,474,086,660,120 (12)
abstracting: (1<=p6)
states: 3,914,577,133,929 (12)
abstracting: (p0<=p5)
states: 3,396,001,327,950 (12)
.
EG iterations: 1
abstracting: (p2<=14)
states: 6,023,027,103,786 (12)
.
EG iterations: 1
abstracting: (p21<=18)
states: 6,029,098,470,318 (12)
.abstracting: (13<=p18)
states: 38,960,194,350 (10)
.abstracting: (p3<=p19)
states: 4,474,086,660,120 (12)
abstracting: (1<=p6)
states: 3,914,577,133,929 (12)
abstracting: (p0<=p5)
states: 3,396,001,327,950 (12)
.
EG iterations: 1
.................................................................
EG iterations: 65
-> the formula is FALSE

FORMULA FMS-PT-00020-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.870sec

totally nodes used: 22734610 (2.3e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 296282858 66548579 362831437
used/not used/entry size/cache size: 48211587 18897277 16 1024MB
basic ops cache: hits/miss/sum: 110890621 25132158 136022779
used/not used/entry size/cache size: 14500274 2276942 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: 7255362 1560428 8815790
used/not used/entry size/cache size: 1423986 6964622 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 48420422
1 15735644
2 2584271
3 294561
4 32149
5 8172
6 4711
7 3443
8 2489
9 1933
>= 10 21069

Total processing time: 1m 7.641sec


BK_STOP 1678494069587

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:1560 (78), effective:340 (17)

initing FirstDep: 0m 0.000sec


iterations count:730 (36), effective:140 (7)

iterations count:245 (12), effective:55 (2)

iterations count:955 (47), effective:235 (11)

iterations count:111 (5), effective:26 (1)

iterations count:208 (10), effective:55 (2)

iterations count:933 (46), effective:181 (9)

iterations count:933 (46), effective:181 (9)

iterations count:608 (30), effective:156 (7)

iterations count:933 (46), effective:181 (9)

iterations count:259 (12), effective:87 (4)

iterations count:946 (47), effective:220 (11)

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

iterations count:1028 (51), effective:196 (9)

iterations count:1028 (51), effective:196 (9)

iterations count:39 (1), effective:18 (0)

iterations count:1028 (51), effective:196 (9)

iterations count:140 (7), effective:40 (2)

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

iterations count:347 (17), effective:105 (5)

iterations count:166 (8), effective:36 (1)

iterations count:140 (7), effective:40 (2)

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

iterations count:347 (17), effective:105 (5)

iterations count:787 (39), effective:173 (8)

iterations count:140 (7), effective:40 (2)

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

iterations count:347 (17), effective:105 (5)

iterations count:80 (4), effective:24 (1)

iterations count:848 (42), effective:162 (8)

iterations count:638 (31), effective:156 (7)

iterations count:1052 (52), effective:233 (11)

iterations count:437 (21), effective:139 (6)

iterations count:1052 (52), effective:233 (11)

iterations count:1052 (52), effective:233 (11)

iterations count:54 (2), effective:17 (0)

iterations count:330 (16), effective:70 (3)

iterations count:462 (23), effective:150 (7)

iterations count:76 (3), effective:22 (1)

iterations count:58 (2), effective:11 (0)

iterations count:76 (3), effective:22 (1)

iterations count:76 (3), effective:22 (1)

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="FMS-PT-00020"
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 FMS-PT-00020, 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 r170-tall-167838856900209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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