About the Execution of Marcie+red for RefineWMG-PT-007007
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5482.128 | 9242.00 | 13780.00 | 370.50 | TTTTFFFTTFTTFTTF | 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-167889203400562.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-007007, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203400562
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.8K Feb 26 16:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 16:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 17K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 16:00 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 18K 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-007007-CTLFireability-00
FORMULA_NAME RefineWMG-PT-007007-CTLFireability-01
FORMULA_NAME RefineWMG-PT-007007-CTLFireability-02
FORMULA_NAME RefineWMG-PT-007007-CTLFireability-03
FORMULA_NAME RefineWMG-PT-007007-CTLFireability-04
FORMULA_NAME RefineWMG-PT-007007-CTLFireability-05
FORMULA_NAME RefineWMG-PT-007007-CTLFireability-06
FORMULA_NAME RefineWMG-PT-007007-CTLFireability-07
FORMULA_NAME RefineWMG-PT-007007-CTLFireability-08
FORMULA_NAME RefineWMG-PT-007007-CTLFireability-09
FORMULA_NAME RefineWMG-PT-007007-CTLFireability-10
FORMULA_NAME RefineWMG-PT-007007-CTLFireability-11
FORMULA_NAME RefineWMG-PT-007007-CTLFireability-12
FORMULA_NAME RefineWMG-PT-007007-CTLFireability-13
FORMULA_NAME RefineWMG-PT-007007-CTLFireability-14
FORMULA_NAME RefineWMG-PT-007007-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679170018991
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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-007007
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:07:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 20:07:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:07:00] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-18 20:07:00] [INFO ] Transformed 39 places.
[2023-03-18 20:07:00] [INFO ] Transformed 31 transitions.
[2023-03-18 20:07:00] [INFO ] Parsed PT model containing 39 places and 31 transitions and 92 arcs in 81 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 38 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 9 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2023-03-18 20:07:00] [INFO ] Computed 16 place invariants in 9 ms
[2023-03-18 20:07:00] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
[2023-03-18 20:07:00] [INFO ] Invariant cache hit.
[2023-03-18 20:07:00] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-18 20:07:00] [INFO ] Invariant cache hit.
[2023-03-18 20:07:00] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-18 20:07:00] [INFO ] Invariant cache hit.
[2023-03-18 20:07:00] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 341 ms. Remains : 39/39 places, 31/31 transitions.
Support contains 38 out of 39 places after structural reductions.
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 17 ms
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 6 ms
[2023-03-18 20:07:01] [INFO ] Input system was already deterministic with 31 transitions.
Support contains 36 out of 39 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 45) seen :41
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-18 20:07:01] [INFO ] Invariant cache hit.
[2023-03-18 20:07:01] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 6 ms
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:07:01] [INFO ] Input system was already deterministic with 31 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2023-03-18 20:07:01] [INFO ] Invariant cache hit.
[2023-03-18 20:07:01] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 39/39 places, 31/31 transitions.
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 7 ms
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:01] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 18 edges and 39 vertex of which 12 / 39 are part of one of the 6 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 27 transition count 20
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 24 place count 15 transition count 14
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 15 transition count 11
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 30 place count 12 transition count 10
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 32 place count 11 transition count 10
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 34 place count 10 transition count 9
Applied a total of 34 rules in 20 ms. Remains 10 /39 variables (removed 29) and now considering 9/31 (removed 22) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-18 20:07:01] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 20:07:01] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 10/39 places, 9/31 transitions.
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:01] [INFO ] Input system was already deterministic with 9 transitions.
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
FORMULA RefineWMG-PT-007007-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 0 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2023-03-18 20:07:01] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-18 20:07:01] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 39/39 places, 31/31 transitions.
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:01] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2023-03-18 20:07:01] [INFO ] Invariant cache hit.
[2023-03-18 20:07:01] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 39/39 places, 31/31 transitions.
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:01] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2023-03-18 20:07:01] [INFO ] Invariant cache hit.
[2023-03-18 20:07:01] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 39/39 places, 31/31 transitions.
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:01] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 8 edges and 39 vertex of which 4 / 39 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 35 transition count 28
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 14 place count 27 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 14 place count 27 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 25 transition count 22
Applied a total of 18 rules in 4 ms. Remains 25 /39 variables (removed 14) and now considering 22/31 (removed 9) transitions.
// Phase 1: matrix 22 rows 25 cols
[2023-03-18 20:07:01] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-18 20:07:01] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 25/39 places, 22/31 transitions.
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:01] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2023-03-18 20:07:01] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-18 20:07:01] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 39/39 places, 31/31 transitions.
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:01] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2023-03-18 20:07:01] [INFO ] Invariant cache hit.
[2023-03-18 20:07:01] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 39/39 places, 31/31 transitions.
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:01] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 18 edges and 39 vertex of which 12 / 39 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 27 transition count 20
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 24 place count 15 transition count 14
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 28 place count 15 transition count 10
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 32 place count 11 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 32 place count 11 transition count 9
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 34 place count 10 transition count 9
Applied a total of 34 rules in 3 ms. Remains 10 /39 variables (removed 29) and now considering 9/31 (removed 22) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-18 20:07:01] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 20:07:01] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 10/39 places, 9/31 transitions.
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:01] [INFO ] Input system was already deterministic with 9 transitions.
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
FORMULA RefineWMG-PT-007007-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 13 edges and 39 vertex of which 8 / 39 are part of one of the 4 SCC in 0 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 31 transition count 24
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 19 place count 21 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 1 with 1 rules applied. Total rules applied 20 place count 21 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 20 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 20 transition count 16
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 25 place count 18 transition count 16
Applied a total of 25 rules in 3 ms. Remains 18 /39 variables (removed 21) and now considering 16/31 (removed 15) transitions.
// Phase 1: matrix 16 rows 18 cols
[2023-03-18 20:07:01] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-18 20:07:01] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 18/39 places, 16/31 transitions.
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:01] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:01] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2023-03-18 20:07:01] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-18 20:07:02] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 39/39 places, 31/31 transitions.
[2023-03-18 20:07:02] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:02] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:02] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 17 edges and 39 vertex of which 10 / 39 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 29 transition count 22
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 26 place count 15 transition count 15
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 28 place count 15 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 30 place count 13 transition count 11
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 34 place count 11 transition count 11
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 36 place count 10 transition count 10
Applied a total of 36 rules in 3 ms. Remains 10 /39 variables (removed 29) and now considering 10/31 (removed 21) transitions.
// Phase 1: matrix 10 rows 10 cols
[2023-03-18 20:07:02] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 20:07:02] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 10/39 places, 10/31 transitions.
[2023-03-18 20:07:02] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:02] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:02] [INFO ] Input system was already deterministic with 10 transitions.
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
FORMULA RefineWMG-PT-007007-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2023-03-18 20:07:02] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-18 20:07:02] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 39/39 places, 31/31 transitions.
[2023-03-18 20:07:02] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:02] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:02] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2023-03-18 20:07:02] [INFO ] Invariant cache hit.
[2023-03-18 20:07:02] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 39/39 places, 31/31 transitions.
[2023-03-18 20:07:02] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:02] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:02] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 20 edges and 39 vertex of which 14 / 39 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 25 transition count 18
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 25 place count 13 transition count 12
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 30 place count 13 transition count 7
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 35 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 35 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 7 transition count 6
Applied a total of 37 rules in 2 ms. Remains 7 /39 variables (removed 32) and now considering 6/31 (removed 25) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-18 20:07:02] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:07:02] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 7/39 places, 6/31 transitions.
[2023-03-18 20:07:02] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:02] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:02] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
FORMULA RefineWMG-PT-007007-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 18 edges and 39 vertex of which 12 / 39 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 27 transition count 20
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 24 place count 15 transition count 14
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 29 place count 15 transition count 9
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 34 place count 10 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 9 transition count 8
Applied a total of 36 rules in 2 ms. Remains 9 /39 variables (removed 30) and now considering 8/31 (removed 23) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-18 20:07:02] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-18 20:07:02] [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 21 ms. Remains : 9/39 places, 8/31 transitions.
[2023-03-18 20:07:02] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:02] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:02] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-18 20:07:02] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:07:02] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:02] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-18 20:07:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 39 places, 31 transitions and 92 arcs took 1 ms.
Total runtime 1793 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=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 39 NrTr: 31 NrArc: 92)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.732sec
RS generation: 0m 0.042sec
-> reachability set: #nodes 954 (9.5e+02) #states 169,808,575,793,725,440 (17)
starting MCC model checker
--------------------------
checking: EF [AG [[1<=p0 & [1<=p36 & 1<=p37]]]]
normalized: E [true U ~ [E [true U ~ [[[1<=p36 & 1<=p37] & 1<=p0]]]]]
abstracting: (1<=p0)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p37)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p36)
states: 148,582,503,819,509,760 (17)
-> the formula is FALSE
FORMULA RefineWMG-PT-007007-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: AG [[EG [[1<=p37 | [AG [1<=p5] & AX [1<=p35]]]] | AX [[2<=p1 & 2<=p2]]]]
normalized: ~ [E [true U ~ [[~ [EX [~ [[2<=p1 & 2<=p2]]]] | EG [[[~ [EX [~ [1<=p35]]] & ~ [E [true U ~ [1<=p5]]]] | 1<=p37]]]]]]
abstracting: (1<=p37)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p5)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p35)
states: 148,582,503,819,509,760 (17)
..
EG iterations: 1
abstracting: (2<=p2)
states: 113,205,717,195,816,960 (17)
abstracting: (2<=p1)
states: 33,961,715,158,745,088 (16)
.-> the formula is FALSE
FORMULA RefineWMG-PT-007007-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: AX [E [EF [~ [[[3<=p3 | p38<=0] | 1<=p17]]] U EX [[E [1<=p5 U 3<=p3] | 5<=p4]]]]
normalized: ~ [EX [~ [E [E [true U ~ [[[3<=p3 | p38<=0] | 1<=p17]]] U EX [[5<=p4 | E [1<=p5 U 3<=p3]]]]]]]
abstracting: (3<=p3)
states: 84,904,287,896,862,720 (16)
abstracting: (1<=p5)
states: 148,582,503,819,509,760 (17)
abstracting: (5<=p4)
states: 1,187,472,557,998,080 (15)
.abstracting: (1<=p17)
states: 148,582,503,819,509,760 (17)
abstracting: (p38<=0)
states: 21,226,071,974,215,680 (16)
abstracting: (3<=p3)
states: 84,904,287,896,862,720 (16)
.-> the formula is TRUE
FORMULA RefineWMG-PT-007007-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.063sec
checking: AG [EF [[AG [1<=p27] & [E [1<=p27 U 1<=p5] & [1<=p7 | [1<=p11 & [1<=p12 & 1<=p14]]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[[[1<=p12 & 1<=p14] & 1<=p11] | 1<=p7] & E [1<=p27 U 1<=p5]] & ~ [E [true U ~ [1<=p27]]]]]]]]
abstracting: (1<=p27)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p5)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p27)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p7)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p11)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p14)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
-> the formula is FALSE
FORMULA RefineWMG-PT-007007-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.029sec
checking: E [[[~ [EX [1<=p8]] | AF [p10<=0]] | [1<=p5 | [1<=p13 | [1<=p0 & [1<=p36 & 1<=p37]]]]] U [1<=p11 & [1<=p12 & 1<=p14]]]
normalized: E [[[1<=p5 | [1<=p13 | [1<=p0 & [1<=p36 & 1<=p37]]]] | [~ [EG [~ [p10<=0]]] | ~ [EX [1<=p8]]]] U [1<=p11 & [1<=p12 & 1<=p14]]]
abstracting: (1<=p14)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p11)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p8)
states: 148,582,503,819,509,760 (17)
.abstracting: (p10<=0)
states: 21,226,071,974,215,680 (16)
.
EG iterations: 1
abstracting: (1<=p37)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p36)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p0)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p13)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p5)
states: 148,582,503,819,509,760 (17)
-> the formula is TRUE
FORMULA RefineWMG-PT-007007-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.057sec
checking: AG [AF [[p15<=0 | [[EG [p5<=0] & [AF [1<=p7] | [1<=p33 & [1<=p23 & [1<=p8 | 1<=p17]]]]] | [p8<=0 & [p26<=0 | [p27<=0 | p29<=0]]]]]]]
normalized: ~ [E [true U EG [~ [[p15<=0 | [[p8<=0 & [p26<=0 | [p27<=0 | p29<=0]]] | [[[1<=p33 & [1<=p23 & [1<=p8 | 1<=p17]]] | ~ [EG [~ [1<=p7]]]] & EG [p5<=0]]]]]]]]
abstracting: (p5<=0)
states: 21,226,071,974,215,680 (16)
.
EG iterations: 1
abstracting: (1<=p7)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
abstracting: (1<=p17)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p8)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p23)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p33)
states: 148,582,503,819,509,760 (17)
abstracting: (p29<=0)
states: 90,564,573,756,653,568 (16)
abstracting: (p27<=0)
states: 21,226,071,974,215,680 (16)
abstracting: (p26<=0)
states: 21,226,071,974,215,680 (16)
abstracting: (p8<=0)
states: 21,226,071,974,215,680 (16)
abstracting: (p15<=0)
states: 21,226,071,974,215,680 (16)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-007007-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.076sec
checking: EF [[[~ [E [[[1<=p31 & 1<=p32] & [1<=p34 & 1<=p33]] U [[1<=p26 & 1<=p27] & [1<=p29 & 1<=p18]]]] & AX [3<=p3]] & [AG [1<=p8] & AX [EG [EF [1<=p25]]]]]]
normalized: E [true U [[~ [EX [~ [EG [E [true U 1<=p25]]]]] & ~ [E [true U ~ [1<=p8]]]] & [~ [EX [~ [3<=p3]]] & ~ [E [[[1<=p34 & 1<=p33] & [1<=p31 & 1<=p32]] U [[1<=p29 & 1<=p18] & [1<=p26 & 1<=p27]]]]]]]
abstracting: (1<=p27)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p26)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p18)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p29)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p32)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p31)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p33)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p34)
states: 79,244,002,037,071,872 (16)
abstracting: (3<=p3)
states: 84,904,287,896,862,720 (16)
.abstracting: (1<=p8)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p25)
states: 148,582,503,819,509,760 (17)
EG iterations: 0
.-> the formula is FALSE
FORMULA RefineWMG-PT-007007-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.052sec
checking: [AG [[EF [1<=p28] | [EG [1<=p35] | EG [1<=p23]]]] | AF [[E [EX [[1<=p32 & 1<=p28]] U [AF [1<=p7] & [[1<=p18 & 1<=p32] | A [1<=p22 U [1<=p11 & [1<=p12 & 1<=p14]]]]]] & AG [AX [p28<=0]]]]]
normalized: [~ [EG [~ [[~ [E [true U EX [~ [p28<=0]]]] & E [EX [[1<=p32 & 1<=p28]] U [[[~ [EG [~ [[1<=p11 & [1<=p12 & 1<=p14]]]]] & ~ [E [~ [[1<=p11 & [1<=p12 & 1<=p14]]] U [~ [1<=p22] & ~ [[1<=p11 & [1<=p12 & 1<=p14]]]]]]] | [1<=p18 & 1<=p32]] & ~ [EG [~ [1<=p7]]]]]]]]] | ~ [E [true U ~ [[[EG [1<=p23] | EG [1<=p35]] | E [true U 1<=p28]]]]]]
abstracting: (1<=p28)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p35)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
abstracting: (1<=p23)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
abstracting: (1<=p7)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
abstracting: (1<=p32)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p18)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p14)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p11)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p22)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p14)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p11)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p14)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p11)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
abstracting: (1<=p28)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p32)
states: 148,582,503,819,509,760 (17)
.abstracting: (p28<=0)
states: 21,226,071,974,215,680 (16)
.
EG iterations: 0
-> the formula is TRUE
FORMULA RefineWMG-PT-007007-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.047sec
checking: [AF [1<=p35] | [~ [E [AX [[1<=p10 | [1<=p0 & [1<=p36 & 1<=p37]]]] U [E [1<=p17 U 1<=p33] & EG [1<=p37]]]] | [~ [A [[AG [1<=p10] | [1<=p37 & 1<=p22]] U [AF [1<=p18] & ~ [[1<=p21 & [1<=p22 & 1<=p24]]]]]] & EF [1<=p15]]]]
normalized: [[[E [true U 1<=p15] & ~ [[~ [EG [~ [[~ [[1<=p21 & [1<=p22 & 1<=p24]]] & ~ [EG [~ [1<=p18]]]]]]] & ~ [E [~ [[~ [[1<=p21 & [1<=p22 & 1<=p24]]] & ~ [EG [~ [1<=p18]]]]] U [~ [[[1<=p37 & 1<=p22] | ~ [E [true U ~ [1<=p10]]]]] & ~ [[~ [[1<=p21 & [1<=p22 & 1<=p24]]] & ~ [EG [~ [1<=p18]]]]]]]]]]] | ~ [E [~ [EX [~ [[1<=p10 | [1<=p0 & [1<=p36 & 1<=p37]]]]]] U [EG [1<=p37] & E [1<=p17 U 1<=p33]]]]] | ~ [EG [~ [1<=p35]]]]
abstracting: (1<=p35)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
abstracting: (1<=p33)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p17)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p37)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
abstracting: (1<=p37)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p36)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p0)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p10)
states: 148,582,503,819,509,760 (17)
.abstracting: (1<=p18)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
abstracting: (1<=p24)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p22)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p21)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p10)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p22)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p37)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p18)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
abstracting: (1<=p24)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p22)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p21)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p18)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
abstracting: (1<=p24)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p22)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p21)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
abstracting: (1<=p15)
states: 148,582,503,819,509,760 (17)
-> the formula is TRUE
FORMULA RefineWMG-PT-007007-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.071sec
checking: [AF [EX [[[AX [AF [1<=p12]] | p31<=0] | [p32<=0 | p34<=0]]]] & AG [E [[[~ [[1<=p18 | 1<=p13]] & AF [1<=p13]] | ~ [EG [[1<=p6 & [1<=p7 & 1<=p9]]]]] U [~ [[E [5<=p4 U 1<=p38] & AF [[1<=p11 & [1<=p12 & 1<=p14]]]]] & p7<=0]]]]
normalized: [~ [E [true U ~ [E [[~ [EG [[1<=p6 & [1<=p7 & 1<=p9]]]] | [~ [EG [~ [1<=p13]]] & ~ [[1<=p18 | 1<=p13]]]] U [p7<=0 & ~ [[~ [EG [~ [[1<=p11 & [1<=p12 & 1<=p14]]]]] & E [5<=p4 U 1<=p38]]]]]]]] & ~ [EG [~ [EX [[[p32<=0 | p34<=0] | [p31<=0 | ~ [EX [EG [~ [1<=p12]]]]]]]]]]]
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
.abstracting: (p31<=0)
states: 21,226,071,974,215,680 (16)
abstracting: (p34<=0)
states: 90,564,573,756,653,568 (16)
abstracting: (p32<=0)
states: 21,226,071,974,215,680 (16)
..
EG iterations: 1
abstracting: (1<=p38)
states: 148,582,503,819,509,760 (17)
abstracting: (5<=p4)
states: 1,187,472,557,998,080 (15)
abstracting: (1<=p14)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p11)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
abstracting: (p7<=0)
states: 21,226,071,974,215,680 (16)
abstracting: (1<=p13)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p18)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p13)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
abstracting: (1<=p9)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p7)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p6)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-007007-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.091sec
checking: EX [A [EF [1<=p10] U [A [1<=p23 U [1<=p11 & [1<=p12 & 1<=p14]]] | E [AX [[1<=p0 & [1<=p36 & 1<=p37]]] U [[1<=p31 & [1<=p32 & 1<=p34]] & [[1<=p6 & 1<=p7] & [1<=p9 & [1<=p32 | 1<=p15]]]]]]]]
normalized: EX [[~ [EG [~ [[E [~ [EX [~ [[1<=p0 & [1<=p36 & 1<=p37]]]]] U [[[1<=p9 & [1<=p32 | 1<=p15]] & [1<=p6 & 1<=p7]] & [1<=p31 & [1<=p32 & 1<=p34]]]] | [~ [EG [~ [[1<=p11 & [1<=p12 & 1<=p14]]]]] & ~ [E [~ [[1<=p11 & [1<=p12 & 1<=p14]]] U [~ [1<=p23] & ~ [[1<=p11 & [1<=p12 & 1<=p14]]]]]]]]]]] & ~ [E [~ [[E [~ [EX [~ [[1<=p0 & [1<=p36 & 1<=p37]]]]] U [[[1<=p9 & [1<=p32 | 1<=p15]] & [1<=p6 & 1<=p7]] & [1<=p31 & [1<=p32 & 1<=p34]]]] | [~ [EG [~ [[1<=p11 & [1<=p12 & 1<=p14]]]]] & ~ [E [~ [[1<=p11 & [1<=p12 & 1<=p14]]] U [~ [1<=p23] & ~ [[1<=p11 & [1<=p12 & 1<=p14]]]]]]]]] U [~ [[E [~ [EX [~ [[1<=p0 & [1<=p36 & 1<=p37]]]]] U [[[1<=p9 & [1<=p32 | 1<=p15]] & [1<=p6 & 1<=p7]] & [1<=p31 & [1<=p32 & 1<=p34]]]] | [~ [EG [~ [[1<=p11 & [1<=p12 & 1<=p14]]]]] & ~ [E [~ [[1<=p11 & [1<=p12 & 1<=p14]]] U [~ [1<=p23] & ~ [[1<=p11 & [1<=p12 & 1<=p14]]]]]]]]] & ~ [E [true U 1<=p10]]]]]]]
abstracting: (1<=p10)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p14)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p11)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p23)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p14)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p11)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p14)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p11)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
abstracting: (1<=p34)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p32)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p31)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p7)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p6)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p15)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p32)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p9)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p37)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p36)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p0)
states: 79,244,002,037,071,872 (16)
.abstracting: (1<=p14)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p11)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p23)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p14)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p11)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p14)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p11)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
abstracting: (1<=p34)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p32)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p31)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p7)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p6)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p15)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p32)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p9)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p37)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p36)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p0)
states: 79,244,002,037,071,872 (16)
.abstracting: (1<=p14)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p11)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p23)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p14)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p11)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p14)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p11)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
abstracting: (1<=p34)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p32)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p31)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p7)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p6)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p15)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p32)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p9)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p37)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p36)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p0)
states: 79,244,002,037,071,872 (16)
..
EG iterations: 1
.-> the formula is TRUE
FORMULA RefineWMG-PT-007007-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.068sec
checking: A [E [[AG [[EX [[1<=p21 & [1<=p22 & 1<=p24]]] | EF [1<=p13]]] | A [E [1<=p13 U 1<=p18] U 1<=p17]] U EF [[[1<=p12 | 1<=p5] | [~ [[[1<=p0 & 1<=p36] & [1<=p37 & 1<=p13]]] | [1<=p21 & [1<=p22 & 1<=p24]]]]]] U [[EX [EF [[1<=p11 & [1<=p12 & 1<=p14]]]] | [E [~ [[[p18<=0 & 1<=p20] & [1<=p26 & [1<=p27 & 1<=p29]]]] U p37<=0] | [[1<=p0 & [1<=p36 & 1<=p37]] & [[1<=p21 & 1<=p22] & [1<=p24 & p17<=0]]]]] & [1<=p27 | AX [A [~ [[1<=p6 & [1<=p7 & 1<=p9]]] U [1<=p10 | 1<=p33]]]]]]
normalized: [~ [EG [~ [[[1<=p27 | ~ [EX [~ [[~ [EG [~ [[1<=p10 | 1<=p33]]]] & ~ [E [~ [[1<=p10 | 1<=p33]] U [[1<=p6 & [1<=p7 & 1<=p9]] & ~ [[1<=p10 | 1<=p33]]]]]]]]]] & [[[[[1<=p24 & p17<=0] & [1<=p21 & 1<=p22]] & [1<=p0 & [1<=p36 & 1<=p37]]] | E [~ [[[1<=p26 & [1<=p27 & 1<=p29]] & [p18<=0 & 1<=p20]]] U p37<=0]] | EX [E [true U [1<=p11 & [1<=p12 & 1<=p14]]]]]]]]] & ~ [E [~ [[[1<=p27 | ~ [EX [~ [[~ [EG [~ [[1<=p10 | 1<=p33]]]] & ~ [E [~ [[1<=p10 | 1<=p33]] U [[1<=p6 & [1<=p7 & 1<=p9]] & ~ [[1<=p10 | 1<=p33]]]]]]]]]] & [[[[[1<=p24 & p17<=0] & [1<=p21 & 1<=p22]] & [1<=p0 & [1<=p36 & 1<=p37]]] | E [~ [[[1<=p26 & [1<=p27 & 1<=p29]] & [p18<=0 & 1<=p20]]] U p37<=0]] | EX [E [true U [1<=p11 & [1<=p12 & 1<=p14]]]]]]] U [~ [E [[[~ [EG [~ [1<=p17]]] & ~ [E [~ [1<=p17] U [~ [E [1<=p13 U 1<=p18]] & ~ [1<=p17]]]]] | ~ [E [true U ~ [[E [true U 1<=p13] | EX [[1<=p21 & [1<=p22 & 1<=p24]]]]]]]] U E [true U [[[1<=p21 & [1<=p22 & 1<=p24]] | ~ [[[1<=p37 & 1<=p13] & [1<=p0 & 1<=p36]]]] | [1<=p12 | 1<=p5]]]]] & ~ [[[1<=p27 | ~ [EX [~ [[~ [EG [~ [[1<=p10 | 1<=p33]]]] & ~ [E [~ [[1<=p10 | 1<=p33]] U [[1<=p6 & [1<=p7 & 1<=p9]] & ~ [[1<=p10 | 1<=p33]]]]]]]]]] & [[[[[1<=p24 & p17<=0] & [1<=p21 & 1<=p22]] & [1<=p0 & [1<=p36 & 1<=p37]]] | E [~ [[[1<=p26 & [1<=p27 & 1<=p29]] & [p18<=0 & 1<=p20]]] U p37<=0]] | EX [E [true U [1<=p11 & [1<=p12 & 1<=p14]]]]]]]]]]]
abstracting: (1<=p14)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p11)
states: 148,582,503,819,509,760 (17)
.abstracting: (p37<=0)
states: 21,226,071,974,215,680 (16)
abstracting: (1<=p20)
states: 148,582,503,819,509,760 (17)
abstracting: (p18<=0)
states: 21,226,071,974,215,680 (16)
abstracting: (1<=p29)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p27)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p26)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p37)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p36)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p0)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p22)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p21)
states: 148,582,503,819,509,760 (17)
abstracting: (p17<=0)
states: 21,226,071,974,215,680 (16)
abstracting: (1<=p24)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p33)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p10)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p9)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p7)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p6)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p33)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p10)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p33)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p10)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
.abstracting: (1<=p27)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p5)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p36)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p0)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p13)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p37)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p24)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p22)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p21)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p24)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p22)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p21)
states: 148,582,503,819,509,760 (17)
.abstracting: (1<=p13)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p17)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p18)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p13)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p17)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p17)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
abstracting: (1<=p14)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p11)
states: 148,582,503,819,509,760 (17)
.abstracting: (p37<=0)
states: 21,226,071,974,215,680 (16)
abstracting: (1<=p20)
states: 148,582,503,819,509,760 (17)
abstracting: (p18<=0)
states: 21,226,071,974,215,680 (16)
abstracting: (1<=p29)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p27)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p26)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p37)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p36)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p0)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p22)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p21)
states: 148,582,503,819,509,760 (17)
abstracting: (p17<=0)
states: 21,226,071,974,215,680 (16)
abstracting: (1<=p24)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p33)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p10)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p9)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p7)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p6)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p33)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p10)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p33)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p10)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
.abstracting: (1<=p27)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p14)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p12)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p11)
states: 148,582,503,819,509,760 (17)
.abstracting: (p37<=0)
states: 21,226,071,974,215,680 (16)
abstracting: (1<=p20)
states: 148,582,503,819,509,760 (17)
abstracting: (p18<=0)
states: 21,226,071,974,215,680 (16)
abstracting: (1<=p29)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p27)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p26)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p37)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p36)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p0)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p22)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p21)
states: 148,582,503,819,509,760 (17)
abstracting: (p17<=0)
states: 21,226,071,974,215,680 (16)
abstracting: (1<=p24)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p33)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p10)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p9)
states: 79,244,002,037,071,872 (16)
abstracting: (1<=p7)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p6)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p33)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p10)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p33)
states: 148,582,503,819,509,760 (17)
abstracting: (1<=p10)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
.abstracting: (1<=p27)
states: 148,582,503,819,509,760 (17)
.
EG iterations: 1
-> the formula is TRUE
FORMULA RefineWMG-PT-007007-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.054sec
totally nodes used: 469585 (4.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1450060 1457084 2907144
used/not used/entry size/cache size: 1822807 65286057 16 1024MB
basic ops cache: hits/miss/sum: 487153 483213 970366
used/not used/entry size/cache size: 905792 15871424 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: 24510 24901 49411
used/not used/entry size/cache size: 24886 8363722 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 66647239
1 457613
2 3369
3 289
4 62
5 42
6 37
7 50
8 25
9 61
>= 10 77
Total processing time: 0m 5.010sec
BK_STOP 1679170028233
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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.001sec
iterations count:2627 (84), effective:955 (30)
initing FirstDep: 0m 0.000sec
iterations count:45 (1), effective:7 (0)
iterations count:38 (1), effective:7 (0)
iterations count:48 (1), effective:8 (0)
iterations count:619 (19), effective:214 (6)
iterations count:98 (3), effective:23 (0)
iterations count:82 (2), effective:20 (0)
iterations count:94 (3), effective:21 (0)
iterations count:114 (3), effective:23 (0)
iterations count:31 (1), effective:0 (0)
iterations count:143 (4), effective:42 (1)
iterations count:200 (6), effective:66 (2)
iterations count:235 (7), effective:76 (2)
iterations count:38 (1), effective:7 (0)
iterations count:226 (7), effective:71 (2)
iterations count:40 (1), effective:3 (0)
iterations count:94 (3), effective:21 (0)
iterations count:64 (2), effective:14 (0)
iterations count:31 (1), effective:0 (0)
iterations count:40 (1), effective:3 (0)
iterations count:34 (1), effective:2 (0)
iterations count:38 (1), effective:7 (0)
iterations count:192 (6), effective:70 (2)
iterations count:162 (5), effective:47 (1)
iterations count:33 (1), effective:1 (0)
iterations count:87 (2), effective:21 (0)
iterations count:111 (3), effective:23 (0)
iterations count:138 (4), effective:35 (1)
iterations count:45 (1), effective:7 (0)
iterations count:323 (10), effective:111 (3)
iterations count:45 (1), effective:7 (0)
iterations count:323 (10), effective:111 (3)
iterations count:45 (1), effective:7 (0)
iterations count:323 (10), effective:111 (3)
iterations count:136 (4), effective:35 (1)
iterations count:45 (1), effective:7 (0)
iterations count:33 (1), effective:2 (0)
iterations count:38 (1), effective:3 (0)
iterations count:38 (1), effective:3 (0)
iterations count:40 (1), effective:3 (0)
iterations count:31 (1), effective:0 (0)
iterations count:136 (4), effective:35 (1)
iterations count:45 (1), effective:7 (0)
iterations count:33 (1), effective:2 (0)
iterations count:136 (4), effective:35 (1)
iterations count:45 (1), effective:7 (0)
iterations count:33 (1), effective:2 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-007007"
export BK_EXAMINATION="CTLFireability"
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-007007, examination is CTLFireability"
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-167889203400562"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-007007.tgz
mv RefineWMG-PT-007007 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;