About the Execution of Marcie+red for Raft-PT-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5449.376 | 9046.00 | 13074.00 | 382.20 | TFFFFTTTTFFFTTTF | 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-167889203100290.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 Raft-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203100290
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.8K Feb 26 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 17:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 17:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 26 17:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 13K 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 Raft-PT-02-CTLFireability-00
FORMULA_NAME Raft-PT-02-CTLFireability-01
FORMULA_NAME Raft-PT-02-CTLFireability-02
FORMULA_NAME Raft-PT-02-CTLFireability-03
FORMULA_NAME Raft-PT-02-CTLFireability-04
FORMULA_NAME Raft-PT-02-CTLFireability-05
FORMULA_NAME Raft-PT-02-CTLFireability-06
FORMULA_NAME Raft-PT-02-CTLFireability-07
FORMULA_NAME Raft-PT-02-CTLFireability-08
FORMULA_NAME Raft-PT-02-CTLFireability-09
FORMULA_NAME Raft-PT-02-CTLFireability-10
FORMULA_NAME Raft-PT-02-CTLFireability-11
FORMULA_NAME Raft-PT-02-CTLFireability-12
FORMULA_NAME Raft-PT-02-CTLFireability-13
FORMULA_NAME Raft-PT-02-CTLFireability-14
FORMULA_NAME Raft-PT-02-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679139753918
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=Raft-PT-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 11:42:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 11:42:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 11:42:35] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-18 11:42:35] [INFO ] Transformed 28 places.
[2023-03-18 11:42:35] [INFO ] Transformed 52 transitions.
[2023-03-18 11:42:35] [INFO ] Found NUPN structural information;
[2023-03-18 11:42:35] [INFO ] Parsed PT model containing 28 places and 52 transitions and 159 arcs in 81 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Support contains 28 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Applied a total of 0 rules in 9 ms. Remains 28 /28 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-18 11:42:35] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
// Phase 1: matrix 36 rows 28 cols
[2023-03-18 11:42:35] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-18 11:42:35] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-18 11:42:35] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
[2023-03-18 11:42:35] [INFO ] Invariant cache hit.
[2023-03-18 11:42:35] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-18 11:42:35] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-18 11:42:35] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
[2023-03-18 11:42:35] [INFO ] Invariant cache hit.
[2023-03-18 11:42:35] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 28/28 places, 42/42 transitions.
Support contains 28 out of 28 places after structural reductions.
[2023-03-18 11:42:36] [INFO ] Flatten gal took : 19 ms
[2023-03-18 11:42:36] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:42:36] [INFO ] Input system was already deterministic with 42 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 60) seen :53
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2023-03-18 11:42:36] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
[2023-03-18 11:42:36] [INFO ] Invariant cache hit.
[2023-03-18 11:42:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-18 11:42:36] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-18 11:42:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-18 11:42:36] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-18 11:42:36] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-18 11:42:37] [INFO ] After 7ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-03-18 11:42:37] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-18 11:42:37] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 42/42 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 28 transition count 39
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 26 transition count 35
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 26 transition count 35
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 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 15 place count 22 transition count 31
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 20 transition count 29
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 20 transition count 29
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 20 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 20 transition count 25
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 18 transition count 23
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 18 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 18 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 17 transition count 20
Applied a total of 30 rules in 15 ms. Remains 17 /28 variables (removed 11) and now considering 20/42 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 17/28 places, 20/42 transitions.
Finished random walk after 75 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=75 )
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:42:37] [INFO ] Input system was already deterministic with 42 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 28/28 places, 42/42 transitions.
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:42:37] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 26 transition count 38
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 26 transition count 38
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 26 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 24 transition count 34
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 23 transition count 33
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 23 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 23 transition count 32
Applied a total of 13 rules in 6 ms. Remains 23 /28 variables (removed 5) and now considering 32/42 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 23/28 places, 32/42 transitions.
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 27 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 40
Applied a total of 2 rules in 1 ms. Remains 27 /28 variables (removed 1) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/28 places, 40/42 transitions.
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 27 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 40
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 0 with 2 rules applied. Total rules applied 4 place count 26 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 25 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 25 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 25 transition count 37
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 25 transition count 36
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 1 with 2 rules applied. Total rules applied 10 place count 24 transition count 35
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 23 transition count 34
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 23 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 23 transition count 33
Applied a total of 13 rules in 8 ms. Remains 23 /28 variables (removed 5) and now considering 33/42 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 23/28 places, 33/42 transitions.
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 11:42:37] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 42/42 transitions.
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 27 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 40
Applied a total of 2 rules in 3 ms. Remains 27 /28 variables (removed 1) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 27/28 places, 40/42 transitions.
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 27 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 40
Applied a total of 2 rules in 1 ms. Remains 27 /28 variables (removed 1) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/28 places, 40/42 transitions.
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 27 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 40
Applied a total of 2 rules in 1 ms. Remains 27 /28 variables (removed 1) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/28 places, 40/42 transitions.
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 26 transition count 38
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 26 transition count 38
Applied a total of 4 rules in 1 ms. Remains 26 /28 variables (removed 2) and now considering 38/42 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 26/28 places, 38/42 transitions.
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:42:37] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 26 transition count 38
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 26 transition count 38
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 0 with 2 rules applied. Total rules applied 6 place count 25 transition count 37
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 24 transition count 36
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 24 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 24 transition count 35
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 24 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 22 transition count 31
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 21 transition count 30
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 21 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 21 transition count 29
Applied a total of 18 rules in 9 ms. Remains 21 /28 variables (removed 7) and now considering 29/42 (removed 13) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 21/28 places, 29/42 transitions.
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 27 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 40
Applied a total of 2 rules in 2 ms. Remains 27 /28 variables (removed 1) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 27/28 places, 40/42 transitions.
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 26 transition count 38
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 26 transition count 38
Applied a total of 4 rules in 1 ms. Remains 26 /28 variables (removed 2) and now considering 38/42 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 26/28 places, 38/42 transitions.
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 28/28 places, 42/42 transitions.
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 28/28 places, 42/42 transitions.
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:37] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 26 transition count 38
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 26 transition count 38
Applied a total of 4 rules in 1 ms. Remains 26 /28 variables (removed 2) and now considering 38/42 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 26/28 places, 38/42 transitions.
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 11:42:37] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 26 transition count 38
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 26 transition count 38
Applied a total of 4 rules in 1 ms. Remains 26 /28 variables (removed 2) and now considering 38/42 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 26/28 places, 38/42 transitions.
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 1 ms
[2023-03-18 11:42:37] [INFO ] Input system was already deterministic with 38 transitions.
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:42:37] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:42:37] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-18 11:42:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 28 places, 42 transitions and 139 arcs took 1 ms.
Total runtime 2016 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: 28 NrTr: 42 NrArc: 139)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.740sec
RS generation: 0m 0.010sec
-> reachability set: #nodes 302 (3.0e+02) #states 7,381 (3)
starting MCC model checker
--------------------------
checking: AF [EX [[p20<=1 & 1<=p20]]]
normalized: ~ [EG [~ [EX [[p20<=1 & 1<=p20]]]]]
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
..
EG iterations: 1
-> the formula is TRUE
FORMULA Raft-PT-02-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AF [AG [[[p2<=1 & 1<=p2] & [p20<=1 & 1<=p20]]]]
normalized: ~ [EG [E [true U ~ [[[p20<=1 & 1<=p20] & [p2<=1 & 1<=p2]]]]]]
abstracting: (1<=p2)
states: 1,220 (3)
abstracting: (p2<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA Raft-PT-02-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AX [[EG [EF [[p26<=1 & 1<=p26]]] & [p14<=0 & 0<=p14]]]
normalized: ~ [EX [~ [[[p14<=0 & 0<=p14] & EG [E [true U [p26<=1 & 1<=p26]]]]]]]
abstracting: (1<=p26)
states: 1,845 (3)
abstracting: (p26<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (0<=p14)
states: 7,381 (3)
abstracting: (p14<=0)
states: 6,161 (3)
.-> the formula is TRUE
FORMULA Raft-PT-02-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: EG [AX [EG [AF [[[p9<=0 & 0<=p9] | [p15<=0 & 0<=p15]]]]]]
normalized: EG [~ [EX [~ [EG [~ [EG [~ [[[p15<=0 & 0<=p15] | [p9<=0 & 0<=p9]]]]]]]]]]
abstracting: (0<=p9)
states: 7,381 (3)
abstracting: (p9<=0)
states: 6,161 (3)
abstracting: (0<=p15)
states: 7,381 (3)
abstracting: (p15<=0)
states: 4,881 (3)
.
EG iterations: 1
.
EG iterations: 1
...
EG iterations: 2
-> the formula is FALSE
FORMULA Raft-PT-02-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EF [[AG [E [EF [[p26<=1 & 1<=p26]] U [[p10<=1 & 1<=p10] & [p20<=1 & 1<=p20]]]] & [EG [AG [EF [[[p16<=1 & 1<=p16] & [p27<=1 & 1<=p27]]]]] | [[p22<=1 & 1<=p22] & [p25<=1 & 1<=p25]]]]]
normalized: E [true U [~ [E [true U ~ [E [E [true U [p26<=1 & 1<=p26]] U [[p20<=1 & 1<=p20] & [p10<=1 & 1<=p10]]]]]] & [[[p25<=1 & 1<=p25] & [p22<=1 & 1<=p22]] | EG [~ [E [true U ~ [E [true U [[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]]]]]]]]]]
abstracting: (1<=p16)
states: 1,220 (3)
abstracting: (p16<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p22)
states: 1,476 (3)
abstracting: (p22<=1)
states: 7,381 (3)
abstracting: (1<=p25)
states: 1,845 (3)
abstracting: (p25<=1)
states: 7,381 (3)
abstracting: (1<=p10)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p26)
states: 1,845 (3)
abstracting: (p26<=1)
states: 7,381 (3)
-> the formula is FALSE
FORMULA Raft-PT-02-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: AX [EX [[AX [[p0<=1 & 1<=p0]] & [A [~ [[p12<=1 & 1<=p12]] U [[[p5<=1 & 1<=p5] & [p15<=1 & 1<=p15]] & [[p9<=1 & 1<=p9] & [p15<=1 & 1<=p15]]]] & EG [EF [[p11<=1 & 1<=p11]]]]]]]
normalized: ~ [EX [~ [EX [[[[~ [EG [~ [[[[p15<=1 & 1<=p15] & [p9<=1 & 1<=p9]] & [[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]]] & ~ [E [~ [[[[p15<=1 & 1<=p15] & [p9<=1 & 1<=p9]] & [[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]] U [~ [[[[p15<=1 & 1<=p15] & [p9<=1 & 1<=p9]] & [[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]] & [p12<=1 & 1<=p12]]]]] & EG [E [true U [p11<=1 & 1<=p11]]]] & ~ [EX [~ [[p0<=1 & 1<=p0]]]]]]]]]
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 7,381 (3)
.abstracting: (1<=p11)
states: 1,220 (3)
abstracting: (p11<=1)
states: 7,381 (3)
EG iterations: 0
abstracting: (1<=p12)
states: 1,220 (3)
abstracting: (p12<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p9)
states: 1,220 (3)
abstracting: (p9<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p9)
states: 1,220 (3)
abstracting: (p9<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p9)
states: 1,220 (3)
abstracting: (p9<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
.
EG iterations: 1
..-> the formula is FALSE
FORMULA Raft-PT-02-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: AF [[~ [A [[AG [[p14<=1 & 1<=p14]] | ~ [[[p12<=1 & 1<=p12] | [[p16<=1 & 1<=p16] & [p27<=1 & 1<=p27]]]]] U [[p1<=1 & 1<=p1] & [p20<=1 & 1<=p20]]]] | [[p8<=1 & 1<=p8] & [p15<=1 & 1<=p15]]]]
normalized: ~ [EG [~ [[[[p15<=1 & 1<=p15] & [p8<=1 & 1<=p8]] | ~ [[~ [EG [~ [[[p20<=1 & 1<=p20] & [p1<=1 & 1<=p1]]]]] & ~ [E [~ [[[p20<=1 & 1<=p20] & [p1<=1 & 1<=p1]]] U [~ [[~ [[[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]] | [p12<=1 & 1<=p12]]] | ~ [E [true U ~ [[p14<=1 & 1<=p14]]]]]] & ~ [[[p20<=1 & 1<=p20] & [p1<=1 & 1<=p1]]]]]]]]]]]]
abstracting: (1<=p1)
states: 1,220 (3)
abstracting: (p1<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (1<=p12)
states: 1,220 (3)
abstracting: (p12<=1)
states: 7,381 (3)
abstracting: (1<=p16)
states: 1,220 (3)
abstracting: (p16<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
abstracting: (1<=p1)
states: 1,220 (3)
abstracting: (p1<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p1)
states: 1,220 (3)
abstracting: (p1<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p8)
states: 1,220 (3)
abstracting: (p8<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Raft-PT-02-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: E [~ [AG [[[[[AF [[1<=p19 & p19<=1]] & [p12<=1 & 1<=p12]] & [[p16<=1 & 1<=p16] & [p27<=1 & 1<=p27]]] | [[p13<=1 & 1<=p13] & [p27<=1 & 1<=p27]]] | [[[p5<=1 & 1<=p5] & [p15<=1 & 1<=p15]] | [[p10<=1 & 1<=p10] & [p20<=1 & 1<=p20]]]]]] U [p12<=1 & 1<=p12]]
normalized: E [E [true U ~ [[[[[p20<=1 & 1<=p20] & [p10<=1 & 1<=p10]] | [[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]] | [[[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]] | [[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]] & [[p12<=1 & 1<=p12] & ~ [EG [~ [[1<=p19 & p19<=1]]]]]]]]]] U [p12<=1 & 1<=p12]]
abstracting: (1<=p12)
states: 1,220 (3)
abstracting: (p12<=1)
states: 7,381 (3)
abstracting: (p19<=1)
states: 7,381 (3)
abstracting: (1<=p19)
states: 1,220 (3)
.
EG iterations: 1
abstracting: (1<=p12)
states: 1,220 (3)
abstracting: (p12<=1)
states: 7,381 (3)
abstracting: (1<=p16)
states: 1,220 (3)
abstracting: (p16<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
abstracting: (1<=p13)
states: 1,220 (3)
abstracting: (p13<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p10)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
-> the formula is TRUE
FORMULA Raft-PT-02-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AF [[~ [E [EF [[[p19<=1 & 1<=p19] | [p20<=1 & 1<=p20]]] U [[EF [[p20<=1 & 1<=p20]] & [[p1<=1 & 1<=p1] & [p20<=1 & 1<=p20]]] | A [[[p10<=1 & 1<=p10] & [p20<=1 & 1<=p20]] U [[p10<=1 & 1<=p10] & [p20<=1 & 1<=p20]]]]]] | EF [AG [[[p5<=0 & 0<=p5] | [p15<=0 & 0<=p15]]]]]]
normalized: ~ [EG [~ [[E [true U ~ [E [true U ~ [[[p15<=0 & 0<=p15] | [p5<=0 & 0<=p5]]]]]] | ~ [E [E [true U [[p20<=1 & 1<=p20] | [p19<=1 & 1<=p19]]] U [[~ [EG [~ [[[p20<=1 & 1<=p20] & [p10<=1 & 1<=p10]]]]] & ~ [E [~ [[[p20<=1 & 1<=p20] & [p10<=1 & 1<=p10]]] U [~ [[[p20<=1 & 1<=p20] & [p10<=1 & 1<=p10]]] & ~ [[[p20<=1 & 1<=p20] & [p10<=1 & 1<=p10]]]]]]] | [[[p20<=1 & 1<=p20] & [p1<=1 & 1<=p1]] & E [true U [p20<=1 & 1<=p20]]]]]]]]]]
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p1)
states: 1,220 (3)
abstracting: (p1<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p10)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p10)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p10)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p10)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
..
EG iterations: 2
abstracting: (1<=p19)
states: 1,220 (3)
abstracting: (p19<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (0<=p5)
states: 7,381 (3)
abstracting: (p5<=0)
states: 4,881 (3)
abstracting: (0<=p15)
states: 7,381 (3)
abstracting: (p15<=0)
states: 4,881 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA Raft-PT-02-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: [~ [E [[A [[p17<=1 & 1<=p17] U ~ [[p15<=1 & 1<=p15]]] & [[p15<=1 & 1<=p15] & [p23<=1 & 1<=p23]]] U ~ [[[[[p17<=1 & 1<=p17] & [p19<=1 & 1<=p19]] | [[p5<=1 & 1<=p5] & [p15<=1 & 1<=p15]]] & [p20<=1 & 1<=p20]]]]] | [AG [[AG [[p14<=1 & 1<=p14]] & [AF [[p17<=0 & 0<=p17]] | [[p10<=0 & 0<=p10] | [p20<=0 & 0<=p20]]]]] | AX [[p26<=1 & 1<=p26]]]]
normalized: [~ [E [[[[p23<=1 & 1<=p23] & [p15<=1 & 1<=p15]] & [~ [EG [[p15<=1 & 1<=p15]]] & ~ [E [[p15<=1 & 1<=p15] U [~ [[p17<=1 & 1<=p17]] & [p15<=1 & 1<=p15]]]]]] U ~ [[[p20<=1 & 1<=p20] & [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]] | [[p19<=1 & 1<=p19] & [p17<=1 & 1<=p17]]]]]]] | [~ [EX [~ [[p26<=1 & 1<=p26]]]] | ~ [E [true U ~ [[[[[p20<=0 & 0<=p20] | [p10<=0 & 0<=p10]] | ~ [EG [~ [[p17<=0 & 0<=p17]]]]] & ~ [E [true U ~ [[p14<=1 & 1<=p14]]]]]]]]]]
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (0<=p17)
states: 7,381 (3)
abstracting: (p17<=0)
states: 6,161 (3)
.
EG iterations: 1
abstracting: (0<=p10)
states: 7,381 (3)
abstracting: (p10<=0)
states: 4,881 (3)
abstracting: (0<=p20)
states: 7,381 (3)
abstracting: (p20<=0)
states: 4,881 (3)
abstracting: (1<=p26)
states: 1,845 (3)
abstracting: (p26<=1)
states: 7,381 (3)
.abstracting: (1<=p17)
states: 1,220 (3)
abstracting: (p17<=1)
states: 7,381 (3)
abstracting: (1<=p19)
states: 1,220 (3)
abstracting: (p19<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p17)
states: 1,220 (3)
abstracting: (p17<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
-> the formula is FALSE
FORMULA Raft-PT-02-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EF [[~ [A [EF [[[p10<=1 & 1<=p10] & [[p20<=1 & 1<=p20] & [p11<=1 & 1<=p11]]]] U ~ [AG [[[p10<=1 & 1<=p10] & [p20<=1 & 1<=p20]]]]]] & [EG [[[p26<=0 & 0<=p26] & [[[p6<=0 & 0<=p6] | [p15<=0 & 0<=p15]] & [[p16<=0 & 0<=p16] | [p27<=0 & 0<=p27]]]]] & [[AG [[p17<=0 & 0<=p17]] | AX [[[p20<=1 & 1<=p20] & [p21<=1 & 1<=p21]]]] | [[p24<=0 & 0<=p24] | [p25<=0 & 0<=p25]]]]]]
normalized: E [true U [[EG [[[[[p16<=0 & 0<=p16] | [p27<=0 & 0<=p27]] & [[p15<=0 & 0<=p15] | [p6<=0 & 0<=p6]]] & [p26<=0 & 0<=p26]]] & [[[p25<=0 & 0<=p25] | [p24<=0 & 0<=p24]] | [~ [EX [~ [[[p21<=1 & 1<=p21] & [p20<=1 & 1<=p20]]]]] | ~ [E [true U ~ [[p17<=0 & 0<=p17]]]]]]] & ~ [[~ [EG [~ [E [true U ~ [[[p20<=1 & 1<=p20] & [p10<=1 & 1<=p10]]]]]]] & ~ [E [~ [E [true U ~ [[[p20<=1 & 1<=p20] & [p10<=1 & 1<=p10]]]]] U [~ [E [true U [[[p11<=1 & 1<=p11] & [p20<=1 & 1<=p20]] & [p10<=1 & 1<=p10]]]] & ~ [E [true U ~ [[[p20<=1 & 1<=p20] & [p10<=1 & 1<=p10]]]]]]]]]]]]
abstracting: (1<=p10)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p10)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p11)
states: 1,220 (3)
abstracting: (p11<=1)
states: 7,381 (3)
abstracting: (1<=p10)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p10)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (0<=p17)
states: 7,381 (3)
abstracting: (p17<=0)
states: 6,161 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p21)
states: 1,476 (3)
abstracting: (p21<=1)
states: 7,381 (3)
.abstracting: (0<=p24)
states: 7,381 (3)
abstracting: (p24<=0)
states: 5,905 (3)
abstracting: (0<=p25)
states: 7,381 (3)
abstracting: (p25<=0)
states: 5,536 (3)
abstracting: (0<=p26)
states: 7,381 (3)
abstracting: (p26<=0)
states: 5,536 (3)
abstracting: (0<=p6)
states: 7,381 (3)
abstracting: (p6<=0)
states: 6,161 (3)
abstracting: (0<=p15)
states: 7,381 (3)
abstracting: (p15<=0)
states: 4,881 (3)
abstracting: (0<=p27)
states: 7,381 (3)
abstracting: (p27<=0)
states: 5,536 (3)
abstracting: (0<=p16)
states: 7,381 (3)
abstracting: (p16<=0)
states: 6,161 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA Raft-PT-02-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: EF [[E [[[p5<=1 & 1<=p5] & [p15<=1 & 1<=p15]] U [A [[[[p5<=1 & 1<=p5] & [p15<=1 & 1<=p15]] | [[p20<=1 & 1<=p20] & [p23<=1 & 1<=p23]]] U [[p13<=1 & 1<=p13] | [[p10<=1 & 1<=p10] & [p20<=1 & 1<=p20]]]] | [[p4<=1 & 1<=p4] & [p20<=1 & 1<=p20]]]] | EG [[[EX [[p19<=0 & 0<=p19]] & [[p5<=0 & 0<=p5] | [p15<=0 & 0<=p15]]] & [[[p7<=0 & 0<=p7] | [p15<=0 & 0<=p15]] & [[p10<=1 & 1<=p10] & [p20<=1 & 1<=p20]]]]]]]
normalized: E [true U [EG [[[[[p20<=1 & 1<=p20] & [p10<=1 & 1<=p10]] & [[p15<=0 & 0<=p15] | [p7<=0 & 0<=p7]]] & [[[p15<=0 & 0<=p15] | [p5<=0 & 0<=p5]] & EX [[p19<=0 & 0<=p19]]]]] | E [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]] U [[[p20<=1 & 1<=p20] & [p4<=1 & 1<=p4]] | [~ [EG [~ [[[[p20<=1 & 1<=p20] & [p10<=1 & 1<=p10]] | [p13<=1 & 1<=p13]]]]] & ~ [E [~ [[[[p20<=1 & 1<=p20] & [p10<=1 & 1<=p10]] | [p13<=1 & 1<=p13]]] U [~ [[[[p23<=1 & 1<=p23] & [p20<=1 & 1<=p20]] | [[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]] & ~ [[[[p20<=1 & 1<=p20] & [p10<=1 & 1<=p10]] | [p13<=1 & 1<=p13]]]]]]]]]]]
abstracting: (1<=p13)
states: 1,220 (3)
abstracting: (p13<=1)
states: 7,381 (3)
abstracting: (1<=p10)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
abstracting: (1<=p13)
states: 1,220 (3)
abstracting: (p13<=1)
states: 7,381 (3)
abstracting: (1<=p10)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p13)
states: 1,220 (3)
abstracting: (p13<=1)
states: 7,381 (3)
abstracting: (1<=p10)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
..
EG iterations: 2
abstracting: (1<=p4)
states: 1,220 (3)
abstracting: (p4<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (0<=p19)
states: 7,381 (3)
abstracting: (p19<=0)
states: 6,161 (3)
.abstracting: (0<=p5)
states: 7,381 (3)
abstracting: (p5<=0)
states: 4,881 (3)
abstracting: (0<=p15)
states: 7,381 (3)
abstracting: (p15<=0)
states: 4,881 (3)
abstracting: (0<=p7)
states: 7,381 (3)
abstracting: (p7<=0)
states: 6,161 (3)
abstracting: (0<=p15)
states: 7,381 (3)
abstracting: (p15<=0)
states: 4,881 (3)
abstracting: (1<=p10)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Raft-PT-02-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: [EX [[[[[[p24<=1 & 1<=p24] & [p25<=1 & 1<=p25]] & [[p4<=1 & 1<=p4] & [p20<=1 & 1<=p20]]] | [[[p11<=1 & 1<=p11] & [p27<=1 & 1<=p27]] | [p15<=1 & 1<=p15]]] & [[AG [~ [E [[p12<=1 & 1<=p12] U [[p4<=1 & 1<=p4] & [p20<=1 & 1<=p20]]]]] | ~ [[p14<=1 & 1<=p14]]] | [~ [[p20<=1 & 1<=p20]] | ~ [[p23<=1 & 1<=p23]]]]]] | A [~ [EG [AF [[p15<=1 & 1<=p15]]]] U [[[p6<=1 & 1<=p6] & [p15<=1 & 1<=p15]] | ~ [EF [~ [[[p20<=1 & 1<=p20] & [p23<=1 & 1<=p23]]]]]]]]
normalized: [[~ [EG [~ [[~ [E [true U ~ [[[p23<=1 & 1<=p23] & [p20<=1 & 1<=p20]]]]] | [[p15<=1 & 1<=p15] & [p6<=1 & 1<=p6]]]]]] & ~ [E [~ [[~ [E [true U ~ [[[p23<=1 & 1<=p23] & [p20<=1 & 1<=p20]]]]] | [[p15<=1 & 1<=p15] & [p6<=1 & 1<=p6]]]] U [~ [[~ [E [true U ~ [[[p23<=1 & 1<=p23] & [p20<=1 & 1<=p20]]]]] | [[p15<=1 & 1<=p15] & [p6<=1 & 1<=p6]]]] & EG [~ [EG [~ [[p15<=1 & 1<=p15]]]]]]]]] | EX [[[[~ [[p23<=1 & 1<=p23]] | ~ [[p20<=1 & 1<=p20]]] | [~ [[p14<=1 & 1<=p14]] | ~ [E [true U E [[p12<=1 & 1<=p12] U [[p20<=1 & 1<=p20] & [p4<=1 & 1<=p4]]]]]]] & [[[p15<=1 & 1<=p15] | [[p27<=1 & 1<=p27] & [p11<=1 & 1<=p11]]] | [[[p20<=1 & 1<=p20] & [p4<=1 & 1<=p4]] & [[p25<=1 & 1<=p25] & [p24<=1 & 1<=p24]]]]]]]
abstracting: (1<=p24)
states: 1,476 (3)
abstracting: (p24<=1)
states: 7,381 (3)
abstracting: (1<=p25)
states: 1,845 (3)
abstracting: (p25<=1)
states: 7,381 (3)
abstracting: (1<=p4)
states: 1,220 (3)
abstracting: (p4<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p11)
states: 1,220 (3)
abstracting: (p11<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p4)
states: 1,220 (3)
abstracting: (p4<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p12)
states: 1,220 (3)
abstracting: (p12<=1)
states: 7,381 (3)
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
.abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (1<=p6)
states: 1,220 (3)
abstracting: (p6<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
abstracting: (1<=p6)
states: 1,220 (3)
abstracting: (p6<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
abstracting: (1<=p6)
states: 1,220 (3)
abstracting: (p6<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Raft-PT-02-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: EX [[[EX [[AF [[[p10<=0 & 0<=p10] | [p20<=0 & 0<=p20]]] | [EF [[[p5<=1 & 1<=p5] & [p15<=1 & 1<=p15]]] | AG [[p20<=1 & 1<=p20]]]]] | A [AX [[[p16<=1 & 1<=p16] & [p27<=1 & 1<=p27]]] U [[p13<=1 & 1<=p13] & [p27<=1 & 1<=p27]]]] | [[[p13<=1 & 1<=p13] & [p27<=1 & 1<=p27]] | [[EF [[[p2<=0 & 0<=p2] | [p20<=0 & 0<=p20]]] & [p20<=0 & 0<=p20]] & [[p14<=0 & 0<=p14] & [[[AF [[p26<=1 & 1<=p26]] | EF [[p11<=1 & 1<=p11]]] | [[p9<=0 & 0<=p9] | [p15<=0 & 0<=p15]]] & [[p8<=0 & 0<=p8] | [[p15<=0 & 0<=p15] | [p21<=0 & 0<=p21]]]]]]]]]
normalized: EX [[[[[[[[[p21<=0 & 0<=p21] | [p15<=0 & 0<=p15]] | [p8<=0 & 0<=p8]] & [[[p15<=0 & 0<=p15] | [p9<=0 & 0<=p9]] | [E [true U [p11<=1 & 1<=p11]] | ~ [EG [~ [[p26<=1 & 1<=p26]]]]]]] & [p14<=0 & 0<=p14]] & [[p20<=0 & 0<=p20] & E [true U [[p20<=0 & 0<=p20] | [p2<=0 & 0<=p2]]]]] | [[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]]] | [[~ [EG [~ [[[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]]]]] & ~ [E [~ [[[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]]] U [EX [~ [[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]]]] & ~ [[[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]]]]]]] | EX [[[~ [E [true U ~ [[p20<=1 & 1<=p20]]]] | E [true U [[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]] | ~ [EG [~ [[[p20<=0 & 0<=p20] | [p10<=0 & 0<=p10]]]]]]]]]]
abstracting: (0<=p10)
states: 7,381 (3)
abstracting: (p10<=0)
states: 4,881 (3)
abstracting: (0<=p20)
states: 7,381 (3)
abstracting: (p20<=0)
states: 4,881 (3)
.
EG iterations: 1
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
.abstracting: (1<=p13)
states: 1,220 (3)
abstracting: (p13<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
abstracting: (1<=p16)
states: 1,220 (3)
abstracting: (p16<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
.abstracting: (1<=p13)
states: 1,220 (3)
abstracting: (p13<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
abstracting: (1<=p13)
states: 1,220 (3)
abstracting: (p13<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p13)
states: 1,220 (3)
abstracting: (p13<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
abstracting: (0<=p2)
states: 7,381 (3)
abstracting: (p2<=0)
states: 6,161 (3)
abstracting: (0<=p20)
states: 7,381 (3)
abstracting: (p20<=0)
states: 4,881 (3)
abstracting: (0<=p20)
states: 7,381 (3)
abstracting: (p20<=0)
states: 4,881 (3)
abstracting: (0<=p14)
states: 7,381 (3)
abstracting: (p14<=0)
states: 6,161 (3)
abstracting: (1<=p26)
states: 1,845 (3)
abstracting: (p26<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p11)
states: 1,220 (3)
abstracting: (p11<=1)
states: 7,381 (3)
abstracting: (0<=p9)
states: 7,381 (3)
abstracting: (p9<=0)
states: 6,161 (3)
abstracting: (0<=p15)
states: 7,381 (3)
abstracting: (p15<=0)
states: 4,881 (3)
abstracting: (0<=p8)
states: 7,381 (3)
abstracting: (p8<=0)
states: 6,161 (3)
abstracting: (0<=p15)
states: 7,381 (3)
abstracting: (p15<=0)
states: 4,881 (3)
abstracting: (0<=p21)
states: 7,381 (3)
abstracting: (p21<=0)
states: 5,905 (3)
.-> the formula is TRUE
FORMULA Raft-PT-02-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: EX [[A [[[[[p24<=1 & 1<=p24] & [p25<=1 & 1<=p25]] | [[p20<=1 & 1<=p20] | [p12<=1 & 1<=p12]]] & [AG [[[p20<=1 & 1<=p20] & [p23<=1 & 1<=p23]]] & A [~ [[p26<=1 & 1<=p26]] U ~ [[p14<=1 & 1<=p14]]]]] U A [EG [[p20<=1 & 1<=p20]] U ~ [[p14<=1 & 1<=p14]]]] | [EX [[[~ [A [[[p10<=1 & 1<=p10] & [p20<=1 & 1<=p20]] U [[p13<=1 & 1<=p13] & [p27<=1 & 1<=p27]]]] | [p10<=0 & 0<=p10]] | [[p20<=0 & 0<=p20] | [p11<=0 & 0<=p11]]]] & [EG [[p13<=0 & 0<=p13]] | [[p12<=1 & 1<=p12] | [[p20<=0 & 0<=p20] & [[[p13<=0 & 0<=p13] | [p27<=0 & 0<=p27]] & [[p18<=1 & 1<=p18] | [[[p22<=1 & 1<=p22] & [p25<=1 & 1<=p25]] | [[p5<=1 & 1<=p5] & [p15<=1 & 1<=p15]]]]]]]]]]]
normalized: EX [[[[[[[[[[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]] | [[p25<=1 & 1<=p25] & [p22<=1 & 1<=p22]]] | [p18<=1 & 1<=p18]] & [[p27<=0 & 0<=p27] | [p13<=0 & 0<=p13]]] & [p20<=0 & 0<=p20]] | [p12<=1 & 1<=p12]] | EG [[p13<=0 & 0<=p13]]] & EX [[[[p11<=0 & 0<=p11] | [p20<=0 & 0<=p20]] | [[p10<=0 & 0<=p10] | ~ [[~ [EG [~ [[[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]]]]] & ~ [E [~ [[[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]]] U [~ [[[p20<=1 & 1<=p20] & [p10<=1 & 1<=p10]]] & ~ [[[p27<=1 & 1<=p27] & [p13<=1 & 1<=p13]]]]]]]]]]]] | [~ [EG [~ [[~ [EG [[p14<=1 & 1<=p14]]] & ~ [E [[p14<=1 & 1<=p14] U [~ [EG [[p20<=1 & 1<=p20]]] & [p14<=1 & 1<=p14]]]]]]]] & ~ [E [~ [[~ [EG [[p14<=1 & 1<=p14]]] & ~ [E [[p14<=1 & 1<=p14] U [~ [EG [[p20<=1 & 1<=p20]]] & [p14<=1 & 1<=p14]]]]]] U [~ [[[[~ [EG [[p14<=1 & 1<=p14]]] & ~ [E [[p14<=1 & 1<=p14] U [[p26<=1 & 1<=p26] & [p14<=1 & 1<=p14]]]]] & ~ [E [true U ~ [[[p23<=1 & 1<=p23] & [p20<=1 & 1<=p20]]]]]] & [[[p12<=1 & 1<=p12] | [p20<=1 & 1<=p20]] | [[p25<=1 & 1<=p25] & [p24<=1 & 1<=p24]]]]] & ~ [[~ [EG [[p14<=1 & 1<=p14]]] & ~ [E [[p14<=1 & 1<=p14] U [~ [EG [[p20<=1 & 1<=p20]]] & [p14<=1 & 1<=p14]]]]]]]]]]]]
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p24)
states: 1,476 (3)
abstracting: (p24<=1)
states: 7,381 (3)
abstracting: (1<=p25)
states: 1,845 (3)
abstracting: (p25<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p12)
states: 1,220 (3)
abstracting: (p12<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (1<=p26)
states: 1,845 (3)
abstracting: (p26<=1)
states: 7,381 (3)
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p13)
states: 1,220 (3)
abstracting: (p13<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
abstracting: (1<=p10)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p13)
states: 1,220 (3)
abstracting: (p13<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
abstracting: (1<=p13)
states: 1,220 (3)
abstracting: (p13<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (0<=p10)
states: 7,381 (3)
abstracting: (p10<=0)
states: 4,881 (3)
abstracting: (0<=p20)
states: 7,381 (3)
abstracting: (p20<=0)
states: 4,881 (3)
abstracting: (0<=p11)
states: 7,381 (3)
abstracting: (p11<=0)
states: 6,161 (3)
.abstracting: (0<=p13)
states: 7,381 (3)
abstracting: (p13<=0)
states: 6,161 (3)
.
EG iterations: 1
abstracting: (1<=p12)
states: 1,220 (3)
abstracting: (p12<=1)
states: 7,381 (3)
abstracting: (0<=p20)
states: 7,381 (3)
abstracting: (p20<=0)
states: 4,881 (3)
abstracting: (0<=p13)
states: 7,381 (3)
abstracting: (p13<=0)
states: 6,161 (3)
abstracting: (0<=p27)
states: 7,381 (3)
abstracting: (p27<=0)
states: 5,536 (3)
abstracting: (1<=p18)
states: 1,220 (3)
abstracting: (p18<=1)
states: 7,381 (3)
abstracting: (1<=p22)
states: 1,476 (3)
abstracting: (p22<=1)
states: 7,381 (3)
abstracting: (1<=p25)
states: 1,845 (3)
abstracting: (p25<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
.-> the formula is TRUE
FORMULA Raft-PT-02-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: A [AF [[~ [[EF [[p15<=1 & 1<=p15]] & [[[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]] | AG [[[p15<=1 & 1<=p15] & [p23<=1 & 1<=p23]]]]]] & ~ [[[EG [[[p7<=1 & 1<=p7] & [p15<=1 & 1<=p15]]] & [A [[p15<=1 & 1<=p15] U [p19<=1 & 1<=p19]] & [p15<=1 & 1<=p15]]] & [[[p21<=1 & 1<=p21] & [p3<=1 & 1<=p3]] & [[p20<=1 & 1<=p20] & ~ [[p0<=1 & 1<=p0]]]]]]]] U [EF [AG [E [[[p5<=1 & 1<=p5] & [p15<=1 & 1<=p15]] U [[p22<=1 & 1<=p22] & [p25<=1 & 1<=p25]]]]] | [[[[[p14<=1 & 1<=p14] | [[p17<=1 & 1<=p17] | [p20<=1 & 1<=p20]]] | [EG [[p20<=1 & 1<=p20]] | [AF [[[p18<=1 & 1<=p18] & [p27<=1 & 1<=p27]]] | AG [[AF [[p0<=1 & 1<=p0]] & AX [[[p16<=1 & 1<=p16] & [p27<=1 & 1<=p27]]]]]]]] & A [~ [A [[p17<=1 & 1<=p17] U [[p20<=1 & 1<=p20] & [p23<=1 & 1<=p23]]]] U A [[[p15<=1 & 1<=p15] & [p21<=1 & 1<=p21]] U [[p5<=1 & 1<=p5] & [p15<=1 & 1<=p15]]]]] & AF [[EG [[p17<=1 & 1<=p17]] | EX [[p0<=1 & 1<=p0]]]]]]]
normalized: [~ [EG [~ [[[~ [EG [~ [[EX [[p0<=1 & 1<=p0]] | EG [[p17<=1 & 1<=p17]]]]]] & [[~ [EG [~ [[~ [EG [~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]] & ~ [E [~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]] U [~ [[[p21<=1 & 1<=p21] & [p15<=1 & 1<=p15]]] & ~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]] & ~ [E [~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]] U [~ [[[p21<=1 & 1<=p21] & [p15<=1 & 1<=p15]]] & ~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]]]]] U [[~ [EG [~ [[[p23<=1 & 1<=p23] & [p20<=1 & 1<=p20]]]]] & ~ [E [~ [[[p23<=1 & 1<=p23] & [p20<=1 & 1<=p20]]] U [~ [[p17<=1 & 1<=p17]] & ~ [[[p23<=1 & 1<=p23] & [p20<=1 & 1<=p20]]]]]]] & ~ [[~ [EG [~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]] & ~ [E [~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]] U [~ [[[p21<=1 & 1<=p21] & [p15<=1 & 1<=p15]]] & ~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]]]]]]]]] & [[[~ [E [true U ~ [[~ [EX [~ [[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]]]]] & ~ [EG [~ [[p0<=1 & 1<=p0]]]]]]]] | ~ [EG [~ [[[p27<=1 & 1<=p27] & [p18<=1 & 1<=p18]]]]]] | EG [[p20<=1 & 1<=p20]]] | [[[p20<=1 & 1<=p20] | [p17<=1 & 1<=p17]] | [p14<=1 & 1<=p14]]]]] | E [true U ~ [E [true U ~ [E [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]] U [[p25<=1 & 1<=p25] & [p22<=1 & 1<=p22]]]]]]]]]]] & ~ [E [~ [[[~ [EG [~ [[EX [[p0<=1 & 1<=p0]] | EG [[p17<=1 & 1<=p17]]]]]] & [[~ [EG [~ [[~ [EG [~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]] & ~ [E [~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]] U [~ [[[p21<=1 & 1<=p21] & [p15<=1 & 1<=p15]]] & ~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]] & ~ [E [~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]] U [~ [[[p21<=1 & 1<=p21] & [p15<=1 & 1<=p15]]] & ~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]]]]] U [[~ [EG [~ [[[p23<=1 & 1<=p23] & [p20<=1 & 1<=p20]]]]] & ~ [E [~ [[[p23<=1 & 1<=p23] & [p20<=1 & 1<=p20]]] U [~ [[p17<=1 & 1<=p17]] & ~ [[[p23<=1 & 1<=p23] & [p20<=1 & 1<=p20]]]]]]] & ~ [[~ [EG [~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]] & ~ [E [~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]] U [~ [[[p21<=1 & 1<=p21] & [p15<=1 & 1<=p15]]] & ~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]]]]]]]]] & [[[~ [E [true U ~ [[~ [EX [~ [[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]]]]] & ~ [EG [~ [[p0<=1 & 1<=p0]]]]]]]] | ~ [EG [~ [[[p27<=1 & 1<=p27] & [p18<=1 & 1<=p18]]]]]] | EG [[p20<=1 & 1<=p20]]] | [[[p20<=1 & 1<=p20] | [p17<=1 & 1<=p17]] | [p14<=1 & 1<=p14]]]]] | E [true U ~ [E [true U ~ [E [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]] U [[p25<=1 & 1<=p25] & [p22<=1 & 1<=p22]]]]]]]]] U [EG [~ [[~ [[[[~ [[p0<=1 & 1<=p0]] & [p20<=1 & 1<=p20]] & [[p3<=1 & 1<=p3] & [p21<=1 & 1<=p21]]] & [[[p15<=1 & 1<=p15] & [~ [EG [~ [[p19<=1 & 1<=p19]]]] & ~ [E [~ [[p19<=1 & 1<=p19]] U [~ [[p15<=1 & 1<=p15]] & ~ [[p19<=1 & 1<=p19]]]]]]] & EG [[[p15<=1 & 1<=p15] & [p7<=1 & 1<=p7]]]]]] & ~ [[[~ [E [true U ~ [[[p23<=1 & 1<=p23] & [p15<=1 & 1<=p15]]]]] | [[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]] & E [true U [p15<=1 & 1<=p15]]]]]]] & ~ [[[~ [EG [~ [[EX [[p0<=1 & 1<=p0]] | EG [[p17<=1 & 1<=p17]]]]]] & [[~ [EG [~ [[~ [EG [~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]] & ~ [E [~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]] U [~ [[[p21<=1 & 1<=p21] & [p15<=1 & 1<=p15]]] & ~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]] & ~ [E [~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]] U [~ [[[p21<=1 & 1<=p21] & [p15<=1 & 1<=p15]]] & ~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]]]]] U [[~ [EG [~ [[[p23<=1 & 1<=p23] & [p20<=1 & 1<=p20]]]]] & ~ [E [~ [[[p23<=1 & 1<=p23] & [p20<=1 & 1<=p20]]] U [~ [[p17<=1 & 1<=p17]] & ~ [[[p23<=1 & 1<=p23] & [p20<=1 & 1<=p20]]]]]]] & ~ [[~ [EG [~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]] & ~ [E [~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]] U [~ [[[p21<=1 & 1<=p21] & [p15<=1 & 1<=p15]]] & ~ [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]]]]]]]]]]]] & [[[~ [E [true U ~ [[~ [EX [~ [[[p27<=1 & 1<=p27] & [p16<=1 & 1<=p16]]]]] & ~ [EG [~ [[p0<=1 & 1<=p0]]]]]]]] | ~ [EG [~ [[[p27<=1 & 1<=p27] & [p18<=1 & 1<=p18]]]]]] | EG [[p20<=1 & 1<=p20]]] | [[[p20<=1 & 1<=p20] | [p17<=1 & 1<=p17]] | [p14<=1 & 1<=p14]]]]] | E [true U ~ [E [true U ~ [E [[[p15<=1 & 1<=p15] & [p5<=1 & 1<=p5]] U [[p25<=1 & 1<=p25] & [p22<=1 & 1<=p22]]]]]]]]]]]]]
abstracting: (1<=p22)
states: 1,476 (3)
abstracting: (p22<=1)
states: 7,381 (3)
abstracting: (1<=p25)
states: 1,845 (3)
abstracting: (p25<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (1<=p17)
states: 1,220 (3)
abstracting: (p17<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p18)
states: 1,220 (3)
abstracting: (p18<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p16)
states: 1,220 (3)
abstracting: (p16<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
.abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p21)
states: 1,476 (3)
abstracting: (p21<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
..
EG iterations: 2
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
abstracting: (1<=p17)
states: 1,220 (3)
abstracting: (p17<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p21)
states: 1,476 (3)
abstracting: (p21<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
..
EG iterations: 2
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p21)
states: 1,476 (3)
abstracting: (p21<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
..
EG iterations: 2
..
EG iterations: 2
abstracting: (1<=p17)
states: 1,220 (3)
abstracting: (p17<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 7,381 (3)
..
EG iterations: 1
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p12)
states: 1,220 (3)
abstracting: (p12<=1)
states: 7,381 (3)
abstracting: (1<=p26)
states: 1,845 (3)
abstracting: (p26<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
abstracting: (1<=p7)
states: 1,220 (3)
abstracting: (p7<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p19)
states: 1,220 (3)
abstracting: (p19<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p19)
states: 1,220 (3)
abstracting: (p19<=1)
states: 7,381 (3)
abstracting: (1<=p19)
states: 1,220 (3)
abstracting: (p19<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p21)
states: 1,476 (3)
abstracting: (p21<=1)
states: 7,381 (3)
abstracting: (1<=p3)
states: 1,220 (3)
abstracting: (p3<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p22)
states: 1,476 (3)
abstracting: (p22<=1)
states: 7,381 (3)
abstracting: (1<=p25)
states: 1,845 (3)
abstracting: (p25<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (1<=p17)
states: 1,220 (3)
abstracting: (p17<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p18)
states: 1,220 (3)
abstracting: (p18<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p16)
states: 1,220 (3)
abstracting: (p16<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
.abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p21)
states: 1,476 (3)
abstracting: (p21<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
..
EG iterations: 2
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
abstracting: (1<=p17)
states: 1,220 (3)
abstracting: (p17<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p21)
states: 1,476 (3)
abstracting: (p21<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
..
EG iterations: 2
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p21)
states: 1,476 (3)
abstracting: (p21<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
..
EG iterations: 2
..
EG iterations: 2
abstracting: (1<=p17)
states: 1,220 (3)
abstracting: (p17<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 7,381 (3)
..
EG iterations: 1
abstracting: (1<=p22)
states: 1,476 (3)
abstracting: (p22<=1)
states: 7,381 (3)
abstracting: (1<=p25)
states: 1,845 (3)
abstracting: (p25<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (1<=p17)
states: 1,220 (3)
abstracting: (p17<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p18)
states: 1,220 (3)
abstracting: (p18<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p16)
states: 1,220 (3)
abstracting: (p16<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
.abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p21)
states: 1,476 (3)
abstracting: (p21<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
..
EG iterations: 2
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
abstracting: (1<=p17)
states: 1,220 (3)
abstracting: (p17<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p21)
states: 1,476 (3)
abstracting: (p21<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
..
EG iterations: 2
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p21)
states: 1,476 (3)
abstracting: (p21<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
..
EG iterations: 2
..
EG iterations: 2
abstracting: (1<=p17)
states: 1,220 (3)
abstracting: (p17<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 7,381 (3)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA Raft-PT-02-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.029sec
totally nodes used: 63440 (6.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 171586 319140 490726
used/not used/entry size/cache size: 372271 66736593 16 1024MB
basic ops cache: hits/miss/sum: 56245 77833 134078
used/not used/entry size/cache size: 142406 16634810 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: 2769 4381 7150
used/not used/entry size/cache size: 4381 8384227 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 67047879
1 58721
2 2085
3 167
4 12
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.494sec
BK_STOP 1679139762964
--------------------
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.000sec
iterations count:2954 (70), effective:243 (5)
initing FirstDep: 0m 0.000sec
iterations count:70 (1), effective:1 (0)
iterations count:701 (16), effective:47 (1)
iterations count:496 (11), effective:35 (0)
iterations count:706 (16), effective:48 (1)
iterations count:701 (16), effective:47 (1)
iterations count:257 (6), effective:17 (0)
iterations count:708 (16), effective:49 (1)
iterations count:268 (6), effective:16 (0)
iterations count:270 (6), effective:16 (0)
iterations count:48 (1), effective:1 (0)
iterations count:390 (9), effective:27 (0)
iterations count:141 (3), effective:10 (0)
iterations count:270 (6), effective:16 (0)
iterations count:124 (2), effective:5 (0)
iterations count:42 (1), effective:0 (0)
iterations count:117 (2), effective:4 (0)
iterations count:348 (8), effective:28 (0)
iterations count:336 (8), effective:23 (0)
iterations count:48 (1), effective:1 (0)
iterations count:42 (1), effective:0 (0)
iterations count:50 (1), effective:1 (0)
iterations count:42 (1), effective:0 (0)
iterations count:44 (1), effective:1 (0)
iterations count:355 (8), effective:25 (0)
iterations count:44 (1), effective:1 (0)
iterations count:44 (1), effective:1 (0)
iterations count:314 (7), effective:20 (0)
iterations count:284 (6), effective:20 (0)
iterations count:225 (5), effective:15 (0)
iterations count:317 (7), effective:25 (0)
iterations count:93 (2), effective:4 (0)
iterations count:350 (8), effective:24 (0)
iterations count:166 (3), effective:9 (0)
iterations count:166 (3), effective:9 (0)
iterations count:91 (2), effective:4 (0)
iterations count:166 (3), effective:9 (0)
iterations count:336 (8), effective:23 (0)
iterations count:165 (3), effective:9 (0)
iterations count:42 (1), effective:0 (0)
iterations count:70 (1), effective:1 (0)
iterations count:268 (6), effective:16 (0)
iterations count:93 (2), effective:3 (0)
iterations count:166 (3), effective:9 (0)
iterations count:475 (11), effective:30 (0)
iterations count:93 (2), effective:3 (0)
iterations count:42 (1), effective:0 (0)
iterations count:93 (2), effective:3 (0)
iterations count:44 (1), effective:1 (0)
iterations count:310 (7), effective:17 (0)
iterations count:148 (3), effective:11 (0)
iterations count:42 (1), effective:0 (0)
iterations count:81 (1), effective:5 (0)
iterations count:53 (1), effective:2 (0)
iterations count:81 (1), effective:5 (0)
iterations count:628 (14), effective:46 (1)
iterations count:81 (1), effective:5 (0)
iterations count:122 (2), effective:5 (0)
iterations count:167 (3), effective:9 (0)
iterations count:160 (3), effective:8 (0)
iterations count:310 (7), effective:17 (0)
iterations count:148 (3), effective:11 (0)
iterations count:42 (1), effective:0 (0)
iterations count:81 (1), effective:5 (0)
iterations count:53 (1), effective:2 (0)
iterations count:81 (1), effective:5 (0)
iterations count:628 (14), effective:46 (1)
iterations count:81 (1), effective:5 (0)
iterations count:820 (19), effective:64 (1)
iterations count:310 (7), effective:17 (0)
iterations count:148 (3), effective:11 (0)
iterations count:42 (1), effective:0 (0)
iterations count:81 (1), effective:5 (0)
iterations count:53 (1), effective:2 (0)
iterations count:81 (1), effective:5 (0)
iterations count:628 (14), effective:46 (1)
iterations count:81 (1), effective:5 (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="Raft-PT-02"
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 Raft-PT-02, 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-167889203100290"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Raft-PT-02.tgz
mv Raft-PT-02 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 ;