About the Execution of Marcie+red for AutoFlight-PT-01b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8573.636 | 58924.00 | 70647.00 | 38.00 | FFTTTFFTFTFTFTTF | 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.r010-oct2-167813599000378.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutoFlight-PT-01b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599000378
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 7.9K Feb 25 18:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 18:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 18:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 26K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-00
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-01
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-02
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-03
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-04
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-05
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-06
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-07
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-08
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-09
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-10
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-11
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-12
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-13
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-14
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678687292799
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=AutoFlight-PT-01b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 06:01:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 06:01:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:01:35] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2023-03-13 06:01:35] [INFO ] Transformed 114 places.
[2023-03-13 06:01:35] [INFO ] Transformed 112 transitions.
[2023-03-13 06:01:35] [INFO ] Found NUPN structural information;
[2023-03-13 06:01:35] [INFO ] Parsed PT model containing 114 places and 112 transitions and 264 arcs in 97 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 72 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Applied a total of 0 rules in 11 ms. Remains 114 /114 variables (removed 0) and now considering 112/112 (removed 0) transitions.
// Phase 1: matrix 112 rows 114 cols
[2023-03-13 06:01:35] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-13 06:01:35] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-13 06:01:35] [INFO ] Invariant cache hit.
[2023-03-13 06:01:36] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2023-03-13 06:01:36] [INFO ] Invariant cache hit.
[2023-03-13 06:01:36] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 836 ms. Remains : 114/114 places, 112/112 transitions.
Support contains 72 out of 114 places after structural reductions.
[2023-03-13 06:01:36] [INFO ] Flatten gal took : 32 ms
[2023-03-13 06:01:36] [INFO ] Flatten gal took : 11 ms
[2023-03-13 06:01:36] [INFO ] Input system was already deterministic with 112 transitions.
Support contains 71 out of 114 places (down from 72) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 69) seen :57
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-13 06:01:37] [INFO ] Invariant cache hit.
[2023-03-13 06:01:37] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 06:01:37] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-13 06:01:38] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :2 sat :5
[2023-03-13 06:01:38] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 3 ms to minimize.
[2023-03-13 06:01:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-13 06:01:38] [INFO ] After 140ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :0 real:4
[2023-03-13 06:01:38] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:4
[2023-03-13 06:01:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 06:01:38] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-13 06:01:38] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-13 06:01:38] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2023-03-13 06:01:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-13 06:01:38] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-13 06:01:38] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 49 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 4 properties in 14 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-13 06:01:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 8 ms
FORMULA AutoFlight-PT-01b-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 14 ms
[2023-03-13 06:01:38] [INFO ] Input system was already deterministic with 112 transitions.
Support contains 62 out of 114 places (down from 66) after GAL structural reductions.
Computed a total of 36 stabilizing places and 36 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 100 transition count 98
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 100 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 100 transition count 96
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 95 transition count 91
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 95 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 94 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 94 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 93 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 93 transition count 89
Applied a total of 44 rules in 15 ms. Remains 93 /114 variables (removed 21) and now considering 89/112 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 93/114 places, 89/112 transitions.
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:01:38] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 103 transition count 101
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 103 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 103 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 101 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 101 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 100 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 100 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 99 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 99 transition count 95
Applied a total of 32 rules in 20 ms. Remains 99 /114 variables (removed 15) and now considering 95/112 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 99/114 places, 95/112 transitions.
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:01:38] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 99 transition count 97
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 99 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 99 transition count 95
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 94 transition count 90
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 94 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 93 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 93 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 92 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 92 transition count 88
Applied a total of 46 rules in 11 ms. Remains 92 /114 variables (removed 22) and now considering 88/112 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 92/114 places, 88/112 transitions.
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:01:38] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 100 transition count 98
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 100 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 100 transition count 96
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 95 transition count 91
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 95 transition count 91
Applied a total of 40 rules in 6 ms. Remains 95 /114 variables (removed 19) and now considering 91/112 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 95/114 places, 91/112 transitions.
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:01:38] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 102 transition count 100
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 102 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 102 transition count 98
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 98 transition count 94
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 98 transition count 94
Applied a total of 34 rules in 8 ms. Remains 98 /114 variables (removed 16) and now considering 94/112 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 98/114 places, 94/112 transitions.
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:01:38] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 102 transition count 100
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 102 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 102 transition count 99
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 97 transition count 94
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 97 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 96 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 96 transition count 93
Applied a total of 37 rules in 4 ms. Remains 96 /114 variables (removed 18) and now considering 93/112 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 96/114 places, 93/112 transitions.
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:01:38] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 102 transition count 100
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 102 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 102 transition count 98
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 98 transition count 94
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 98 transition count 94
Applied a total of 34 rules in 5 ms. Remains 98 /114 variables (removed 16) and now considering 94/112 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 98/114 places, 94/112 transitions.
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:01:38] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 113 transition count 71
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 87 place count 73 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 71 transition count 64
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 89 place count 71 transition count 46
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 125 place count 53 transition count 46
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 135 place count 43 transition count 36
Iterating global reduction 3 with 10 rules applied. Total rules applied 145 place count 43 transition count 36
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 145 place count 43 transition count 33
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 151 place count 40 transition count 33
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 171 place count 30 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 29 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 173 place count 28 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 173 place count 28 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 175 place count 27 transition count 21
Applied a total of 175 rules in 31 ms. Remains 27 /114 variables (removed 87) and now considering 21/112 (removed 91) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 27/114 places, 21/112 transitions.
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 1 ms
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 1 ms
[2023-03-13 06:01:38] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 100 transition count 98
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 100 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 100 transition count 96
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 95 transition count 91
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 95 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 94 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 94 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 93 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 93 transition count 89
Applied a total of 44 rules in 6 ms. Remains 93 /114 variables (removed 21) and now considering 89/112 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 93/114 places, 89/112 transitions.
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 21 ms
[2023-03-13 06:01:38] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 113 transition count 78
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 73 place count 80 transition count 71
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 77 place count 78 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 79 place count 76 transition count 69
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 79 place count 76 transition count 50
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 117 place count 57 transition count 50
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 125 place count 49 transition count 42
Iterating global reduction 4 with 8 rules applied. Total rules applied 133 place count 49 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 133 place count 49 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 135 place count 48 transition count 41
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 157 place count 37 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 36 transition count 29
Applied a total of 158 rules in 24 ms. Remains 36 /114 variables (removed 78) and now considering 29/112 (removed 83) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 36/114 places, 29/112 transitions.
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:01:38] [INFO ] Flatten gal took : 1 ms
[2023-03-13 06:01:38] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 101 transition count 99
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 101 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 101 transition count 98
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 96 transition count 93
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 96 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 95 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 95 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 94 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 94 transition count 91
Applied a total of 41 rules in 13 ms. Remains 94 /114 variables (removed 20) and now considering 91/112 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 94/114 places, 91/112 transitions.
[2023-03-13 06:01:39] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:01:39] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:01:39] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 102 transition count 100
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 102 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 102 transition count 98
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 97 transition count 93
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 97 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 96 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 96 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 95 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 95 transition count 91
Applied a total of 40 rules in 5 ms. Remains 95 /114 variables (removed 19) and now considering 91/112 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 95/114 places, 91/112 transitions.
[2023-03-13 06:01:39] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:01:39] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:01:39] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 113 transition count 71
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 87 place count 73 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 71 transition count 64
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 89 place count 71 transition count 46
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 125 place count 53 transition count 46
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 135 place count 43 transition count 36
Iterating global reduction 3 with 10 rules applied. Total rules applied 145 place count 43 transition count 36
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 145 place count 43 transition count 33
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 151 place count 40 transition count 33
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 171 place count 30 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 29 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 173 place count 28 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 173 place count 28 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 175 place count 27 transition count 21
Applied a total of 175 rules in 23 ms. Remains 27 /114 variables (removed 87) and now considering 21/112 (removed 91) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 27/114 places, 21/112 transitions.
[2023-03-13 06:01:39] [INFO ] Flatten gal took : 1 ms
[2023-03-13 06:01:39] [INFO ] Flatten gal took : 1 ms
[2023-03-13 06:01:39] [INFO ] Input system was already deterministic with 21 transitions.
Finished random walk after 150 steps, including 18 resets, run visited all 1 properties in 2 ms. (steps per millisecond=75 )
FORMULA AutoFlight-PT-01b-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 113 transition count 77
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 41 rules applied. Total rules applied 75 place count 79 transition count 70
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 84 place count 74 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 73 transition count 66
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 85 place count 73 transition count 50
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 117 place count 57 transition count 50
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 127 place count 47 transition count 40
Iterating global reduction 4 with 10 rules applied. Total rules applied 137 place count 47 transition count 40
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 137 place count 47 transition count 38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 141 place count 45 transition count 38
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 161 place count 35 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 34 transition count 27
Applied a total of 162 rules in 10 ms. Remains 34 /114 variables (removed 80) and now considering 27/112 (removed 85) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 34/114 places, 27/112 transitions.
[2023-03-13 06:01:39] [INFO ] Flatten gal took : 1 ms
[2023-03-13 06:01:39] [INFO ] Flatten gal took : 1 ms
[2023-03-13 06:01:39] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 101 transition count 99
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 101 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 101 transition count 97
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 97 transition count 93
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 97 transition count 93
Applied a total of 36 rules in 4 ms. Remains 97 /114 variables (removed 17) and now considering 93/112 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 97/114 places, 93/112 transitions.
[2023-03-13 06:01:39] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:01:39] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:01:39] [INFO ] Input system was already deterministic with 93 transitions.
[2023-03-13 06:01:39] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:01:39] [INFO ] Flatten gal took : 11 ms
[2023-03-13 06:01:39] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 06:01:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 114 places, 112 transitions and 264 arcs took 0 ms.
Total runtime 3819 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: 114 NrTr: 112 NrArc: 264)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 2.939sec
RS generation: 0m 0.172sec
-> reachability set: #nodes 9307 (9.3e+03) #states 48,881,955 (7)
starting MCC model checker
--------------------------
checking: AG [EF [[p31<=1 & 1<=p31]]]
normalized: ~ [E [true U ~ [E [true U [p31<=1 & 1<=p31]]]]]
abstracting: (1<=p31)
states: 693,000 (5)
abstracting: (p31<=1)
states: 48,881,955 (7)
-> the formula is FALSE
FORMULA AutoFlight-PT-01b-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.344sec
checking: [AF [EX [EX [AX [[1<=p47 & p47<=1]]]]] | AG [[p78<=0 & 0<=p78]]]
normalized: [~ [E [true U ~ [[p78<=0 & 0<=p78]]]] | ~ [EG [~ [EX [EX [~ [EX [~ [[1<=p47 & p47<=1]]]]]]]]]]
abstracting: (p47<=1)
states: 48,881,955 (7)
abstracting: (1<=p47)
states: 2,511,136 (6)
........................................................
EG iterations: 53
abstracting: (0<=p78)
states: 48,881,955 (7)
abstracting: (p78<=0)
states: 44,262,562 (7)
-> the formula is FALSE
FORMULA AutoFlight-PT-01b-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.298sec
checking: EG [[AF [[AX [[p40<=0 & 0<=p40]] | [p104<=1 & 1<=p104]]] | EG [[p55<=0 & 0<=p55]]]]
normalized: EG [[EG [[p55<=0 & 0<=p55]] | ~ [EG [~ [[[p104<=1 & 1<=p104] | ~ [EX [~ [[p40<=0 & 0<=p40]]]]]]]]]]
abstracting: (0<=p40)
states: 48,881,955 (7)
abstracting: (p40<=0)
states: 46,513,363 (7)
.abstracting: (1<=p104)
states: 2,388,556 (6)
abstracting: (p104<=1)
states: 48,881,955 (7)
....................................................
EG iterations: 52
abstracting: (0<=p55)
states: 48,881,955 (7)
abstracting: (p55<=0)
states: 44,489,871 (7)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA AutoFlight-PT-01b-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.068sec
checking: AF [EG [[[p27<=0 & 0<=p27] | ~ [E [EX [[p67<=1 & 1<=p67]] U [[p68<=1 & 1<=p68] & [[p112<=1 & 1<=p112] & [p54<=1 & 1<=p54]]]]]]]]
normalized: ~ [EG [~ [EG [[~ [E [EX [[p67<=1 & 1<=p67]] U [[[p54<=1 & 1<=p54] & [p112<=1 & 1<=p112]] & [p68<=1 & 1<=p68]]]] | [p27<=0 & 0<=p27]]]]]]
abstracting: (0<=p27)
states: 48,881,955 (7)
abstracting: (p27<=0)
states: 42,678,415 (7)
abstracting: (1<=p68)
states: 1,071,000 (6)
abstracting: (p68<=1)
states: 48,881,955 (7)
abstracting: (1<=p112)
states: 19,955,784 (7)
abstracting: (p112<=1)
states: 48,881,955 (7)
abstracting: (1<=p54)
states: 4,392,084 (6)
abstracting: (p54<=1)
states: 48,881,955 (7)
abstracting: (1<=p67)
states: 5,018,544 (6)
abstracting: (p67<=1)
states: 48,881,955 (7)
..
EG iterations: 1
..............................
EG iterations: 30
-> the formula is TRUE
FORMULA AutoFlight-PT-01b-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.349sec
checking: AG [[A [~ [[p61<=1 & 1<=p61]] U AG [[[p27<=1 & 1<=p27] & [[p43<=1 & 1<=p43] | [p79<=1 & 1<=p79]]]]] | [p37<=0 & 0<=p37]]]
normalized: ~ [E [true U ~ [[[p37<=0 & 0<=p37] | [~ [EG [E [true U ~ [[[[p79<=1 & 1<=p79] | [p43<=1 & 1<=p43]] & [p27<=1 & 1<=p27]]]]]] & ~ [E [E [true U ~ [[[[p79<=1 & 1<=p79] | [p43<=1 & 1<=p43]] & [p27<=1 & 1<=p27]]]] U [[p61<=1 & 1<=p61] & E [true U ~ [[[[p79<=1 & 1<=p79] | [p43<=1 & 1<=p43]] & [p27<=1 & 1<=p27]]]]]]]]]]]]
abstracting: (1<=p27)
states: 6,203,540 (6)
abstracting: (p27<=1)
states: 48,881,955 (7)
abstracting: (1<=p43)
states: 2,120,452 (6)
abstracting: (p43<=1)
states: 48,881,955 (7)
abstracting: (1<=p79)
states: 4,619,393 (6)
abstracting: (p79<=1)
states: 48,881,955 (7)
abstracting: (1<=p61)
states: 7,097,584 (6)
abstracting: (p61<=1)
states: 48,881,955 (7)
abstracting: (1<=p27)
states: 6,203,540 (6)
abstracting: (p27<=1)
states: 48,881,955 (7)
abstracting: (1<=p43)
states: 2,120,452 (6)
abstracting: (p43<=1)
states: 48,881,955 (7)
abstracting: (1<=p79)
states: 4,619,393 (6)
abstracting: (p79<=1)
states: 48,881,955 (7)
abstracting: (1<=p27)
states: 6,203,540 (6)
abstracting: (p27<=1)
states: 48,881,955 (7)
abstracting: (1<=p43)
states: 2,120,452 (6)
abstracting: (p43<=1)
states: 48,881,955 (7)
abstracting: (1<=p79)
states: 4,619,393 (6)
abstracting: (p79<=1)
states: 48,881,955 (7)
EG iterations: 0
abstracting: (0<=p37)
states: 48,881,955 (7)
abstracting: (p37<=0)
states: 48,405,955 (7)
-> the formula is FALSE
FORMULA AutoFlight-PT-01b-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.884sec
checking: ~ [A [A [EG [EF [[p14<=1 & 1<=p14]]] U [p58<=1 & 1<=p58]] U A [~ [EX [[[p9<=1 & 1<=p9] | [p72<=1 & 1<=p72]]]] U [p41<=1 & 1<=p41]]]]
normalized: ~ [[~ [EG [~ [[~ [EG [~ [[p41<=1 & 1<=p41]]]] & ~ [E [~ [[p41<=1 & 1<=p41]] U [EX [[[p72<=1 & 1<=p72] | [p9<=1 & 1<=p9]]] & ~ [[p41<=1 & 1<=p41]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[p41<=1 & 1<=p41]]]] & ~ [E [~ [[p41<=1 & 1<=p41]] U [EX [[[p72<=1 & 1<=p72] | [p9<=1 & 1<=p9]]] & ~ [[p41<=1 & 1<=p41]]]]]]] U [~ [[~ [EG [~ [[p58<=1 & 1<=p58]]]] & ~ [E [~ [[p58<=1 & 1<=p58]] U [~ [EG [E [true U [p14<=1 & 1<=p14]]]] & ~ [[p58<=1 & 1<=p58]]]]]]] & ~ [[~ [EG [~ [[p41<=1 & 1<=p41]]]] & ~ [E [~ [[p41<=1 & 1<=p41]] U [EX [[[p72<=1 & 1<=p72] | [p9<=1 & 1<=p9]]] & ~ [[p41<=1 & 1<=p41]]]]]]]]]]]]
abstracting: (1<=p41)
states: 5,284,136 (6)
abstracting: (p41<=1)
states: 48,881,955 (7)
abstracting: (1<=p9)
states: 6,156,380 (6)
abstracting: (p9<=1)
states: 48,881,955 (7)
abstracting: (1<=p72)
states: 833,000 (5)
abstracting: (p72<=1)
states: 48,881,955 (7)
.abstracting: (1<=p41)
states: 5,284,136 (6)
abstracting: (p41<=1)
states: 48,881,955 (7)
abstracting: (1<=p41)
states: 5,284,136 (6)
abstracting: (p41<=1)
states: 48,881,955 (7)
.............................................................
EG iterations: 61
abstracting: (1<=p58)
states: 2,164,738 (6)
abstracting: (p58<=1)
states: 48,881,955 (7)
abstracting: (1<=p14)
states: 2,862,816 (6)
abstracting: (p14<=1)
states: 48,881,955 (7)
.............................................
EG iterations: 45
abstracting: (1<=p58)
states: 2,164,738 (6)
abstracting: (p58<=1)
states: 48,881,955 (7)
abstracting: (1<=p58)
states: 2,164,738 (6)
abstracting: (p58<=1)
states: 48,881,955 (7)
......................................
EG iterations: 38
abstracting: (1<=p41)
states: 5,284,136 (6)
abstracting: (p41<=1)
states: 48,881,955 (7)
abstracting: (1<=p9)
states: 6,156,380 (6)
abstracting: (p9<=1)
states: 48,881,955 (7)
abstracting: (1<=p72)
states: 833,000 (5)
abstracting: (p72<=1)
states: 48,881,955 (7)
.abstracting: (1<=p41)
states: 5,284,136 (6)
abstracting: (p41<=1)
states: 48,881,955 (7)
abstracting: (1<=p41)
states: 5,284,136 (6)
abstracting: (p41<=1)
states: 48,881,955 (7)
.............................................................
EG iterations: 61
abstracting: (1<=p41)
states: 5,284,136 (6)
abstracting: (p41<=1)
states: 48,881,955 (7)
abstracting: (1<=p9)
states: 6,156,380 (6)
abstracting: (p9<=1)
states: 48,881,955 (7)
abstracting: (1<=p72)
states: 833,000 (5)
abstracting: (p72<=1)
states: 48,881,955 (7)
.abstracting: (1<=p41)
states: 5,284,136 (6)
abstracting: (p41<=1)
states: 48,881,955 (7)
abstracting: (1<=p41)
states: 5,284,136 (6)
abstracting: (p41<=1)
states: 48,881,955 (7)
.............................................................
EG iterations: 61
............................................................
EG iterations: 60
-> the formula is TRUE
FORMULA AutoFlight-PT-01b-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.543sec
checking: AG [AF [[EX [[p1<=1 & 1<=p1]] | [AX [[p87<=1 & 1<=p87]] & [[p13<=1 & 1<=p13] & [EG [[p47<=1 & 1<=p47]] | [p37<=0 & 0<=p37]]]]]]]
normalized: ~ [E [true U EG [~ [[[[[[p37<=0 & 0<=p37] | EG [[p47<=1 & 1<=p47]]] & [p13<=1 & 1<=p13]] & ~ [EX [~ [[p87<=1 & 1<=p87]]]]] | EX [[p1<=1 & 1<=p1]]]]]]]
abstracting: (1<=p1)
states: 1
abstracting: (p1<=1)
states: 48,881,955 (7)
.abstracting: (1<=p87)
states: 1,617,000 (6)
abstracting: (p87<=1)
states: 48,881,955 (7)
.abstracting: (1<=p13)
states: 2,862,816 (6)
abstracting: (p13<=1)
states: 48,881,955 (7)
abstracting: (1<=p47)
states: 2,511,136 (6)
abstracting: (p47<=1)
states: 48,881,955 (7)
......................................
EG iterations: 38
abstracting: (0<=p37)
states: 48,881,955 (7)
abstracting: (p37<=0)
states: 48,405,955 (7)
..
EG iterations: 2
-> the formula is FALSE
FORMULA AutoFlight-PT-01b-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.493sec
checking: EF [[EF [[[EG [[p67<=0 & 0<=p67]] & [[[p15<=0 & 0<=p15] | [p97<=0 & 0<=p97]] & [p25<=0 & 0<=p25]]] | EG [[p60<=0 & 0<=p60]]]] & EG [[p56<=1 & 1<=p56]]]]
normalized: E [true U [EG [[p56<=1 & 1<=p56]] & E [true U [EG [[p60<=0 & 0<=p60]] | [[[p25<=0 & 0<=p25] & [[p97<=0 & 0<=p97] | [p15<=0 & 0<=p15]]] & EG [[p67<=0 & 0<=p67]]]]]]]
abstracting: (0<=p67)
states: 48,881,955 (7)
abstracting: (p67<=0)
states: 43,863,411 (7)
........................................
EG iterations: 40
abstracting: (0<=p15)
states: 48,881,955 (7)
abstracting: (p15<=0)
states: 42,725,575 (7)
abstracting: (0<=p97)
states: 48,881,955 (7)
abstracting: (p97<=0)
states: 46,585,507 (7)
abstracting: (0<=p25)
states: 48,881,955 (7)
abstracting: (p25<=0)
states: 46,192,499 (7)
abstracting: (0<=p60)
states: 48,881,955 (7)
abstracting: (p60<=0)
states: 41,784,371 (7)
...................................................
EG iterations: 51
abstracting: (1<=p56)
states: 4,392,084 (6)
abstracting: (p56<=1)
states: 48,881,955 (7)
......................................
EG iterations: 38
-> the formula is TRUE
FORMULA AutoFlight-PT-01b-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.686sec
checking: [EF [AX [[p31<=1 & 1<=p31]]] | A [EX [~ [[~ [EX [[p30<=1 & 1<=p30]]] | [[[p28<=1 & 1<=p28] & [p108<=1 & 1<=p108]] | [[p95<=1 & 1<=p95] & [[p112<=1 & 1<=p112] & [p0<=1 & 1<=p0]]]]]]] U AX [[p78<=1 & 1<=p78]]]]
normalized: [[~ [EG [EX [~ [[p78<=1 & 1<=p78]]]]] & ~ [E [EX [~ [[p78<=1 & 1<=p78]]] U [~ [EX [~ [[[[[[p0<=1 & 1<=p0] & [p112<=1 & 1<=p112]] & [p95<=1 & 1<=p95]] | [[p108<=1 & 1<=p108] & [p28<=1 & 1<=p28]]] | ~ [EX [[p30<=1 & 1<=p30]]]]]]] & EX [~ [[p78<=1 & 1<=p78]]]]]]] | E [true U ~ [EX [~ [[p31<=1 & 1<=p31]]]]]]
abstracting: (1<=p31)
states: 693,000 (5)
abstracting: (p31<=1)
states: 48,881,955 (7)
.abstracting: (1<=p78)
states: 4,619,393 (6)
abstracting: (p78<=1)
states: 48,881,955 (7)
.abstracting: (1<=p30)
states: 4,256,392 (6)
abstracting: (p30<=1)
states: 48,881,955 (7)
.abstracting: (1<=p28)
states: 1,757,514 (6)
abstracting: (p28<=1)
states: 48,881,955 (7)
abstracting: (1<=p108)
states: 2,388,556 (6)
abstracting: (p108<=1)
states: 48,881,955 (7)
abstracting: (1<=p95)
states: 1,852,928 (6)
abstracting: (p95<=1)
states: 48,881,955 (7)
abstracting: (1<=p112)
states: 19,955,784 (7)
abstracting: (p112<=1)
states: 48,881,955 (7)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 48,881,955 (7)
.abstracting: (1<=p78)
states: 4,619,393 (6)
abstracting: (p78<=1)
states: 48,881,955 (7)
.abstracting: (1<=p78)
states: 4,619,393 (6)
abstracting: (p78<=1)
states: 48,881,955 (7)
........................................................
EG iterations: 55
-> the formula is TRUE
FORMULA AutoFlight-PT-01b-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.579sec
checking: [EG [AF [EX [[[[p107<=1 & 1<=p107] | [p21<=1 & 1<=p21]] & [[p39<=1 & 1<=p39] | [p17<=1 & 1<=p17]]]]]] & E [AF [~ [[[p68<=1 & 1<=p68] & [p112<=1 & 1<=p112]]]] U [~ [EG [~ [[p48<=1 & 1<=p48]]]] | [[p57<=1 & 1<=p57] | ~ [[p24<=1 & 1<=p24]]]]]]
normalized: [EG [~ [EG [~ [EX [[[[p21<=1 & 1<=p21] | [p107<=1 & 1<=p107]] & [[p17<=1 & 1<=p17] | [p39<=1 & 1<=p39]]]]]]]] & E [~ [EG [[[p112<=1 & 1<=p112] & [p68<=1 & 1<=p68]]]] U [[~ [[p24<=1 & 1<=p24]] | [p57<=1 & 1<=p57]] | ~ [EG [~ [[p48<=1 & 1<=p48]]]]]]]
abstracting: (1<=p48)
states: 4,392,084 (6)
abstracting: (p48<=1)
states: 48,881,955 (7)
......................................
EG iterations: 38
abstracting: (1<=p57)
states: 4,392,084 (6)
abstracting: (p57<=1)
states: 48,881,955 (7)
abstracting: (1<=p24)
states: 2,689,456 (6)
abstracting: (p24<=1)
states: 48,881,955 (7)
abstracting: (1<=p68)
states: 1,071,000 (6)
abstracting: (p68<=1)
states: 48,881,955 (7)
abstracting: (1<=p112)
states: 19,955,784 (7)
abstracting: (p112<=1)
states: 48,881,955 (7)
......................................
EG iterations: 38
abstracting: (1<=p39)
states: 2,368,592 (6)
abstracting: (p39<=1)
states: 48,881,955 (7)
abstracting: (1<=p17)
states: 2,681,734 (6)
abstracting: (p17<=1)
states: 48,881,955 (7)
abstracting: (1<=p107)
states: 2,388,556 (6)
abstracting: (p107<=1)
states: 48,881,955 (7)
abstracting: (1<=p21)
states: 3,498,920 (6)
abstracting: (p21<=1)
states: 48,881,955 (7)
...........................................
EG iterations: 42
...............................................................
EG iterations: 63
-> the formula is FALSE
FORMULA AutoFlight-PT-01b-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.272sec
checking: EG [[[p44<=0 & 0<=p44] & [E [[p61<=1 & 1<=p61] U [p58<=1 & 1<=p58]] | [[[p93<=0 & 0<=p93] & AF [[p65<=0 & 0<=p65]]] & [EX [[p59<=0 & 0<=p59]] & [EF [[p30<=0 & 0<=p30]] | [[p24<=0 & 0<=p24] & [p5<=0 & 0<=p5]]]]]]]]
normalized: EG [[[[[[[[p5<=0 & 0<=p5] & [p24<=0 & 0<=p24]] | E [true U [p30<=0 & 0<=p30]]] & EX [[p59<=0 & 0<=p59]]] & [~ [EG [~ [[p65<=0 & 0<=p65]]]] & [p93<=0 & 0<=p93]]] | E [[p61<=1 & 1<=p61] U [p58<=1 & 1<=p58]]] & [p44<=0 & 0<=p44]]]
abstracting: (0<=p44)
states: 48,881,955 (7)
abstracting: (p44<=0)
states: 46,761,503 (7)
abstracting: (1<=p58)
states: 2,164,738 (6)
abstracting: (p58<=1)
states: 48,881,955 (7)
abstracting: (1<=p61)
states: 7,097,584 (6)
abstracting: (p61<=1)
states: 48,881,955 (7)
abstracting: (0<=p93)
states: 48,881,955 (7)
abstracting: (p93<=0)
states: 46,493,399 (7)
abstracting: (0<=p65)
states: 48,881,955 (7)
abstracting: (p65<=0)
states: 48,252,794 (7)
.....................................................
EG iterations: 53
abstracting: (0<=p59)
states: 48,881,955 (7)
abstracting: (p59<=0)
states: 31,538,775 (7)
.abstracting: (0<=p30)
states: 48,881,955 (7)
abstracting: (p30<=0)
states: 44,625,563 (7)
abstracting: (0<=p24)
states: 48,881,955 (7)
abstracting: (p24<=0)
states: 46,192,499 (7)
abstracting: (0<=p5)
states: 48,881,955 (7)
abstracting: (p5<=0)
states: 48,866,819 (7)
..........................................................
EG iterations: 58
-> the formula is TRUE
FORMULA AutoFlight-PT-01b-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.253sec
checking: EX [[[AF [EG [[[[p41<=0 & 0<=p41] | [p86<=0 & 0<=p86]] & [p25<=0 & 0<=p25]]]] | A [AF [[[p44<=1 & 1<=p44] | [p36<=1 & 1<=p36]]] U ~ [AF [[p44<=1 & 1<=p44]]]]] | [[p103<=1 & 1<=p103] | EX [A [[p60<=1 & 1<=p60] U [[p95<=1 & 1<=p95] & [p112<=1 & 1<=p112]]]]]]]
normalized: EX [[[EX [[~ [E [~ [[[p112<=1 & 1<=p112] & [p95<=1 & 1<=p95]]] U [~ [[p60<=1 & 1<=p60]] & ~ [[[p112<=1 & 1<=p112] & [p95<=1 & 1<=p95]]]]]] & ~ [EG [~ [[[p112<=1 & 1<=p112] & [p95<=1 & 1<=p95]]]]]]] | [p103<=1 & 1<=p103]] | [[~ [EG [~ [EG [~ [[p44<=1 & 1<=p44]]]]]] & ~ [E [~ [EG [~ [[p44<=1 & 1<=p44]]]] U [EG [~ [[[p36<=1 & 1<=p36] | [p44<=1 & 1<=p44]]]] & ~ [EG [~ [[p44<=1 & 1<=p44]]]]]]]] | ~ [EG [~ [EG [[[p25<=0 & 0<=p25] & [[p86<=0 & 0<=p86] | [p41<=0 & 0<=p41]]]]]]]]]]
abstracting: (0<=p41)
states: 48,881,955 (7)
abstracting: (p41<=0)
states: 43,597,819 (7)
abstracting: (0<=p86)
states: 48,881,955 (7)
abstracting: (p86<=0)
states: 47,264,955 (7)
abstracting: (0<=p25)
states: 48,881,955 (7)
abstracting: (p25<=0)
states: 46,192,499 (7)
......................................
EG iterations: 38
.......................................................
EG iterations: 55
abstracting: (1<=p44)
states: 2,120,452 (6)
abstracting: (p44<=1)
states: 48,881,955 (7)
..........................................................
EG iterations: 58
abstracting: (1<=p44)
states: 2,120,452 (6)
abstracting: (p44<=1)
states: 48,881,955 (7)
abstracting: (1<=p36)
states: 1,266,768 (6)
abstracting: (p36<=1)
states: 48,881,955 (7)
..........................................................
EG iterations: 58
abstracting: (1<=p44)
states: 2,120,452 (6)
abstracting: (p44<=1)
states: 48,881,955 (7)
..........................................................
EG iterations: 58
abstracting: (1<=p44)
states: 2,120,452 (6)
abstracting: (p44<=1)
states: 48,881,955 (7)
..........................................................
EG iterations: 58
...........................................................
EG iterations: 59
abstracting: (1<=p103)
states: 2,388,556 (6)
abstracting: (p103<=1)
states: 48,881,955 (7)
abstracting: (1<=p95)
states: 1,852,928 (6)
abstracting: (p95<=1)
states: 48,881,955 (7)
abstracting: (1<=p112)
states: 19,955,784 (7)
abstracting: (p112<=1)
states: 48,881,955 (7)
..........................................
EG iterations: 42
abstracting: (1<=p95)
states: 1,852,928 (6)
abstracting: (p95<=1)
states: 48,881,955 (7)
abstracting: (1<=p112)
states: 19,955,784 (7)
abstracting: (p112<=1)
states: 48,881,955 (7)
abstracting: (1<=p60)
states: 7,097,584 (6)
abstracting: (p60<=1)
states: 48,881,955 (7)
abstracting: (1<=p95)
states: 1,852,928 (6)
abstracting: (p95<=1)
states: 48,881,955 (7)
abstracting: (1<=p112)
states: 19,955,784 (7)
abstracting: (p112<=1)
states: 48,881,955 (7)
..-> the formula is TRUE
FORMULA AutoFlight-PT-01b-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.173sec
checking: E [EX [EF [[[p35<=1 & 1<=p35] | [[p41<=1 & 1<=p41] & [p78<=1 & 1<=p78]]]]] U [[p34<=1 & 1<=p34] & [AF [E [EG [[[p91<=1 & 1<=p91] & [p110<=1 & 1<=p110]]] U EG [[p83<=1 & 1<=p83]]]] & [[[p91<=1 & 1<=p91] & [p110<=1 & 1<=p110]] | [~ [[[p15<=1 & 1<=p15] | [p9<=1 & 1<=p9]]] & AX [AF [[p33<=1 & 1<=p33]]]]]]]]
normalized: E [EX [E [true U [[[p78<=1 & 1<=p78] & [p41<=1 & 1<=p41]] | [p35<=1 & 1<=p35]]]] U [[[[~ [EX [EG [~ [[p33<=1 & 1<=p33]]]]] & ~ [[[p9<=1 & 1<=p9] | [p15<=1 & 1<=p15]]]] | [[p110<=1 & 1<=p110] & [p91<=1 & 1<=p91]]] & ~ [EG [~ [E [EG [[[p110<=1 & 1<=p110] & [p91<=1 & 1<=p91]]] U EG [[p83<=1 & 1<=p83]]]]]]] & [p34<=1 & 1<=p34]]]
abstracting: (1<=p34)
states: 1,266,768 (6)
abstracting: (p34<=1)
states: 48,881,955 (7)
abstracting: (1<=p83)
states: 7,674,112 (6)
abstracting: (p83<=1)
states: 48,881,955 (7)
......................................................
EG iterations: 54
abstracting: (1<=p91)
states: 10,649,209 (7)
abstracting: (p91<=1)
states: 48,881,955 (7)
abstracting: (1<=p110)
states: 5,272,467 (6)
abstracting: (p110<=1)
states: 48,881,955 (7)
..............................................
EG iterations: 46
.....................................
EG iterations: 37
abstracting: (1<=p91)
states: 10,649,209 (7)
abstracting: (p91<=1)
states: 48,881,955 (7)
abstracting: (1<=p110)
states: 5,272,467 (6)
abstracting: (p110<=1)
states: 48,881,955 (7)
abstracting: (1<=p15)
states: 6,156,380 (6)
abstracting: (p15<=1)
states: 48,881,955 (7)
abstracting: (1<=p9)
states: 6,156,380 (6)
abstracting: (p9<=1)
states: 48,881,955 (7)
abstracting: (1<=p33)
states: 5,284,136 (6)
abstracting: (p33<=1)
states: 48,881,955 (7)
.
EG iterations: 1
.abstracting: (1<=p35)
states: 1,266,768 (6)
abstracting: (p35<=1)
states: 48,881,955 (7)
abstracting: (1<=p41)
states: 5,284,136 (6)
abstracting: (p41<=1)
states: 48,881,955 (7)
abstracting: (1<=p78)
states: 4,619,393 (6)
abstracting: (p78<=1)
states: 48,881,955 (7)
.-> the formula is FALSE
FORMULA AutoFlight-PT-01b-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.159sec
checking: [AF [[EG [[p87<=1 & 1<=p87]] & [AX [[p64<=1 & 1<=p64]] & [[EF [[[p32<=1 & 1<=p32] & [1<=p89 & p89<=1]]] & E [[p30<=1 & 1<=p30] U [p47<=1 & 1<=p47]]] | [[p30<=0 & 0<=p30] & [[p105<=1 & 1<=p105] & [p71<=1 & 1<=p71]]]]]]] | AX [[A [[p99<=1 & 1<=p99] U [p93<=1 & 1<=p93]] | EG [[[p26<=1 & 1<=p26] & [p98<=1 & 1<=p98]]]]]]
normalized: [~ [EX [~ [[EG [[[p98<=1 & 1<=p98] & [p26<=1 & 1<=p26]]] | [~ [EG [~ [[p93<=1 & 1<=p93]]]] & ~ [E [~ [[p93<=1 & 1<=p93]] U [~ [[p99<=1 & 1<=p99]] & ~ [[p93<=1 & 1<=p93]]]]]]]]]] | ~ [EG [~ [[[[[[[p71<=1 & 1<=p71] & [p105<=1 & 1<=p105]] & [p30<=0 & 0<=p30]] | [E [[p30<=1 & 1<=p30] U [p47<=1 & 1<=p47]] & E [true U [[1<=p89 & p89<=1] & [p32<=1 & 1<=p32]]]]] & ~ [EX [~ [[p64<=1 & 1<=p64]]]]] & EG [[p87<=1 & 1<=p87]]]]]]]
abstracting: (1<=p87)
states: 1,617,000 (6)
abstracting: (p87<=1)
states: 48,881,955 (7)
.........................................
EG iterations: 41
abstracting: (1<=p64)
states: 9,925 (3)
abstracting: (p64<=1)
states: 48,881,955 (7)
.abstracting: (1<=p32)
states: 5,284,136 (6)
abstracting: (p32<=1)
states: 48,881,955 (7)
abstracting: (p89<=1)
states: 48,881,955 (7)
abstracting: (1<=p89)
states: 2,804,368 (6)
abstracting: (1<=p47)
states: 2,511,136 (6)
abstracting: (p47<=1)
states: 48,881,955 (7)
abstracting: (1<=p30)
states: 4,256,392 (6)
abstracting: (p30<=1)
states: 48,881,955 (7)
abstracting: (0<=p30)
states: 48,881,955 (7)
abstracting: (p30<=0)
states: 44,625,563 (7)
abstracting: (1<=p105)
states: 2,388,556 (6)
abstracting: (p105<=1)
states: 48,881,955 (7)
abstracting: (1<=p71)
states: 833,000 (5)
abstracting: (p71<=1)
states: 48,881,955 (7)
EG iterations: 0
abstracting: (1<=p93)
states: 2,388,556 (6)
abstracting: (p93<=1)
states: 48,881,955 (7)
abstracting: (1<=p99)
states: 2,606,208 (6)
abstracting: (p99<=1)
states: 48,881,955 (7)
abstracting: (1<=p93)
states: 2,388,556 (6)
abstracting: (p93<=1)
states: 48,881,955 (7)
abstracting: (1<=p93)
states: 2,388,556 (6)
abstracting: (p93<=1)
states: 48,881,955 (7)
....................................
EG iterations: 36
abstracting: (1<=p26)
states: 6,203,540 (6)
abstracting: (p26<=1)
states: 48,881,955 (7)
abstracting: (1<=p98)
states: 2,606,208 (6)
abstracting: (p98<=1)
states: 48,881,955 (7)
....................................
EG iterations: 36
.-> the formula is FALSE
FORMULA AutoFlight-PT-01b-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.895sec
totally nodes used: 43491224 (4.3e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 35301225 91528767 126829992
used/not used/entry size/cache size: 57036832 10072032 16 1024MB
basic ops cache: hits/miss/sum: 5464358 13641167 19105525
used/not used/entry size/cache size: 13408771 3368445 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: 41242 129017 170259
used/not used/entry size/cache size: 127977 8260631 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 36097690
1 21351592
2 7359706
3 1859500
4 370809
5 60172
6 8280
7 988
8 119
9 5
>= 10 3
Total processing time: 0m52.225sec
BK_STOP 1678687351723
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:3544 (31), effective:400 (3)
initing FirstDep: 0m 0.000sec
iterations count:1709 (15), effective:151 (1)
iterations count:1157 (10), effective:133 (1)
iterations count:180 (1), effective:10 (0)
iterations count:239 (2), effective:7 (0)
iterations count:156 (1), effective:2 (0)
iterations count:156 (1), effective:2 (0)
iterations count:1385 (12), effective:126 (1)
iterations count:156 (1), effective:2 (0)
iterations count:1693 (15), effective:153 (1)
iterations count:514 (4), effective:63 (0)
iterations count:2661 (23), effective:261 (2)
iterations count:1157 (10), effective:133 (1)
iterations count:514 (4), effective:63 (0)
iterations count:212 (1), effective:1 (0)
iterations count:514 (4), effective:63 (0)
iterations count:115 (1), effective:2 (0)
iterations count:127 (1), effective:6 (0)
iterations count:3038 (27), effective:287 (2)
iterations count:1681 (15), effective:183 (1)
iterations count:621 (5), effective:90 (0)
iterations count:569 (5), effective:52 (0)
iterations count:120 (1), effective:2 (0)
iterations count:136 (1), effective:1 (0)
iterations count:114 (1), effective:1 (0)
iterations count:112 (1), effective:0 (0)
iterations count:1913 (17), effective:174 (1)
iterations count:1700 (15), effective:151 (1)
iterations count:676 (6), effective:53 (0)
iterations count:114 (1), effective:1 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-01b"
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 AutoFlight-PT-01b, 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 r010-oct2-167813599000378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-01b.tgz
mv AutoFlight-PT-01b 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 ;