About the Execution of Marcie+red for FlexibleBarrier-PT-08a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5650.819 | 14121.00 | 18098.00 | 375.20 | TTTFTTTTFTTTFTFF | 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.r170-tall-167838857300473.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 FlexibleBarrier-PT-08a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857300473
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 12:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 12:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 12:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 12:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 64K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678553670914
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=FlexibleBarrier-PT-08a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 16:54:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 16:54:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 16:54:32] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-11 16:54:32] [INFO ] Transformed 99 places.
[2023-03-11 16:54:32] [INFO ] Transformed 236 transitions.
[2023-03-11 16:54:32] [INFO ] Found NUPN structural information;
[2023-03-11 16:54:32] [INFO ] Parsed PT model containing 99 places and 236 transitions and 985 arcs in 115 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Ensure Unique test removed 50 transitions
Reduce redundant transitions removed 50 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-08a-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 186/186 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 99 transition count 178
Applied a total of 8 rules in 14 ms. Remains 99 /99 variables (removed 0) and now considering 178/186 (removed 8) transitions.
// Phase 1: matrix 178 rows 99 cols
[2023-03-11 16:54:32] [INFO ] Computed 10 place invariants in 15 ms
[2023-03-11 16:54:32] [INFO ] Implicit Places using invariants in 278 ms returned [97, 98]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 304 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/99 places, 178/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 326 ms. Remains : 97/99 places, 178/186 transitions.
Support contains 67 out of 97 places after structural reductions.
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 30 ms
[2023-03-11 16:54:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FlexibleBarrier-PT-08a-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 13 ms
[2023-03-11 16:54:33] [INFO ] Input system was already deterministic with 178 transitions.
Support contains 61 out of 97 places (down from 67) after GAL structural reductions.
Finished random walk after 861 steps, including 0 resets, run visited all 45 properties in 93 ms. (steps per millisecond=9 )
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 9 ms
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 8 ms
[2023-03-11 16:54:33] [INFO ] Input system was already deterministic with 178 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 97/97 places, 178/178 transitions.
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 9 ms
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 8 ms
[2023-03-11 16:54:33] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 97/97 places, 178/178 transitions.
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 19 ms
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 25 ms
[2023-03-11 16:54:33] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 120 edges and 97 vertex of which 83 / 97 are part of one of the 9 SCC in 2 ms
Free SCC test removed 74 places
Ensure Unique test removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 23 transition count 62
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 20 transition count 62
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 19 transition count 60
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 19 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 19 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 18 transition count 58
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 4 with 36 rules applied. Total rules applied 48 place count 18 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 50 place count 18 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 52 place count 16 transition count 20
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 56 place count 12 transition count 16
Iterating global reduction 6 with 4 rules applied. Total rules applied 60 place count 12 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 61 place count 12 transition count 16
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 62 place count 11 transition count 15
Iterating global reduction 6 with 1 rules applied. Total rules applied 63 place count 11 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 64 place count 11 transition count 14
Applied a total of 64 rules in 20 ms. Remains 11 /97 variables (removed 86) and now considering 14/178 (removed 164) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 11/97 places, 14/178 transitions.
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 1 ms
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 1 ms
[2023-03-11 16:54:33] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 97/97 places, 178/178 transitions.
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 6 ms
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 8 ms
[2023-03-11 16:54:33] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 97/97 places, 178/178 transitions.
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 7 ms
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 6 ms
[2023-03-11 16:54:33] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 97/97 places, 178/178 transitions.
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 6 ms
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 6 ms
[2023-03-11 16:54:33] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 118 edges and 97 vertex of which 80 / 97 are part of one of the 14 SCC in 1 ms
Free SCC test removed 66 places
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 26 transition count 43
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 22 transition count 43
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 20 transition count 39
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 20 transition count 39
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 46 place count 20 transition count 35
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 49 place count 18 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 50 place count 17 transition count 34
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 65 place count 17 transition count 19
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 66 place count 17 transition count 18
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 6 with 4 rules applied. Total rules applied 70 place count 16 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 73 place count 13 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 73 place count 13 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 79 place count 10 transition count 12
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 80 place count 9 transition count 11
Iterating global reduction 8 with 1 rules applied. Total rules applied 81 place count 9 transition count 11
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 82 place count 9 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 82 place count 9 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 84 place count 8 transition count 9
Applied a total of 84 rules in 12 ms. Remains 8 /97 variables (removed 89) and now considering 9/178 (removed 169) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 8/97 places, 9/178 transitions.
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 0 ms
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 0 ms
[2023-03-11 16:54:33] [INFO ] Input system was already deterministic with 9 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
FORMULA FlexibleBarrier-PT-08a-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 97/97 places, 178/178 transitions.
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 7 ms
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 6 ms
[2023-03-11 16:54:33] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 122 edges and 97 vertex of which 87 / 97 are part of one of the 9 SCC in 1 ms
Free SCC test removed 78 places
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 19 transition count 57
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 17 transition count 57
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 16 transition count 55
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 16 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 16 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10 place count 15 transition count 53
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 4 with 35 rules applied. Total rules applied 45 place count 15 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 47 place count 15 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 49 place count 13 transition count 16
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 54 place count 8 transition count 11
Iterating global reduction 6 with 5 rules applied. Total rules applied 59 place count 8 transition count 11
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 60 place count 8 transition count 11
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 61 place count 7 transition count 10
Iterating global reduction 6 with 1 rules applied. Total rules applied 62 place count 7 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 63 place count 7 transition count 9
Applied a total of 63 rules in 10 ms. Remains 7 /97 variables (removed 90) and now considering 9/178 (removed 169) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 7/97 places, 9/178 transitions.
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 0 ms
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 1 ms
[2023-03-11 16:54:33] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 97/97 places, 178/178 transitions.
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 5 ms
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 6 ms
[2023-03-11 16:54:33] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 92 edges and 97 vertex of which 43 / 97 are part of one of the 10 SCC in 0 ms
Free SCC test removed 33 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 64 transition count 130
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 58 transition count 127
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 55 transition count 127
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 19 place count 55 transition count 125
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 23 place count 53 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 25 place count 51 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 51 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 31 place count 51 transition count 117
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 34 place count 49 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 35 place count 48 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 39 place count 46 transition count 114
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 58 place count 46 transition count 95
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 62 place count 46 transition count 95
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 64 place count 44 transition count 93
Iterating global reduction 6 with 2 rules applied. Total rules applied 66 place count 44 transition count 93
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 67 place count 44 transition count 92
Applied a total of 67 rules in 23 ms. Remains 44 /97 variables (removed 53) and now considering 92/178 (removed 86) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 44/97 places, 92/178 transitions.
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 4 ms
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 3 ms
[2023-03-11 16:54:33] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 97/97 places, 178/178 transitions.
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 6 ms
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 6 ms
[2023-03-11 16:54:33] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 97/97 places, 178/178 transitions.
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 5 ms
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 5 ms
[2023-03-11 16:54:33] [INFO ] Input system was already deterministic with 178 transitions.
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 6 ms
[2023-03-11 16:54:33] [INFO ] Flatten gal took : 10 ms
[2023-03-11 16:54:33] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-11 16:54:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 97 places, 178 transitions and 461 arcs took 1 ms.
Total runtime 1573 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: 97 NrTr: 178 NrArc: 461)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 2.741sec
RS generation: 0m 0.110sec
-> reachability set: #nodes 5937 (5.9e+03) #states 429,981,697 (8)
starting MCC model checker
--------------------------
checking: AX [EF [EX [0<=0]]]
normalized: ~ [EX [~ [E [true U EX [0<=0]]]]]
abstracting: (0<=0)
states: 429,981,697 (8)
..-> the formula is TRUE
FORMULA FlexibleBarrier-PT-08a-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.312sec
checking: EX [EF [[p30<=1 & 1<=p30]]]
normalized: EX [E [true U [p30<=1 & 1<=p30]]]
abstracting: (1<=p30)
states: 35,831,808 (7)
abstracting: (p30<=1)
states: 429,981,697 (8)
.-> the formula is TRUE
FORMULA FlexibleBarrier-PT-08a-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.115sec
checking: AG [EF [EX [[[p31<=0 & 0<=p31] & [p11<=1 & 1<=p11]]]]]
normalized: ~ [E [true U ~ [E [true U EX [[[p11<=1 & 1<=p11] & [p31<=0 & 0<=p31]]]]]]]
abstracting: (0<=p31)
states: 429,981,697 (8)
abstracting: (p31<=0)
states: 394,149,889 (8)
abstracting: (1<=p11)
states: 35,831,808 (7)
abstracting: (p11<=1)
states: 429,981,697 (8)
.-> the formula is TRUE
FORMULA FlexibleBarrier-PT-08a-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.167sec
checking: EF [EG [[[p74<=1 & 1<=p74] & [p12<=0 & 0<=p12]]]]
normalized: E [true U EG [[[p12<=0 & 0<=p12] & [p74<=1 & 1<=p74]]]]
abstracting: (1<=p74)
states: 35,831,808 (7)
abstracting: (p74<=1)
states: 429,981,697 (8)
abstracting: (0<=p12)
states: 429,981,697 (8)
abstracting: (p12<=0)
states: 394,149,889 (8)
.
EG iterations: 1
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-08a-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.164sec
checking: ~ [E [[[p90<=0 & 0<=p90] | [p24<=1 & 1<=p24]] U AG [[p37<=1 & 1<=p37]]]]
normalized: ~ [E [[[p24<=1 & 1<=p24] | [p90<=0 & 0<=p90]] U ~ [E [true U ~ [[p37<=1 & 1<=p37]]]]]]
abstracting: (1<=p37)
states: 35,831,808 (7)
abstracting: (p37<=1)
states: 429,981,697 (8)
abstracting: (0<=p90)
states: 429,981,697 (8)
abstracting: (p90<=0)
states: 394,149,889 (8)
abstracting: (1<=p24)
states: 35,831,808 (7)
abstracting: (p24<=1)
states: 429,981,697 (8)
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-08a-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.036sec
checking: AG [AX [~ [A [AX [[p60<=1 & 1<=p60]] U [AF [[p76<=1 & 1<=p76]] & E [[p19<=1 & 1<=p19] U [p86<=1 & 1<=p86]]]]]]]
normalized: ~ [E [true U EX [[~ [EG [~ [[E [[p19<=1 & 1<=p19] U [p86<=1 & 1<=p86]] & ~ [EG [~ [[p76<=1 & 1<=p76]]]]]]]] & ~ [E [~ [[E [[p19<=1 & 1<=p19] U [p86<=1 & 1<=p86]] & ~ [EG [~ [[p76<=1 & 1<=p76]]]]]] U [EX [~ [[p60<=1 & 1<=p60]]] & ~ [[E [[p19<=1 & 1<=p19] U [p86<=1 & 1<=p86]] & ~ [EG [~ [[p76<=1 & 1<=p76]]]]]]]]]]]]]
abstracting: (1<=p76)
states: 35,831,808 (7)
abstracting: (p76<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (1<=p86)
states: 35,831,808 (7)
abstracting: (p86<=1)
states: 429,981,697 (8)
abstracting: (1<=p19)
states: 35,831,808 (7)
abstracting: (p19<=1)
states: 429,981,697 (8)
abstracting: (1<=p60)
states: 35,831,808 (7)
abstracting: (p60<=1)
states: 429,981,697 (8)
.abstracting: (1<=p76)
states: 35,831,808 (7)
abstracting: (p76<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (1<=p86)
states: 35,831,808 (7)
abstracting: (p86<=1)
states: 429,981,697 (8)
abstracting: (1<=p19)
states: 35,831,808 (7)
abstracting: (p19<=1)
states: 429,981,697 (8)
abstracting: (1<=p76)
states: 35,831,808 (7)
abstracting: (p76<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (1<=p86)
states: 35,831,808 (7)
abstracting: (p86<=1)
states: 429,981,697 (8)
abstracting: (1<=p19)
states: 35,831,808 (7)
abstracting: (p19<=1)
states: 429,981,697 (8)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA FlexibleBarrier-PT-08a-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.517sec
checking: EF [AG [[EX [[[p36<=0 & 0<=p36] & [p2<=1 & 1<=p2]]] & [AG [[[p92<=0 & 0<=p92] | [p52<=1 & 1<=p52]]] & EF [[[p88<=0 & 0<=p88] & [p40<=1 & 1<=p40]]]]]]]
normalized: E [true U ~ [E [true U ~ [[[E [true U [[p40<=1 & 1<=p40] & [p88<=0 & 0<=p88]]] & ~ [E [true U ~ [[[p52<=1 & 1<=p52] | [p92<=0 & 0<=p92]]]]]] & EX [[[p2<=1 & 1<=p2] & [p36<=0 & 0<=p36]]]]]]]]
abstracting: (0<=p36)
states: 429,981,697 (8)
abstracting: (p36<=0)
states: 394,149,889 (8)
abstracting: (1<=p2)
states: 35,831,808 (7)
abstracting: (p2<=1)
states: 429,981,697 (8)
.abstracting: (0<=p92)
states: 429,981,697 (8)
abstracting: (p92<=0)
states: 394,149,889 (8)
abstracting: (1<=p52)
states: 35,831,808 (7)
abstracting: (p52<=1)
states: 429,981,697 (8)
abstracting: (0<=p88)
states: 429,981,697 (8)
abstracting: (p88<=0)
states: 394,149,889 (8)
abstracting: (1<=p40)
states: 35,831,808 (7)
abstracting: (p40<=1)
states: 429,981,697 (8)
-> the formula is FALSE
FORMULA FlexibleBarrier-PT-08a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.288sec
checking: AG [E [[AX [~ [[[[p20<=0 & 0<=p20] | [p29<=1 & 1<=p29]] | [[p75<=0 & 0<=p75] | [p82<=1 & 1<=p82]]]]] & EX [[p29<=1 & 1<=p29]]] U AF [AG [[[p95<=0 & 0<=p95] | [p74<=1 & 1<=p74]]]]]]
normalized: ~ [E [true U ~ [E [[EX [[p29<=1 & 1<=p29]] & ~ [EX [[[[p82<=1 & 1<=p82] | [p75<=0 & 0<=p75]] | [[p29<=1 & 1<=p29] | [p20<=0 & 0<=p20]]]]]] U ~ [EG [E [true U ~ [[[p74<=1 & 1<=p74] | [p95<=0 & 0<=p95]]]]]]]]]]
abstracting: (0<=p95)
states: 429,981,697 (8)
abstracting: (p95<=0)
states: 394,149,889 (8)
abstracting: (1<=p74)
states: 35,831,808 (7)
abstracting: (p74<=1)
states: 429,981,697 (8)
EG iterations: 0
abstracting: (0<=p20)
states: 429,981,697 (8)
abstracting: (p20<=0)
states: 394,149,889 (8)
abstracting: (1<=p29)
states: 35,831,808 (7)
abstracting: (p29<=1)
states: 429,981,697 (8)
abstracting: (0<=p75)
states: 429,981,697 (8)
abstracting: (p75<=0)
states: 394,149,889 (8)
abstracting: (1<=p82)
states: 35,831,808 (7)
abstracting: (p82<=1)
states: 429,981,697 (8)
.abstracting: (1<=p29)
states: 35,831,808 (7)
abstracting: (p29<=1)
states: 429,981,697 (8)
.-> the formula is FALSE
FORMULA FlexibleBarrier-PT-08a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.219sec
checking: EF [EG [[[[p93<=0 & 0<=p93] & E [[[p28<=1 & 1<=p28] & [[p33<=0 & 0<=p33] | [p94<=1 & 1<=p94]]] U [~ [[p53<=0 & 0<=p53]] | [[p69<=0 & 0<=p69] & [p63<=1 & 1<=p63]]]]] & [[EX [[p66<=1 & 1<=p66]] | [p84<=1 & 1<=p84]] & [AG [[p66<=1 & 1<=p66]] | [[p63<=0 & 0<=p63] & [[p34<=1 & 1<=p34] & [p2<=0 & 0<=p2]]]]]]]]
normalized: E [true U EG [[[[[[[p34<=1 & 1<=p34] & [p2<=0 & 0<=p2]] & [p63<=0 & 0<=p63]] | ~ [E [true U ~ [[p66<=1 & 1<=p66]]]]] & [[p84<=1 & 1<=p84] | EX [[p66<=1 & 1<=p66]]]] & [E [[[[p94<=1 & 1<=p94] | [p33<=0 & 0<=p33]] & [p28<=1 & 1<=p28]] U [[[p63<=1 & 1<=p63] & [p69<=0 & 0<=p69]] | ~ [[p53<=0 & 0<=p53]]]] & [p93<=0 & 0<=p93]]]]]
abstracting: (0<=p93)
states: 429,981,697 (8)
abstracting: (p93<=0)
states: 394,149,889 (8)
abstracting: (0<=p53)
states: 429,981,697 (8)
abstracting: (p53<=0)
states: 394,149,889 (8)
abstracting: (0<=p69)
states: 429,981,697 (8)
abstracting: (p69<=0)
states: 394,149,889 (8)
abstracting: (1<=p63)
states: 35,831,808 (7)
abstracting: (p63<=1)
states: 429,981,697 (8)
abstracting: (1<=p28)
states: 35,831,808 (7)
abstracting: (p28<=1)
states: 429,981,697 (8)
abstracting: (0<=p33)
states: 429,981,697 (8)
abstracting: (p33<=0)
states: 394,149,889 (8)
abstracting: (1<=p94)
states: 35,831,808 (7)
abstracting: (p94<=1)
states: 429,981,697 (8)
abstracting: (1<=p66)
states: 35,831,808 (7)
abstracting: (p66<=1)
states: 429,981,697 (8)
.abstracting: (1<=p84)
states: 35,831,808 (7)
abstracting: (p84<=1)
states: 429,981,697 (8)
abstracting: (1<=p66)
states: 35,831,808 (7)
abstracting: (p66<=1)
states: 429,981,697 (8)
abstracting: (0<=p63)
states: 429,981,697 (8)
abstracting: (p63<=0)
states: 394,149,889 (8)
abstracting: (0<=p2)
states: 429,981,697 (8)
abstracting: (p2<=0)
states: 394,149,889 (8)
abstracting: (1<=p34)
states: 35,831,808 (7)
abstracting: (p34<=1)
states: 429,981,697 (8)
.
EG iterations: 1
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-08a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.586sec
checking: [EF [[EG [[~ [[p20<=0 & 0<=p20]] & ~ [[p87<=1 & 1<=p87]]]] | [[~ [[p25<=0 & 0<=p25]] & ~ [[p32<=1 & 1<=p32]]] | [EG [[~ [[p9<=0 & 0<=p9]] & ~ [[p73<=1 & 1<=p73]]]] & [[[~ [[p54<=0 & 0<=p54]] & ~ [[p19<=1 & 1<=p19]]] | ~ [[p31<=1 & 1<=p31]]] & AG [~ [[p24<=1 & 1<=p24]]]]]]]] & [EX [~ [E [EX [[p57<=1 & 1<=p57]] U EG [[[p46<=0 & 0<=p46] | [p26<=1 & 1<=p26]]]]]] | EG [AF [[p94<=0 & 0<=p94]]]]]
normalized: [[EG [~ [EG [~ [[p94<=0 & 0<=p94]]]]] | EX [~ [E [EX [[p57<=1 & 1<=p57]] U EG [[[p26<=1 & 1<=p26] | [p46<=0 & 0<=p46]]]]]]] & E [true U [[[[~ [E [true U [p24<=1 & 1<=p24]]] & [~ [[p31<=1 & 1<=p31]] | [~ [[p19<=1 & 1<=p19]] & ~ [[p54<=0 & 0<=p54]]]]] & EG [[~ [[p73<=1 & 1<=p73]] & ~ [[p9<=0 & 0<=p9]]]]] | [~ [[p32<=1 & 1<=p32]] & ~ [[p25<=0 & 0<=p25]]]] | EG [[~ [[p87<=1 & 1<=p87]] & ~ [[p20<=0 & 0<=p20]]]]]]]
abstracting: (0<=p20)
states: 429,981,697 (8)
abstracting: (p20<=0)
states: 394,149,889 (8)
abstracting: (1<=p87)
states: 35,831,808 (7)
abstracting: (p87<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (0<=p25)
states: 429,981,697 (8)
abstracting: (p25<=0)
states: 394,149,889 (8)
abstracting: (1<=p32)
states: 35,831,808 (7)
abstracting: (p32<=1)
states: 429,981,697 (8)
abstracting: (0<=p9)
states: 429,981,697 (8)
abstracting: (p9<=0)
states: 394,149,889 (8)
abstracting: (1<=p73)
states: 35,831,808 (7)
abstracting: (p73<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (0<=p54)
states: 429,981,697 (8)
abstracting: (p54<=0)
states: 394,149,889 (8)
abstracting: (1<=p19)
states: 35,831,808 (7)
abstracting: (p19<=1)
states: 429,981,697 (8)
abstracting: (1<=p31)
states: 35,831,808 (7)
abstracting: (p31<=1)
states: 429,981,697 (8)
abstracting: (1<=p24)
states: 35,831,808 (7)
abstracting: (p24<=1)
states: 429,981,697 (8)
abstracting: (0<=p46)
states: 429,981,697 (8)
abstracting: (p46<=0)
states: 394,149,889 (8)
abstracting: (1<=p26)
states: 35,831,808 (7)
abstracting: (p26<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (1<=p57)
states: 35,831,808 (7)
abstracting: (p57<=1)
states: 429,981,697 (8)
..abstracting: (0<=p94)
states: 429,981,697 (8)
abstracting: (p94<=0)
states: 394,149,889 (8)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-08a-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.015sec
checking: E [AF [[EG [[[[p60<=0 & 0<=p60] | [p84<=1 & 1<=p84]] & [p8<=0 & 0<=p8]]] & [EF [[[p3<=0 & 0<=p3] | [p28<=1 & 1<=p28]]] | [~ [[[p6<=0 & 0<=p6] | [p62<=1 & 1<=p62]]] | AX [[[p73<=0 & 0<=p73] | [p20<=1 & 1<=p20]]]]]]] U AF [~ [[[[[p38<=0 & 0<=p38] | [p91<=1 & 1<=p91]] & AF [[[p51<=0 & 0<=p51] | [p84<=1 & 1<=p84]]]] & [~ [AF [[p28<=1 & 1<=p28]]] & EG [EF [[p54<=1 & 1<=p54]]]]]]]]
normalized: E [~ [EG [~ [[[[~ [EX [~ [[[p20<=1 & 1<=p20] | [p73<=0 & 0<=p73]]]]] | ~ [[[p62<=1 & 1<=p62] | [p6<=0 & 0<=p6]]]] | E [true U [[p28<=1 & 1<=p28] | [p3<=0 & 0<=p3]]]] & EG [[[p8<=0 & 0<=p8] & [[p84<=1 & 1<=p84] | [p60<=0 & 0<=p60]]]]]]]] U ~ [EG [[[[[p91<=1 & 1<=p91] | [p38<=0 & 0<=p38]] & ~ [EG [~ [[[p84<=1 & 1<=p84] | [p51<=0 & 0<=p51]]]]]] & [EG [E [true U [p54<=1 & 1<=p54]]] & EG [~ [[p28<=1 & 1<=p28]]]]]]]]
abstracting: (1<=p28)
states: 35,831,808 (7)
abstracting: (p28<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (1<=p54)
states: 35,831,808 (7)
abstracting: (p54<=1)
states: 429,981,697 (8)
EG iterations: 0
abstracting: (0<=p51)
states: 429,981,697 (8)
abstracting: (p51<=0)
states: 394,149,889 (8)
abstracting: (1<=p84)
states: 35,831,808 (7)
abstracting: (p84<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (0<=p38)
states: 429,981,697 (8)
abstracting: (p38<=0)
states: 394,149,889 (8)
abstracting: (1<=p91)
states: 35,831,808 (7)
abstracting: (p91<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (0<=p60)
states: 429,981,697 (8)
abstracting: (p60<=0)
states: 394,149,889 (8)
abstracting: (1<=p84)
states: 35,831,808 (7)
abstracting: (p84<=1)
states: 429,981,697 (8)
abstracting: (0<=p8)
states: 429,981,697 (8)
abstracting: (p8<=0)
states: 394,149,889 (8)
.
EG iterations: 1
abstracting: (0<=p3)
states: 429,981,697 (8)
abstracting: (p3<=0)
states: 394,149,889 (8)
abstracting: (1<=p28)
states: 35,831,808 (7)
abstracting: (p28<=1)
states: 429,981,697 (8)
abstracting: (0<=p6)
states: 429,981,697 (8)
abstracting: (p6<=0)
states: 394,149,889 (8)
abstracting: (1<=p62)
states: 35,831,808 (7)
abstracting: (p62<=1)
states: 429,981,697 (8)
abstracting: (0<=p73)
states: 429,981,697 (8)
abstracting: (p73<=0)
states: 394,149,889 (8)
abstracting: (1<=p20)
states: 35,831,808 (7)
abstracting: (p20<=1)
states: 429,981,697 (8)
..
EG iterations: 1
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-08a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.352sec
checking: [EF [EG [[~ [[p89<=0 & 0<=p89]] & ~ [[p27<=1 & 1<=p27]]]]] & [E [EG [~ [[p89<=1 & 1<=p89]]] U ~ [AG [E [[[p58<=0 & 0<=p58] | [p55<=1 & 1<=p55]] U [[p35<=0 & 0<=p35] | [p84<=1 & 1<=p84]]]]]] | A [A [[[[[p17<=1 & 1<=p17] & [[p23<=0 & 0<=p23] | [p9<=1 & 1<=p9]]] | [p84<=0 & 0<=p84]] | [[p93<=1 & 1<=p93] | [p10<=0 & 0<=p10]]] U AG [EF [[p95<=0 & 0<=p95]]]] U [[p49<=1 & 1<=p49] | [p87<=1 & 1<=p87]]]]]
normalized: [[[~ [EG [~ [[[p87<=1 & 1<=p87] | [p49<=1 & 1<=p49]]]]] & ~ [E [~ [[[p87<=1 & 1<=p87] | [p49<=1 & 1<=p49]]] U [~ [[~ [EG [E [true U ~ [E [true U [p95<=0 & 0<=p95]]]]]] & ~ [E [E [true U ~ [E [true U [p95<=0 & 0<=p95]]]] U [~ [[[[p10<=0 & 0<=p10] | [p93<=1 & 1<=p93]] | [[p84<=0 & 0<=p84] | [[[p9<=1 & 1<=p9] | [p23<=0 & 0<=p23]] & [p17<=1 & 1<=p17]]]]] & E [true U ~ [E [true U [p95<=0 & 0<=p95]]]]]]]]] & ~ [[[p87<=1 & 1<=p87] | [p49<=1 & 1<=p49]]]]]]] | E [EG [~ [[p89<=1 & 1<=p89]]] U E [true U ~ [E [[[p55<=1 & 1<=p55] | [p58<=0 & 0<=p58]] U [[p84<=1 & 1<=p84] | [p35<=0 & 0<=p35]]]]]]] & E [true U EG [[~ [[p27<=1 & 1<=p27]] & ~ [[p89<=0 & 0<=p89]]]]]]
abstracting: (0<=p89)
states: 429,981,697 (8)
abstracting: (p89<=0)
states: 394,149,889 (8)
abstracting: (1<=p27)
states: 35,831,808 (7)
abstracting: (p27<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (0<=p35)
states: 429,981,697 (8)
abstracting: (p35<=0)
states: 394,149,889 (8)
abstracting: (1<=p84)
states: 35,831,808 (7)
abstracting: (p84<=1)
states: 429,981,697 (8)
abstracting: (0<=p58)
states: 429,981,697 (8)
abstracting: (p58<=0)
states: 394,149,889 (8)
abstracting: (1<=p55)
states: 35,831,808 (7)
abstracting: (p55<=1)
states: 429,981,697 (8)
abstracting: (1<=p89)
states: 35,831,808 (7)
abstracting: (p89<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (1<=p49)
states: 35,831,808 (7)
abstracting: (p49<=1)
states: 429,981,697 (8)
abstracting: (1<=p87)
states: 35,831,808 (7)
abstracting: (p87<=1)
states: 429,981,697 (8)
abstracting: (0<=p95)
states: 429,981,697 (8)
abstracting: (p95<=0)
states: 394,149,889 (8)
abstracting: (1<=p17)
states: 35,831,808 (7)
abstracting: (p17<=1)
states: 429,981,697 (8)
abstracting: (0<=p23)
states: 429,981,697 (8)
abstracting: (p23<=0)
states: 394,149,889 (8)
abstracting: (1<=p9)
states: 35,831,808 (7)
abstracting: (p9<=1)
states: 429,981,697 (8)
abstracting: (0<=p84)
states: 429,981,697 (8)
abstracting: (p84<=0)
states: 394,149,889 (8)
abstracting: (1<=p93)
states: 35,831,808 (7)
abstracting: (p93<=1)
states: 429,981,697 (8)
abstracting: (0<=p10)
states: 429,981,697 (8)
abstracting: (p10<=0)
states: 394,149,889 (8)
abstracting: (0<=p95)
states: 429,981,697 (8)
abstracting: (p95<=0)
states: 394,149,889 (8)
abstracting: (0<=p95)
states: 429,981,697 (8)
abstracting: (p95<=0)
states: 394,149,889 (8)
.
EG iterations: 1
abstracting: (1<=p49)
states: 35,831,808 (7)
abstracting: (p49<=1)
states: 429,981,697 (8)
abstracting: (1<=p87)
states: 35,831,808 (7)
abstracting: (p87<=1)
states: 429,981,697 (8)
abstracting: (1<=p49)
states: 35,831,808 (7)
abstracting: (p49<=1)
states: 429,981,697 (8)
abstracting: (1<=p87)
states: 35,831,808 (7)
abstracting: (p87<=1)
states: 429,981,697 (8)
.
EG iterations: 1
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-08a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.582sec
totally nodes used: 2919788 (2.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7223014 16908145 24131159
used/not used/entry size/cache size: 17002624 50106240 16 1024MB
basic ops cache: hits/miss/sum: 674207 1414293 2088500
used/not used/entry size/cache size: 2146857 14630359 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: 73146 152187 225333
used/not used/entry size/cache size: 150930 8237678 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 64474984
1 2384667
2 216224
3 29576
4 3144
5 246
6 22
7 1
8 0
9 0
>= 10 0
Total processing time: 0m10.156sec
BK_STOP 1678553685035
--------------------
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:1658 (9), effective:166 (0)
initing FirstDep: 0m 0.000sec
iterations count:178 (1), effective:0 (0)
iterations count:512 (2), effective:23 (0)
iterations count:464 (2), effective:12 (0)
iterations count:604 (3), effective:35 (0)
iterations count:179 (1), effective:1 (0)
iterations count:219 (1), effective:11 (0)
iterations count:219 (1), effective:11 (0)
iterations count:243 (1), effective:1 (0)
iterations count:219 (1), effective:11 (0)
iterations count:620 (3), effective:40 (0)
iterations count:290 (1), effective:13 (0)
iterations count:515 (2), effective:24 (0)
iterations count:178 (1), effective:0 (0)
iterations count:292 (1), effective:13 (0)
iterations count:178 (1), effective:0 (0)
iterations count:482 (2), effective:31 (0)
iterations count:180 (1), effective:1 (0)
iterations count:1162 (6), effective:69 (0)
iterations count:538 (3), effective:12 (0)
iterations count:526 (2), effective:28 (0)
iterations count:188 (1), effective:5 (0)
iterations count:524 (2), effective:23 (0)
iterations count:295 (1), effective:7 (0)
iterations count:547 (3), effective:37 (0)
iterations count:379 (2), effective:13 (0)
iterations count:265 (1), effective:1 (0)
iterations count:893 (5), effective:57 (0)
iterations count:178 (1), effective:0 (0)
iterations count:187 (1), effective:1 (0)
iterations count:187 (1), effective:1 (0)
iterations count:187 (1), effective:1 (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="FlexibleBarrier-PT-08a"
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 FlexibleBarrier-PT-08a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857300473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-08a.tgz
mv FlexibleBarrier-PT-08a 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 ;