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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 10:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 10:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 10:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000000001-CTLCardinality-00
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-01
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-02
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-03
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-04
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-05
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-06
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-07
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-08
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-09
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-10
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-11
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-12
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-13
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-14
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678638582795

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=GPPP-PT-C0001N0000000001
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 16:29:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:29:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:29:44] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-12 16:29:44] [INFO ] Transformed 33 places.
[2023-03-12 16:29:44] [INFO ] Transformed 22 transitions.
[2023-03-12 16:29:44] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 79 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 16:29:44] [INFO ] Computed 13 place invariants in 12 ms
[2023-03-12 16:29:44] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
[2023-03-12 16:29:44] [INFO ] Invariant cache hit.
[2023-03-12 16:29:44] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-12 16:29:44] [INFO ] Invariant cache hit.
[2023-03-12 16:29:44] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-12 16:29:44] [INFO ] Invariant cache hit.
[2023-03-12 16:29:44] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 345 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 33 out of 33 places after structural reductions.
[2023-03-12 16:29:45] [INFO ] Flatten gal took : 17 ms
[2023-03-12 16:29:45] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:29:45] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 518 ms. (steps per millisecond=19 ) properties (out of 79) seen :44
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 34) 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 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) 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 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 34) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 33) seen :0
Running SMT prover for 33 properties.
[2023-03-12 16:29:45] [INFO ] Invariant cache hit.
[2023-03-12 16:29:46] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 16:29:46] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-12 16:29:46] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:29
[2023-03-12 16:29:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 16:29:46] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-12 16:29:46] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :33 sat :0
Fused 33 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 33 atomic propositions for a total of 15 simplifications.
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 16:29:46] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:29:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-12 16:29:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:46] [INFO ] Input system was already deterministic with 22 transitions.
Support contains 15 out of 33 places (down from 29) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 16:29:46] [INFO ] Invariant cache hit.
[2023-03-12 16:29:46] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:29:46] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 16:29:46] [INFO ] Invariant cache hit.
[2023-03-12 16:29:46] [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 : 33/33 places, 22/22 transitions.
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:29:46] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 16:29:46] [INFO ] Invariant cache hit.
[2023-03-12 16:29:46] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:46] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
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 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Applied a total of 13 rules in 13 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-12 16:29:46] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:29:46] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 25/33 places, 16/22 transitions.
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:46] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 16:29:46] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-12 16:29:46] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:29:46] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 16:29:46] [INFO ] Invariant cache hit.
[2023-03-12 16:29:46] [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 : 33/33 places, 22/22 transitions.
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:46] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
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 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
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 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 17
Applied a total of 12 rules in 7 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 16:29:46] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-12 16:29:46] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 26/33 places, 17/22 transitions.
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:29:46] [INFO ] Input system was already deterministic with 17 transitions.
Finished random walk after 1396 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=698 )
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 16:29:46] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-12 16:29:46] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:46] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:46] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:29:46] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-12 16:29:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 22 transitions and 83 arcs took 1 ms.
Total runtime 2456 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: 33 NrTr: 22 NrArc: 83)

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

net check time: 0m 0.000sec

init dd package: 0m 2.708sec


RS generation: 0m 0.004sec


-> reachability set: #nodes 561 (5.6e+02) #states 10,380 (4)



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

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

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

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [AX [EF [AG [[p4<=4 & p23<=1]]]]]
normalized: EG [~ [EX [~ [E [true U ~ [E [true U ~ [[p4<=4 & p23<=1]]]]]]]]]

abstracting: (p23<=1)
states: 9,888 (3)
abstracting: (p4<=4)
states: 10,380 (4)
..
EG iterations: 1
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AX [[~ [p15<=0] | EX [~ [p15<=0]]]]
normalized: ~ [EX [~ [[EX [~ [p15<=0]] | ~ [p15<=0]]]]]

abstracting: (p15<=0)
states: 9,144 (3)
abstracting: (p15<=0)
states: 9,144 (3)
..-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[AX [AX [~ [p28<=p11]]] & AG [EF [3<=p8]]]]
normalized: E [true U [~ [E [true U ~ [E [true U 3<=p8]]]] & ~ [EX [EX [p28<=p11]]]]]

abstracting: (p28<=p11)
states: 7,734 (3)
..abstracting: (3<=p8)
states: 6
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [AG [[~ [p0<=7] | [~ [p8<=p30] | p30<=0]]]]
normalized: E [true U ~ [E [true U ~ [[[p30<=0 | ~ [p8<=p30]] | ~ [p0<=7]]]]]]

abstracting: (p0<=7)
states: 10,380 (4)
abstracting: (p8<=p30)
states: 10,272 (4)
abstracting: (p30<=0)
states: 6,804 (3)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [A [[~ [EG [p12<=p32]] | AG [EX [AF [p30<=p24]]]] U EG [[~ [[AF [2<=p7] | [p23<=p8 & p4<=p6]]] | p28<=2]]] & [AF [2<=p8] | AG [EX [E [EF [p28<=p10] U EG [p24<=p17]]]]]]
normalized: [[~ [E [true U ~ [EX [E [E [true U p28<=p10] U EG [p24<=p17]]]]]] | ~ [EG [~ [2<=p8]]]] & [~ [EG [~ [EG [[p28<=2 | ~ [[[p23<=p8 & p4<=p6] | ~ [EG [~ [2<=p7]]]]]]]]]] & ~ [E [~ [EG [[p28<=2 | ~ [[[p23<=p8 & p4<=p6] | ~ [EG [~ [2<=p7]]]]]]]] U [~ [[~ [E [true U ~ [EX [~ [EG [~ [p30<=p24]]]]]]] | ~ [EG [p12<=p32]]]] & ~ [EG [[p28<=2 | ~ [[[p23<=p8 & p4<=p6] | ~ [EG [~ [2<=p7]]]]]]]]]]]]]

abstracting: (2<=p7)
states: 5,190 (3)
.............
EG iterations: 13
abstracting: (p4<=p6)
states: 5,190 (3)
abstracting: (p23<=p8)
states: 7,512 (3)
abstracting: (p28<=2)
states: 10,284 (4)
.......
EG iterations: 7
abstracting: (p12<=p32)
states: 10,212 (4)
..........................................
EG iterations: 42
abstracting: (p30<=p24)
states: 6,804 (3)
.......................
EG iterations: 23
.abstracting: (2<=p7)
states: 5,190 (3)
.............
EG iterations: 13
abstracting: (p4<=p6)
states: 5,190 (3)
abstracting: (p23<=p8)
states: 7,512 (3)
abstracting: (p28<=2)
states: 10,284 (4)
.......
EG iterations: 7
abstracting: (2<=p7)
states: 5,190 (3)
.............
EG iterations: 13
abstracting: (p4<=p6)
states: 5,190 (3)
abstracting: (p23<=p8)
states: 7,512 (3)
abstracting: (p28<=2)
states: 10,284 (4)
.......
EG iterations: 7
........
EG iterations: 8
abstracting: (2<=p8)
states: 48
.
EG iterations: 1
abstracting: (p24<=p17)
states: 10,374 (4)
.................
EG iterations: 17
abstracting: (p28<=p10)
states: 7,746 (3)
.-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

totally nodes used: 35778 (3.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 65653 105796 171449
used/not used/entry size/cache size: 141168 66967696 16 1024MB
basic ops cache: hits/miss/sum: 10224 22258 32482
used/not used/entry size/cache size: 43281 16733935 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: 709 1457 2166
used/not used/entry size/cache size: 1457 8387151 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 67076939
1 30730
2 869
3 135
4 65
5 16
6 23
7 9
8 6
9 2
>= 10 70

Total processing time: 0m 4.354sec


BK_STOP 1678638592039

--------------------
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:446 (20), effective:99 (4)

initing FirstDep: 0m 0.000sec


iterations count:287 (13), effective:61 (2)

iterations count:478 (21), effective:115 (5)

iterations count:608 (27), effective:157 (7)

iterations count:298 (13), effective:72 (3)

iterations count:338 (15), effective:81 (3)

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

iterations count:54 (2), effective:12 (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="GPPP-PT-C0001N0000000001"
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 GPPP-PT-C0001N0000000001, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857700769"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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