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.r330-tall-167889203400545.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 RefineWMG-PT-005005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203400545
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.4K Feb 26 15:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 15:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 15:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14K 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 RefineWMG-PT-005005-CTLCardinality-00
FORMULA_NAME RefineWMG-PT-005005-CTLCardinality-01
FORMULA_NAME RefineWMG-PT-005005-CTLCardinality-02
FORMULA_NAME RefineWMG-PT-005005-CTLCardinality-03
FORMULA_NAME RefineWMG-PT-005005-CTLCardinality-04
FORMULA_NAME RefineWMG-PT-005005-CTLCardinality-05
FORMULA_NAME RefineWMG-PT-005005-CTLCardinality-06
FORMULA_NAME RefineWMG-PT-005005-CTLCardinality-07
FORMULA_NAME RefineWMG-PT-005005-CTLCardinality-08
FORMULA_NAME RefineWMG-PT-005005-CTLCardinality-09
FORMULA_NAME RefineWMG-PT-005005-CTLCardinality-10
FORMULA_NAME RefineWMG-PT-005005-CTLCardinality-11
FORMULA_NAME RefineWMG-PT-005005-CTLCardinality-12
FORMULA_NAME RefineWMG-PT-005005-CTLCardinality-13
FORMULA_NAME RefineWMG-PT-005005-CTLCardinality-14
FORMULA_NAME RefineWMG-PT-005005-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679169912059

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=RefineWMG-PT-005005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:05:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 20:05:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:05:13] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-18 20:05:13] [INFO ] Transformed 29 places.
[2023-03-18 20:05:13] [INFO ] Transformed 23 transitions.
[2023-03-18 20:05:13] [INFO ] Parsed PT model containing 29 places and 23 transitions and 68 arcs in 88 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Support contains 29 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 10 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2023-03-18 20:05:13] [INFO ] Computed 12 place invariants in 9 ms
[2023-03-18 20:05:14] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
[2023-03-18 20:05:14] [INFO ] Invariant cache hit.
[2023-03-18 20:05:14] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-18 20:05:14] [INFO ] Invariant cache hit.
[2023-03-18 20:05:14] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-18 20:05:14] [INFO ] Invariant cache hit.
[2023-03-18 20:05:14] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 528 ms. Remains : 29/29 places, 23/23 transitions.
Support contains 29 out of 29 places after structural reductions.
[2023-03-18 20:05:14] [INFO ] Flatten gal took : 16 ms
[2023-03-18 20:05:14] [INFO ] Flatten gal took : 6 ms
[2023-03-18 20:05:14] [INFO ] Input system was already deterministic with 23 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 80) seen :58
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Running SMT prover for 21 properties.
[2023-03-18 20:05:14] [INFO ] Invariant cache hit.
[2023-03-18 20:05:14] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-18 20:05:14] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:16
[2023-03-18 20:05:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-18 20:05:14] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :17 sat :4
[2023-03-18 20:05:15] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :17 sat :4
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-18 20:05:15] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :17 sat :4
Fused 21 Parikh solutions to 4 different solutions.
Finished Parikh walk after 179 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=179 )
Parikh walk visited 4 properties in 11 ms.
Successfully simplified 17 atomic propositions for a total of 16 simplifications.
FORMULA RefineWMG-PT-005005-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-005005-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:05:15] [INFO ] Input system was already deterministic with 23 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:05:15] [INFO ] Invariant cache hit.
[2023-03-18 20:05:15] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 7 ms
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:15] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:05:15] [INFO ] Invariant cache hit.
[2023-03-18 20:05:15] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:15] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 14 edges and 29 vertex of which 10 / 29 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 19 transition count 14
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 17 place count 11 transition count 10
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 2 rules applied. Total rules applied 19 place count 11 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 8 transition count 7
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 3 with 2 rules applied. Total rules applied 25 place count 7 transition count 6
Applied a total of 25 rules in 11 ms. Remains 7 /29 variables (removed 22) and now considering 6/23 (removed 17) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-18 20:05:15] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:05:15] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 7/29 places, 6/23 transitions.
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:05:15] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2023-03-18 20:05:15] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-18 20:05:15] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:15] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:05:15] [INFO ] Invariant cache hit.
[2023-03-18 20:05:15] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:15] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:05:15] [INFO ] Invariant cache hit.
[2023-03-18 20:05:15] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:05:15] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:05:15] [INFO ] Invariant cache hit.
[2023-03-18 20:05:15] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:15] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:05:15] [INFO ] Invariant cache hit.
[2023-03-18 20:05:15] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:15] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 11 edges and 29 vertex of which 6 / 29 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 23 transition count 18
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 18 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 18 place count 13 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 11 transition count 11
Applied a total of 22 rules in 4 ms. Remains 11 /29 variables (removed 18) and now considering 11/23 (removed 12) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-18 20:05:15] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 20:05:15] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 11/29 places, 11/23 transitions.
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:05:15] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 9 edges and 29 vertex of which 6 / 29 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 23 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 12 place count 17 transition count 15
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 1 rules applied. Total rules applied 13 place count 17 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 16 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 16 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 15 transition count 13
Applied a total of 16 rules in 3 ms. Remains 15 /29 variables (removed 14) and now considering 13/23 (removed 10) transitions.
// Phase 1: matrix 13 rows 15 cols
[2023-03-18 20:05:15] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-18 20:05:15] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 15/29 places, 13/23 transitions.
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:15] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2023-03-18 20:05:15] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-18 20:05:15] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:15] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 13 edges and 29 vertex of which 10 / 29 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 19 transition count 14
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 14 place count 13 transition count 11
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 1 rules applied. Total rules applied 15 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 12 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 11 transition count 9
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 3 with 2 rules applied. Total rules applied 20 place count 10 transition count 8
Applied a total of 20 rules in 3 ms. Remains 10 /29 variables (removed 19) and now considering 8/23 (removed 15) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-18 20:05:15] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 20:05:15] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 10/29 places, 8/23 transitions.
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:05:15] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2023-03-18 20:05:15] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-18 20:05:15] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:15] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:05:15] [INFO ] Invariant cache hit.
[2023-03-18 20:05:15] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:15] [INFO ] Input system was already deterministic with 23 transitions.
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:15] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:15] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-18 20:05:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 29 places, 23 transitions and 68 arcs took 2 ms.
Total runtime 2351 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: 29 NrTr: 23 NrArc: 68)

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

net check time: 0m 0.000sec

init dd package: 0m 2.685sec


RS generation: 0m 0.011sec


-> reachability set: #nodes 518 (5.2e+02) #states 622,559,748,096 (11)



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

checking: EG [EF [p11<=2]]
normalized: EG [E [true U p11<=2]]

abstracting: (p11<=2)
states: 311,279,874,048 (11)

EG iterations: 0
-> the formula is TRUE

FORMULA RefineWMG-PT-005005-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EF [[p21<=4 & AG [p16<=2]]]
normalized: E [true U [~ [E [true U ~ [p16<=2]]] & p21<=4]]

abstracting: (p21<=4)
states: 518,799,790,080 (11)
abstracting: (p16<=2)
states: 311,279,874,048 (11)
-> the formula is FALSE

FORMULA RefineWMG-PT-005005-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: A [AX [1<=0] U EG [p19<=p4]]
normalized: [~ [EG [~ [EG [p19<=p4]]]] & ~ [E [~ [EG [p19<=p4]] U [EX [~ [1<=0]] & ~ [EG [p19<=p4]]]]]]

abstracting: (p19<=p4)
states: 401,253,543,936 (11)
.
EG iterations: 1
abstracting: (1<=0)
states: 0
.abstracting: (p19<=p4)
states: 401,253,543,936 (11)
.
EG iterations: 1
abstracting: (p19<=p4)
states: 401,253,543,936 (11)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-005005-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: EF [EG [E [[p14<=p12 | AX [1<=p7]] U AX [1<=0]]]]
normalized: E [true U EG [E [[p14<=p12 | ~ [EX [~ [1<=p7]]]] U ~ [EX [~ [1<=0]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (1<=p7)
states: 518,799,790,080 (11)
.abstracting: (p14<=p12)
states: 518,860,256,256 (11)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RefineWMG-PT-005005-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [E [p12<=2 U EF [EX [p11<=p4]]]]
normalized: ~ [E [true U ~ [E [p12<=2 U E [true U EX [p11<=p4]]]]]]

abstracting: (p11<=p4)
states: 207,036,186,624 (11)
.abstracting: (p12<=2)
states: 311,279,874,048 (11)
-> the formula is TRUE

FORMULA RefineWMG-PT-005005-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EF [EX [[~ [p9<=p11] & p11<=7]]]
normalized: E [true U EX [[p11<=7 & ~ [p9<=p11]]]]

abstracting: (p9<=p11)
states: 518,860,256,256 (11)
abstracting: (p11<=7)
states: 622,559,748,096 (11)
.-> the formula is TRUE

FORMULA RefineWMG-PT-005005-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: E [E [p18<=0 U ~ [EF [AG [p19<=0]]]] U p7<=4]
normalized: E [E [p18<=0 U ~ [E [true U ~ [E [true U ~ [p19<=0]]]]]] U p7<=4]

abstracting: (p7<=4)
states: 518,799,790,080 (11)
abstracting: (p19<=0)
states: 287,335,268,352 (11)
abstracting: (p18<=0)
states: 103,759,958,016 (11)
-> the formula is TRUE

FORMULA RefineWMG-PT-005005-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [EF [[p13<=p8 | p11<=p15]]]
normalized: ~ [E [true U ~ [E [true U [p13<=p8 | p11<=p15]]]]]

abstracting: (p11<=p15)
states: 363,159,853,056 (11)
abstracting: (p13<=p8)
states: 363,159,853,056 (11)
-> the formula is TRUE

FORMULA RefineWMG-PT-005005-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AF [E [~ [[p7<=p1 & p21<=p15]] U ~ [EX [0<=0]]]]
normalized: ~ [EG [~ [E [~ [[p7<=p1 & p21<=p15]] U ~ [EX [0<=0]]]]]]

abstracting: (0<=0)
states: 622,559,748,096 (11)
.abstracting: (p21<=p15)
states: 363,159,853,056 (11)
abstracting: (p7<=p1)
states: 207,036,186,624 (11)

EG iterations: 0
-> the formula is FALSE

FORMULA RefineWMG-PT-005005-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[~ [1<=p18] | EX [E [[[p26<=1 | p20<=p3] & AG [p12<=p20]] U EF [p21<=1]]]]]
normalized: ~ [E [true U ~ [[EX [E [[~ [E [true U ~ [p12<=p20]]] & [p26<=1 | p20<=p3]] U E [true U p21<=1]]] | ~ [1<=p18]]]]]

abstracting: (1<=p18)
states: 518,799,790,080 (11)
abstracting: (p21<=1)
states: 207,519,916,032 (11)
abstracting: (p20<=p3)
states: 363,159,853,056 (11)
abstracting: (p26<=1)
states: 207,519,916,032 (11)
abstracting: (p12<=p20)
states: 363,159,853,056 (11)
.-> the formula is TRUE

FORMULA RefineWMG-PT-005005-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: A [[AG [4<=p22] | [~ [[p15<=3 | p23<=4]] | p7<=0]] U EF [AX [[7<=p14 & [[AX [p9<=3] | [4<=p0 & p7<=p17]] & [5<=p5 | p11<=3]]]]]]
normalized: [~ [EG [~ [E [true U ~ [EX [~ [[7<=p14 & [[5<=p5 | p11<=3] & [[4<=p0 & p7<=p17] | ~ [EX [~ [p9<=3]]]]]]]]]]]]] & ~ [E [~ [E [true U ~ [EX [~ [[7<=p14 & [[5<=p5 | p11<=3] & [[4<=p0 & p7<=p17] | ~ [EX [~ [p9<=3]]]]]]]]]]] U [~ [[[p7<=0 | ~ [[p15<=3 | p23<=4]]] | ~ [E [true U ~ [4<=p22]]]]] & ~ [E [true U ~ [EX [~ [[7<=p14 & [[5<=p5 | p11<=3] & [[4<=p0 & p7<=p17] | ~ [EX [~ [p9<=3]]]]]]]]]]]]]]]

abstracting: (p9<=3)
states: 592,084,795,392 (11)
.abstracting: (p7<=p17)
states: 363,159,853,056 (11)
abstracting: (4<=p0)
states: 30,474,952,704 (10)
abstracting: (p11<=3)
states: 415,039,832,064 (11)
abstracting: (5<=p5)
states: 103,759,958,016 (11)
abstracting: (7<=p14)
states: 362,797,056 (8)
.abstracting: (4<=p22)
states: 207,519,916,032 (11)
abstracting: (p23<=4)
states: 518,799,790,080 (11)
abstracting: (p15<=3)
states: 415,039,832,064 (11)
abstracting: (p7<=0)
states: 103,759,958,016 (11)
abstracting: (p9<=3)
states: 592,084,795,392 (11)
.abstracting: (p7<=p17)
states: 363,159,853,056 (11)
abstracting: (4<=p0)
states: 30,474,952,704 (10)
abstracting: (p11<=3)
states: 415,039,832,064 (11)
abstracting: (5<=p5)
states: 103,759,958,016 (11)
abstracting: (7<=p14)
states: 362,797,056 (8)
.abstracting: (p9<=3)
states: 592,084,795,392 (11)
.abstracting: (p7<=p17)
states: 363,159,853,056 (11)
abstracting: (4<=p0)
states: 30,474,952,704 (10)
abstracting: (p11<=3)
states: 415,039,832,064 (11)
abstracting: (5<=p5)
states: 103,759,958,016 (11)
abstracting: (7<=p14)
states: 362,797,056 (8)
..
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-005005-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: AG [A [~ [[AF [AX [p8<=1]] | p21<=2]] U [AF [p20<=p1] | [EG [EX [0<=0]] | [AF [[p14<=5 | 5<=p26]] & [~ [E [p2<=p18 U 2<=p20]] | AX [p12<=p9]]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[[[~ [EX [~ [p12<=p9]]] | ~ [E [p2<=p18 U 2<=p20]]] & ~ [EG [~ [[p14<=5 | 5<=p26]]]]] | EG [EX [0<=0]]] | ~ [EG [~ [p20<=p1]]]]]]] & ~ [E [~ [[[[[~ [EX [~ [p12<=p9]]] | ~ [E [p2<=p18 U 2<=p20]]] & ~ [EG [~ [[p14<=5 | 5<=p26]]]]] | EG [EX [0<=0]]] | ~ [EG [~ [p20<=p1]]]]] U [[p21<=2 | ~ [EG [EX [~ [p8<=1]]]]] & ~ [[[[[~ [EX [~ [p12<=p9]]] | ~ [E [p2<=p18 U 2<=p20]]] & ~ [EG [~ [[p14<=5 | 5<=p26]]]]] | EG [EX [0<=0]]] | ~ [EG [~ [p20<=p1]]]]]]]]]]]]

abstracting: (p20<=p1)
states: 207,036,186,624 (11)
.
EG iterations: 1
abstracting: (0<=0)
states: 622,559,748,096 (11)
.
EG iterations: 0
abstracting: (5<=p26)
states: 103,759,958,016 (11)
abstracting: (p14<=5)
states: 620,020,168,704 (11)
.
EG iterations: 1
abstracting: (2<=p20)
states: 415,039,832,064 (11)
abstracting: (p2<=p18)
states: 363,159,853,056 (11)
abstracting: (p12<=p9)
states: 207,036,186,624 (11)
.abstracting: (p8<=1)
states: 207,519,916,032 (11)
..
EG iterations: 1
abstracting: (p21<=2)
states: 311,279,874,048 (11)
abstracting: (p20<=p1)
states: 207,036,186,624 (11)
.
EG iterations: 1
abstracting: (0<=0)
states: 622,559,748,096 (11)
.
EG iterations: 0
abstracting: (5<=p26)
states: 103,759,958,016 (11)
abstracting: (p14<=5)
states: 620,020,168,704 (11)
.
EG iterations: 1
abstracting: (2<=p20)
states: 415,039,832,064 (11)
abstracting: (p2<=p18)
states: 363,159,853,056 (11)
abstracting: (p12<=p9)
states: 207,036,186,624 (11)
.abstracting: (p20<=p1)
states: 207,036,186,624 (11)
.
EG iterations: 1
abstracting: (0<=0)
states: 622,559,748,096 (11)
.
EG iterations: 0
abstracting: (5<=p26)
states: 103,759,958,016 (11)
abstracting: (p14<=5)
states: 620,020,168,704 (11)
.
EG iterations: 1
abstracting: (2<=p20)
states: 415,039,832,064 (11)
abstracting: (p2<=p18)
states: 363,159,853,056 (11)
abstracting: (p12<=p9)
states: 207,036,186,624 (11)
..
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-005005-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.068sec

checking: E [~ [[AG [EF [p18<=0]] | 3<=p23]] U E [~ [[p24<=5 & ~ [[p3<=p6 | AX [p24<=1]]]]] U [~ [E [p0<=5 U p0<=p18]] & [~ [[EF [3<=p12] & ~ [3<=p0]]] & p2<=p4]]]]
normalized: E [~ [[3<=p23 | ~ [E [true U ~ [E [true U p18<=0]]]]]] U E [~ [[p24<=5 & ~ [[p3<=p6 | ~ [EX [~ [p24<=1]]]]]]] U [[p2<=p4 & ~ [[~ [3<=p0] & E [true U 3<=p12]]]] & ~ [E [p0<=5 U p0<=p18]]]]]

abstracting: (p0<=p18)
states: 518,860,256,256 (11)
abstracting: (p0<=5)
states: 620,020,168,704 (11)
abstracting: (3<=p12)
states: 311,279,874,048 (11)
abstracting: (3<=p0)
states: 76,187,381,760 (10)
abstracting: (p2<=p4)
states: 207,036,186,624 (11)
abstracting: (p24<=1)
states: 454,947,508,224 (11)
.abstracting: (p3<=p6)
states: 363,159,853,056 (11)
abstracting: (p24<=5)
states: 620,020,168,704 (11)
abstracting: (p18<=0)
states: 103,759,958,016 (11)
abstracting: (3<=p23)
states: 311,279,874,048 (11)
-> the formula is TRUE

FORMULA RefineWMG-PT-005005-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.064sec

checking: EF [[EF [EG [5<=p9]] | [[~ [E [1<=p23 U p22<=3]] & ~ [p5<=1]] & [~ [4<=p6] & [[~ [p9<=0] | [EX [~ [p24<=6]] & [EG [~ [p3<=1]] & [p19<=p28 | EX [~ [2<=p21]]]]]] & [~ [4<=p22] | p24<=p1]]]]]]
normalized: E [true U [[[[[p24<=p1 | ~ [4<=p22]] & [[[[p19<=p28 | EX [~ [2<=p21]]] & EG [~ [p3<=1]]] & EX [~ [p24<=6]]] | ~ [p9<=0]]] & ~ [4<=p6]] & [~ [p5<=1] & ~ [E [1<=p23 U p22<=3]]]] | E [true U EG [5<=p9]]]]

abstracting: (5<=p9)
states: 10,158,317,568 (10)
.
EG iterations: 1
abstracting: (p22<=3)
states: 415,039,832,064 (11)
abstracting: (1<=p23)
states: 518,799,790,080 (11)
abstracting: (p5<=1)
states: 207,519,916,032 (11)
abstracting: (4<=p6)
states: 207,519,916,032 (11)
abstracting: (p9<=0)
states: 287,335,268,352 (11)
abstracting: (p24<=6)
states: 622,196,951,040 (11)
.abstracting: (p3<=1)
states: 207,519,916,032 (11)
.
EG iterations: 1
abstracting: (2<=p21)
states: 415,039,832,064 (11)
.abstracting: (p19<=p28)
states: 518,860,256,256 (11)
abstracting: (4<=p22)
states: 207,519,916,032 (11)
abstracting: (p24<=p1)
states: 401,253,543,936 (11)
-> the formula is TRUE

FORMULA RefineWMG-PT-005005-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

totally nodes used: 216208 (2.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 670795 638424 1309219
used/not used/entry size/cache size: 806343 66302521 16 1024MB
basic ops cache: hits/miss/sum: 264601 275868 540469
used/not used/entry size/cache size: 512411 16264805 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: 20965 21702 42667
used/not used/entry size/cache size: 21671 8366937 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 66901713
1 204386
2 1972
3 246
4 109
5 145
6 31
7 60
8 34
9 56
>= 10 112

Total processing time: 0m 4.570sec


BK_STOP 1679169921306

--------------------
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:1594 (69), effective:595 (25)

initing FirstDep: 0m 0.000sec


iterations count:300 (13), effective:97 (4)

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

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

iterations count:149 (6), effective:51 (2)

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

iterations count:274 (11), effective:85 (3)

iterations count:123 (5), effective:39 (1)

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

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

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

iterations count:486 (21), effective:173 (7)

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

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

iterations count:1597 (69), effective:577 (25)

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

iterations count:1597 (69), effective:577 (25)

iterations count:1597 (69), effective:577 (25)

iterations count:190 (8), effective:62 (2)

iterations count:190 (8), effective:62 (2)

iterations count:190 (8), effective:62 (2)

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

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

iterations count:1436 (62), effective:555 (24)

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

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

iterations count:493 (21), effective:162 (7)

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

iterations count:23 (1), effective:0 (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="RefineWMG-PT-005005"
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 RefineWMG-PT-005005, 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 r330-tall-167889203400545"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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