About the Execution of Marcie+red for Raft-PT-04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10467.655 | 1698572.00 | 1717428.00 | 4130.40 | FFFTTTTTFFTTFFFT | 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-167889203100306.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-04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203100306
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.0K Feb 26 17:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 17:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 17:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 17:20 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.4K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 17:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 17:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K 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 41K 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-04-CTLFireability-00
FORMULA_NAME Raft-PT-04-CTLFireability-01
FORMULA_NAME Raft-PT-04-CTLFireability-02
FORMULA_NAME Raft-PT-04-CTLFireability-03
FORMULA_NAME Raft-PT-04-CTLFireability-04
FORMULA_NAME Raft-PT-04-CTLFireability-05
FORMULA_NAME Raft-PT-04-CTLFireability-06
FORMULA_NAME Raft-PT-04-CTLFireability-07
FORMULA_NAME Raft-PT-04-CTLFireability-08
FORMULA_NAME Raft-PT-04-CTLFireability-09
FORMULA_NAME Raft-PT-04-CTLFireability-10
FORMULA_NAME Raft-PT-04-CTLFireability-11
FORMULA_NAME Raft-PT-04-CTLFireability-12
FORMULA_NAME Raft-PT-04-CTLFireability-13
FORMULA_NAME Raft-PT-04-CTLFireability-14
FORMULA_NAME Raft-PT-04-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679139981322
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-04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 11:46:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 11:46:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 11:46:23] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-18 11:46:23] [INFO ] Transformed 88 places.
[2023-03-18 11:46:23] [INFO ] Transformed 160 transitions.
[2023-03-18 11:46:23] [INFO ] Found NUPN structural information;
[2023-03-18 11:46:23] [INFO ] Parsed PT model containing 88 places and 160 transitions and 563 arcs in 306 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 18 transitions
Reduce redundant transitions removed 18 transitions.
FORMULA Raft-PT-04-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Applied a total of 0 rules in 11 ms. Remains 88 /88 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2023-03-18 11:46:23] [INFO ] Flow matrix only has 126 transitions (discarded 16 similar events)
// Phase 1: matrix 126 rows 88 cols
[2023-03-18 11:46:23] [INFO ] Computed 16 place invariants in 6 ms
[2023-03-18 11:46:23] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-18 11:46:23] [INFO ] Flow matrix only has 126 transitions (discarded 16 similar events)
[2023-03-18 11:46:23] [INFO ] Invariant cache hit.
[2023-03-18 11:46:23] [INFO ] State equation strengthened by 64 read => feed constraints.
[2023-03-18 11:46:23] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-18 11:46:23] [INFO ] Flow matrix only has 126 transitions (discarded 16 similar events)
[2023-03-18 11:46:23] [INFO ] Invariant cache hit.
[2023-03-18 11:46:23] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 88/88 places, 142/142 transitions.
Support contains 51 out of 88 places after structural reductions.
[2023-03-18 11:46:23] [INFO ] Flatten gal took : 29 ms
[2023-03-18 11:46:23] [INFO ] Flatten gal took : 12 ms
[2023-03-18 11:46:23] [INFO ] Input system was already deterministic with 142 transitions.
Support contains 50 out of 88 places (down from 51) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 55) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 11:46:24] [INFO ] Flow matrix only has 126 transitions (discarded 16 similar events)
[2023-03-18 11:46:24] [INFO ] Invariant cache hit.
[2023-03-18 11:46:24] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2023-03-18 11:46:24] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 9 ms
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 9 ms
[2023-03-18 11:46:24] [INFO ] Input system was already deterministic with 142 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 140
Applied a total of 2 rules in 7 ms. Remains 87 /88 variables (removed 1) and now considering 140/142 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 87/88 places, 140/142 transitions.
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 7 ms
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 8 ms
[2023-03-18 11:46:24] [INFO ] Input system was already deterministic with 140 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 84 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 84 transition count 134
Applied a total of 8 rules in 5 ms. Remains 84 /88 variables (removed 4) and now considering 134/142 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 84/88 places, 134/142 transitions.
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 7 ms
[2023-03-18 11:46:24] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 84 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 84 transition count 134
Applied a total of 8 rules in 5 ms. Remains 84 /88 variables (removed 4) and now considering 134/142 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 84/88 places, 134/142 transitions.
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 11 ms
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 7 ms
[2023-03-18 11:46:24] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 84 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 84 transition count 134
Applied a total of 8 rules in 5 ms. Remains 84 /88 variables (removed 4) and now considering 134/142 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 84/88 places, 134/142 transitions.
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:46:24] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 83 transition count 133
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 83 transition count 133
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 0 with 8 rules applied. Total rules applied 16 place count 79 transition count 129
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 28 place count 67 transition count 117
Iterating global reduction 0 with 12 rules applied. Total rules applied 40 place count 67 transition count 117
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 52 place count 67 transition count 105
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 67 transition count 101
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 64 transition count 98
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 71 place count 55 transition count 89
Iterating global reduction 1 with 9 rules applied. Total rules applied 80 place count 55 transition count 89
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 89 place count 55 transition count 80
Applied a total of 89 rules in 28 ms. Remains 55 /88 variables (removed 33) and now considering 80/142 (removed 62) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 55/88 places, 80/142 transitions.
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:46:24] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 86 transition count 138
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 86 transition count 138
Applied a total of 4 rules in 3 ms. Remains 86 /88 variables (removed 2) and now considering 138/142 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 86/88 places, 138/142 transitions.
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:46:24] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 84 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 84 transition count 134
Applied a total of 8 rules in 2 ms. Remains 84 /88 variables (removed 4) and now considering 134/142 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 84/88 places, 134/142 transitions.
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:24] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 86 transition count 138
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 86 transition count 138
Applied a total of 4 rules in 2 ms. Remains 86 /88 variables (removed 2) and now considering 138/142 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 86/88 places, 138/142 transitions.
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 11 ms
[2023-03-18 11:46:24] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 84 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 84 transition count 134
Applied a total of 8 rules in 2 ms. Remains 84 /88 variables (removed 4) and now considering 134/142 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 84/88 places, 134/142 transitions.
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:46:24] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 84 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 84 transition count 134
Applied a total of 8 rules in 2 ms. Remains 84 /88 variables (removed 4) and now considering 134/142 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 84/88 places, 134/142 transitions.
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:24] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 85 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 85 transition count 136
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 8 place count 84 transition count 135
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 81 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 81 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 81 transition count 129
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 81 transition count 126
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 78 transition count 123
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 69 transition count 114
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 69 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 53 place count 69 transition count 105
Applied a total of 53 rules in 20 ms. Remains 69 /88 variables (removed 19) and now considering 105/142 (removed 37) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 69/88 places, 105/142 transitions.
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:46:24] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 84 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 84 transition count 134
Applied a total of 8 rules in 1 ms. Remains 84 /88 variables (removed 4) and now considering 134/142 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 84/88 places, 134/142 transitions.
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:46:24] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 85 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 85 transition count 136
Applied a total of 6 rules in 1 ms. Remains 85 /88 variables (removed 3) and now considering 136/142 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 85/88 places, 136/142 transitions.
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:24] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 84 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 84 transition count 134
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 81 transition count 131
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 23 place count 72 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 32 place count 72 transition count 122
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 41 place count 72 transition count 113
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 72 transition count 109
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 53 place count 68 transition count 105
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 65 place count 56 transition count 93
Iterating global reduction 1 with 12 rules applied. Total rules applied 77 place count 56 transition count 93
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 89 place count 56 transition count 81
Applied a total of 89 rules in 17 ms. Remains 56 /88 variables (removed 32) and now considering 81/142 (removed 61) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 56/88 places, 81/142 transitions.
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:46:24] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 85 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 85 transition count 136
Applied a total of 6 rules in 1 ms. Remains 85 /88 variables (removed 3) and now considering 136/142 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 85/88 places, 136/142 transitions.
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:46:24] [INFO ] Input system was already deterministic with 136 transitions.
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:24] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:24] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-18 11:46:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 88 places, 142 transitions and 527 arcs took 1 ms.
Total runtime 2153 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: 88 NrTr: 142 NrArc: 527)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 2.780sec
RS generation: 1m 3.314sec
-> reachability set: #nodes 1211400 (1.2e+06) #states 2,965,858,466,581 (12)
starting MCC model checker
--------------------------
checking: EF [EG [[p72<=1 & 1<=p72]]]
normalized: E [true U EG [[p72<=1 & 1<=p72]]]
abstracting: (1<=p72)
states: 588,876,726,020 (11)
abstracting: (p72<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Raft-PT-04-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m33.735sec
checking: EF [AX [AF [[[p37<=1 & 1<=p37] & [p70<=1 & 1<=p70]]]]]
normalized: E [true U ~ [EX [EG [~ [[[p70<=1 & 1<=p70] & [p37<=1 & 1<=p37]]]]]]]
abstracting: (1<=p37)
states: 588,876,726,020 (11)
abstracting: (p37<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA Raft-PT-04-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.437sec
checking: EX [EX [EF [AX [AX [[[p30<=1 & 1<=p30] & [p70<=1 & 1<=p70]]]]]]]
normalized: EX [EX [E [true U ~ [EX [EX [~ [[[p70<=1 & 1<=p70] & [p30<=1 & 1<=p30]]]]]]]]]
abstracting: (1<=p30)
states: 610,351,562,500 (11)
abstracting: (p30<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
....-> the formula is FALSE
FORMULA Raft-PT-04-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.611sec
checking: EF [AX [[EX [0<=0] & EX [~ [E [[p70<=1 & 1<=p70] U [[p65<=1 & 1<=p65] & [p83<=1 & 1<=p83]]]]]]]]
normalized: E [true U ~ [EX [~ [[EX [~ [E [[p70<=1 & 1<=p70] U [[p83<=1 & 1<=p83] & [p65<=1 & 1<=p65]]]]] & EX [0<=0]]]]]]
abstracting: (0<=0)
states: 2,965,858,466,581 (12)
.abstracting: (1<=p65)
states: 610,351,562,500 (11)
abstracting: (p65<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p83)
states: 593,171,693,316 (11)
abstracting: (p83<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
..-> the formula is TRUE
FORMULA Raft-PT-04-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m28.205sec
checking: AG [~ [E [AG [[[p55<=1 & 1<=p55] & [p80<=1 & 1<=p80]]] U EG [[[p50<=1 & 1<=p50] & [p80<=1 & 1<=p80]]]]]]
normalized: ~ [E [true U E [~ [E [true U ~ [[[p80<=1 & 1<=p80] & [p55<=1 & 1<=p55]]]]] U EG [[[p80<=1 & 1<=p80] & [p50<=1 & 1<=p50]]]]]]
abstracting: (1<=p50)
states: 610,351,562,500 (11)
abstracting: (p50<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
abstracting: (1<=p55)
states: 610,351,562,500 (11)
abstracting: (p55<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
-> the formula is FALSE
FORMULA Raft-PT-04-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m13.334sec
checking: AG [EX [[EG [~ [E [[[p40<=1 & 1<=p40] & [p75<=1 & 1<=p75]] U [[p80<=1 & 1<=p80] & [p83<=1 & 1<=p83]]]]] & EF [AX [[[p25<=0 & 0<=p25] | [p70<=0 & 0<=p70]]]]]]]
normalized: ~ [E [true U ~ [EX [[E [true U ~ [EX [~ [[[p70<=0 & 0<=p70] | [p25<=0 & 0<=p25]]]]]] & EG [~ [E [[[p75<=1 & 1<=p75] & [p40<=1 & 1<=p40]] U [[p83<=1 & 1<=p83] & [p80<=1 & 1<=p80]]]]]]]]]]
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p83)
states: 593,171,693,316 (11)
abstracting: (p83<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p40)
states: 610,351,562,500 (11)
abstracting: (p40<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
before gc: list nodes free: 1531689
after gc: idd nodes used:2947519, unused:61052481; list nodes free:294516932
..
EG iterations: 2
abstracting: (0<=p25)
states: 2,965,858,466,581 (12)
abstracting: (p25<=0)
states: 2,355,506,904,081 (12)
abstracting: (0<=p70)
states: 2,965,858,466,581 (12)
abstracting: (p70<=0)
states: 2,355,506,904,081 (12)
..-> the formula is FALSE
FORMULA Raft-PT-04-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m49.316sec
checking: AX [AG [[EG [AF [[[p22<=0 & 0<=p22] | [p75<=0 & 0<=p75]]]] | [EX [[[p40<=0 & 0<=p40] | [p75<=0 & 0<=p75]]] | AF [[[p35<=0 & 0<=p35] | [p75<=0 & 0<=p75]]]]]]]
normalized: ~ [EX [E [true U ~ [[[~ [EG [~ [[[p75<=0 & 0<=p75] | [p35<=0 & 0<=p35]]]]] | EX [[[p75<=0 & 0<=p75] | [p40<=0 & 0<=p40]]]] | EG [~ [EG [~ [[[p75<=0 & 0<=p75] | [p22<=0 & 0<=p22]]]]]]]]]]]
abstracting: (0<=p22)
states: 2,965,858,466,581 (12)
abstracting: (p22<=0)
states: 2,376,981,740,561 (12)
abstracting: (0<=p75)
states: 2,965,858,466,581 (12)
abstracting: (p75<=0)
states: 2,355,506,904,081 (12)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p40)
states: 2,965,858,466,581 (12)
abstracting: (p40<=0)
states: 2,355,506,904,081 (12)
abstracting: (0<=p75)
states: 2,965,858,466,581 (12)
abstracting: (p75<=0)
states: 2,355,506,904,081 (12)
.abstracting: (0<=p35)
states: 2,965,858,466,581 (12)
abstracting: (p35<=0)
states: 2,355,506,904,081 (12)
abstracting: (0<=p75)
states: 2,965,858,466,581 (12)
abstracting: (p75<=0)
states: 2,355,506,904,081 (12)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA Raft-PT-04-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.392sec
checking: EF [[[AX [[p72<=0 & 0<=p72]] & E [[p62<=1 & 1<=p62] U [[p9<=1 & 1<=p9] & [p75<=1 & 1<=p75]]]] & [[p42<=1 & 1<=p42] & [p80<=1 & 1<=p80]]]]
normalized: E [true U [[[p80<=1 & 1<=p80] & [p42<=1 & 1<=p42]] & [E [[p62<=1 & 1<=p62] U [[p75<=1 & 1<=p75] & [p9<=1 & 1<=p9]]] & ~ [EX [~ [[p72<=0 & 0<=p72]]]]]]]
abstracting: (0<=p72)
states: 2,965,858,466,581 (12)
abstracting: (p72<=0)
states: 2,376,981,740,561 (12)
.abstracting: (1<=p9)
states: 588,876,726,020 (11)
abstracting: (p9<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p62)
states: 588,876,726,020 (11)
abstracting: (p62<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p42)
states: 588,876,726,020 (11)
abstracting: (p42<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
-> the formula is TRUE
FORMULA Raft-PT-04-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m35.867sec
checking: E [~ [EG [AX [[[p13<=1 & 1<=p13] & [p80<=1 & 1<=p80]]]]] U [[p68<=1 & 1<=p68] & EX [E [[AG [[[p78<=1 & 1<=p78] & [p87<=1 & 1<=p87]]] | ~ [[[p20<=1 & 1<=p20] & [p70<=1 & 1<=p70]]]] U [[p25<=1 & 1<=p25] & [p70<=1 & 1<=p70]]]]]]
normalized: E [~ [EG [~ [EX [~ [[[p80<=1 & 1<=p80] & [p13<=1 & 1<=p13]]]]]]] U [EX [E [[~ [[[p70<=1 & 1<=p70] & [p20<=1 & 1<=p20]]] | ~ [E [true U ~ [[[p87<=1 & 1<=p87] & [p78<=1 & 1<=p78]]]]]] U [[p70<=1 & 1<=p70] & [p25<=1 & 1<=p25]]]] & [p68<=1 & 1<=p68]]]
abstracting: (1<=p68)
states: 588,876,726,020 (11)
abstracting: (p68<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p25)
states: 610,351,562,500 (11)
abstracting: (p25<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p78)
states: 588,876,726,020 (11)
abstracting: (p78<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p87)
states: 741,464,616,645 (11)
abstracting: (p87<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p20)
states: 610,351,562,500 (11)
abstracting: (p20<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
.abstracting: (1<=p13)
states: 588,876,726,020 (11)
abstracting: (p13<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
..
EG iterations: 1
-> the formula is TRUE
FORMULA Raft-PT-04-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m40.657sec
checking: [EF [AG [[p63<=1 & 1<=p63]]] | [AX [EG [E [[[p45<=1 & 1<=p45] & [p75<=1 & 1<=p75]] U [p74<=1 & 1<=p74]]]] & [~ [E [AF [[[p78<=1 & 1<=p78] & [p87<=1 & 1<=p87]]] U ~ [[[p7<=1 & 1<=p7] & [p75<=1 & 1<=p75]]]]] | AG [EF [[[p71<=1 & 1<=p71] & [p87<=1 & 1<=p87]]]]]]]
normalized: [[[~ [E [true U ~ [E [true U [[p87<=1 & 1<=p87] & [p71<=1 & 1<=p71]]]]]] | ~ [E [~ [EG [~ [[[p87<=1 & 1<=p87] & [p78<=1 & 1<=p78]]]]] U ~ [[[p75<=1 & 1<=p75] & [p7<=1 & 1<=p7]]]]]] & ~ [EX [~ [EG [E [[[p75<=1 & 1<=p75] & [p45<=1 & 1<=p45]] U [p74<=1 & 1<=p74]]]]]]] | E [true U ~ [E [true U ~ [[p63<=1 & 1<=p63]]]]]]
abstracting: (1<=p63)
states: 588,876,726,020 (11)
abstracting: (p63<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p74)
states: 588,876,726,020 (11)
abstracting: (p74<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p45)
states: 610,351,562,500 (11)
abstracting: (p45<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
.abstracting: (1<=p7)
states: 588,876,726,020 (11)
abstracting: (p7<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p78)
states: 588,876,726,020 (11)
abstracting: (p78<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p87)
states: 741,464,616,645 (11)
abstracting: (p87<=1)
states: 2,965,858,466,581 (12)
before gc: list nodes free: 3327132
after gc: idd nodes used:9957809, unused:54042191; list nodes free:260955935
.
EG iterations: 1
abstracting: (1<=p71)
states: 588,876,726,020 (11)
abstracting: (p71<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p87)
states: 741,464,616,645 (11)
abstracting: (p87<=1)
states: 2,965,858,466,581 (12)
-> the formula is FALSE
FORMULA Raft-PT-04-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 3m 8.598sec
checking: [EF [[[EG [[[[p5<=1 & 1<=p5] & [p65<=1 & 1<=p65]] | [[p76<=0 & 0<=p76] | [p87<=0 & 0<=p87]]]] & E [[[p25<=1 & 1<=p25] & [p70<=1 & 1<=p70]] U E [[[p5<=1 & 1<=p5] & [p65<=1 & 1<=p65]] U [[p20<=1 & 1<=p20] & [p70<=1 & 1<=p70]]]]] & [[p82<=1 & 1<=p82] & [p85<=1 & 1<=p85]]]] & AF [[[p45<=1 & 1<=p45] & [p75<=1 & 1<=p75]]]]
normalized: [~ [EG [~ [[[p75<=1 & 1<=p75] & [p45<=1 & 1<=p45]]]]] & E [true U [[[p85<=1 & 1<=p85] & [p82<=1 & 1<=p82]] & [E [[[p70<=1 & 1<=p70] & [p25<=1 & 1<=p25]] U E [[[p65<=1 & 1<=p65] & [p5<=1 & 1<=p5]] U [[p70<=1 & 1<=p70] & [p20<=1 & 1<=p20]]]] & EG [[[[p87<=0 & 0<=p87] | [p76<=0 & 0<=p76]] | [[p65<=1 & 1<=p65] & [p5<=1 & 1<=p5]]]]]]]]
abstracting: (1<=p5)
states: 610,351,562,500 (11)
abstracting: (p5<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p65)
states: 610,351,562,500 (11)
abstracting: (p65<=1)
states: 2,965,858,466,581 (12)
abstracting: (0<=p76)
states: 2,965,858,466,581 (12)
abstracting: (p76<=0)
states: 2,376,981,740,561 (12)
abstracting: (0<=p87)
states: 2,965,858,466,581 (12)
abstracting: (p87<=0)
states: 2,224,393,849,936 (12)
.
EG iterations: 1
abstracting: (1<=p20)
states: 610,351,562,500 (11)
abstracting: (p20<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p5)
states: 610,351,562,500 (11)
abstracting: (p5<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p65)
states: 610,351,562,500 (11)
abstracting: (p65<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p25)
states: 610,351,562,500 (11)
abstracting: (p25<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p82)
states: 593,171,693,316 (11)
abstracting: (p82<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p85)
states: 741,464,616,645 (11)
abstracting: (p85<=1)
states: 2,965,858,466,581 (12)
before gc: list nodes free: 4739905
after gc: idd nodes used:10689230, unused:53310770; list nodes free:258863948
abstracting: (1<=p45)
states: 610,351,562,500 (11)
abstracting: (p45<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
..
EG iterations: 2
-> the formula is TRUE
FORMULA Raft-PT-04-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 4m10.815sec
checking: E [AF [~ [EG [[[[[p65<=1 & 1<=p65] & [p83<=1 & 1<=p83]] | [[p76<=1 & 1<=p76] & [p87<=1 & 1<=p87]]] & ~ [[p78<=1 & 1<=p78]]]]]] U [AG [[[p42<=1 & 1<=p42] & [p80<=1 & 1<=p80]]] | [[AG [[p67<=1 & 1<=p67]] & ~ [[[p45<=1 & 1<=p45] & [p75<=1 & 1<=p75]]]] & [~ [AG [[[p45<=1 & 1<=p45] & [p75<=1 & 1<=p75]]]] & [[[p62<=1 & 1<=p62] | AX [[p76<=1 & 1<=p76]]] & [AX [~ [[[p21<=1 & 1<=p21] & [p75<=1 & 1<=p75]]]] | [[p16<=1 & 1<=p16] & [p65<=1 & 1<=p65]]]]]]]]
normalized: E [~ [EG [EG [[~ [[p78<=1 & 1<=p78]] & [[[p87<=1 & 1<=p87] & [p76<=1 & 1<=p76]] | [[p83<=1 & 1<=p83] & [p65<=1 & 1<=p65]]]]]]] U [[[[[[[p65<=1 & 1<=p65] & [p16<=1 & 1<=p16]] | ~ [EX [[[p75<=1 & 1<=p75] & [p21<=1 & 1<=p21]]]]] & [~ [EX [~ [[p76<=1 & 1<=p76]]]] | [p62<=1 & 1<=p62]]] & E [true U ~ [[[p75<=1 & 1<=p75] & [p45<=1 & 1<=p45]]]]] & [~ [[[p75<=1 & 1<=p75] & [p45<=1 & 1<=p45]]] & ~ [E [true U ~ [[p67<=1 & 1<=p67]]]]]] | ~ [E [true U ~ [[[p80<=1 & 1<=p80] & [p42<=1 & 1<=p42]]]]]]]
abstracting: (1<=p42)
states: 588,876,726,020 (11)
abstracting: (p42<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p67)
states: 588,876,726,020 (11)
abstracting: (p67<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p45)
states: 610,351,562,500 (11)
abstracting: (p45<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p45)
states: 610,351,562,500 (11)
abstracting: (p45<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p62)
states: 588,876,726,020 (11)
abstracting: (p62<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p76)
states: 588,876,726,020 (11)
abstracting: (p76<=1)
states: 2,965,858,466,581 (12)
before gc: list nodes free: 6231206
after gc: idd nodes used:12946445, unused:51053555; list nodes free:247919054
.abstracting: (1<=p21)
states: 588,876,726,020 (11)
abstracting: (p21<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
.abstracting: (1<=p16)
states: 588,876,726,020 (11)
abstracting: (p16<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p65)
states: 610,351,562,500 (11)
abstracting: (p65<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p65)
states: 610,351,562,500 (11)
abstracting: (p65<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p83)
states: 593,171,693,316 (11)
abstracting: (p83<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p76)
states: 588,876,726,020 (11)
abstracting: (p76<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p87)
states: 741,464,616,645 (11)
abstracting: (p87<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p78)
states: 588,876,726,020 (11)
abstracting: (p78<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA Raft-PT-04-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m13.843sec
checking: EF [[A [AX [EX [[p70<=1 & 1<=p70]]] U EF [[p74<=1 & 1<=p74]]] & A [AF [~ [[[[p44<=1 & 1<=p44] & [p80<=1 & 1<=p80]] | [p74<=1 & 1<=p74]]]] U [[E [[p64<=1 & 1<=p64] U [p0<=1 & 1<=p0]] & [EG [A [[p65<=1 & 1<=p65] U [[p38<=1 & 1<=p38] & [p70<=1 & 1<=p70]]]] & [p75<=1 & 1<=p75]]] & [[p35<=1 & 1<=p35] & [[p75<=1 & 1<=p75] & [[[p64<=1 & 1<=p64] & [[p53<=1 & 1<=p53] & [p70<=1 & 1<=p70]]] | [[[p60<=1 & 1<=p60] & [p80<=1 & 1<=p80]] | [p86<=1 & 1<=p86]]]]]]]]]
normalized: E [true U [[~ [EG [~ [[[[[[[p86<=1 & 1<=p86] | [[p80<=1 & 1<=p80] & [p60<=1 & 1<=p60]]] | [[[p70<=1 & 1<=p70] & [p53<=1 & 1<=p53]] & [p64<=1 & 1<=p64]]] & [p75<=1 & 1<=p75]] & [p35<=1 & 1<=p35]] & [[[p75<=1 & 1<=p75] & EG [[~ [EG [~ [[[p70<=1 & 1<=p70] & [p38<=1 & 1<=p38]]]]] & ~ [E [~ [[[p70<=1 & 1<=p70] & [p38<=1 & 1<=p38]]] U [~ [[p65<=1 & 1<=p65]] & ~ [[[p70<=1 & 1<=p70] & [p38<=1 & 1<=p38]]]]]]]]] & E [[p64<=1 & 1<=p64] U [p0<=1 & 1<=p0]]]]]]] & ~ [E [~ [[[[[[[p86<=1 & 1<=p86] | [[p80<=1 & 1<=p80] & [p60<=1 & 1<=p60]]] | [[[p70<=1 & 1<=p70] & [p53<=1 & 1<=p53]] & [p64<=1 & 1<=p64]]] & [p75<=1 & 1<=p75]] & [p35<=1 & 1<=p35]] & [[[p75<=1 & 1<=p75] & EG [[~ [EG [~ [[[p70<=1 & 1<=p70] & [p38<=1 & 1<=p38]]]]] & ~ [E [~ [[[p70<=1 & 1<=p70] & [p38<=1 & 1<=p38]]] U [~ [[p65<=1 & 1<=p65]] & ~ [[[p70<=1 & 1<=p70] & [p38<=1 & 1<=p38]]]]]]]]] & E [[p64<=1 & 1<=p64] U [p0<=1 & 1<=p0]]]]] U [EG [[[p74<=1 & 1<=p74] | [[p80<=1 & 1<=p80] & [p44<=1 & 1<=p44]]]] & ~ [[[[[[[p86<=1 & 1<=p86] | [[p80<=1 & 1<=p80] & [p60<=1 & 1<=p60]]] | [[[p70<=1 & 1<=p70] & [p53<=1 & 1<=p53]] & [p64<=1 & 1<=p64]]] & [p75<=1 & 1<=p75]] & [p35<=1 & 1<=p35]] & [[[p75<=1 & 1<=p75] & EG [[~ [EG [~ [[[p70<=1 & 1<=p70] & [p38<=1 & 1<=p38]]]]] & ~ [E [~ [[[p70<=1 & 1<=p70] & [p38<=1 & 1<=p38]]] U [~ [[p65<=1 & 1<=p65]] & ~ [[[p70<=1 & 1<=p70] & [p38<=1 & 1<=p38]]]]]]]]] & E [[p64<=1 & 1<=p64] U [p0<=1 & 1<=p0]]]]]]]]] & [~ [EG [~ [E [true U [p74<=1 & 1<=p74]]]]] & ~ [E [~ [E [true U [p74<=1 & 1<=p74]]] U [EX [~ [EX [[p70<=1 & 1<=p70]]]] & ~ [E [true U [p74<=1 & 1<=p74]]]]]]]]]
abstracting: (1<=p74)
states: 588,876,726,020 (11)
abstracting: (p74<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
..abstracting: (1<=p74)
states: 588,876,726,020 (11)
abstracting: (p74<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p74)
states: 588,876,726,020 (11)
abstracting: (p74<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p64)
states: 588,876,726,020 (11)
abstracting: (p64<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p38)
states: 588,876,726,020 (11)
abstracting: (p38<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p65)
states: 610,351,562,500 (11)
abstracting: (p65<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p38)
states: 588,876,726,020 (11)
abstracting: (p38<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p38)
states: 588,876,726,020 (11)
abstracting: (p38<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p35)
states: 610,351,562,500 (11)
abstracting: (p35<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p64)
states: 588,876,726,020 (11)
abstracting: (p64<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p53)
states: 588,876,726,020 (11)
abstracting: (p53<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p60)
states: 610,351,562,500 (11)
abstracting: (p60<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p86)
states: 741,464,616,645 (11)
abstracting: (p86<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p44)
states: 588,876,726,020 (11)
abstracting: (p44<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p74)
states: 588,876,726,020 (11)
abstracting: (p74<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p64)
states: 588,876,726,020 (11)
abstracting: (p64<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p38)
states: 588,876,726,020 (11)
abstracting: (p38<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p65)
states: 610,351,562,500 (11)
abstracting: (p65<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p38)
states: 588,876,726,020 (11)
abstracting: (p38<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p38)
states: 588,876,726,020 (11)
abstracting: (p38<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p35)
states: 610,351,562,500 (11)
abstracting: (p35<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p64)
states: 588,876,726,020 (11)
abstracting: (p64<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p53)
states: 588,876,726,020 (11)
abstracting: (p53<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p60)
states: 610,351,562,500 (11)
abstracting: (p60<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p86)
states: 741,464,616,645 (11)
abstracting: (p86<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p64)
states: 588,876,726,020 (11)
abstracting: (p64<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p38)
states: 588,876,726,020 (11)
abstracting: (p38<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p65)
states: 610,351,562,500 (11)
abstracting: (p65<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p38)
states: 588,876,726,020 (11)
abstracting: (p38<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p38)
states: 588,876,726,020 (11)
abstracting: (p38<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p35)
states: 610,351,562,500 (11)
abstracting: (p35<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p64)
states: 588,876,726,020 (11)
abstracting: (p64<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p53)
states: 588,876,726,020 (11)
abstracting: (p53<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p60)
states: 610,351,562,500 (11)
abstracting: (p60<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p86)
states: 741,464,616,645 (11)
abstracting: (p86<=1)
states: 2,965,858,466,581 (12)
EG iterations: 0
-> the formula is FALSE
FORMULA Raft-PT-04-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m57.980sec
checking: E [AG [[AF [AX [[[p80<=1 & 1<=p80] & [p81<=1 & 1<=p81]]]] & ~ [[[[[[p2<=1 & 1<=p2] & [p70<=1 & 1<=p70]] | [[p20<=1 & 1<=p20] & [p70<=1 & 1<=p70]]] & ~ [[[p7<=1 & 1<=p7] & [p75<=1 & 1<=p75]]]] | A [[[p13<=1 & 1<=p13] & [p80<=1 & 1<=p80]] U [p65<=1 & 1<=p65]]]]]] U [AX [A [E [[[p30<=1 & 1<=p30] & [p70<=1 & 1<=p70]] U [p69<=1 & 1<=p69]] U [[[[p6<=1 & 1<=p6] & [p75<=1 & 1<=p75]] | [p71<=1 & 1<=p71]] | [[[p27<=1 & 1<=p27] & [p80<=1 & 1<=p80]] | [[p60<=1 & 1<=p60] & [p80<=1 & 1<=p80]]]]]] | [[p75<=1 & 1<=p75] & [p81<=1 & 1<=p81]]]]
normalized: E [~ [E [true U ~ [[~ [[[~ [EG [~ [[p65<=1 & 1<=p65]]]] & ~ [E [~ [[p65<=1 & 1<=p65]] U [~ [[[p80<=1 & 1<=p80] & [p13<=1 & 1<=p13]]] & ~ [[p65<=1 & 1<=p65]]]]]] | [~ [[[p75<=1 & 1<=p75] & [p7<=1 & 1<=p7]]] & [[[p70<=1 & 1<=p70] & [p20<=1 & 1<=p20]] | [[p70<=1 & 1<=p70] & [p2<=1 & 1<=p2]]]]]] & ~ [EG [EX [~ [[[p81<=1 & 1<=p81] & [p80<=1 & 1<=p80]]]]]]]]]] U [[[p81<=1 & 1<=p81] & [p75<=1 & 1<=p75]] | ~ [EX [~ [[~ [EG [~ [[[[[p80<=1 & 1<=p80] & [p60<=1 & 1<=p60]] | [[p80<=1 & 1<=p80] & [p27<=1 & 1<=p27]]] | [[p71<=1 & 1<=p71] | [[p75<=1 & 1<=p75] & [p6<=1 & 1<=p6]]]]]]] & ~ [E [~ [[[[[p80<=1 & 1<=p80] & [p60<=1 & 1<=p60]] | [[p80<=1 & 1<=p80] & [p27<=1 & 1<=p27]]] | [[p71<=1 & 1<=p71] | [[p75<=1 & 1<=p75] & [p6<=1 & 1<=p6]]]]] U [~ [E [[[p70<=1 & 1<=p70] & [p30<=1 & 1<=p30]] U [p69<=1 & 1<=p69]]] & ~ [[[[[p80<=1 & 1<=p80] & [p60<=1 & 1<=p60]] | [[p80<=1 & 1<=p80] & [p27<=1 & 1<=p27]]] | [[p71<=1 & 1<=p71] | [[p75<=1 & 1<=p75] & [p6<=1 & 1<=p6]]]]]]]]]]]]]]
abstracting: (1<=p6)
states: 588,876,726,020 (11)
abstracting: (p6<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p71)
states: 588,876,726,020 (11)
abstracting: (p71<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p27)
states: 588,876,726,020 (11)
abstracting: (p27<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p60)
states: 610,351,562,500 (11)
abstracting: (p60<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p69)
states: 588,876,726,020 (11)
abstracting: (p69<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p30)
states: 610,351,562,500 (11)
abstracting: (p30<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p6)
states: 588,876,726,020 (11)
abstracting: (p6<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p71)
states: 588,876,726,020 (11)
abstracting: (p71<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p27)
states: 588,876,726,020 (11)
abstracting: (p27<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p60)
states: 610,351,562,500 (11)
abstracting: (p60<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p6)
states: 588,876,726,020 (11)
abstracting: (p6<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p71)
states: 588,876,726,020 (11)
abstracting: (p71<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p27)
states: 588,876,726,020 (11)
abstracting: (p27<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p60)
states: 610,351,562,500 (11)
abstracting: (p60<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
before gc: list nodes free: 2573169
after gc: idd nodes used:15456370, unused:48543630; list nodes free:235598881
..
EG iterations: 2
.abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p81)
states: 593,171,693,316 (11)
abstracting: (p81<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p81)
states: 593,171,693,316 (11)
abstracting: (p81<=1)
states: 2,965,858,466,581 (12)
..
EG iterations: 1
abstracting: (1<=p2)
states: 588,876,726,020 (11)
abstracting: (p2<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p20)
states: 610,351,562,500 (11)
abstracting: (p20<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p7)
states: 588,876,726,020 (11)
abstracting: (p7<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p65)
states: 610,351,562,500 (11)
abstracting: (p65<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p13)
states: 588,876,726,020 (11)
abstracting: (p13<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p65)
states: 610,351,562,500 (11)
abstracting: (p65<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p65)
states: 610,351,562,500 (11)
abstracting: (p65<=1)
states: 2,965,858,466,581 (12)
..
EG iterations: 2
-> the formula is TRUE
FORMULA Raft-PT-04-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 4m10.087sec
checking: ~ [A [[AF [EG [[[p46<=1 & 1<=p46] & [p65<=1 & 1<=p65]]]] | [AG [[A [[[p14<=1 & 1<=p14] & [p80<=1 & 1<=p80]] U [p61<=1 & 1<=p61]] | [[[p35<=1 & 1<=p35] & [p75<=1 & 1<=p75]] | [[p55<=1 & 1<=p55] & [p80<=1 & 1<=p80]]]]] | E [[[AF [[[p35<=1 & 1<=p35] & [p75<=1 & 1<=p75]]] & EX [[[p70<=1 & 1<=p70] & [p81<=1 & 1<=p81]]]] & [[p65<=1 & 1<=p65] & [p78<=1 & 1<=p78]]] U [EX [[p70<=1 & 1<=p70]] | A [[[p45<=1 & 1<=p45] & [p75<=1 & 1<=p75]] U [[p42<=1 & 1<=p42] & [p80<=1 & 1<=p80]]]]]]] U E [[AG [AX [[p69<=1 & 1<=p69]]] | [[p7<=1 & 1<=p7] & [p75<=1 & 1<=p75]]] U AG [AF [[[p45<=1 & 1<=p45] & [p75<=1 & 1<=p75]]]]]]]
normalized: ~ [[~ [EG [~ [E [[[[p75<=1 & 1<=p75] & [p7<=1 & 1<=p7]] | ~ [E [true U EX [~ [[p69<=1 & 1<=p69]]]]]] U ~ [E [true U EG [~ [[[p75<=1 & 1<=p75] & [p45<=1 & 1<=p45]]]]]]]]]] & ~ [E [~ [E [[[[p75<=1 & 1<=p75] & [p7<=1 & 1<=p7]] | ~ [E [true U EX [~ [[p69<=1 & 1<=p69]]]]]] U ~ [E [true U EG [~ [[[p75<=1 & 1<=p75] & [p45<=1 & 1<=p45]]]]]]]] U [~ [[[E [[[[p78<=1 & 1<=p78] & [p65<=1 & 1<=p65]] & [EX [[[p81<=1 & 1<=p81] & [p70<=1 & 1<=p70]]] & ~ [EG [~ [[[p75<=1 & 1<=p75] & [p35<=1 & 1<=p35]]]]]]] U [[~ [EG [~ [[[p80<=1 & 1<=p80] & [p42<=1 & 1<=p42]]]]] & ~ [E [~ [[[p80<=1 & 1<=p80] & [p42<=1 & 1<=p42]]] U [~ [[[p75<=1 & 1<=p75] & [p45<=1 & 1<=p45]]] & ~ [[[p80<=1 & 1<=p80] & [p42<=1 & 1<=p42]]]]]]] | EX [[p70<=1 & 1<=p70]]]] | ~ [E [true U ~ [[[[[p80<=1 & 1<=p80] & [p55<=1 & 1<=p55]] | [[p75<=1 & 1<=p75] & [p35<=1 & 1<=p35]]] | [~ [EG [~ [[p61<=1 & 1<=p61]]]] & ~ [E [~ [[p61<=1 & 1<=p61]] U [~ [[[p80<=1 & 1<=p80] & [p14<=1 & 1<=p14]]] & ~ [[p61<=1 & 1<=p61]]]]]]]]]]] | ~ [EG [~ [EG [[[p65<=1 & 1<=p65] & [p46<=1 & 1<=p46]]]]]]]] & ~ [E [[[[p75<=1 & 1<=p75] & [p7<=1 & 1<=p7]] | ~ [E [true U EX [~ [[p69<=1 & 1<=p69]]]]]] U ~ [E [true U EG [~ [[[p75<=1 & 1<=p75] & [p45<=1 & 1<=p45]]]]]]]]]]]]]
abstracting: (1<=p45)
states: 610,351,562,500 (11)
abstracting: (p45<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
..
EG iterations: 2
abstracting: (1<=p69)
states: 588,876,726,020 (11)
abstracting: (p69<=1)
states: 2,965,858,466,581 (12)
.abstracting: (1<=p7)
states: 588,876,726,020 (11)
abstracting: (p7<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p46)
states: 588,876,726,020 (11)
abstracting: (p46<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p65)
states: 610,351,562,500 (11)
abstracting: (p65<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p61)
states: 588,876,726,020 (11)
abstracting: (p61<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p14)
states: 588,876,726,020 (11)
abstracting: (p14<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p61)
states: 588,876,726,020 (11)
abstracting: (p61<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p61)
states: 588,876,726,020 (11)
abstracting: (p61<=1)
states: 2,965,858,466,581 (12)
before gc: list nodes free: 530707
after gc: idd nodes used:16656681, unused:47343319; list nodes free:231047792
.
EG iterations: 1
abstracting: (1<=p35)
states: 610,351,562,500 (11)
abstracting: (p35<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p55)
states: 610,351,562,500 (11)
abstracting: (p55<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
.abstracting: (1<=p42)
states: 588,876,726,020 (11)
abstracting: (p42<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p45)
states: 610,351,562,500 (11)
abstracting: (p45<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p42)
states: 588,876,726,020 (11)
abstracting: (p42<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p42)
states: 588,876,726,020 (11)
abstracting: (p42<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
abstracting: (1<=p35)
states: 610,351,562,500 (11)
abstracting: (p35<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
..
EG iterations: 2
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (p70<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p81)
states: 593,171,693,316 (11)
abstracting: (p81<=1)
states: 2,965,858,466,581 (12)
.abstracting: (1<=p65)
states: 610,351,562,500 (11)
abstracting: (p65<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p78)
states: 588,876,726,020 (11)
abstracting: (p78<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p45)
states: 610,351,562,500 (11)
abstracting: (p45<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
..
EG iterations: 2
abstracting: (1<=p69)
states: 588,876,726,020 (11)
abstracting: (p69<=1)
states: 2,965,858,466,581 (12)
.abstracting: (1<=p7)
states: 588,876,726,020 (11)
abstracting: (p7<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p45)
states: 610,351,562,500 (11)
abstracting: (p45<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
..
EG iterations: 2
abstracting: (1<=p69)
states: 588,876,726,020 (11)
abstracting: (p69<=1)
states: 2,965,858,466,581 (12)
.abstracting: (1<=p7)
states: 588,876,726,020 (11)
abstracting: (p7<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
EG iterations: 0
-> the formula is TRUE
FORMULA Raft-PT-04-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 3m48.231sec
totally nodes used: 363701582 (3.6e+08)
number of garbage collections: 6
fire ops cache: hits/miss/sum: 854835080 2166207603 3021042683
used/not used/entry size/cache size: 63012401 4096463 16 1024MB
basic ops cache: hits/miss/sum: 129223930 305153537 434377467
used/not used/entry size/cache size: 12476397 4300819 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: 12477810 31021760 43499570
used/not used/entry size/cache size: 2149412 6239196 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 33164815
1 22820209
2 8437905
3 2175345
4 431175
5 68923
6 9309
7 1065
8 106
9 10
>= 10 2
Total processing time: 28m13.950sec
BK_STOP 1679141679894
--------------------
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
384740 676523 697371 1180189
iterations count:482051 (3394), effective:29724 (209)
initing FirstDep: 0m 0.000sec
iterations count:1449 (10), effective:30 (0)
iterations count:485 (3), effective:27 (0)
iterations count:698 (4), effective:37 (0)
iterations count:787 (5), effective:19 (0)
iterations count:142 (1), effective:0 (0)
iterations count:703 (4), effective:25 (0)
iterations count:778 (5), effective:37 (0)
iterations count:557 (3), effective:15 (0)
iterations count:142 (1), effective:0 (0)
iterations count:265 (1), effective:4 (0)
iterations count:2457 (17), effective:91 (0)
iterations count:571 (4), effective:27 (0)
iterations count:908 (6), effective:20 (0)
iterations count:691 (4), effective:20 (0)
iterations count:149 (1), effective:1 (0)
iterations count:795 (5), effective:21 (0)
iterations count:441 (3), effective:9 (0)
iterations count:939 (6), effective:26 (0)
iterations count:725 (5), effective:37 (0)
iterations count:256 (1), effective:8 (0)
iterations count:308 (2), effective:19 (0)
iterations count:1609 (11), effective:138 (0)
iterations count:803 (5), effective:17 (0)
iterations count:147 (1), effective:1 (0)
iterations count:689 (4), effective:17 (0)
iterations count:1428 (10), effective:34 (0)
iterations count:1428 (10), effective:34 (0)
iterations count:1428 (10), effective:34 (0)
iterations count:142 (1), effective:0 (0)
iterations count:664 (4), effective:21 (0)
iterations count:142 (1), effective:0 (0)
iterations count:664 (4), effective:21 (0)
iterations count:1428 (10), effective:34 (0)
iterations count:142 (1), effective:0 (0)
iterations count:664 (4), effective:21 (0)
iterations count:727 (5), effective:21 (0)
iterations count:408 (2), effective:16 (0)
iterations count:850 (5), effective:17 (0)
iterations count:276 (1), effective:1 (0)
iterations count:142 (1), effective:0 (0)
iterations count:823 (5), effective:18 (0)
iterations count:142 (1), effective:0 (0)
iterations count:673 (4), effective:13 (0)
iterations count:1136 (8), effective:33 (0)
iterations count:689 (4), effective:17 (0)
iterations count:142 (1), effective:0 (0)
iterations count:823 (5), effective:18 (0)
iterations count:142 (1), effective:0 (0)
iterations count:823 (5), effective:18 (0)
iterations count:142 (1), effective:0 (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-04"
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-04, 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-167889203100306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Raft-PT-04.tgz
mv Raft-PT-04 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 ;