About the Execution of Marcie+red for RefineWMG-PT-010010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6177.415 | 24173.00 | 29638.00 | 336.40 | TFFTFTTTTTFFTTFF | normal |
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-167889203400577.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-010010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203400577
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 7.1K Feb 26 16:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 16:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 16:02 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 9.2K Feb 26 16:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 16:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 16:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 16:04 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 24K 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-010010-CTLCardinality-00
FORMULA_NAME RefineWMG-PT-010010-CTLCardinality-01
FORMULA_NAME RefineWMG-PT-010010-CTLCardinality-02
FORMULA_NAME RefineWMG-PT-010010-CTLCardinality-03
FORMULA_NAME RefineWMG-PT-010010-CTLCardinality-04
FORMULA_NAME RefineWMG-PT-010010-CTLCardinality-05
FORMULA_NAME RefineWMG-PT-010010-CTLCardinality-06
FORMULA_NAME RefineWMG-PT-010010-CTLCardinality-07
FORMULA_NAME RefineWMG-PT-010010-CTLCardinality-08
FORMULA_NAME RefineWMG-PT-010010-CTLCardinality-09
FORMULA_NAME RefineWMG-PT-010010-CTLCardinality-10
FORMULA_NAME RefineWMG-PT-010010-CTLCardinality-11
FORMULA_NAME RefineWMG-PT-010010-CTLCardinality-12
FORMULA_NAME RefineWMG-PT-010010-CTLCardinality-13
FORMULA_NAME RefineWMG-PT-010010-CTLCardinality-14
FORMULA_NAME RefineWMG-PT-010010-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679170122334
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-010010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:08:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 20:08:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:08:44] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2023-03-18 20:08:44] [INFO ] Transformed 54 places.
[2023-03-18 20:08:44] [INFO ] Transformed 43 transitions.
[2023-03-18 20:08:44] [INFO ] Parsed PT model containing 54 places and 43 transitions and 128 arcs in 87 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Support contains 51 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 10 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2023-03-18 20:08:44] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-18 20:08:44] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
[2023-03-18 20:08:44] [INFO ] Invariant cache hit.
[2023-03-18 20:08:44] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-18 20:08:44] [INFO ] Invariant cache hit.
[2023-03-18 20:08:44] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-18 20:08:44] [INFO ] Invariant cache hit.
[2023-03-18 20:08:44] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 348 ms. Remains : 54/54 places, 43/43 transitions.
Support contains 51 out of 54 places after structural reductions.
[2023-03-18 20:08:44] [INFO ] Flatten gal took : 19 ms
[2023-03-18 20:08:44] [INFO ] Flatten gal took : 6 ms
[2023-03-18 20:08:44] [INFO ] Input system was already deterministic with 43 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 87) seen :61
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) seen :0
Running SMT prover for 26 properties.
[2023-03-18 20:08:44] [INFO ] Invariant cache hit.
[2023-03-18 20:08:45] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-18 20:08:45] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:25
[2023-03-18 20:08:45] [INFO ] [Nat]Absence check using 22 positive place invariants in 2 ms returned sat
[2023-03-18 20:08:45] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :14
[2023-03-18 20:08:45] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :14
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-18 20:08:45] [INFO ] After 362ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :14
Fused 26 Parikh solutions to 14 different solutions.
Finished Parikh walk after 149 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=74 )
Parikh walk visited 14 properties in 71 ms.
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
FORMULA RefineWMG-PT-010010-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:08:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 20:08:45] [INFO ] Flatten gal took : 6 ms
FORMULA RefineWMG-PT-010010-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:08:45] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:08:45] [INFO ] Input system was already deterministic with 43 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:08:45] [INFO ] Invariant cache hit.
[2023-03-18 20:08:45] [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 : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:45] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:08:45] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:45] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 14 edges and 54 vertex of which 8 / 54 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 46 transition count 36
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 22 place count 34 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 22 place count 34 transition count 29
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 24 place count 33 transition count 29
Applied a total of 24 rules in 11 ms. Remains 33 /54 variables (removed 21) and now considering 29/43 (removed 14) transitions.
// Phase 1: matrix 29 rows 33 cols
[2023-03-18 20:08:45] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-18 20:08:45] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 33/54 places, 29/43 transitions.
[2023-03-18 20:08:45] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:45] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:45] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 25 edges and 54 vertex of which 18 / 54 are part of one of the 9 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 36 transition count 26
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 30 place count 22 transition count 19
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 34 place count 22 transition count 15
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 18 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 38 place count 18 transition count 14
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 40 place count 17 transition count 14
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 42 place count 16 transition count 13
Applied a total of 42 rules in 9 ms. Remains 16 /54 variables (removed 38) and now considering 13/43 (removed 30) transitions.
// Phase 1: matrix 13 rows 16 cols
[2023-03-18 20:08:45] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-18 20:08:45] [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 36 ms. Remains : 16/54 places, 13/43 transitions.
[2023-03-18 20:08:45] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:45] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:08:45] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2023-03-18 20:08:45] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-18 20:08:45] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:45] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:45] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:45] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:08:45] [INFO ] Invariant cache hit.
[2023-03-18 20:08:45] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:45] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:45] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:45] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:08:45] [INFO ] Invariant cache hit.
[2023-03-18 20:08:45] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:45] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:45] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:45] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 0 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:08:45] [INFO ] Invariant cache hit.
[2023-03-18 20:08:45] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:45] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:45] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:45] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:08:45] [INFO ] Invariant cache hit.
[2023-03-18 20:08:45] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:45] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:45] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:45] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 25 edges and 54 vertex of which 16 / 54 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 38 transition count 28
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 35 place count 20 transition count 19
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 38 place count 20 transition count 16
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 17 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 41 place count 17 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 15 transition count 14
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 47 place count 14 transition count 13
Applied a total of 47 rules in 6 ms. Remains 14 /54 variables (removed 40) and now considering 13/43 (removed 30) transitions.
// Phase 1: matrix 13 rows 14 cols
[2023-03-18 20:08:45] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 20:08:46] [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 27 ms. Remains : 14/54 places, 13/43 transitions.
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:08:46] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2023-03-18 20:08:46] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-18 20:08:46] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:46] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 28 edges and 54 vertex of which 18 / 54 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 36 transition count 26
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 39 place count 16 transition count 16
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 7 rules applied. Total rules applied 46 place count 16 transition count 9
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 53 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 53 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 3 with 2 rules applied. Total rules applied 55 place count 8 transition count 8
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 57 place count 7 transition count 7
Applied a total of 57 rules in 5 ms. Remains 7 /54 variables (removed 47) and now considering 7/43 (removed 36) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-18 20:08:46] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:08:46] [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 24 ms. Remains : 7/54 places, 7/43 transitions.
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:08:46] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
FORMULA RefineWMG-PT-010010-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2023-03-18 20:08:46] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-18 20:08: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 : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:46] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:08:46] [INFO ] Invariant cache hit.
[2023-03-18 20:08:46] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:46] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:08:46] [INFO ] Invariant cache hit.
[2023-03-18 20:08:46] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:46] [INFO ] Input system was already deterministic with 43 transitions.
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:46] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-18 20:08:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 43 transitions and 128 arcs took 0 ms.
Total runtime 2291 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: 54 NrTr: 43 NrArc: 128)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.765sec
RS generation: 0m 0.106sec
-> reachability set: #nodes 1848 (1.8e+03) #states 128,457,575,032,402,738,396,875,744 (26)
starting MCC model checker
--------------------------
checking: EX [AG [EX [0<=0]]]
normalized: EX [~ [E [true U ~ [EX [0<=0]]]]]
abstracting: (0<=0)
states: 128,457,575,032,402,738,396,875,744 (26)
..-> the formula is TRUE
FORMULA RefineWMG-PT-010010-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: AF [[AG [EF [~ [7<=p21]]] & EF [AX [p25<=9]]]]
normalized: ~ [EG [~ [[E [true U ~ [EX [~ [p25<=9]]]] & ~ [E [true U ~ [E [true U ~ [7<=p21]]]]]]]]]
abstracting: (7<=p21)
states: 46,711,845,466,328,268,507,954,816 (25)
abstracting: (p25<=9)
states: 116,779,613,665,820,671,269,887,040 (26)
..
EG iterations: 1
-> the formula is TRUE
FORMULA RefineWMG-PT-010010-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.217sec
checking: EX [E [p47<=3 U EF [~ [A [p22<=6 U 1<=p41]]]]]
normalized: EX [E [p47<=3 U E [true U ~ [[~ [EG [~ [1<=p41]]] & ~ [E [~ [1<=p41] U [~ [p22<=6] & ~ [1<=p41]]]]]]]]]
abstracting: (1<=p41)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (p22<=6)
states: 81,745,729,566,074,469,888,920,928 (25)
abstracting: (1<=p41)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p41)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
abstracting: (p47<=3)
states: 46,711,845,466,328,268,507,954,816 (25)
.-> the formula is TRUE
FORMULA RefineWMG-PT-010010-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.478sec
checking: EG [E [EG [3<=p51] U ~ [A [9<=p33 U EG [p45<=p26]]]]]
normalized: EG [E [EG [3<=p51] U ~ [[~ [EG [~ [EG [p45<=p26]]]] & ~ [E [~ [EG [p45<=p26]] U [~ [9<=p33] & ~ [EG [p45<=p26]]]]]]]]]
abstracting: (p45<=p26)
states: 70,067,768,199,492,402,761,932,224 (25)
.
EG iterations: 1
abstracting: (9<=p33)
states: 23,355,922,733,164,134,253,977,408 (25)
abstracting: (p45<=p26)
states: 70,067,768,199,492,402,761,932,224 (25)
.
EG iterations: 1
abstracting: (p45<=p26)
states: 70,067,768,199,492,402,761,932,224 (25)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (3<=p51)
states: 93,423,690,932,656,537,015,909,632 (25)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA RefineWMG-PT-010010-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.065sec
checking: [AF [EX [AG [[~ [p51<=9] & ~ [p20<=1]]]]] | E [0<=0 U ~ [p29<=p52]]]
normalized: [~ [EG [~ [EX [~ [E [true U ~ [[~ [p20<=1] & ~ [p51<=9]]]]]]]]] | E [0<=0 U ~ [p29<=p52]]]
abstracting: (p29<=p52)
states: 121,645,430,901,896,532,572,799,000 (26)
abstracting: (0<=0)
states: 128,457,575,032,402,738,396,875,744 (26)
abstracting: (p51<=9)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (p20<=1)
states: 23,355,922,733,164,134,253,977,408 (25)
.
EG iterations: 0
-> the formula is TRUE
FORMULA RefineWMG-PT-010010-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.158sec
checking: EG [A [[~ [p28<=p37] & p20<=p39] U AG [~ [4<=p20]]]]
normalized: EG [[~ [EG [E [true U 4<=p20]]] & ~ [E [E [true U 4<=p20] U [~ [[p20<=p39 & ~ [p28<=p37]]] & E [true U 4<=p20]]]]]]
abstracting: (4<=p20)
states: 81,745,729,566,074,469,888,920,928 (25)
abstracting: (p28<=p37)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (p20<=p39)
states: 18,490,105,497,088,272,951,065,448 (25)
abstracting: (4<=p20)
states: 81,745,729,566,074,469,888,920,928 (25)
abstracting: (4<=p20)
states: 81,745,729,566,074,469,888,920,928 (25)
EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-010010-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.253sec
checking: [EX [[AG [~ [p31<=3]] | AX [1<=0]]] & [EX [AG [E [p3<=p9 U p30<=p23]]] & AX [AF [~ [p11<=5]]]]]
normalized: [[~ [EX [EG [p11<=5]]] & EX [~ [E [true U ~ [E [p3<=p9 U p30<=p23]]]]]] & EX [[~ [EX [~ [1<=0]]] | ~ [E [true U p31<=3]]]]]
abstracting: (p31<=3)
states: 46,711,845,466,328,268,507,954,816 (25)
abstracting: (1<=0)
states: 0
..abstracting: (p30<=p23)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (p3<=p9)
states: 33,889,780,994,727,710,463,500,375 (25)
.abstracting: (p11<=5)
states: 70,067,768,199,492,402,761,932,224 (25)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA RefineWMG-PT-010010-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.961sec
checking: EF [[AX [A [p50<=p26 U 5<=p8]] & AG [[p34<=3 | p30<=p14]]]]
normalized: E [true U [~ [E [true U ~ [[p34<=3 | p30<=p14]]]] & ~ [EX [~ [[~ [EG [~ [5<=p8]]] & ~ [E [~ [5<=p8] U [~ [p50<=p26] & ~ [5<=p8]]]]]]]]]]
abstracting: (5<=p8)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (p50<=p26)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (5<=p8)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (5<=p8)
states: 70,067,768,199,492,402,761,932,224 (25)
.
EG iterations: 1
.abstracting: (p30<=p14)
states: 18,490,105,497,088,272,951,065,448 (25)
abstracting: (p34<=3)
states: 126,988,289,043,470,027,336,780,760 (26)
-> the formula is FALSE
FORMULA RefineWMG-PT-010010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.261sec
checking: E [[AX [~ [[4<=p25 & 4<=p49]]] & ~ [E [p17<=p40 U ~ [EX [8<=p18]]]]] U 5<=p13]
normalized: E [[~ [E [p17<=p40 U ~ [EX [8<=p18]]]] & ~ [EX [[4<=p25 & 4<=p49]]]] U 5<=p13]
abstracting: (5<=p13)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (4<=p49)
states: 1,469,285,988,932,711,060,094,984 (24)
abstracting: (4<=p25)
states: 81,745,729,566,074,469,888,920,928 (25)
.abstracting: (8<=p18)
states: 35,033,884,099,746,201,380,966,112 (25)
.abstracting: (p17<=p40)
states: 70,067,768,199,492,402,761,932,224 (25)
-> the formula is FALSE
FORMULA RefineWMG-PT-010010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.394sec
checking: [E [~ [[~ [E [AX [p11<=5] U p1<=p24]] & EG [p14<=p34]]] U EX [[AX [~ [p22<=3]] | AF [AG [p36<=p52]]]]] & E [[[AF [7<=p6] & p30<=0] & [EX [p46<=1] & ~ [[~ [p30<=2] | EG [3<=p27]]]]] U AX [~ [[EF [1<=p4] & EX [0<=0]]]]]]
normalized: [E [[[~ [[EG [3<=p27] | ~ [p30<=2]]] & EX [p46<=1]] & [p30<=0 & ~ [EG [~ [7<=p6]]]]] U ~ [EX [[EX [0<=0] & E [true U 1<=p4]]]]] & E [~ [[EG [p14<=p34] & ~ [E [~ [EX [~ [p11<=5]]] U p1<=p24]]]] U EX [[~ [EG [E [true U ~ [p36<=p52]]]] | ~ [EX [p22<=3]]]]]]
abstracting: (p22<=3)
states: 46,711,845,466,328,268,507,954,816 (25)
.abstracting: (p36<=p52)
states: 70,067,768,199,492,402,761,932,224 (25)
EG iterations: 0
.abstracting: (p1<=p24)
states: 91,822,301,308,355,250,535,826,088 (25)
abstracting: (p11<=5)
states: 70,067,768,199,492,402,761,932,224 (25)
.abstracting: (p14<=p34)
states: 91,822,301,308,355,250,535,826,088 (25)
.
EG iterations: 1
abstracting: (1<=p4)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (0<=0)
states: 128,457,575,032,402,738,396,875,744 (26)
..abstracting: (7<=p6)
states: 46,711,845,466,328,268,507,954,816 (25)
.
EG iterations: 1
abstracting: (p30<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
abstracting: (p46<=1)
states: 23,355,922,733,164,134,253,977,408 (25)
.abstracting: (p30<=2)
states: 35,033,884,099,746,201,380,966,112 (25)
abstracting: (3<=p27)
states: 93,423,690,932,656,537,015,909,632 (25)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-010010-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.358sec
checking: A [A [[[~ [EF [4<=p39]] | AG [EF [10<=p10]]] | [~ [p2<=p26] | ~ [[7<=p33 | p38<=p42]]]] U A [6<=p20 U [~ [A [2<=p18 U p11<=4]] | p33<=4]]] U ~ [EF [[AF [p47<=p9] & [p12<=p30 | ~ [p32<=p20]]]]]]
normalized: [~ [EG [E [true U [[p12<=p30 | ~ [p32<=p20]] & ~ [EG [~ [p47<=p9]]]]]]] & ~ [E [E [true U [[p12<=p30 | ~ [p32<=p20]] & ~ [EG [~ [p47<=p9]]]]] U [~ [[~ [EG [~ [[~ [EG [~ [[p33<=4 | ~ [[~ [EG [~ [p11<=4]]] & ~ [E [~ [p11<=4] U [~ [2<=p18] & ~ [p11<=4]]]]]]]]]] & ~ [E [~ [[p33<=4 | ~ [[~ [EG [~ [p11<=4]]] & ~ [E [~ [p11<=4] U [~ [2<=p18] & ~ [p11<=4]]]]]]]] U [~ [6<=p20] & ~ [[p33<=4 | ~ [[~ [EG [~ [p11<=4]]] & ~ [E [~ [p11<=4] U [~ [2<=p18] & ~ [p11<=4]]]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[p33<=4 | ~ [[~ [EG [~ [p11<=4]]] & ~ [E [~ [p11<=4] U [~ [2<=p18] & ~ [p11<=4]]]]]]]]]] & ~ [E [~ [[p33<=4 | ~ [[~ [EG [~ [p11<=4]]] & ~ [E [~ [p11<=4] U [~ [2<=p18] & ~ [p11<=4]]]]]]]] U [~ [6<=p20] & ~ [[p33<=4 | ~ [[~ [EG [~ [p11<=4]]] & ~ [E [~ [p11<=4] U [~ [2<=p18] & ~ [p11<=4]]]]]]]]]]]]] U [~ [[[~ [[7<=p33 | p38<=p42]] | ~ [p2<=p26]] | [~ [E [true U ~ [E [true U 10<=p10]]]] | ~ [E [true U 4<=p39]]]]] & ~ [[~ [EG [~ [[p33<=4 | ~ [[~ [EG [~ [p11<=4]]] & ~ [E [~ [p11<=4] U [~ [2<=p18] & ~ [p11<=4]]]]]]]]]] & ~ [E [~ [[p33<=4 | ~ [[~ [EG [~ [p11<=4]]] & ~ [E [~ [p11<=4] U [~ [2<=p18] & ~ [p11<=4]]]]]]]] U [~ [6<=p20] & ~ [[p33<=4 | ~ [[~ [EG [~ [p11<=4]]] & ~ [E [~ [p11<=4] U [~ [2<=p18] & ~ [p11<=4]]]]]]]]]]]]]]]]]] & E [true U [[p12<=p30 | ~ [p32<=p20]] & ~ [EG [~ [p47<=p9]]]]]]]]]
abstracting: (p47<=p9)
states: 18,490,105,497,088,272,951,065,448 (25)
.
EG iterations: 1
abstracting: (p32<=p20)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (p12<=p30)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (2<=p18)
states: 105,101,652,299,238,604,142,898,336 (26)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
.
EG iterations: 1
abstracting: (p33<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (6<=p20)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (2<=p18)
states: 105,101,652,299,238,604,142,898,336 (26)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
.
EG iterations: 1
abstracting: (p33<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (2<=p18)
states: 105,101,652,299,238,604,142,898,336 (26)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
.
EG iterations: 1
abstracting: (p33<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
.
EG iterations: 1
abstracting: (4<=p39)
states: 1,469,285,988,932,711,060,094,984 (24)
abstracting: (10<=p10)
states: 11,677,961,366,582,067,126,988,704 (25)
abstracting: (p2<=p26)
states: 99,262,671,615,947,570,579,403,984 (25)
abstracting: (p38<=p42)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (7<=p33)
states: 46,711,845,466,328,268,507,954,816 (25)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (2<=p18)
states: 105,101,652,299,238,604,142,898,336 (26)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
.
EG iterations: 1
abstracting: (p33<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (6<=p20)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (2<=p18)
states: 105,101,652,299,238,604,142,898,336 (26)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
.
EG iterations: 1
abstracting: (p33<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (2<=p18)
states: 105,101,652,299,238,604,142,898,336 (26)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
.
EG iterations: 1
abstracting: (p33<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
.
EG iterations: 1
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (2<=p18)
states: 105,101,652,299,238,604,142,898,336 (26)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
.
EG iterations: 1
abstracting: (p33<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (6<=p20)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (2<=p18)
states: 105,101,652,299,238,604,142,898,336 (26)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
.
EG iterations: 1
abstracting: (p33<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (2<=p18)
states: 105,101,652,299,238,604,142,898,336 (26)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (p11<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
.
EG iterations: 1
abstracting: (p33<=4)
states: 58,389,806,832,910,335,634,943,520 (25)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p47<=p9)
states: 18,490,105,497,088,272,951,065,448 (25)
.
EG iterations: 1
abstracting: (p32<=p20)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (p12<=p30)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (p47<=p9)
states: 18,490,105,497,088,272,951,065,448 (25)
.
EG iterations: 1
abstracting: (p32<=p20)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (p12<=p30)
states: 70,067,768,199,492,402,761,932,224 (25)
EG iterations: 0
-> the formula is FALSE
FORMULA RefineWMG-PT-010010-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.548sec
checking: A [[[EF [AX [1<=0]] | [p10<=p26 | [[~ [AF [6<=p17]] & AX [p38<=p41]] & [p1<=0 & [~ [1<=p5] | [p21<=p34 | 6<=p9]]]]]] & [AF [[EF [5<=p28] | 3<=p42]] | [~ [p0<=1] & [[[6<=p45 | p38<=9] | [p5<=p40 | [p10<=p40 & p24<=4]]] & [~ [p7<=p38] | 2<=p50]]]]] U AG [EF [p26<=p4]]]
normalized: [~ [EG [E [true U ~ [E [true U p26<=p4]]]]] & ~ [E [E [true U ~ [E [true U p26<=p4]]] U [~ [[[[[[2<=p50 | ~ [p7<=p38]] & [[p5<=p40 | [p10<=p40 & p24<=4]] | [6<=p45 | p38<=9]]] & ~ [p0<=1]] | ~ [EG [~ [[3<=p42 | E [true U 5<=p28]]]]]] & [[p10<=p26 | [[p1<=0 & [[p21<=p34 | 6<=p9] | ~ [1<=p5]]] & [~ [EX [~ [p38<=p41]]] & EG [~ [6<=p17]]]]] | E [true U ~ [EX [~ [1<=0]]]]]]] & E [true U ~ [E [true U p26<=p4]]]]]]]
abstracting: (p26<=p4)
states: 18,490,105,497,088,272,951,065,448 (25)
abstracting: (1<=0)
states: 0
.abstracting: (6<=p17)
states: 58,389,806,832,910,335,634,943,520 (25)
.
EG iterations: 1
abstracting: (p38<=p41)
states: 70,067,768,199,492,402,761,932,224 (25)
.abstracting: (1<=p5)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (6<=p9)
states: 48,437,999,635,144,320,662,472 (22)
abstracting: (p21<=p34)
states: 18,490,105,497,088,272,951,065,448 (25)
abstracting: (p1<=0)
states: 78,501,851,408,690,562,353,646,288 (25)
abstracting: (p10<=p26)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (5<=p28)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (3<=p42)
states: 93,423,690,932,656,537,015,909,632 (25)
.
EG iterations: 1
abstracting: (p0<=1)
states: 110,826,143,165,210,205,675,735,936 (26)
abstracting: (p38<=9)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (6<=p45)
states: 58,389,806,832,910,335,634,943,520 (25)
abstracting: (p24<=4)
states: 128,142,728,034,774,300,312,569,676 (26)
abstracting: (p10<=p40)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (p5<=p40)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (p7<=p38)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (2<=p50)
states: 105,101,652,299,238,604,142,898,336 (26)
abstracting: (p26<=p4)
states: 18,490,105,497,088,272,951,065,448 (25)
abstracting: (p26<=p4)
states: 18,490,105,497,088,272,951,065,448 (25)
.
EG iterations: 1
-> the formula is TRUE
FORMULA RefineWMG-PT-010010-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.385sec
checking: E [[10<=p7 | [[AX [EX [1<=p11]] & EG [p14<=4]] | [AX [p50<=9] & [E [A [3<=p37 U p35<=3] U EG [p46<=6]] & [EX [EX [p43<=p1]] | ~ [AG [p39<=p1]]]]]]] U E [[E [[p2<=p38 & p19<=p46] U [[p29<=p23 | p52<=p48] & [7<=p51 & p32<=p51]]] | AF [[EX [2<=p35] & ~ [8<=p46]]]] U EX [[EF [p12<=p13] | EX [p52<=5]]]]]
normalized: E [[10<=p7 | [[[[E [true U ~ [p39<=p1]] | EX [EX [p43<=p1]]] & E [[~ [EG [~ [p35<=3]]] & ~ [E [~ [p35<=3] U [~ [3<=p37] & ~ [p35<=3]]]]] U EG [p46<=6]]] & ~ [EX [~ [p50<=9]]]] | [EG [p14<=4] & ~ [EX [~ [EX [1<=p11]]]]]]] U E [[~ [EG [~ [[~ [8<=p46] & EX [2<=p35]]]]] | E [[p2<=p38 & p19<=p46] U [[7<=p51 & p32<=p51] & [p29<=p23 | p52<=p48]]]] U EX [[EX [p52<=5] | E [true U p12<=p13]]]]]
abstracting: (p12<=p13)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (p52<=5)
states: 70,067,768,199,492,402,761,932,224 (25)
..abstracting: (p52<=p48)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (p29<=p23)
states: 121,645,430,901,896,532,572,799,000 (26)
abstracting: (p32<=p51)
states: 70,067,768,199,492,402,761,932,224 (25)
abstracting: (7<=p51)
states: 46,711,845,466,328,268,507,954,816 (25)
abstracting: (p19<=p46)
states: 121,645,430,901,896,532,572,799,000 (26)
abstracting: (p2<=p38)
states: 99,262,671,615,947,570,579,403,984 (25)
abstracting: (2<=p35)
states: 105,101,652,299,238,604,142,898,336 (26)
.abstracting: (8<=p46)
states: 35,033,884,099,746,201,380,966,112 (25)
.
EG iterations: 1
abstracting: (1<=p11)
states: 116,779,613,665,820,671,269,887,040 (26)
..abstracting: (p14<=4)
states: 128,142,728,034,774,300,312,569,676 (26)
.
EG iterations: 1
abstracting: (p50<=9)
states: 116,779,613,665,820,671,269,887,040 (26)
.abstracting: (p46<=6)
states: 81,745,729,566,074,469,888,920,928 (25)
.
EG iterations: 1
abstracting: (p35<=3)
states: 46,711,845,466,328,268,507,954,816 (25)
abstracting: (3<=p37)
states: 93,423,690,932,656,537,015,909,632 (25)
abstracting: (p35<=3)
states: 46,711,845,466,328,268,507,954,816 (25)
abstracting: (p35<=3)
states: 46,711,845,466,328,268,507,954,816 (25)
.
EG iterations: 1
abstracting: (p43<=p1)
states: 18,490,105,497,088,272,951,065,448 (25)
..abstracting: (p39<=p1)
states: 91,822,301,308,355,250,535,826,088 (25)
abstracting: (10<=p7)
states: 11,677,961,366,582,067,126,988,704 (25)
-> the formula is TRUE
FORMULA RefineWMG-PT-010010-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.083sec
totally nodes used: 7917881 (7.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 26770522 23941574 50712096
used/not used/entry size/cache size: 24979652 42129212 16 1024MB
basic ops cache: hits/miss/sum: 10157595 9198730 19356325
used/not used/entry size/cache size: 8973316 7803900 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: 161156 164919 326075
used/not used/entry size/cache size: 163372 8225236 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 59781275
1 6929727
2 369554
3 13721
4 746
5 743
6 3266
7 939
8 169
9 796
>= 10 7928
Total processing time: 0m19.363sec
BK_STOP 1679170146507
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:3896 (90), effective:1393 (32)
initing FirstDep: 0m 0.000sec
iterations count:806 (18), effective:263 (6)
iterations count:45 (1), effective:2 (0)
iterations count:57 (1), effective:7 (0)
iterations count:2830 (65), effective:977 (22)
iterations count:43 (1), effective:0 (0)
iterations count:47 (1), effective:2 (0)
iterations count:1714 (39), effective:579 (13)
iterations count:479 (11), effective:160 (3)
iterations count:52 (1), effective:9 (0)
iterations count:806 (18), effective:263 (6)
iterations count:806 (18), effective:263 (6)
iterations count:115 (2), effective:26 (0)
iterations count:806 (18), effective:263 (6)
iterations count:1914 (44), effective:654 (15)
iterations count:115 (2), effective:24 (0)
iterations count:573 (13), effective:198 (4)
iterations count:1786 (41), effective:606 (14)
iterations count:1669 (38), effective:576 (13)
iterations count:660 (15), effective:211 (4)
iterations count:78 (1), effective:15 (0)
iterations count:55 (1), effective:11 (0)
iterations count:479 (11), effective:151 (3)
iterations count:51 (1), effective:4 (0)
iterations count:125 (2), effective:32 (0)
iterations count:511 (11), effective:177 (4)
iterations count:61 (1), effective:9 (0)
iterations count:61 (1), effective:9 (0)
iterations count:48 (1), effective:5 (0)
iterations count:61 (1), effective:9 (0)
iterations count:1098 (25), effective:375 (8)
iterations count:2508 (58), effective:851 (19)
iterations count:61 (1), effective:9 (0)
iterations count:61 (1), effective:9 (0)
iterations count:48 (1), effective:5 (0)
iterations count:61 (1), effective:9 (0)
iterations count:61 (1), effective:9 (0)
iterations count:61 (1), effective:9 (0)
iterations count:48 (1), effective:5 (0)
iterations count:61 (1), effective:9 (0)
iterations count:511 (11), effective:177 (4)
iterations count:1326 (30), effective:439 (10)
iterations count:511 (11), effective:177 (4)
iterations count:1221 (28), effective:426 (9)
iterations count:88 (2), effective:15 (0)
iterations count:1221 (28), effective:426 (9)
iterations count:1221 (28), effective:426 (9)
iterations count:78 (1), effective:15 (0)
iterations count:132 (3), effective:35 (0)
iterations count:43 (1), effective:0 (0)
iterations count:109 (2), effective:22 (0)
iterations count:1166 (27), effective:398 (9)
iterations count:672 (15), effective:223 (5)
iterations count:43 (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-010010"
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-010010, 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-167889203400577"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-010010.tgz
mv RefineWMG-PT-010010 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 '
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 ;