About the Execution of Marcie+red for RefineWMG-PT-010011
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6012.231 | 26279.00 | 31716.00 | 398.60 | FTFFTFTFTFFTFFFF | 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-167889203400585.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-010011, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203400585
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:50 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.7K 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.6K Feb 26 15:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 15:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 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-010011-CTLCardinality-00
FORMULA_NAME RefineWMG-PT-010011-CTLCardinality-01
FORMULA_NAME RefineWMG-PT-010011-CTLCardinality-02
FORMULA_NAME RefineWMG-PT-010011-CTLCardinality-03
FORMULA_NAME RefineWMG-PT-010011-CTLCardinality-04
FORMULA_NAME RefineWMG-PT-010011-CTLCardinality-05
FORMULA_NAME RefineWMG-PT-010011-CTLCardinality-06
FORMULA_NAME RefineWMG-PT-010011-CTLCardinality-07
FORMULA_NAME RefineWMG-PT-010011-CTLCardinality-08
FORMULA_NAME RefineWMG-PT-010011-CTLCardinality-09
FORMULA_NAME RefineWMG-PT-010011-CTLCardinality-10
FORMULA_NAME RefineWMG-PT-010011-CTLCardinality-11
FORMULA_NAME RefineWMG-PT-010011-CTLCardinality-12
FORMULA_NAME RefineWMG-PT-010011-CTLCardinality-13
FORMULA_NAME RefineWMG-PT-010011-CTLCardinality-14
FORMULA_NAME RefineWMG-PT-010011-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679170214768
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-010011
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:10:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 20:10:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:10:16] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2023-03-18 20:10:16] [INFO ] Transformed 54 places.
[2023-03-18 20:10:16] [INFO ] Transformed 43 transitions.
[2023-03-18 20:10:16] [INFO ] Parsed PT model containing 54 places and 43 transitions and 128 arcs in 85 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 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:10:16] [INFO ] Computed 22 place invariants in 12 ms
[2023-03-18 20:10:16] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
[2023-03-18 20:10:16] [INFO ] Invariant cache hit.
[2023-03-18 20:10:16] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-18 20:10:16] [INFO ] Invariant cache hit.
[2023-03-18 20:10:16] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-18 20:10:16] [INFO ] Invariant cache hit.
[2023-03-18 20:10:16] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 54/54 places, 43/43 transitions.
Support contains 51 out of 54 places after structural reductions.
[2023-03-18 20:10:17] [INFO ] Flatten gal took : 20 ms
[2023-03-18 20:10:17] [INFO ] Flatten gal took : 7 ms
[2023-03-18 20:10:17] [INFO ] Input system was already deterministic with 43 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 85) seen :64
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-18 20:10:17] [INFO ] Invariant cache hit.
[2023-03-18 20:10:17] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-18 20:10:17] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:20
[2023-03-18 20:10:17] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-18 20:10:17] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :10
[2023-03-18 20:10:17] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :10
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-18 20:10:17] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :10
Fused 21 Parikh solutions to 10 different solutions.
Finished Parikh walk after 204 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=68 )
Parikh walk visited 10 properties in 27 ms.
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 7 ms
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:10:18] [INFO ] Input system was already deterministic with 43 transitions.
Support contains 49 out of 54 places (down from 51) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 15 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 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 25 place count 32 transition count 29
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 32 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 31 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 27 place count 31 transition count 26
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 31 place count 29 transition count 26
Applied a total of 31 rules in 14 ms. Remains 29 /54 variables (removed 25) and now considering 26/43 (removed 17) transitions.
// Phase 1: matrix 26 rows 29 cols
[2023-03-18 20:10:18] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-18 20:10:18] [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 48 ms. Remains : 29/54 places, 26/43 transitions.
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:18] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 26 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 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 38 place count 18 transition count 18
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 44 place count 18 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 50 place count 12 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 50 place count 12 transition count 10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 10 transition count 10
Applied a total of 54 rules in 5 ms. Remains 10 /54 variables (removed 44) and now considering 10/43 (removed 33) transitions.
// Phase 1: matrix 10 rows 10 cols
[2023-03-18 20:10:18] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 20:10:18] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 10/54 places, 10/43 transitions.
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:18] [INFO ] Input system was already deterministic with 10 transitions.
Finished random walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
FORMULA RefineWMG-PT-010011-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 26 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 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 33 place count 20 transition count 18
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 20 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 18 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 37 place count 18 transition count 15
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 39 place count 17 transition count 15
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 41 place count 16 transition count 14
Applied a total of 41 rules in 7 ms. Remains 16 /54 variables (removed 38) and now considering 14/43 (removed 29) transitions.
// Phase 1: matrix 14 rows 16 cols
[2023-03-18 20:10:18] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 20:10:18] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 16/54 places, 14/43 transitions.
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:10:18] [INFO ] Input system was already deterministic with 14 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:10:18] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-18 20:10:18] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:18] [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:10:18] [INFO ] Invariant cache hit.
[2023-03-18 20:10:18] [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:10:18] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:18] [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 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:10:18] [INFO ] Invariant cache hit.
[2023-03-18 20:10:18] [INFO ] Dead Transitions using invariants and state equation in 37 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:10:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:10:18] [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 22 edges and 54 vertex of which 16 / 54 are part of one of the 8 SCC in 1 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 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 26 place count 26 transition count 22
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 26 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 25 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 28 place count 25 transition count 19
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 32 place count 23 transition count 19
Applied a total of 32 rules in 5 ms. Remains 23 /54 variables (removed 31) and now considering 19/43 (removed 24) transitions.
// Phase 1: matrix 19 rows 23 cols
[2023-03-18 20:10:18] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-18 20:10:18] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 23/54 places, 19/43 transitions.
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:10:18] [INFO ] Input system was already deterministic with 19 transitions.
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=124 )
FORMULA RefineWMG-PT-010011-CTLCardinality-06 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:10:18] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-18 20:10:18] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:18] [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:10:18] [INFO ] Invariant cache hit.
[2023-03-18 20:10:18] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:10:18] [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:10:18] [INFO ] Invariant cache hit.
[2023-03-18 20:10:18] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:10:18] [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:10:18] [INFO ] Invariant cache hit.
[2023-03-18 20:10:18] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:18] [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:10:18] [INFO ] Invariant cache hit.
[2023-03-18 20:10:18] [INFO ] Dead Transitions using invariants and state equation in 33 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:10:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:18] [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:10:18] [INFO ] Invariant cache hit.
[2023-03-18 20:10:18] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 8 ms
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:10:18] [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 7 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:10:18] [INFO ] Invariant cache hit.
[2023-03-18 20:10:18] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:10:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:18] [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 5 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:10:18] [INFO ] Invariant cache hit.
[2023-03-18 20:10:18] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:19] [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 3 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 9 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:10:19] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 20:10:19] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 7/54 places, 7/43 transitions.
[2023-03-18 20:10:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:10:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:10:19] [INFO ] Input system was already deterministic with 7 transitions.
[2023-03-18 20:10:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:10:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:10:19] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-18 20:10:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 43 transitions and 128 arcs took 1 ms.
Total runtime 2857 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.810sec
RS generation: 0m 0.190sec
-> reachability set: #nodes 1994 (2.0e+03) #states 732,033,467,997,890,689,728,774,144 (26)
starting MCC model checker
--------------------------
checking: EG [EF [EX [EG [~ [p9<=5]]]]]
normalized: EG [E [true U EX [EG [~ [p9<=5]]]]]
abstracting: (p9<=5)
states: 731,757,437,278,434,471,519,977,472 (26)
.
EG iterations: 1
.
EG iterations: 0
-> the formula is TRUE
FORMULA RefineWMG-PT-010011-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.216sec
checking: EX [p13<=p6]
normalized: EX [p13<=p6]
abstracting: (p13<=p6)
states: 396,518,128,498,857,456,936,419,328 (26)
.-> the formula is TRUE
FORMULA RefineWMG-PT-010011-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.027sec
checking: EG [EF [AG [~ [E [10<=p28 U 2<=p28]]]]]
normalized: EG [E [true U ~ [E [true U E [10<=p28 U 2<=p28]]]]]
abstracting: (2<=p28)
states: 610,027,889,998,242,241,440,645,120 (26)
abstracting: (10<=p28)
states: 122,005,577,999,648,448,288,129,024 (26)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-010011-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.025sec
checking: EG [[EX [p43<=p32] & [8<=p37 & AX [~ [E [p7<=10 U p22<=7]]]]]]
normalized: EG [[[8<=p37 & ~ [EX [E [p7<=10 U p22<=7]]]] & EX [p43<=p32]]]
abstracting: (p43<=p32)
states: 396,518,128,498,857,456,936,419,328 (26)
.abstracting: (p22<=7)
states: 488,022,311,998,593,793,152,516,096 (26)
abstracting: (p7<=10)
states: 671,030,678,998,066,465,584,709,632 (26)
.abstracting: (8<=p37)
states: 244,011,155,999,296,896,576,258,048 (26)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-010011-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.114sec
checking: EF [[AG [[EX [~ [p24<=p41]] | [p21<=p51 & 2<=p8]]] & p53<=10]]
normalized: E [true U [p53<=10 & ~ [E [true U ~ [[[p21<=p51 & 2<=p8] | EX [~ [p24<=p41]]]]]]]]
abstracting: (p24<=p41)
states: 696,448,507,747,993,225,644,736,512 (26)
.abstracting: (2<=p8)
states: 610,027,889,998,242,241,440,645,120 (26)
abstracting: (p21<=p51)
states: 396,518,128,498,857,456,936,419,328 (26)
abstracting: (p53<=10)
states: 671,030,678,998,066,465,584,709,632 (26)
-> the formula is FALSE
FORMULA RefineWMG-PT-010011-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.935sec
checking: EF [AG [[p3<=p34 & [A [p10<=0 U p15<=p27] | p16<=p24]]]]
normalized: E [true U ~ [E [true U ~ [[p3<=p34 & [p16<=p24 | [~ [EG [~ [p15<=p27]]] & ~ [E [~ [p15<=p27] U [~ [p10<=0] & ~ [p15<=p27]]]]]]]]]]]
abstracting: (p15<=p27)
states: 396,518,128,498,857,456,936,419,328 (26)
abstracting: (p10<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (p15<=p27)
states: 396,518,128,498,857,456,936,419,328 (26)
abstracting: (p15<=p27)
states: 396,518,128,498,857,456,936,419,328 (26)
.
EG iterations: 1
abstracting: (p16<=p24)
states: 96,587,749,249,721,688,228,102,144 (25)
abstracting: (p3<=p34)
states: 193,125,659,619,541,559,279,616,000 (26)
-> the formula is FALSE
FORMULA RefineWMG-PT-010011-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.809sec
checking: EF [[[EG [[~ [p1<=5] | ~ [p28<=p4]]] & EX [9<=p13]] & [6<=p41 & [~ [9<=p51] | ~ [2<=p19]]]]]
normalized: E [true U [[6<=p41 & [~ [2<=p19] | ~ [9<=p51]]] & [EX [9<=p13] & EG [[~ [p28<=p4] | ~ [p1<=5]]]]]]
abstracting: (p1<=5)
states: 731,757,437,278,434,471,519,977,472 (26)
abstracting: (p28<=p4)
states: 96,587,749,249,721,688,228,102,144 (25)
.
EG iterations: 1
abstracting: (9<=p13)
states: 183,008,366,999,472,672,432,193,536 (26)
.abstracting: (9<=p51)
states: 183,008,366,999,472,672,432,193,536 (26)
abstracting: (2<=p19)
states: 100,475,181,882,063,428,001,988,608 (26)
abstracting: (6<=p41)
states: 366,016,733,998,945,344,864,387,072 (26)
-> the formula is TRUE
FORMULA RefineWMG-PT-010011-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.318sec
checking: [AF [AG [[10<=p41 | [10<=p47 | [8<=p38 & p29<=p35]]]]] | EX [AG [[2<=p6 | [p22<=p12 & AF [~ [9<=p37]]]]]]]
normalized: [EX [~ [E [true U ~ [[2<=p6 | [p22<=p12 & ~ [EG [9<=p37]]]]]]]] | ~ [EG [E [true U ~ [[10<=p41 | [10<=p47 | [8<=p38 & p29<=p35]]]]]]]]
abstracting: (p29<=p35)
states: 696,448,507,747,993,225,644,736,512 (26)
abstracting: (8<=p38)
states: 244,011,155,999,296,896,576,258,048 (26)
abstracting: (10<=p47)
states: 122,005,577,999,648,448,288,129,024 (26)
abstracting: (10<=p41)
states: 122,005,577,999,648,448,288,129,024 (26)
EG iterations: 0
abstracting: (9<=p37)
states: 183,008,366,999,472,672,432,193,536 (26)
.
EG iterations: 1
abstracting: (p22<=p12)
states: 396,518,128,498,857,456,936,419,328 (26)
abstracting: (2<=p6)
states: 610,027,889,998,242,241,440,645,120 (26)
.-> the formula is FALSE
FORMULA RefineWMG-PT-010011-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.408sec
checking: [[AF [~ [7<=p46]] | AG [[[EX [~ [p48<=1]] & AG [~ [p21<=9]]] | ~ [A [10<=p13 U 9<=p33]]]]] & AF [[AG [[~ [p12<=9] | AG [p51<=p26]]] & EG [EF [~ [1<=p41]]]]]]
normalized: [~ [EG [~ [[~ [E [true U ~ [[~ [E [true U ~ [p51<=p26]]] | ~ [p12<=9]]]]] & EG [E [true U ~ [1<=p41]]]]]]] & [~ [E [true U ~ [[~ [[~ [EG [~ [9<=p33]]] & ~ [E [~ [9<=p33] U [~ [10<=p13] & ~ [9<=p33]]]]]] | [~ [E [true U p21<=9]] & EX [~ [p48<=1]]]]]]] | ~ [EG [7<=p46]]]]
abstracting: (7<=p46)
states: 305,013,944,999,121,120,720,322,560 (26)
.
EG iterations: 1
abstracting: (p48<=1)
states: 122,005,577,999,648,448,288,129,024 (26)
.abstracting: (p21<=9)
states: 610,027,889,998,242,241,440,645,120 (26)
abstracting: (9<=p33)
states: 183,008,366,999,472,672,432,193,536 (26)
abstracting: (10<=p13)
states: 122,005,577,999,648,448,288,129,024 (26)
abstracting: (9<=p33)
states: 183,008,366,999,472,672,432,193,536 (26)
abstracting: (9<=p33)
states: 183,008,366,999,472,672,432,193,536 (26)
.
EG iterations: 1
abstracting: (1<=p41)
states: 671,030,678,998,066,465,584,709,632 (26)
EG iterations: 0
abstracting: (p12<=9)
states: 610,027,889,998,242,241,440,645,120 (26)
abstracting: (p51<=p26)
states: 396,518,128,498,857,456,936,419,328 (26)
EG iterations: 0
-> the formula is FALSE
FORMULA RefineWMG-PT-010011-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.385sec
checking: AG [[EX [~ [p36<=p50]] & [EG [~ [p2<=p25]] & [AF [EG [~ [p47<=3]]] | [AF [~ [p0<=p14]] & [5<=p2 & EX [~ [p38<=p36]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[5<=p2 & EX [~ [p38<=p36]]] & ~ [EG [p0<=p14]]] | ~ [EG [~ [EG [~ [p47<=3]]]]]] & EG [~ [p2<=p25]]] & EX [~ [p36<=p50]]]]]]
abstracting: (p36<=p50)
states: 396,518,128,498,857,456,936,419,328 (26)
.abstracting: (p2<=p25)
states: 579,526,495,498,330,129,368,612,864 (26)
.
EG iterations: 1
abstracting: (p47<=3)
states: 244,011,155,999,296,896,576,258,048 (26)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p0<=p14)
states: 523,262,233,849,170,984,475,557,888 (26)
.
EG iterations: 1
abstracting: (p38<=p36)
states: 396,518,128,498,857,456,936,419,328 (26)
.abstracting: (5<=p2)
states: 122,005,577,999,648,448,288,129,024 (26)
-> the formula is FALSE
FORMULA RefineWMG-PT-010011-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.683sec
checking: E [~ [[EX [[AG [p4<=p23] & E [2<=p30 U 9<=p22]]] | [AG [9<=p20] & ~ [EX [p35<=p50]]]]] U ~ [EF [~ [[E [3<=p26 U p27<=8] & AG [p8<=4]]]]]]
normalized: E [~ [[EX [[~ [E [true U ~ [p4<=p23]]] & E [2<=p30 U 9<=p22]]] | [~ [E [true U ~ [9<=p20]]] & ~ [EX [p35<=p50]]]]] U ~ [E [true U ~ [[~ [E [true U ~ [p8<=4]]] & E [3<=p26 U p27<=8]]]]]]
abstracting: (p27<=8)
states: 549,025,100,998,418,017,296,580,608 (26)
abstracting: (3<=p26)
states: 549,025,100,998,418,017,296,580,608 (26)
abstracting: (p8<=4)
states: 305,013,944,999,121,120,720,322,560 (26)
abstracting: (p35<=p50)
states: 396,518,128,498,857,456,936,419,328 (26)
.abstracting: (9<=p20)
states: 183,008,366,999,472,672,432,193,536 (26)
abstracting: (9<=p22)
states: 183,008,366,999,472,672,432,193,536 (26)
abstracting: (2<=p30)
states: 610,027,889,998,242,241,440,645,120 (26)
abstracting: (p4<=p23)
states: 696,448,507,747,993,225,644,736,512 (26)
.-> the formula is FALSE
FORMULA RefineWMG-PT-010011-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.311sec
checking: AX [[~ [E [[[E [11<=p28 U p42<=8] & ~ [5<=p12]] | ~ [EG [p52<=7]]] U ~ [[~ [9<=p41] | [3<=p19 | p12<=p26]]]]] & [~ [p31<=7] | EG [~ [p34<=p21]]]]]
normalized: ~ [EX [~ [[[EG [~ [p34<=p21]] | ~ [p31<=7]] & ~ [E [[~ [EG [p52<=7]] | [~ [5<=p12] & E [11<=p28 U p42<=8]]] U ~ [[[3<=p19 | p12<=p26] | ~ [9<=p41]]]]]]]]]
abstracting: (9<=p41)
states: 183,008,366,999,472,672,432,193,536 (26)
abstracting: (p12<=p26)
states: 396,518,128,498,857,456,936,419,328 (26)
abstracting: (3<=p19)
states: 31,398,494,338,144,821,250,621,440 (25)
abstracting: (p42<=8)
states: 549,025,100,998,418,017,296,580,608 (26)
abstracting: (11<=p28)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (5<=p12)
states: 427,019,522,998,769,569,008,451,584 (26)
abstracting: (p52<=7)
states: 488,022,311,998,593,793,152,516,096 (26)
.
EG iterations: 1
abstracting: (p31<=7)
states: 488,022,311,998,593,793,152,516,096 (26)
abstracting: (p34<=p21)
states: 696,448,507,747,993,225,644,736,512 (26)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA RefineWMG-PT-010011-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.999sec
checking: E [EF [[AG [p7<=p31] & 5<=p33]] U [p41<=6 & EG [A [10<=p42 U [[p44<=p7 | p13<=2] & [p31<=p16 | p53<=p47]]]]]]
normalized: E [E [true U [5<=p33 & ~ [E [true U ~ [p7<=p31]]]]] U [p41<=6 & EG [[~ [EG [~ [[[p31<=p16 | p53<=p47] & [p44<=p7 | p13<=2]]]]] & ~ [E [~ [[[p31<=p16 | p53<=p47] & [p44<=p7 | p13<=2]]] U [~ [10<=p42] & ~ [[[p31<=p16 | p53<=p47] & [p44<=p7 | p13<=2]]]]]]]]]]
abstracting: (p13<=2)
states: 183,008,366,999,472,672,432,193,536 (26)
abstracting: (p44<=p7)
states: 696,448,507,747,993,225,644,736,512 (26)
abstracting: (p53<=p47)
states: 396,518,128,498,857,456,936,419,328 (26)
abstracting: (p31<=p16)
states: 396,518,128,498,857,456,936,419,328 (26)
abstracting: (10<=p42)
states: 122,005,577,999,648,448,288,129,024 (26)
abstracting: (p13<=2)
states: 183,008,366,999,472,672,432,193,536 (26)
abstracting: (p44<=p7)
states: 696,448,507,747,993,225,644,736,512 (26)
abstracting: (p53<=p47)
states: 396,518,128,498,857,456,936,419,328 (26)
abstracting: (p31<=p16)
states: 396,518,128,498,857,456,936,419,328 (26)
abstracting: (p13<=2)
states: 183,008,366,999,472,672,432,193,536 (26)
abstracting: (p44<=p7)
states: 696,448,507,747,993,225,644,736,512 (26)
abstracting: (p53<=p47)
states: 396,518,128,498,857,456,936,419,328 (26)
abstracting: (p31<=p16)
states: 396,518,128,498,857,456,936,419,328 (26)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p41<=6)
states: 427,019,522,998,769,569,008,451,584 (26)
abstracting: (p7<=p31)
states: 396,518,128,498,857,456,936,419,328 (26)
abstracting: (5<=p33)
states: 427,019,522,998,769,569,008,451,584 (26)
-> the formula is FALSE
FORMULA RefineWMG-PT-010011-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.174sec
checking: AG [[~ [A [EG [p8<=9] U ~ [[AF [p35<=p16] | ~ [p13<=p36]]]]] | [~ [E [[AG [p8<=8] | EX [10<=p40]] U E [p32<=6 U p25<=1]]] & AG [[4<=p8 | ~ [p27<=p6]]]]]]
normalized: ~ [E [true U ~ [[[~ [E [true U ~ [[4<=p8 | ~ [p27<=p6]]]]] & ~ [E [[EX [10<=p40] | ~ [E [true U ~ [p8<=8]]]] U E [p32<=6 U p25<=1]]]] | ~ [[~ [EG [[~ [p13<=p36] | ~ [EG [~ [p35<=p16]]]]]] & ~ [E [[~ [p13<=p36] | ~ [EG [~ [p35<=p16]]]] U [~ [EG [p8<=9]] & [~ [p13<=p36] | ~ [EG [~ [p35<=p16]]]]]]]]]]]]]
abstracting: (p35<=p16)
states: 396,518,128,498,857,456,936,419,328 (26)
.
EG iterations: 1
abstracting: (p13<=p36)
states: 396,518,128,498,857,456,936,419,328 (26)
abstracting: (p8<=9)
states: 610,027,889,998,242,241,440,645,120 (26)
.
EG iterations: 1
abstracting: (p35<=p16)
states: 396,518,128,498,857,456,936,419,328 (26)
.
EG iterations: 1
abstracting: (p13<=p36)
states: 396,518,128,498,857,456,936,419,328 (26)
abstracting: (p35<=p16)
states: 396,518,128,498,857,456,936,419,328 (26)
.
EG iterations: 1
abstracting: (p13<=p36)
states: 396,518,128,498,857,456,936,419,328 (26)
.
EG iterations: 1
abstracting: (p25<=1)
states: 122,005,577,999,648,448,288,129,024 (26)
abstracting: (p32<=6)
states: 427,019,522,998,769,569,008,451,584 (26)
abstracting: (p8<=8)
states: 549,025,100,998,418,017,296,580,608 (26)
abstracting: (10<=p40)
states: 122,005,577,999,648,448,288,129,024 (26)
.abstracting: (p27<=p6)
states: 396,518,128,498,857,456,936,419,328 (26)
abstracting: (4<=p8)
states: 488,022,311,998,593,793,152,516,096 (26)
-> the formula is FALSE
FORMULA RefineWMG-PT-010011-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.916sec
totally nodes used: 6102453 (6.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 23269665 20984404 44254069
used/not used/entry size/cache size: 21936879 45171985 16 1024MB
basic ops cache: hits/miss/sum: 8323247 7795718 16118965
used/not used/entry size/cache size: 7595015 9182201 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: 165548 168181 333729
used/not used/entry size/cache size: 166599 8222009 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 61338972
1 5526741
2 229814
3 8005
4 902
5 952
6 273
7 618
8 104
9 548
>= 10 1935
Total processing time: 0m20.996sec
BK_STOP 1679170241047
--------------------
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:4260 (99), effective:1518 (35)
initing FirstDep: 0m 0.000sec
iterations count:1570 (36), effective:508 (11)
iterations count:43 (1), effective:0 (0)
iterations count:61 (1), effective:6 (0)
iterations count:79 (1), effective:12 (0)
iterations count:144 (3), effective:38 (0)
iterations count:189 (4), effective:45 (1)
iterations count:369 (8), effective:114 (2)
iterations count:197 (4), effective:62 (1)
iterations count:481 (11), effective:164 (3)
iterations count:2501 (58), effective:842 (19)
iterations count:298 (6), effective:88 (2)
iterations count:47 (1), effective:2 (0)
iterations count:112 (2), effective:23 (0)
iterations count:3227 (75), effective:1116 (25)
iterations count:519 (12), effective:175 (4)
iterations count:57 (1), effective:6 (0)
iterations count:311 (7), effective:102 (2)
iterations count:69 (1), effective:8 (0)
iterations count:53 (1), effective:5 (0)
iterations count:43 (1), effective:0 (0)
iterations count:46 (1), effective:3 (0)
iterations count:61 (1), effective:9 (0)
iterations count:267 (6), effective:97 (2)
iterations count:70 (1), effective:9 (0)
iterations count:600 (13), effective:212 (4)
iterations count:61 (1), effective:6 (0)
iterations count:317 (7), effective:103 (2)
iterations count:43 (1), effective:0 (0)
iterations count:63 (1), effective:10 (0)
iterations count:53 (1), effective:10 (0)
iterations count:61 (1), effective:9 (0)
iterations count:53 (1), effective:10 (0)
iterations count:62 (1), effective:19 (0)
iterations count:1671 (38), effective:565 (13)
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-010011"
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-010011, 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-167889203400585"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-010011.tgz
mv RefineWMG-PT-010011 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 ;