About the Execution of Marcie+red for RefineWMG-PT-015016
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5718.468 | 14659.00 | 19722.00 | 397.80 | FTTTTFTTFTFTFFFT | 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-167889203500602.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-015016, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203500602
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.7K Feb 26 16:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 16:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 26 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 16:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 16:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 16:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 16:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 16:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 35K 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-015016-CTLFireability-00
FORMULA_NAME RefineWMG-PT-015016-CTLFireability-01
FORMULA_NAME RefineWMG-PT-015016-CTLFireability-02
FORMULA_NAME RefineWMG-PT-015016-CTLFireability-03
FORMULA_NAME RefineWMG-PT-015016-CTLFireability-04
FORMULA_NAME RefineWMG-PT-015016-CTLFireability-05
FORMULA_NAME RefineWMG-PT-015016-CTLFireability-06
FORMULA_NAME RefineWMG-PT-015016-CTLFireability-07
FORMULA_NAME RefineWMG-PT-015016-CTLFireability-08
FORMULA_NAME RefineWMG-PT-015016-CTLFireability-09
FORMULA_NAME RefineWMG-PT-015016-CTLFireability-10
FORMULA_NAME RefineWMG-PT-015016-CTLFireability-11
FORMULA_NAME RefineWMG-PT-015016-CTLFireability-12
FORMULA_NAME RefineWMG-PT-015016-CTLFireability-13
FORMULA_NAME RefineWMG-PT-015016-CTLFireability-14
FORMULA_NAME RefineWMG-PT-015016-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679170407420
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-015016
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:13:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 20:13:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:13:29] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-18 20:13:29] [INFO ] Transformed 79 places.
[2023-03-18 20:13:29] [INFO ] Transformed 63 transitions.
[2023-03-18 20:13:29] [INFO ] Parsed PT model containing 79 places and 63 transitions and 188 arcs in 94 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 58 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 10 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2023-03-18 20:13:29] [INFO ] Computed 32 place invariants in 9 ms
[2023-03-18 20:13:29] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
[2023-03-18 20:13:29] [INFO ] Invariant cache hit.
[2023-03-18 20:13:29] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-18 20:13:29] [INFO ] Invariant cache hit.
[2023-03-18 20:13:29] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-18 20:13:29] [INFO ] Invariant cache hit.
[2023-03-18 20:13:29] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 79/79 places, 63/63 transitions.
Support contains 58 out of 79 places after structural reductions.
[2023-03-18 20:13:29] [INFO ] Flatten gal took : 22 ms
[2023-03-18 20:13:29] [INFO ] Flatten gal took : 8 ms
[2023-03-18 20:13:29] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10013 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 49) seen :31
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-18 20:13:30] [INFO ] Invariant cache hit.
[2023-03-18 20:13:30] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-18 20:13:30] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-18 20:13:30] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-18 20:13:30] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-18 20:13:30] [INFO ] After 317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-18 20:13:31] [INFO ] After 523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Finished Parikh walk after 428 steps, including 0 resets, run visited all 18 properties in 5 ms. (steps per millisecond=85 )
Parikh walk visited 18 properties in 5 ms.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 7 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 7 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 63 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 39 edges and 79 vertex of which 26 / 79 are part of one of the 13 SCC in 2 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 53 transition count 38
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 1 with 39 rules applied. Total rules applied 52 place count 27 transition count 25
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 7 rules applied. Total rules applied 59 place count 27 transition count 18
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 66 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 20 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 17 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 16 transition count 14
Applied a total of 74 rules in 11 ms. Remains 16 /79 variables (removed 63) and now considering 14/63 (removed 49) transitions.
// Phase 1: matrix 14 rows 16 cols
[2023-03-18 20:13:31] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-18 20:13:31] [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 36 ms. Remains : 16/79 places, 14/63 transitions.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 42 edges and 79 vertex of which 28 / 79 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 51 transition count 36
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 56 place count 23 transition count 22
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 11 rules applied. Total rules applied 67 place count 23 transition count 11
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 78 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 78 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 80 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 82 place count 10 transition count 9
Applied a total of 82 rules in 6 ms. Remains 10 /79 variables (removed 69) and now considering 9/63 (removed 54) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-18 20:13:31] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-18 20:13:31] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 10/79 places, 9/63 transitions.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 44 edges and 79 vertex of which 30 / 79 are part of one of the 15 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 49 transition count 34
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 57 place count 21 transition count 20
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 12 rules applied. Total rules applied 69 place count 21 transition count 8
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 81 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 81 place count 9 transition count 7
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 83 place count 8 transition count 7
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 85 place count 7 transition count 6
Applied a total of 85 rules in 5 ms. Remains 7 /79 variables (removed 72) and now considering 6/63 (removed 57) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-18 20:13:31] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:13:31] [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 22 ms. Remains : 7/79 places, 6/63 transitions.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
FORMULA RefineWMG-PT-015016-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 19 edges and 79 vertex of which 10 / 79 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 69 transition count 54
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 32 place count 51 transition count 45
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 34 place count 51 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 49 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 36 place count 49 transition count 42
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 48 transition count 42
Applied a total of 38 rules in 8 ms. Remains 48 /79 variables (removed 31) and now considering 42/63 (removed 21) transitions.
// Phase 1: matrix 42 rows 48 cols
[2023-03-18 20:13:31] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-18 20:13:31] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 48/79 places, 42/63 transitions.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2023-03-18 20:13:31] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-18 20:13:31] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 20:13:31] [INFO ] Invariant cache hit.
[2023-03-18 20:13:31] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 20:13:31] [INFO ] Invariant cache hit.
[2023-03-18 20:13:31] [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 : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 20:13:31] [INFO ] Invariant cache hit.
[2023-03-18 20:13:31] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 33 edges and 79 vertex of which 22 / 79 are part of one of the 11 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 57 transition count 42
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 1 with 33 rules applied. Total rules applied 44 place count 35 transition count 31
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 49 place count 35 transition count 26
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 54 place count 30 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 54 place count 30 transition count 24
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 58 place count 28 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 27 transition count 23
Applied a total of 60 rules in 9 ms. Remains 27 /79 variables (removed 52) and now considering 23/63 (removed 40) transitions.
// Phase 1: matrix 23 rows 27 cols
[2023-03-18 20:13:31] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-18 20:13:31] [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 40 ms. Remains : 27/79 places, 23/63 transitions.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 44 edges and 79 vertex of which 30 / 79 are part of one of the 15 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 49 transition count 34
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 57 place count 21 transition count 20
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 13 rules applied. Total rules applied 70 place count 21 transition count 7
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 83 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 83 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 85 place count 7 transition count 6
Applied a total of 85 rules in 3 ms. Remains 7 /79 variables (removed 72) and now considering 6/63 (removed 57) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-18 20:13:31] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 20:13:31] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 7/79 places, 6/63 transitions.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
FORMULA RefineWMG-PT-015016-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2023-03-18 20:13:31] [INFO ] Computed 32 place invariants in 4 ms
[2023-03-18 20:13:31] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 20:13:31] [INFO ] Invariant cache hit.
[2023-03-18 20:13:31] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 20:13:31] [INFO ] Invariant cache hit.
[2023-03-18 20:13:31] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 20:13:31] [INFO ] Invariant cache hit.
[2023-03-18 20:13:31] [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 : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 20:13:31] [INFO ] Invariant cache hit.
[2023-03-18 20:13:31] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 9 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 20:13:31] [INFO ] Invariant cache hit.
[2023-03-18 20:13:31] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 63 transitions.
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:32] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-18 20:13:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 79 places, 63 transitions and 188 arcs took 1 ms.
Total runtime 2847 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: 79 NrTr: 63 NrArc: 188)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.713sec
RS generation: 0m 0.593sec
-> reachability set: #nodes 4204 (4.2e+03) #states 12,052,112,861,661,422,877,288,655,381,293,683,978,185,758 (43)
starting MCC model checker
--------------------------
checking: AX [EX [AG [1<=p7]]]
normalized: ~ [EX [~ [EX [~ [E [true U ~ [1<=p7]]]]]]]
abstracting: (1<=p7)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
..-> the formula is FALSE
FORMULA RefineWMG-PT-015016-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.119sec
checking: AX [EF [AX [AG [p25<=0]]]]
normalized: ~ [EX [~ [E [true U ~ [EX [E [true U ~ [p25<=0]]]]]]]]
abstracting: (p25<=0)
states: 708,947,815,391,848,404,546,391,493,017,275,528,128,574 (41)
..-> the formula is FALSE
FORMULA RefineWMG-PT-015016-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.196sec
checking: AX [AG [[1<=p62 & 1<=p7]]]
normalized: ~ [EX [E [true U ~ [[1<=p62 & 1<=p7]]]]]
abstracting: (1<=p7)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p62)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.-> the formula is FALSE
FORMULA RefineWMG-PT-015016-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: AG [EF [[p36<=0 | [p37<=0 | p39<=0]]]]
normalized: ~ [E [true U ~ [E [true U [p36<=0 | [p37<=0 | p39<=0]]]]]]
abstracting: (p39<=0)
states: 8,384,078,512,460,120,262,461,673,308,726,041,028,303,136 (42)
abstracting: (p37<=0)
states: 708,947,815,391,848,404,546,391,493,017,275,528,128,574 (41)
abstracting: (p36<=0)
states: 708,947,815,391,848,404,546,391,493,017,275,528,128,574 (41)
-> the formula is TRUE
FORMULA RefineWMG-PT-015016-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.037sec
checking: A [[[1<=p32 & 1<=p34] & 1<=p31] U AF [[1<=p65 | AF [AG [1<=p17]]]]]
normalized: [~ [EG [EG [~ [[1<=p65 | ~ [EG [E [true U ~ [1<=p17]]]]]]]]] & ~ [E [EG [~ [[1<=p65 | ~ [EG [E [true U ~ [1<=p17]]]]]]] U [~ [[1<=p31 & [1<=p32 & 1<=p34]]] & EG [~ [[1<=p65 | ~ [EG [E [true U ~ [1<=p17]]]]]]]]]]]
abstracting: (1<=p17)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
EG iterations: 0
abstracting: (1<=p65)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
abstracting: (1<=p34)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p32)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p31)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p17)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
EG iterations: 0
abstracting: (1<=p65)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
abstracting: (1<=p17)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
EG iterations: 0
abstracting: (1<=p65)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-015016-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.175sec
checking: [EG [[1<=p12 | EF [AG [p35<=0]]]] & E [[1<=p67 & [~ [AG [AF [1<=p28]]] & 1<=p52]] U EX [p32<=0]]]
normalized: [E [[1<=p67 & [1<=p52 & E [true U EG [~ [1<=p28]]]]] U EX [p32<=0]] & EG [[1<=p12 | E [true U ~ [E [true U ~ [p35<=0]]]]]]]
abstracting: (p35<=0)
states: 708,947,815,391,848,404,546,391,493,017,275,528,128,574 (41)
abstracting: (1<=p12)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
abstracting: (p32<=0)
states: 708,947,815,391,848,404,546,391,493,017,275,528,128,574 (41)
.abstracting: (1<=p28)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
abstracting: (1<=p52)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p67)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
-> the formula is TRUE
FORMULA RefineWMG-PT-015016-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.492sec
checking: E [1<=p52 U E [[EX [A [1<=p23 U 1<=p25]] & ~ [[1<=p38 | [1<=p40 | 1<=p55]]]] U ~ [EF [[1<=p45 | 1<=p33]]]]]
normalized: E [1<=p52 U E [[~ [[1<=p38 | [1<=p40 | 1<=p55]]] & EX [[~ [EG [~ [1<=p25]]] & ~ [E [~ [1<=p25] U [~ [1<=p23] & ~ [1<=p25]]]]]]] U ~ [E [true U [1<=p45 | 1<=p33]]]]]
abstracting: (1<=p33)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p45)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p25)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p23)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p25)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p25)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
.abstracting: (1<=p55)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p40)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p38)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p52)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
-> the formula is FALSE
FORMULA RefineWMG-PT-015016-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.186sec
checking: [EF [1<=p45] & EX [A [[~ [AX [1<=p13]] & ~ [[[1<=p22 | [1<=p0 & [1<=p76 & 1<=p77]]] & p55<=0]]] U 1<=p62]]]
normalized: [EX [[~ [EG [~ [1<=p62]]] & ~ [E [~ [1<=p62] U [~ [[~ [[p55<=0 & [1<=p22 | [1<=p0 & [1<=p76 & 1<=p77]]]]] & EX [~ [1<=p13]]]] & ~ [1<=p62]]]]]] & E [true U 1<=p45]]
abstracting: (1<=p45)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p62)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p13)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.abstracting: (1<=p77)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p76)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p0)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p22)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (p55<=0)
states: 708,947,815,391,848,404,546,391,493,017,275,528,128,574 (41)
abstracting: (1<=p62)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p62)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA RefineWMG-PT-015016-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.311sec
checking: AG [A [~ [[[[A [1<=p65 U 1<=p33] | AG [1<=p65]] & 1<=p0] & [1<=p76 & 1<=p77]]] U [AG [EX [1<=p47]] | 1<=p57]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[1<=p57 | ~ [E [true U ~ [EX [1<=p47]]]]]]]] & ~ [E [~ [[1<=p57 | ~ [E [true U ~ [EX [1<=p47]]]]]] U [[[1<=p76 & 1<=p77] & [1<=p0 & [~ [E [true U ~ [1<=p65]]] | [~ [EG [~ [1<=p33]]] & ~ [E [~ [1<=p33] U [~ [1<=p65] & ~ [1<=p33]]]]]]]] & ~ [[1<=p57 | ~ [E [true U ~ [EX [1<=p47]]]]]]]]]]]]]
abstracting: (1<=p47)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.abstracting: (1<=p57)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p33)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p65)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p33)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p33)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
abstracting: (1<=p65)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p0)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p77)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p76)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p47)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.abstracting: (1<=p57)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p47)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.abstracting: (1<=p57)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
-> the formula is TRUE
FORMULA RefineWMG-PT-015016-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.104sec
checking: AG [[EG [[1<=p50 & A [AF [[1<=p26 & [1<=p27 & 1<=p29]]] U AF [[1<=p11 & [1<=p12 & 1<=p14]]]]]] | [1<=p37 | [1<=p16 & [1<=p17 & 1<=p19]]]]]
normalized: ~ [E [true U ~ [[[1<=p37 | [1<=p16 & [1<=p17 & 1<=p19]]] | EG [[1<=p50 & [~ [EG [EG [~ [[1<=p11 & [1<=p12 & 1<=p14]]]]]] & ~ [E [EG [~ [[1<=p11 & [1<=p12 & 1<=p14]]]] U [EG [~ [[1<=p26 & [1<=p27 & 1<=p29]]]] & EG [~ [[1<=p11 & [1<=p12 & 1<=p14]]]]]]]]]]]]]]
abstracting: (1<=p14)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p12)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p11)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
abstracting: (1<=p29)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p27)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p26)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
abstracting: (1<=p14)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p12)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p11)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
abstracting: (1<=p14)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p12)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p11)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p50)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
abstracting: (1<=p19)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p17)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p16)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p37)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
-> the formula is FALSE
FORMULA RefineWMG-PT-015016-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.345sec
checking: AG [[AG [[EX [[1<=p13 | 1<=p62]] | [[[p56<=0 | p57<=0] | [p59<=0 | 1<=p5]] & A [1<=p5 U [1<=p6 & [1<=p7 & 1<=p9]]]]]] | [1<=p16 & [1<=p17 & 1<=p19]]]]
normalized: ~ [E [true U ~ [[[1<=p16 & [1<=p17 & 1<=p19]] | ~ [E [true U ~ [[[[~ [EG [~ [[1<=p6 & [1<=p7 & 1<=p9]]]]] & ~ [E [~ [[1<=p6 & [1<=p7 & 1<=p9]]] U [~ [1<=p5] & ~ [[1<=p6 & [1<=p7 & 1<=p9]]]]]]] & [[p59<=0 | 1<=p5] | [p56<=0 | p57<=0]]] | EX [[1<=p13 | 1<=p62]]]]]]]]]]
abstracting: (1<=p62)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p13)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.abstracting: (p57<=0)
states: 708,947,815,391,848,404,546,391,493,017,275,528,128,574 (41)
abstracting: (p56<=0)
states: 708,947,815,391,848,404,546,391,493,017,275,528,128,574 (41)
abstracting: (1<=p5)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (p59<=0)
states: 8,384,078,512,460,120,262,461,673,308,726,041,028,303,136 (42)
abstracting: (1<=p9)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p7)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p6)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p5)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p9)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p7)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p6)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p9)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p7)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p6)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
abstracting: (1<=p19)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p17)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p16)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
-> the formula is TRUE
FORMULA RefineWMG-PT-015016-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.279sec
checking: E [[[1<=p70 | EG [1<=p67]] | [AX [A [[1<=p11 & [1<=p12 & 1<=p14]] U 1<=p17]] | [1<=p25 | AG [[AF [[1<=p51 & [1<=p52 & 1<=p54]]] | AG [AF [1<=p13]]]]]]] U [1<=p51 & [1<=p52 & 1<=p54]]]
normalized: E [[[[1<=p25 | ~ [E [true U ~ [[~ [E [true U EG [~ [1<=p13]]]] | ~ [EG [~ [[1<=p51 & [1<=p52 & 1<=p54]]]]]]]]]] | ~ [EX [~ [[~ [EG [~ [1<=p17]]] & ~ [E [~ [1<=p17] U [~ [[1<=p11 & [1<=p12 & 1<=p14]]] & ~ [1<=p17]]]]]]]]] | [1<=p70 | EG [1<=p67]]] U [1<=p51 & [1<=p52 & 1<=p54]]]
abstracting: (1<=p54)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p52)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p51)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p67)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
abstracting: (1<=p70)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p17)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p14)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p12)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p11)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p17)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p17)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
.abstracting: (1<=p54)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p52)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p51)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
abstracting: (1<=p13)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
abstracting: (1<=p25)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
-> the formula is TRUE
FORMULA RefineWMG-PT-015016-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.524sec
checking: AG [[[[AX [1<=p58] | AG [[1<=p26 & [1<=p27 & 1<=p29]]]] | [p23<=0 | p71<=0]] | [[p72<=0 | p74<=0] | [~ [E [1<=p45 U [1<=p36 & [1<=p37 & 1<=p39]]]] | [1<=p31 & [1<=p32 & 1<=p34]]]]]]
normalized: ~ [E [true U ~ [[[[~ [E [true U ~ [[1<=p26 & [1<=p27 & 1<=p29]]]]] | ~ [EX [~ [1<=p58]]]] | [p23<=0 | p71<=0]] | [[p72<=0 | p74<=0] | [~ [E [1<=p45 U [1<=p36 & [1<=p37 & 1<=p39]]]] | [1<=p31 & [1<=p32 & 1<=p34]]]]]]]]
abstracting: (1<=p34)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p32)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p31)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p39)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p37)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p36)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p45)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (p74<=0)
states: 8,384,078,512,460,120,262,461,673,308,726,041,028,303,136 (42)
abstracting: (p72<=0)
states: 708,947,815,391,848,404,546,391,493,017,275,528,128,574 (41)
abstracting: (p71<=0)
states: 708,947,815,391,848,404,546,391,493,017,275,528,128,574 (41)
abstracting: (p23<=0)
states: 708,947,815,391,848,404,546,391,493,017,275,528,128,574 (41)
abstracting: (1<=p58)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.abstracting: (1<=p29)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p27)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p26)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
-> the formula is FALSE
FORMULA RefineWMG-PT-015016-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.535sec
checking: [E [[[[[~ [[1<=p31 & [1<=p32 & 1<=p34]]] & 2<=p1] & [2<=p2 & 1<=p42]] | EG [1<=p52]] | [EG [~ [[1<=p46 & [1<=p47 & 1<=p49]]]] | [E [[[AF [1<=p72] & 1<=p46] & [1<=p47 & 1<=p49]] U A [[1<=p56 & [1<=p57 & 1<=p59]] U 1<=p67]] | E [~ [[[1<=p67 & 1<=p6] & [1<=p7 & 1<=p9]]] U ~ [AG [1<=p38]]]]]] U [[EF [p30<=0] & 1<=p36] & [1<=p37 & [1<=p39 & 1<=p75]]]] & AG [EF [[EG [p62<=0] | AG [[[1<=p46 & 1<=p47] & [1<=p49 & 1<=p73]]]]]]]
normalized: [~ [E [true U ~ [E [true U [~ [E [true U ~ [[[1<=p49 & 1<=p73] & [1<=p46 & 1<=p47]]]]] | EG [p62<=0]]]]]] & E [[[[E [~ [[[1<=p7 & 1<=p9] & [1<=p67 & 1<=p6]]] U E [true U ~ [1<=p38]]] | E [[[1<=p47 & 1<=p49] & [1<=p46 & ~ [EG [~ [1<=p72]]]]] U [~ [EG [~ [1<=p67]]] & ~ [E [~ [1<=p67] U [~ [[1<=p56 & [1<=p57 & 1<=p59]]] & ~ [1<=p67]]]]]]] | EG [~ [[1<=p46 & [1<=p47 & 1<=p49]]]]] | [EG [1<=p52] | [[2<=p2 & 1<=p42] & [2<=p1 & ~ [[1<=p31 & [1<=p32 & 1<=p34]]]]]]] U [[1<=p37 & [1<=p39 & 1<=p75]] & [1<=p36 & E [true U p30<=0]]]]]
abstracting: (p30<=0)
states: 708,947,815,391,848,404,546,391,493,017,275,528,128,574 (41)
abstracting: (1<=p36)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p75)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p39)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p37)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p34)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p32)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p31)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (2<=p1)
states: 1,000,373,004,327,627,985,861,904,201,609,357,168,149,806 (42)
abstracting: (1<=p42)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (2<=p2)
states: 8,034,741,907,774,281,918,192,436,920,862,455,985,457,172 (42)
abstracting: (1<=p52)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
abstracting: (1<=p49)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p47)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p46)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
abstracting: (1<=p67)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p59)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p57)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p56)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p67)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p67)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
abstracting: (1<=p72)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.
EG iterations: 1
abstracting: (1<=p46)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p49)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p47)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p38)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p6)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p67)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p9)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (1<=p7)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (p62<=0)
states: 708,947,815,391,848,404,546,391,493,017,275,528,128,574 (41)
.
EG iterations: 1
abstracting: (1<=p47)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p46)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p73)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (1<=p49)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
-> the formula is TRUE
FORMULA RefineWMG-PT-015016-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.409sec
totally nodes used: 2847972 (2.8e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 11361491 11253252 22614743
used/not used/entry size/cache size: 12438263 54670601 16 1024MB
basic ops cache: hits/miss/sum: 2371043 2409017 4780060
used/not used/entry size/cache size: 3438113 13339103 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: 143422 144567 287989
used/not used/entry size/cache size: 143299 8245309 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 64309613
1 2757058
2 40622
3 1174
4 108
5 56
6 41
7 23
8 24
9 59
>= 10 86
Total processing time: 0m 8.880sec
BK_STOP 1679170422079
--------------------
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 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.000sec
iterations count:7427 (117), effective:2611 (41)
initing FirstDep: 0m 0.000sec
iterations count:95 (1), effective:16 (0)
iterations count:354 (5), effective:95 (1)
iterations count:95 (1), effective:16 (0)
iterations count:98 (1), effective:7 (0)
iterations count:153 (2), effective:30 (0)
iterations count:153 (2), effective:30 (0)
iterations count:98 (1), effective:7 (0)
iterations count:153 (2), effective:30 (0)
iterations count:418 (6), effective:119 (1)
iterations count:95 (1), effective:16 (0)
iterations count:150 (2), effective:29 (0)
iterations count:72 (1), effective:3 (0)
iterations count:95 (1), effective:16 (0)
iterations count:482 (7), effective:143 (2)
iterations count:77 (1), effective:6 (0)
iterations count:79 (1), effective:16 (0)
iterations count:79 (1), effective:16 (0)
iterations count:98 (1), effective:7 (0)
iterations count:209 (3), effective:44 (0)
iterations count:111 (1), effective:32 (0)
iterations count:84 (1), effective:7 (0)
iterations count:95 (1), effective:16 (0)
iterations count:98 (1), effective:7 (0)
iterations count:510 (8), effective:155 (2)
iterations count:414 (6), effective:119 (1)
iterations count:98 (1), effective:7 (0)
iterations count:774 (12), effective:252 (4)
iterations count:79 (1), effective:16 (0)
iterations count:98 (1), effective:7 (0)
iterations count:65 (1), effective:1 (0)
iterations count:95 (1), effective:16 (0)
iterations count:63 (1), effective:0 (0)
iterations count:734 (11), effective:239 (3)
iterations count:98 (1), effective:7 (0)
iterations count:153 (2), effective:30 (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-015016"
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-015016, 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-167889203500602"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-015016.tgz
mv RefineWMG-PT-015016 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 ;