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-167838856900194.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-00005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856900194
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.7K Feb 25 19:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 19:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 19:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 19:47 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.7K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 19:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 19:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 19:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Feb 25 19:49 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 17K 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-00005-CTLFireability-00
FORMULA_NAME FMS-PT-00005-CTLFireability-01
FORMULA_NAME FMS-PT-00005-CTLFireability-02
FORMULA_NAME FMS-PT-00005-CTLFireability-03
FORMULA_NAME FMS-PT-00005-CTLFireability-04
FORMULA_NAME FMS-PT-00005-CTLFireability-05
FORMULA_NAME FMS-PT-00005-CTLFireability-06
FORMULA_NAME FMS-PT-00005-CTLFireability-07
FORMULA_NAME FMS-PT-00005-CTLFireability-08
FORMULA_NAME FMS-PT-00005-CTLFireability-09
FORMULA_NAME FMS-PT-00005-CTLFireability-10
FORMULA_NAME FMS-PT-00005-CTLFireability-11
FORMULA_NAME FMS-PT-00005-CTLFireability-12
FORMULA_NAME FMS-PT-00005-CTLFireability-13
FORMULA_NAME FMS-PT-00005-CTLFireability-14
FORMULA_NAME FMS-PT-00005-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678493897101

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FMS-PT-00005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:18:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 00:18:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:18:18] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-11 00:18:18] [INFO ] Transformed 22 places.
[2023-03-11 00:18:18] [INFO ] Transformed 20 transitions.
[2023-03-11 00:18:18] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 80 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 2 formulas.
FORMULA FMS-PT-00005-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00005-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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:18:18] [INFO ] Computed 6 place invariants in 8 ms
[2023-03-11 00:18:19] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-11 00:18:19] [INFO ] Invariant cache hit.
[2023-03-11 00:18:19] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2023-03-11 00:18:19] [INFO ] Invariant cache hit.
[2023-03-11 00:18:19] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 458 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 15 ms
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 5 ms
[2023-03-11 00:18:19] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 40) seen :39
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 00:18:19] [INFO ] Invariant cache hit.
[2023-03-11 00:18:19] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 00:18:19] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 3 ms
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 3 ms
[2023-03-11 00:18:19] [INFO ] Input system was already deterministic with 20 transitions.
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:18:19] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 7 edges and 17 vertex of which 3 / 17 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 11 place count 15 transition count 15
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 17 place count 13 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 19 place count 11 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 19 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 21 place count 10 transition count 10
Applied a total of 21 rules in 8 ms. Remains 10 /22 variables (removed 12) and now considering 10/20 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 10/22 places, 10/20 transitions.
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [INFO ] Input system was already deterministic with 10 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:18:19] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [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:18:19] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 11 edges and 15 vertex of which 9 / 15 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 9 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 20 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 25 place count 5 transition count 7
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 5 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 27 place count 5 transition count 3
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 2 transition count 3
Applied a total of 32 rules in 2 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 2/22 places, 3/20 transitions.
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:18:19] [INFO ] Input system was already deterministic with 3 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA FMS-PT-00005-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [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:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [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:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 8 edges and 17 vertex of which 3 / 17 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 10 place count 15 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 14 place count 14 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 13 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 15 place count 13 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 17 place count 12 transition count 12
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 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 20 place count 10 transition count 11
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 10 transition count 11
Applied a total of 21 rules in 3 ms. Remains 10 /22 variables (removed 12) and now considering 11/20 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 10/22 places, 11/20 transitions.
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [INFO ] Input system was already deterministic with 11 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:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 18 transition count 15
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 16 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 13 place count 15 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 13 place count 15 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 20 place count 11 transition count 11
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 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 23 place count 9 transition count 10
Applied a total of 23 rules in 3 ms. Remains 9 /22 variables (removed 13) and now considering 10/20 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 9/22 places, 10/20 transitions.
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:18:19] [INFO ] Input system was already deterministic with 10 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:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [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:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [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:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [INFO ] Input system was already deterministic with 20 transitions.
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:18:19] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:18:19] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-11 00:18:19] [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 1214 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=CTLFireability.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.729sec


RS generation: 0m 0.009sec


-> reachability set: #nodes 1005 (1.0e+03) #states 2,895,018 (6)



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

checking: E [p11<=0 U EX [~ [AF [p20<=0]]]]
normalized: E [p11<=0 U EX [EG [~ [p20<=0]]]]

abstracting: (p20<=0)
states: 827,148 (5)
.
EG iterations: 1
.abstracting: (p11<=0)
states: 1,943,697 (6)
-> the formula is TRUE

FORMULA FMS-PT-00005-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

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

abstracting: (1<=p11)
states: 951,321 (5)
.abstracting: (1<=p14)
states: 614,040 (5)
-> the formula is FALSE

FORMULA FMS-PT-00005-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AG [EF [[1<=p0 | [1<=p8 & 1<=p10]]]]
normalized: ~ [E [true U ~ [E [true U [[1<=p8 & 1<=p10] | 1<=p0]]]]]

abstracting: (1<=p0)
states: 1,280,706 (6)
abstracting: (1<=p10)
states: 1,943,697 (6)
abstracting: (1<=p8)
states: 1,356,810 (6)
-> the formula is TRUE

FORMULA FMS-PT-00005-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EF [[EG [AG [[p9<=0 | [p2<=0 | p18<=0]]]] & 1<=p11]]
normalized: E [true U [EG [~ [E [true U ~ [[[p2<=0 | p18<=0] | p9<=0]]]]] & 1<=p11]]

abstracting: (1<=p11)
states: 951,321 (5)
abstracting: (p9<=0)
states: 1,538,208 (6)
abstracting: (p18<=0)
states: 1,538,208 (6)
abstracting: (p2<=0)
states: 1,614,312 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA FMS-PT-00005-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AX [[AF [1<=p4] & [p11<=0 & [p10<=0 | p17<=0]]]]
normalized: ~ [EX [~ [[[[p10<=0 | p17<=0] & p11<=0] & ~ [EG [~ [1<=p4]]]]]]]

abstracting: (1<=p4)
states: 1,280,706 (6)
.
EG iterations: 1
abstracting: (p11<=0)
states: 1,943,697 (6)
abstracting: (p17<=0)
states: 827,148 (5)
abstracting: (p10<=0)
states: 951,321 (5)
.-> the formula is FALSE

FORMULA FMS-PT-00005-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EG [EF [[[EG [[1<=p19 & 1<=p16]] & 1<=p2] & [1<=p18 & [1<=p10 & 1<=p17]]]]]
normalized: EG [E [true U [[1<=p18 & [1<=p10 & 1<=p17]] & [1<=p2 & EG [[1<=p19 & 1<=p16]]]]]]

abstracting: (1<=p16)
states: 2,067,870 (6)
abstracting: (1<=p19)
states: 1,356,810 (6)
.
EG iterations: 1
abstracting: (1<=p2)
states: 1,280,706 (6)
abstracting: (1<=p17)
states: 2,067,870 (6)
abstracting: (1<=p10)
states: 1,943,697 (6)
abstracting: (1<=p18)
states: 1,356,810 (6)

EG iterations: 0
-> the formula is TRUE

FORMULA FMS-PT-00005-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [[[AX [[p4<=0 & [p10<=0 | p17<=0]]] & 1<=p5] & [1<=p7 & 1<=p19]]]
normalized: E [true U [[1<=p7 & 1<=p19] & [1<=p5 & ~ [EX [~ [[p4<=0 & [p10<=0 | p17<=0]]]]]]]]

abstracting: (p17<=0)
states: 827,148 (5)
abstracting: (p10<=0)
states: 951,321 (5)
abstracting: (p4<=0)
states: 1,614,312 (6)
.abstracting: (1<=p5)
states: 1,280,706 (6)
abstracting: (1<=p19)
states: 1,356,810 (6)
abstracting: (1<=p7)
states: 2,778,678 (6)
-> the formula is TRUE

FORMULA FMS-PT-00005-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: AG [[AF [[[EX [[p18<=0 | p2<=0]] & [p16<=0 | p12<=0]] | [1<=p19 & AX [[p13<=0 | p15<=0]]]]] | 1<=p0]]
normalized: ~ [E [true U ~ [[1<=p0 | ~ [EG [~ [[[1<=p19 & ~ [EX [~ [[p13<=0 | p15<=0]]]]] | [[p16<=0 | p12<=0] & EX [[p18<=0 | p2<=0]]]]]]]]]]]

abstracting: (p2<=0)
states: 1,614,312 (6)
abstracting: (p18<=0)
states: 1,538,208 (6)
.abstracting: (p12<=0)
states: 2,292,192 (6)
abstracting: (p16<=0)
states: 827,148 (5)
abstracting: (p15<=0)
states: 90,006 (4)
abstracting: (p13<=0)
states: 2,280,978 (6)
.abstracting: (1<=p19)
states: 1,356,810 (6)
................
EG iterations: 16
abstracting: (1<=p0)
states: 1,280,706 (6)
-> the formula is FALSE

FORMULA FMS-PT-00005-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: ~ [E [AG [[AF [p11<=0] | 1<=p20]] U [~ [AX [~ [A [1<=p4 U 1<=p19]]]] | ~ [[~ [[1<=p12 & 1<=p19]] | [[1<=p2 & 1<=p18] & [1<=p8 & [1<=p10 & 1<=p12]]]]]]]]
normalized: ~ [E [~ [E [true U ~ [[1<=p20 | ~ [EG [~ [p11<=0]]]]]]] U [~ [[[[1<=p8 & [1<=p10 & 1<=p12]] & [1<=p2 & 1<=p18]] | ~ [[1<=p12 & 1<=p19]]]] | EX [[~ [EG [~ [1<=p19]]] & ~ [E [~ [1<=p19] U [~ [1<=p4] & ~ [1<=p19]]]]]]]]]

abstracting: (1<=p19)
states: 1,356,810 (6)
abstracting: (1<=p4)
states: 1,280,706 (6)
abstracting: (1<=p19)
states: 1,356,810 (6)
abstracting: (1<=p19)
states: 1,356,810 (6)
....................
EG iterations: 20
.abstracting: (1<=p19)
states: 1,356,810 (6)
abstracting: (1<=p12)
states: 602,826 (5)
abstracting: (1<=p18)
states: 1,356,810 (6)
abstracting: (1<=p2)
states: 1,280,706 (6)
abstracting: (1<=p12)
states: 602,826 (5)
abstracting: (1<=p10)
states: 1,943,697 (6)
abstracting: (1<=p8)
states: 1,356,810 (6)
abstracting: (p11<=0)
states: 1,943,697 (6)
....................
EG iterations: 20
abstracting: (1<=p20)
states: 2,067,870 (6)
-> the formula is TRUE

FORMULA FMS-PT-00005-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: [E [~ [EX [[1<=p6 | AF [1<=p6]]]] U [[AF [AG [1<=p3]] & 1<=p1] | [[[[AF [1<=p16] | E [1<=p14 U [1<=p10 & 1<=p17]]] & [AG [1<=p11] | AG [[1<=p10 & 1<=p17]]]] & [1<=p8 & 1<=p10]] | EG [AG [1<=p6]]]]] | AF [EX [[1<=p2 & 1<=p18]]]]
normalized: [~ [EG [~ [EX [[1<=p2 & 1<=p18]]]]] | E [~ [EX [[1<=p6 | ~ [EG [~ [1<=p6]]]]]] U [[EG [~ [E [true U ~ [1<=p6]]]] | [[1<=p8 & 1<=p10] & [[~ [E [true U ~ [[1<=p10 & 1<=p17]]]] | ~ [E [true U ~ [1<=p11]]]] & [E [1<=p14 U [1<=p10 & 1<=p17]] | ~ [EG [~ [1<=p16]]]]]]] | [1<=p1 & ~ [EG [E [true U ~ [1<=p3]]]]]]]]

abstracting: (1<=p3)
states: 614,040 (5)

EG iterations: 0
abstracting: (1<=p1)
states: 1,280,706 (6)
abstracting: (1<=p16)
states: 2,067,870 (6)
.
EG iterations: 1
abstracting: (1<=p17)
states: 2,067,870 (6)
abstracting: (1<=p10)
states: 1,943,697 (6)
abstracting: (1<=p14)
states: 614,040 (5)
abstracting: (1<=p11)
states: 951,321 (5)
abstracting: (1<=p17)
states: 2,067,870 (6)
abstracting: (1<=p10)
states: 1,943,697 (6)
abstracting: (1<=p10)
states: 1,943,697 (6)
abstracting: (1<=p8)
states: 1,356,810 (6)
abstracting: (1<=p6)
states: 1,251,306 (6)
.
EG iterations: 1
abstracting: (1<=p6)
states: 1,251,306 (6)
.
EG iterations: 1
abstracting: (1<=p6)
states: 1,251,306 (6)
.abstracting: (1<=p18)
states: 1,356,810 (6)
abstracting: (1<=p2)
states: 1,280,706 (6)
.....................
EG iterations: 20
-> the formula is FALSE

FORMULA FMS-PT-00005-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: E [[~ [[[EG [AX [1<=p3]] | [[EG [[1<=p10 & 1<=p17]] & 1<=p16] & [1<=p3 & 1<=p9]]] | [EF [1<=p6] | [[1<=p2 & 1<=p18] | [1<=p2 & 1<=p18]]]]] & [~ [[1<=p4 & EG [AX [[1<=p8 & 1<=p10]]]]] | 1<=p16]] U [1<=p9 & ~ [EX [~ [[[1<=p2 & [1<=p18 & 1<=p19]] | 1<=p1]]]]]]
normalized: E [[[1<=p16 | ~ [[1<=p4 & EG [~ [EX [~ [[1<=p8 & 1<=p10]]]]]]]] & ~ [[[[[1<=p2 & 1<=p18] | [1<=p2 & 1<=p18]] | E [true U 1<=p6]] | [[[1<=p3 & 1<=p9] & [1<=p16 & EG [[1<=p10 & 1<=p17]]]] | EG [~ [EX [~ [1<=p3]]]]]]]] U [1<=p9 & ~ [EX [~ [[1<=p1 | [1<=p2 & [1<=p18 & 1<=p19]]]]]]]]

abstracting: (1<=p19)
states: 1,356,810 (6)
abstracting: (1<=p18)
states: 1,356,810 (6)
abstracting: (1<=p2)
states: 1,280,706 (6)
abstracting: (1<=p1)
states: 1,280,706 (6)
.abstracting: (1<=p9)
states: 1,356,810 (6)
abstracting: (1<=p3)
states: 614,040 (5)
..
EG iterations: 1
abstracting: (1<=p17)
states: 2,067,870 (6)
abstracting: (1<=p10)
states: 1,943,697 (6)
.
EG iterations: 1
abstracting: (1<=p16)
states: 2,067,870 (6)
abstracting: (1<=p9)
states: 1,356,810 (6)
abstracting: (1<=p3)
states: 614,040 (5)
abstracting: (1<=p6)
states: 1,251,306 (6)
abstracting: (1<=p18)
states: 1,356,810 (6)
abstracting: (1<=p2)
states: 1,280,706 (6)
abstracting: (1<=p18)
states: 1,356,810 (6)
abstracting: (1<=p2)
states: 1,280,706 (6)
abstracting: (1<=p10)
states: 1,943,697 (6)
abstracting: (1<=p8)
states: 1,356,810 (6)
...
EG iterations: 2
abstracting: (1<=p4)
states: 1,280,706 (6)
abstracting: (1<=p16)
states: 2,067,870 (6)
-> the formula is FALSE

FORMULA FMS-PT-00005-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: [EX [[[~ [E [1<=p12 U [1<=p8 & 1<=p10]]] | [1<=p4 | [p11<=0 & p1<=0]]] & EG [~ [E [[1<=p5 & 1<=p7] U 1<=p3]]]]] & [AG [[EF [p14<=0] & EF [[[AG [p3<=0] | 1<=p19] | [1<=p3 | [[1<=p8 & 1<=p10] | 1<=p20]]]]]] & EF [[[[EX [[1<=p10 & 1<=p17]] | [p16<=0 | ~ [A [1<=p0 U 1<=p11]]]] & [1<=p5 & 1<=p7]] | [~ [E [1<=p11 U 1<=p1]] & EX [[p10<=0 | p17<=0]]]]]]]
normalized: [[E [true U [[EX [[p10<=0 | p17<=0]] & ~ [E [1<=p11 U 1<=p1]]] | [[1<=p5 & 1<=p7] & [[p16<=0 | ~ [[~ [EG [~ [1<=p11]]] & ~ [E [~ [1<=p11] U [~ [1<=p0] & ~ [1<=p11]]]]]]] | EX [[1<=p10 & 1<=p17]]]]]] & ~ [E [true U ~ [[E [true U [[1<=p3 | [1<=p20 | [1<=p8 & 1<=p10]]] | [1<=p19 | ~ [E [true U ~ [p3<=0]]]]]] & E [true U p14<=0]]]]]] & EX [[EG [~ [E [[1<=p5 & 1<=p7] U 1<=p3]]] & [[1<=p4 | [p11<=0 & p1<=0]] | ~ [E [1<=p12 U [1<=p8 & 1<=p10]]]]]]]

abstracting: (1<=p10)
states: 1,943,697 (6)
abstracting: (1<=p8)
states: 1,356,810 (6)
abstracting: (1<=p12)
states: 602,826 (5)
abstracting: (p1<=0)
states: 1,614,312 (6)
abstracting: (p11<=0)
states: 1,943,697 (6)
abstracting: (1<=p4)
states: 1,280,706 (6)
abstracting: (1<=p3)
states: 614,040 (5)
abstracting: (1<=p7)
states: 2,778,678 (6)
abstracting: (1<=p5)
states: 1,280,706 (6)
.
EG iterations: 1
.abstracting: (p14<=0)
states: 2,280,978 (6)
abstracting: (p3<=0)
states: 2,280,978 (6)
abstracting: (1<=p19)
states: 1,356,810 (6)
abstracting: (1<=p10)
states: 1,943,697 (6)
abstracting: (1<=p8)
states: 1,356,810 (6)
abstracting: (1<=p20)
states: 2,067,870 (6)
abstracting: (1<=p3)
states: 614,040 (5)
abstracting: (1<=p17)
states: 2,067,870 (6)
abstracting: (1<=p10)
states: 1,943,697 (6)
.abstracting: (1<=p11)
states: 951,321 (5)
abstracting: (1<=p0)
states: 1,280,706 (6)
abstracting: (1<=p11)
states: 951,321 (5)
abstracting: (1<=p11)
states: 951,321 (5)
.
EG iterations: 1
abstracting: (p16<=0)
states: 827,148 (5)
abstracting: (1<=p7)
states: 2,778,678 (6)
abstracting: (1<=p5)
states: 1,280,706 (6)
abstracting: (1<=p1)
states: 1,280,706 (6)
abstracting: (1<=p11)
states: 951,321 (5)
abstracting: (p17<=0)
states: 827,148 (5)
abstracting: (p10<=0)
states: 951,321 (5)
.-> the formula is TRUE

FORMULA FMS-PT-00005-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.070sec

checking: E [[A [[1<=p4 | [AX [1<=p21] & p16<=0]] U ~ [[1<=p10 & 1<=p17]]] | [1<=p21 | A [[p11<=0 & p3<=0] U ~ [[EF [1<=p19] | ~ [[1<=p13 & [1<=p15 & 1<=p3]]]]]]]] U [~ [[AF [~ [[1<=p8 & 1<=p10]]] | [1<=p19 | [1<=p8 & 1<=p10]]]] & [AX [[A [1<=p12 U [1<=p5 & 1<=p7]] | [1<=p14 | [1<=p5 & [1<=p7 & 1<=p16]]]]] & [1<=p6 | [[EX [p11<=0] & EX [1<=p19]] & [~ [[[p13<=0 | p15<=0] & AX [~ [[p13<=0 | p15<=0]]]]] & [p19<=0 & [1<=p0 | [1<=p3 & [1<=p8 & 1<=p10]]]]]]]]]]
normalized: E [[[1<=p21 | [~ [EG [[~ [[1<=p13 & [1<=p15 & 1<=p3]]] | E [true U 1<=p19]]]] & ~ [E [[~ [[1<=p13 & [1<=p15 & 1<=p3]]] | E [true U 1<=p19]] U [~ [[p11<=0 & p3<=0]] & [~ [[1<=p13 & [1<=p15 & 1<=p3]]] | E [true U 1<=p19]]]]]]] | [~ [EG [[1<=p10 & 1<=p17]]] & ~ [E [[1<=p10 & 1<=p17] U [~ [[1<=p4 | [p16<=0 & ~ [EX [~ [1<=p21]]]]]] & [1<=p10 & 1<=p17]]]]]] U [[[1<=p6 | [[[p19<=0 & [1<=p0 | [1<=p3 & [1<=p8 & 1<=p10]]]] & ~ [[~ [EX [[p13<=0 | p15<=0]]] & [p13<=0 | p15<=0]]]] & [EX [1<=p19] & EX [p11<=0]]]] & ~ [EX [~ [[[1<=p14 | [1<=p5 & [1<=p7 & 1<=p16]]] | [~ [EG [~ [[1<=p5 & 1<=p7]]]] & ~ [E [~ [[1<=p5 & 1<=p7]] U [~ [1<=p12] & ~ [[1<=p5 & 1<=p7]]]]]]]]]]] & ~ [[[1<=p19 | [1<=p8 & 1<=p10]] | ~ [EG [[1<=p8 & 1<=p10]]]]]]]

abstracting: (1<=p10)
states: 1,943,697 (6)
abstracting: (1<=p8)
states: 1,356,810 (6)
.
EG iterations: 1
abstracting: (1<=p10)
states: 1,943,697 (6)
abstracting: (1<=p8)
states: 1,356,810 (6)
abstracting: (1<=p19)
states: 1,356,810 (6)
abstracting: (1<=p7)
states: 2,778,678 (6)
abstracting: (1<=p5)
states: 1,280,706 (6)
abstracting: (1<=p12)
states: 602,826 (5)
abstracting: (1<=p7)
states: 2,778,678 (6)
abstracting: (1<=p5)
states: 1,280,706 (6)
abstracting: (1<=p7)
states: 2,778,678 (6)
abstracting: (1<=p5)
states: 1,280,706 (6)
.
EG iterations: 1
abstracting: (1<=p16)
states: 2,067,870 (6)
abstracting: (1<=p7)
states: 2,778,678 (6)
abstracting: (1<=p5)
states: 1,280,706 (6)
abstracting: (1<=p14)
states: 614,040 (5)
.abstracting: (p11<=0)
states: 1,943,697 (6)
.abstracting: (1<=p19)
states: 1,356,810 (6)
.abstracting: (p15<=0)
states: 90,006 (4)
abstracting: (p13<=0)
states: 2,280,978 (6)
abstracting: (p15<=0)
states: 90,006 (4)
abstracting: (p13<=0)
states: 2,280,978 (6)
.abstracting: (1<=p10)
states: 1,943,697 (6)
abstracting: (1<=p8)
states: 1,356,810 (6)
abstracting: (1<=p3)
states: 614,040 (5)
abstracting: (1<=p0)
states: 1,280,706 (6)
abstracting: (p19<=0)
states: 1,538,208 (6)
abstracting: (1<=p6)
states: 1,251,306 (6)
abstracting: (1<=p17)
states: 2,067,870 (6)
abstracting: (1<=p10)
states: 1,943,697 (6)
abstracting: (1<=p21)
states: 1,356,810 (6)
.abstracting: (p16<=0)
states: 827,148 (5)
abstracting: (1<=p4)
states: 1,280,706 (6)
abstracting: (1<=p17)
states: 2,067,870 (6)
abstracting: (1<=p10)
states: 1,943,697 (6)
abstracting: (1<=p17)
states: 2,067,870 (6)
abstracting: (1<=p10)
states: 1,943,697 (6)
.
EG iterations: 1
abstracting: (1<=p19)
states: 1,356,810 (6)
abstracting: (1<=p3)
states: 614,040 (5)
abstracting: (1<=p15)
states: 2,805,012 (6)
abstracting: (1<=p13)
states: 614,040 (5)
abstracting: (p3<=0)
states: 2,280,978 (6)
abstracting: (p11<=0)
states: 1,943,697 (6)
abstracting: (1<=p19)
states: 1,356,810 (6)
abstracting: (1<=p3)
states: 614,040 (5)
abstracting: (1<=p15)
states: 2,805,012 (6)
abstracting: (1<=p13)
states: 614,040 (5)
abstracting: (1<=p19)
states: 1,356,810 (6)
abstracting: (1<=p3)
states: 614,040 (5)
abstracting: (1<=p15)
states: 2,805,012 (6)
abstracting: (1<=p13)
states: 614,040 (5)

EG iterations: 0
abstracting: (1<=p21)
states: 1,356,810 (6)
-> the formula is FALSE

FORMULA FMS-PT-00005-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

totally nodes used: 220784 (2.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 820148 640869 1461017
used/not used/entry size/cache size: 813841 66295023 16 1024MB
basic ops cache: hits/miss/sum: 246816 191948 438764
used/not used/entry size/cache size: 366039 16411177 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: 22665 16418 39083
used/not used/entry size/cache size: 16416 8372192 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 66899359
1 202895
2 5469
3 401
4 229
5 142
6 80
7 83
8 39
9 29
>= 10 138

Total processing time: 0m 4.641sec


BK_STOP 1678493905520

--------------------
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 CTLFireability -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:405 (20), effective:85 (4)

initing FirstDep: 0m 0.000sec


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

iterations count:91 (4), effective:14 (0)

iterations count:63 (3), effective:13 (0)

iterations count:150 (7), effective:28 (1)

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

iterations count:220 (11), effective:57 (2)

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

iterations count:35 (1), effective:5 (0)

iterations count:108 (5), effective:23 (1)

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

iterations count:30 (1), effective:5 (0)

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

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

iterations count:49 (2), effective:10 (0)

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

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

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

iterations count:81 (4), effective:14 (0)

iterations count:95 (4), effective:15 (0)

iterations count:35 (1), effective:5 (0)

iterations count:92 (4), effective:14 (0)

iterations count:37 (1), effective:6 (0)

iterations count:25 (1), effective:5 (0)

iterations count:61 (3), effective:10 (0)

iterations count:86 (4), effective:23 (1)

iterations count:40 (2), effective:2 (0)

iterations count:43 (2), effective:9 (0)

iterations count:82 (4), effective:14 (0)

iterations count:82 (4), effective:14 (0)

iterations count:79 (3), effective:13 (0)

iterations count:82 (4), effective:14 (0)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FMS-PT-00005"
export BK_EXAMINATION="CTLFireability"
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-00005, examination is CTLFireability"
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-167838856900194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-00005.tgz
mv FMS-PT-00005 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;