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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 6.2K Feb 26 16:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 16:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 15:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 15:58 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.5K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 7.9K Feb 26 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 16:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 16:01 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-005006-CTLCardinality-00
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-01
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-02
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-03
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-04
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-05
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-06
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-07
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-08
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-09
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-10
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-11
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-12
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-13
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-14
FORMULA_NAME RefineWMG-PT-005006-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679169965887

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-005006
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:06:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 20:06:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:06:07] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-18 20:06:07] [INFO ] Transformed 29 places.
[2023-03-18 20:06:07] [INFO ] Transformed 23 transitions.
[2023-03-18 20:06:07] [INFO ] Parsed PT model containing 29 places and 23 transitions and 68 arcs in 81 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Support contains 28 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 9 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:06:07] [INFO ] Computed 12 place invariants in 8 ms
[2023-03-18 20:06:07] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
[2023-03-18 20:06:07] [INFO ] Invariant cache hit.
[2023-03-18 20:06:07] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-18 20:06:07] [INFO ] Invariant cache hit.
[2023-03-18 20:06:07] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-18 20:06:07] [INFO ] Invariant cache hit.
[2023-03-18 20:06:07] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 29/29 places, 23/23 transitions.
Support contains 28 out of 29 places after structural reductions.
[2023-03-18 20:06:08] [INFO ] Flatten gal took : 34 ms
[2023-03-18 20:06:08] [INFO ] Flatten gal took : 6 ms
[2023-03-18 20:06:08] [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 77) seen :63
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-18 20:06:08] [INFO ] Invariant cache hit.
[2023-03-18 20:06:08] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-18 20:06:08] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:9
[2023-03-18 20:06:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-18 20:06:08] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :0
Fused 12 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
FORMULA RefineWMG-PT-005006-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:06:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 5 ms
FORMULA RefineWMG-PT-005006-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:06:09] [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 2 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:06:09] [INFO ] Invariant cache hit.
[2023-03-18 20:06:09] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:09] [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 15 edges and 29 vertex of which 10 / 29 are part of one of the 5 SCC in 2 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 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 20 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 20 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 8 transition count 8
Applied a total of 22 rules in 10 ms. Remains 8 /29 variables (removed 21) and now considering 8/23 (removed 15) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-18 20:06:09] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-18 20:06:09] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 8/29 places, 8/23 transitions.
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:09] [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 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:06:09] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-18 20:06:09] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:09] [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 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 16 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 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:06:09] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-18 20:06:09] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 10/29 places, 8/23 transitions.
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:09] [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 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:06:09] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-18 20:06:09] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:09] [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:06:09] [INFO ] Invariant cache hit.
[2023-03-18 20:06:09] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:09] [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:06:09] [INFO ] Invariant cache hit.
[2023-03-18 20:06:09] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:06:09] [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:06:09] [INFO ] Invariant cache hit.
[2023-03-18 20:06:09] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:09] [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:06:09] [INFO ] Invariant cache hit.
[2023-03-18 20:06:09] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:09] [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:06:09] [INFO ] Invariant cache hit.
[2023-03-18 20:06:09] [INFO ] Dead Transitions using invariants and state equation in 32 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:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:09] [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 1 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 4 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:06:09] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:06:09] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 7/29 places, 6/23 transitions.
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:06:09] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
FORMULA RefineWMG-PT-005006-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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:06:09] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-18 20:06:09] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:09] [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:06:09] [INFO ] Invariant cache hit.
[2023-03-18 20:06:09] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:09] [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 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 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 11 transition count 7
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 23 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 23 place count 8 transition count 6
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 2 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:06:09] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:06:09] [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 25 ms. Remains : 7/29 places, 6/23 transitions.
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:06:09] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:06:09] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:09] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2023-03-18 20:06:09] [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 2352 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.694sec


RS generation: 0m 0.019sec


-> reachability set: #nodes 584 (5.8e+02) #states 2,908,365,163,704 (12)



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

checking: AG [AF [2<=p6]]
normalized: ~ [E [true U EG [~ [2<=p6]]]]

abstracting: (2<=p6)
states: 2,077,403,688,360 (12)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RefineWMG-PT-005006-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: EF [[EG [AG [1<=p19]] & p9<=1]]
normalized: E [true U [EG [~ [E [true U ~ [1<=p19]]]] & p9<=1]]

abstracting: (p9<=1)
states: 2,125,343,773,476 (12)
abstracting: (1<=p19)
states: 1,566,042,780,456 (12)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RefineWMG-PT-005006-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EX [EF [AX [~ [p10<=p15]]]]
normalized: EX [E [true U ~ [EX [p10<=p15]]]]

abstracting: (p10<=p15)
states: 1,661,922,950,688 (12)
..-> the formula is TRUE

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

MC time: 0m 0.025sec

checking: AF [[EF [[5<=p26 & 6<=p20]] & ~ [3<=p3]]]
normalized: ~ [EG [~ [[~ [3<=p3] & E [true U [5<=p26 & 6<=p20]]]]]]

abstracting: (6<=p20)
states: 415,480,737,672 (11)
abstracting: (5<=p26)
states: 830,961,475,344 (11)
abstracting: (3<=p3)
states: 1,454,182,581,852 (12)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.042sec

checking: E [EG [AF [p23<=2]] U [~ [5<=p6] & ~ [AX [AF [4<=p13]]]]]
normalized: E [EG [~ [EG [~ [p23<=2]]]] U [EX [EG [~ [4<=p13]]] & ~ [5<=p6]]]

abstracting: (5<=p6)
states: 830,961,475,344 (11)
abstracting: (4<=p13)
states: 1,246,442,213,016 (12)
.
EG iterations: 1
.abstracting: (p23<=2)
states: 1,246,442,213,016 (12)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.021sec

checking: EF [EX [AX [[~ [7<=p12] & ~ [p5<=p26]]]]]
normalized: E [true U EX [~ [EX [~ [[~ [p5<=p26] & ~ [7<=p12]]]]]]]

abstracting: (7<=p12)
states: 0
abstracting: (p5<=p26)
states: 1,661,922,950,688 (12)
..-> the formula is TRUE

FORMULA RefineWMG-PT-005006-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.099sec

checking: EX [[EG [AX [[p23<=1 & A [p8<=5 U p2<=3]]]] & AG [~ [6<=p4]]]]
normalized: EX [[~ [E [true U 6<=p4]] & EG [~ [EX [~ [[p23<=1 & [~ [EG [~ [p2<=3]]] & ~ [E [~ [p2<=3] U [~ [p8<=5] & ~ [p2<=3]]]]]]]]]]]]

abstracting: (p2<=3)
states: 1,938,910,109,136 (12)
abstracting: (p8<=5)
states: 2,492,884,426,032 (12)
abstracting: (p2<=3)
states: 1,938,910,109,136 (12)
abstracting: (p2<=3)
states: 1,938,910,109,136 (12)
.
EG iterations: 1
abstracting: (p23<=1)
states: 830,961,475,344 (11)
..
EG iterations: 1
abstracting: (6<=p4)
states: 11,863,960,458 (10)
.-> the formula is FALSE

FORMULA RefineWMG-PT-005006-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EF [[AG [[EF [[3<=p12 | p1<=p11]] | AF [~ [p2<=p27]]]] & AX [1<=0]]]
normalized: E [true U [~ [EX [~ [1<=0]]] & ~ [E [true U ~ [[~ [EG [p2<=p27]] | E [true U [3<=p12 | p1<=p11]]]]]]]]

abstracting: (p1<=p11)
states: 2,492,884,426,032 (12)
abstracting: (3<=p12)
states: 1,661,922,950,688 (12)
abstracting: (p2<=p27)
states: 1,869,663,319,524 (12)
.
EG iterations: 1
abstracting: (1<=0)
states: 0
.-> the formula is FALSE

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

MC time: 0m 0.028sec

checking: AG [[A [AX [[p15<=2 | [7<=p21 | 1<=p21]]] U [~ [AX [p26<=p9]] | [~ [[3<=p18 | p26<=1]] & EF [p19<=p4]]]] | p12<=4]]
normalized: ~ [E [true U ~ [[p12<=4 | [~ [EG [~ [[[E [true U p19<=p4] & ~ [[3<=p18 | p26<=1]]] | EX [~ [p26<=p9]]]]]] & ~ [E [~ [[[E [true U p19<=p4] & ~ [[3<=p18 | p26<=1]]] | EX [~ [p26<=p9]]]] U [EX [~ [[p15<=2 | [7<=p21 | 1<=p21]]]] & ~ [[[E [true U p19<=p4] & ~ [[3<=p18 | p26<=1]]] | EX [~ [p26<=p9]]]]]]]]]]]]

abstracting: (p26<=p9)
states: 830,719,353,702 (11)
.abstracting: (p26<=1)
states: 830,961,475,344 (11)
abstracting: (3<=p18)
states: 1,661,922,950,688 (12)
abstracting: (p19<=p4)
states: 1,874,505,752,364 (12)
abstracting: (1<=p21)
states: 2,492,884,426,032 (12)
abstracting: (7<=p21)
states: 0
abstracting: (p15<=2)
states: 1,246,442,213,016 (12)
.abstracting: (p26<=p9)
states: 830,719,353,702 (11)
.abstracting: (p26<=1)
states: 830,961,475,344 (11)
abstracting: (3<=p18)
states: 1,661,922,950,688 (12)
abstracting: (p19<=p4)
states: 1,874,505,752,364 (12)
abstracting: (p26<=p9)
states: 830,719,353,702 (11)
.abstracting: (p26<=1)
states: 830,961,475,344 (11)
abstracting: (3<=p18)
states: 1,661,922,950,688 (12)
abstracting: (p19<=p4)
states: 1,874,505,752,364 (12)
.
EG iterations: 1
abstracting: (p12<=4)
states: 2,077,403,688,360 (12)
-> the formula is FALSE

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

MC time: 0m 0.159sec

checking: A [[p9<=4 & [AF [AG [5<=p3]] | AF [E [[p8<=3 | p3<=0] U ~ [p26<=p20]]]]] U AX [AG [[~ [AG [6<=p26]] | A [p26<=p24 U p27<=p5]]]]]
normalized: [~ [EG [EX [E [true U ~ [[[~ [EG [~ [p27<=p5]]] & ~ [E [~ [p27<=p5] U [~ [p26<=p24] & ~ [p27<=p5]]]]] | E [true U ~ [6<=p26]]]]]]]] & ~ [E [EX [E [true U ~ [[[~ [EG [~ [p27<=p5]]] & ~ [E [~ [p27<=p5] U [~ [p26<=p24] & ~ [p27<=p5]]]]] | E [true U ~ [6<=p26]]]]]] U [~ [[p9<=4 & [~ [EG [~ [E [[p8<=3 | p3<=0] U ~ [p26<=p20]]]]] | ~ [EG [E [true U ~ [5<=p3]]]]]]] & EX [E [true U ~ [[[~ [EG [~ [p27<=p5]]] & ~ [E [~ [p27<=p5] U [~ [p26<=p24] & ~ [p27<=p5]]]]] | E [true U ~ [6<=p26]]]]]]]]]]

abstracting: (6<=p26)
states: 415,480,737,672 (11)
abstracting: (p27<=p5)
states: 1,661,922,950,688 (12)
abstracting: (p26<=p24)
states: 830,719,353,702 (11)
abstracting: (p27<=p5)
states: 1,661,922,950,688 (12)
abstracting: (p27<=p5)
states: 1,661,922,950,688 (12)
.
EG iterations: 1
.abstracting: (5<=p3)
states: 484,727,527,284 (11)

EG iterations: 0
abstracting: (p26<=p20)
states: 1,661,922,950,688 (12)
abstracting: (p3<=0)
states: 484,727,527,284 (11)
abstracting: (p8<=3)
states: 1,661,922,950,688 (12)
.
EG iterations: 1
abstracting: (p9<=4)
states: 2,860,909,321,872 (12)
abstracting: (6<=p26)
states: 415,480,737,672 (11)
abstracting: (p27<=p5)
states: 1,661,922,950,688 (12)
abstracting: (p26<=p24)
states: 830,719,353,702 (11)
abstracting: (p27<=p5)
states: 1,661,922,950,688 (12)
abstracting: (p27<=p5)
states: 1,661,922,950,688 (12)
.
EG iterations: 1
.abstracting: (6<=p26)
states: 415,480,737,672 (11)
abstracting: (p27<=p5)
states: 1,661,922,950,688 (12)
abstracting: (p26<=p24)
states: 830,719,353,702 (11)
abstracting: (p27<=p5)
states: 1,661,922,950,688 (12)
abstracting: (p27<=p5)
states: 1,661,922,950,688 (12)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.060sec

checking: AG [[EX [~ [A [p15<=p1 U 4<=p10]]] | [AF [[~ [4<=p12] | ~ [p10<=1]]] | [EX [~ [p7<=p8]] & [[3<=p16 | p23<=p21] & [~ [p4<=7] | ~ [p7<=3]]]]]]]
normalized: ~ [E [true U ~ [[[[[[~ [p7<=3] | ~ [p4<=7]] & [3<=p16 | p23<=p21]] & EX [~ [p7<=p8]]] | ~ [EG [~ [[~ [p10<=1] | ~ [4<=p12]]]]]] | EX [~ [[~ [EG [~ [4<=p10]]] & ~ [E [~ [4<=p10] U [~ [p15<=p1] & ~ [4<=p10]]]]]]]]]]]

abstracting: (4<=p10)
states: 1,246,442,213,016 (12)
abstracting: (p15<=p1)
states: 830,719,353,702 (11)
abstracting: (4<=p10)
states: 1,246,442,213,016 (12)
abstracting: (4<=p10)
states: 1,246,442,213,016 (12)
.
EG iterations: 1
.abstracting: (4<=p12)
states: 1,246,442,213,016 (12)
abstracting: (p10<=1)
states: 830,961,475,344 (11)
.
EG iterations: 1
abstracting: (p7<=p8)
states: 1,661,922,950,688 (12)
.abstracting: (p23<=p21)
states: 1,661,922,950,688 (12)
abstracting: (3<=p16)
states: 1,661,922,950,688 (12)
abstracting: (p4<=7)
states: 2,908,365,163,704 (12)
abstracting: (p7<=3)
states: 1,661,922,950,688 (12)
-> the formula is TRUE

FORMULA RefineWMG-PT-005006-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: [EF [[EX [EX [p4<=p20]] | p24<=4]] & [EF [[[[3<=p13 | p0<=p13] & E [p3<=p21 U p4<=p20]] | EX [AG [~ [p25<=p7]]]]] & AG [[AG [[2<=p18 & 1<=p21]] | [AX [~ [p28<=3]] | 1<=p6]]]]]
normalized: [[~ [E [true U ~ [[[1<=p6 | ~ [EX [p28<=3]]] | ~ [E [true U ~ [[2<=p18 & 1<=p21]]]]]]]] & E [true U [EX [~ [E [true U p25<=p7]]] | [E [p3<=p21 U p4<=p20] & [3<=p13 | p0<=p13]]]]] & E [true U [p24<=4 | EX [EX [p4<=p20]]]]]

abstracting: (p4<=p20)
states: 2,492,884,426,032 (12)
..abstracting: (p24<=4)
states: 2,860,909,321,872 (12)
abstracting: (p0<=p13)
states: 2,492,884,426,032 (12)
abstracting: (3<=p13)
states: 1,661,922,950,688 (12)
abstracting: (p4<=p20)
states: 2,492,884,426,032 (12)
abstracting: (p3<=p21)
states: 1,869,663,319,524 (12)
abstracting: (p25<=p7)
states: 1,661,922,950,688 (12)
.abstracting: (1<=p21)
states: 2,492,884,426,032 (12)
abstracting: (2<=p18)
states: 2,077,403,688,360 (12)
abstracting: (p28<=3)
states: 1,661,922,950,688 (12)
.abstracting: (1<=p6)
states: 2,492,884,426,032 (12)
-> the formula is FALSE

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

MC time: 0m 0.114sec

checking: AF [EX [[A [A [2<=p1 U p2<=3] U AX [p13<=p9]] | [[AF [p13<=p19] & [AG [p24<=4] & [~ [A [p3<=p15 U p17<=p23]] | EF [~ [1<=p25]]]]] | [AF [1<=p5] & [[2<=p26 | 1<=p26] & [AX [4<=p27] | EX [p20<=2]]]]]]]]
normalized: ~ [EG [~ [EX [[[[[[EX [p20<=2] | ~ [EX [~ [4<=p27]]]] & [2<=p26 | 1<=p26]] & ~ [EG [~ [1<=p5]]]] | [[[E [true U ~ [1<=p25]] | ~ [[~ [EG [~ [p17<=p23]]] & ~ [E [~ [p17<=p23] U [~ [p3<=p15] & ~ [p17<=p23]]]]]]] & ~ [E [true U ~ [p24<=4]]]] & ~ [EG [~ [p13<=p19]]]]] | [~ [EG [EX [~ [p13<=p9]]]] & ~ [E [EX [~ [p13<=p9]] U [~ [[~ [EG [~ [p2<=3]]] & ~ [E [~ [p2<=3] U [~ [2<=p1] & ~ [p2<=3]]]]]] & EX [~ [p13<=p9]]]]]]]]]]]

abstracting: (p13<=p9)
states: 830,719,353,702 (11)
.abstracting: (p2<=3)
states: 1,938,910,109,136 (12)
abstracting: (2<=p1)
states: 783,021,390,228 (11)
abstracting: (p2<=3)
states: 1,938,910,109,136 (12)
abstracting: (p2<=3)
states: 1,938,910,109,136 (12)
.
EG iterations: 1
abstracting: (p13<=p9)
states: 830,719,353,702 (11)
.abstracting: (p13<=p9)
states: 830,719,353,702 (11)
..
EG iterations: 1
abstracting: (p13<=p19)
states: 830,719,353,702 (11)
.
EG iterations: 1
abstracting: (p24<=4)
states: 2,860,909,321,872 (12)
abstracting: (p17<=p23)
states: 1,661,922,950,688 (12)
abstracting: (p3<=p15)
states: 1,869,663,319,524 (12)
abstracting: (p17<=p23)
states: 1,661,922,950,688 (12)
abstracting: (p17<=p23)
states: 1,661,922,950,688 (12)
.
EG iterations: 1
abstracting: (1<=p25)
states: 2,492,884,426,032 (12)
abstracting: (1<=p5)
states: 2,492,884,426,032 (12)
.
EG iterations: 1
abstracting: (1<=p26)
states: 2,492,884,426,032 (12)
abstracting: (2<=p26)
states: 2,077,403,688,360 (12)
abstracting: (4<=p27)
states: 1,246,442,213,016 (12)
.abstracting: (p20<=2)
states: 1,246,442,213,016 (12)
...
EG iterations: 1
-> the formula is FALSE

FORMULA RefineWMG-PT-005006-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.102sec

totally nodes used: 487367 (4.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1697764 1600402 3298166
used/not used/entry size/cache size: 2002582 65106282 16 1024MB
basic ops cache: hits/miss/sum: 624218 596894 1221112
used/not used/entry size/cache size: 1018553 15758663 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: 28490 29120 57610
used/not used/entry size/cache size: 29083 8359525 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 66640276
1 461585
2 4763
3 953
4 291
5 300
6 80
7 174
8 54
9 133
>= 10 255

Total processing time: 0m 5.102sec


BK_STOP 1679169975799

--------------------
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:1830 (79), effective:681 (29)

initing FirstDep: 0m 0.000sec


iterations count:471 (20), effective:150 (6)

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

iterations count:162 (7), effective:54 (2)

iterations count:740 (32), effective:265 (11)

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

iterations count:552 (24), effective:194 (8)

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

iterations count:261 (11), effective:96 (4)

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

iterations count:91 (3), effective:30 (1)

iterations count:91 (3), effective:30 (1)

iterations count:692 (30), effective:243 (10)

iterations count:91 (3), effective:30 (1)

iterations count:610 (26), effective:221 (9)

iterations count:194 (8), effective:65 (2)

iterations count:80 (3), effective:22 (0)

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

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

iterations count:194 (8), effective:65 (2)

iterations count:80 (3), effective:22 (0)

iterations count:194 (8), effective:65 (2)

iterations count:80 (3), effective:22 (0)

iterations count:288 (12), effective:99 (4)

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

iterations count:228 (9), effective:69 (3)

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

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

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

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

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

iterations count:233 (10), effective:79 (3)

iterations count:663 (28), effective:243 (10)

iterations count:271 (11), effective:97 (4)

iterations count:29 (1), effective:6 (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-005006"
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-005006, 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-167889203400553"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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