About the Execution of Marcie+red for AutoFlight-PT-04a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5747.827 | 13954.00 | 22324.00 | 58.10 | FTFTFTFTFFTTTFTT | 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-167813599000418.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-04a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599000418
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.2K Feb 25 17:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 17:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 17:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 17:55 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:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 25 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:32 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 29K 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-04a-CTLFireability-00
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-01
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-02
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-03
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-04
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-05
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-06
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-07
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-08
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-09
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-10
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-11
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-12
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-13
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-14
FORMULA_NAME AutoFlight-PT-04a-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678688454624
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-04a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 06:20:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 06:20:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:20:57] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-13 06:20:57] [INFO ] Transformed 107 places.
[2023-03-13 06:20:57] [INFO ] Transformed 105 transitions.
[2023-03-13 06:20:57] [INFO ] Found NUPN structural information;
[2023-03-13 06:20:57] [INFO ] Parsed PT model containing 107 places and 105 transitions and 340 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
Support contains 91 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 85/85 transitions.
Applied a total of 0 rules in 43 ms. Remains 107 /107 variables (removed 0) and now considering 85/85 (removed 0) transitions.
// Phase 1: matrix 85 rows 107 cols
[2023-03-13 06:20:57] [INFO ] Computed 28 place invariants in 7 ms
[2023-03-13 06:20:58] [INFO ] Implicit Places using invariants in 335 ms returned [80, 98]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 478 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/107 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 532 ms. Remains : 105/107 places, 85/85 transitions.
Support contains 91 out of 105 places after structural reductions.
[2023-03-13 06:20:58] [INFO ] Flatten gal took : 52 ms
[2023-03-13 06:20:58] [INFO ] Flatten gal took : 11 ms
[2023-03-13 06:20:58] [INFO ] Input system was already deterministic with 85 transitions.
Support contains 89 out of 105 places (down from 91) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 332 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 75) seen :60
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 85 rows 105 cols
[2023-03-13 06:20:58] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-13 06:20:59] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-13 06:20:59] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:3
[2023-03-13 06:20:59] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-13 06:20:59] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :3
[2023-03-13 06:20:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-13 06:20:59] [INFO ] After 18ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :7 sat :3
[2023-03-13 06:20:59] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :3
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-13 06:20:59] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :3
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 3 ms.
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 85/85 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 105 transition count 75
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 95 transition count 75
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 20 place count 95 transition count 69
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 32 place count 89 transition count 69
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 88 transition count 68
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 88 transition count 68
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 46 place count 82 transition count 62
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 53 place count 82 transition count 55
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 60 place count 75 transition count 55
Applied a total of 60 rules in 36 ms. Remains 75 /105 variables (removed 30) and now considering 55/85 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 75/105 places, 55/85 transitions.
Incomplete random walk after 10000 steps, including 187 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished Best-First random walk after 478 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=239 )
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA AutoFlight-PT-04a-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 6 ms
[2023-03-13 06:20:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutoFlight-PT-04a-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 6 ms
[2023-03-13 06:20:59] [INFO ] Input system was already deterministic with 85 transitions.
Support contains 67 out of 105 places (down from 74) after GAL structural reductions.
Computed a total of 9 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 84
Applied a total of 2 rules in 17 ms. Remains 104 /105 variables (removed 1) and now considering 84/85 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 104/105 places, 84/85 transitions.
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:20:59] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 84
Applied a total of 2 rules in 4 ms. Remains 104 /105 variables (removed 1) and now considering 84/85 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 104/105 places, 84/85 transitions.
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:20:59] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 84
Applied a total of 2 rules in 3 ms. Remains 104 /105 variables (removed 1) and now considering 84/85 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 104/105 places, 84/85 transitions.
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:20:59] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 105 transition count 75
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 95 transition count 75
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 20 place count 95 transition count 69
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 32 place count 89 transition count 69
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 88 transition count 68
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 88 transition count 68
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 50 place count 80 transition count 60
Applied a total of 50 rules in 10 ms. Remains 80 /105 variables (removed 25) and now considering 60/85 (removed 25) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 80/105 places, 60/85 transitions.
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:20:59] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 84
Applied a total of 2 rules in 2 ms. Remains 104 /105 variables (removed 1) and now considering 84/85 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 104/105 places, 84/85 transitions.
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:20:59] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 77
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 97 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 96 transition count 76
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 18 place count 96 transition count 72
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 26 place count 92 transition count 72
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 91 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 91 transition count 71
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 38 place count 86 transition count 66
Applied a total of 38 rules in 9 ms. Remains 86 /105 variables (removed 19) and now considering 66/85 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 86/105 places, 66/85 transitions.
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:20:59] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 105 transition count 78
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 98 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 97 transition count 77
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 16 place count 97 transition count 71
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 28 place count 91 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 90 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 90 transition count 70
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 3 with 8 rules applied. Total rules applied 38 place count 86 transition count 66
Applied a total of 38 rules in 7 ms. Remains 86 /105 variables (removed 19) and now considering 66/85 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 86/105 places, 66/85 transitions.
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:20:59] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 105 transition count 78
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 98 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 14 place count 98 transition count 73
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 93 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 92 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 92 transition count 72
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 84 transition count 64
Applied a total of 42 rules in 7 ms. Remains 84 /105 variables (removed 21) and now considering 64/85 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 84/105 places, 64/85 transitions.
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:20:59] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 77
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 97 transition count 77
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 97 transition count 72
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 92 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 91 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 91 transition count 71
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 42 place count 84 transition count 64
Applied a total of 42 rules in 7 ms. Remains 84 /105 variables (removed 21) and now considering 64/85 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 84/105 places, 64/85 transitions.
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:20:59] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 84
Applied a total of 2 rules in 2 ms. Remains 104 /105 variables (removed 1) and now considering 84/85 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 104/105 places, 84/85 transitions.
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:20:59] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 84
Applied a total of 2 rules in 2 ms. Remains 104 /105 variables (removed 1) and now considering 84/85 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 104/105 places, 84/85 transitions.
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:20:59] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 84
Applied a total of 2 rules in 2 ms. Remains 104 /105 variables (removed 1) and now considering 84/85 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 104/105 places, 84/85 transitions.
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:20:59] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 84
Applied a total of 2 rules in 3 ms. Remains 104 /105 variables (removed 1) and now considering 84/85 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 104/105 places, 84/85 transitions.
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:20:59] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 85/85 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 84
Applied a total of 2 rules in 2 ms. Remains 104 /105 variables (removed 1) and now considering 84/85 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 104/105 places, 84/85 transitions.
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:20:59] [INFO ] Input system was already deterministic with 84 transitions.
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:20:59] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:20:59] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 06:20:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 105 places, 85 transitions and 294 arcs took 1 ms.
Total runtime 2767 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: 105 NrTr: 85 NrArc: 294)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.012sec
init dd package: 0m 2.942sec
RS generation: 0m 0.021sec
-> reachability set: #nodes 708 (7.1e+02) #states 3,332,017 (6)
starting MCC model checker
--------------------------
checking: AF [EX [EG [[AF [[0<=p3 & p3<=0]] & EF [[[p21<=0 & 0<=p21] | [p56<=0 & 0<=p56]]]]]]]
normalized: ~ [EG [~ [EX [EG [[~ [EG [~ [[0<=p3 & p3<=0]]]] & E [true U [[p21<=0 & 0<=p21] | [p56<=0 & 0<=p56]]]]]]]]]
abstracting: (0<=p56)
states: 3,332,017 (6)
abstracting: (p56<=0)
states: 3,311,281 (6)
abstracting: (0<=p21)
states: 3,332,017 (6)
abstracting: (p21<=0)
states: 1
abstracting: (p3<=0)
states: 2,162,593 (6)
abstracting: (0<=p3)
states: 3,332,017 (6)
..........................
EG iterations: 26
............................
EG iterations: 28
.............................
EG iterations: 28
-> the formula is TRUE
FORMULA AutoFlight-PT-04a-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.432sec
checking: AF [AX [[[p5<=1 & 1<=p5] & [[p24<=1 & 1<=p24] & [p98<=1 & 1<=p98]]]]]
normalized: ~ [EG [EX [~ [[[p5<=1 & 1<=p5] & [[p98<=1 & 1<=p98] & [p24<=1 & 1<=p24]]]]]]]
abstracting: (1<=p24)
states: 1,194,048 (6)
abstracting: (p24<=1)
states: 3,332,017 (6)
abstracting: (1<=p98)
states: 104,976 (5)
abstracting: (p98<=1)
states: 3,332,017 (6)
abstracting: (1<=p5)
states: 1,020,816 (6)
abstracting: (p5<=1)
states: 3,332,017 (6)
.........................
EG iterations: 24
-> the formula is FALSE
FORMULA AutoFlight-PT-04a-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.234sec
checking: AG [[[p36<=0 & 0<=p36] | EX [[[p28<=0 & 0<=p28] | [p57<=0 & 0<=p57]]]]]
normalized: ~ [E [true U ~ [[EX [[[p57<=0 & 0<=p57] | [p28<=0 & 0<=p28]]] | [p36<=0 & 0<=p36]]]]]
abstracting: (0<=p36)
states: 3,332,017 (6)
abstracting: (p36<=0)
states: 1,666,009 (6)
abstracting: (0<=p28)
states: 3,332,017 (6)
abstracting: (p28<=0)
states: 1
abstracting: (0<=p57)
states: 3,332,017 (6)
abstracting: (p57<=0)
states: 3,311,281 (6)
.-> the formula is TRUE
FORMULA AutoFlight-PT-04a-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: [AF [AG [[[p21<=1 & 1<=p21] & [p66<=1 & 1<=p66]]]] & EF [[[p8<=0 & 0<=p8] | [p59<=0 & 0<=p59]]]]
normalized: [E [true U [[p59<=0 & 0<=p59] | [p8<=0 & 0<=p8]]] & ~ [EG [E [true U ~ [[[p66<=1 & 1<=p66] & [p21<=1 & 1<=p21]]]]]]]
abstracting: (1<=p21)
states: 3,332,016 (6)
abstracting: (p21<=1)
states: 3,332,017 (6)
abstracting: (1<=p66)
states: 20,736 (4)
abstracting: (p66<=1)
states: 3,332,017 (6)
EG iterations: 0
abstracting: (0<=p8)
states: 3,332,017 (6)
abstracting: (p8<=0)
states: 2,157,409 (6)
abstracting: (0<=p59)
states: 3,332,017 (6)
abstracting: (p59<=0)
states: 3,285,361 (6)
-> the formula is FALSE
FORMULA AutoFlight-PT-04a-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: [AG [A [~ [EG [~ [[[p15<=1 & 1<=p15] & [p60<=1 & 1<=p60]]]]] U ~ [[[p25<=1 & 1<=p25] & [p79<=1 & 1<=p79]]]]] | EG [EX [[EX [[p33<=1 & 1<=p33]] | [[p21<=1 & 1<=p21] & [p44<=1 & 1<=p44]]]]]]
normalized: [EG [EX [[[[p44<=1 & 1<=p44] & [p21<=1 & 1<=p21]] | EX [[p33<=1 & 1<=p33]]]]] | ~ [E [true U ~ [[~ [EG [[[p79<=1 & 1<=p79] & [p25<=1 & 1<=p25]]]] & ~ [E [[[p79<=1 & 1<=p79] & [p25<=1 & 1<=p25]] U [EG [~ [[[p60<=1 & 1<=p60] & [p15<=1 & 1<=p15]]]] & [[p79<=1 & 1<=p79] & [p25<=1 & 1<=p25]]]]]]]]]]
abstracting: (1<=p25)
states: 1,180,224 (6)
abstracting: (p25<=1)
states: 3,332,017 (6)
abstracting: (1<=p79)
states: 104,976 (5)
abstracting: (p79<=1)
states: 3,332,017 (6)
abstracting: (1<=p15)
states: 1,182,384 (6)
abstracting: (p15<=1)
states: 3,332,017 (6)
abstracting: (1<=p60)
states: 69,984 (4)
abstracting: (p60<=1)
states: 3,332,017 (6)
.......................
EG iterations: 23
abstracting: (1<=p25)
states: 1,180,224 (6)
abstracting: (p25<=1)
states: 3,332,017 (6)
abstracting: (1<=p79)
states: 104,976 (5)
abstracting: (p79<=1)
states: 3,332,017 (6)
abstracting: (1<=p25)
states: 1,180,224 (6)
abstracting: (p25<=1)
states: 3,332,017 (6)
abstracting: (1<=p79)
states: 104,976 (5)
abstracting: (p79<=1)
states: 3,332,017 (6)
....................
EG iterations: 20
abstracting: (1<=p33)
states: 1,666,008 (6)
abstracting: (p33<=1)
states: 3,332,017 (6)
.abstracting: (1<=p21)
states: 3,332,016 (6)
abstracting: (p21<=1)
states: 3,332,017 (6)
abstracting: (1<=p44)
states: 20,736 (4)
abstracting: (p44<=1)
states: 3,332,017 (6)
.......................
EG iterations: 22
-> the formula is TRUE
FORMULA AutoFlight-PT-04a-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.342sec
checking: [EF [[E [AF [~ [[p33<=1 & 1<=p33]]] U E [[[[p7<=1 & 1<=p7] & [p64<=1 & 1<=p64]] | [p12<=1 & 1<=p12]] U AG [[p52<=1 & 1<=p52]]]] & AF [~ [[p24<=1 & 1<=p24]]]]] & EF [[[p3<=1 & 1<=p3] & [p81<=1 & 1<=p81]]]]
normalized: [E [true U [[p81<=1 & 1<=p81] & [p3<=1 & 1<=p3]]] & E [true U [~ [EG [[p24<=1 & 1<=p24]]] & E [~ [EG [[p33<=1 & 1<=p33]]] U E [[[[p64<=1 & 1<=p64] & [p7<=1 & 1<=p7]] | [p12<=1 & 1<=p12]] U ~ [E [true U ~ [[p52<=1 & 1<=p52]]]]]]]]]
abstracting: (1<=p52)
states: 20,736 (4)
abstracting: (p52<=1)
states: 3,332,017 (6)
abstracting: (1<=p12)
states: 1,010,448 (6)
abstracting: (p12<=1)
states: 3,332,017 (6)
abstracting: (1<=p7)
states: 3,332,016 (6)
abstracting: (p7<=1)
states: 3,332,017 (6)
abstracting: (1<=p64)
states: 20,736 (4)
abstracting: (p64<=1)
states: 3,332,017 (6)
abstracting: (1<=p33)
states: 1,666,008 (6)
abstracting: (p33<=1)
states: 3,332,017 (6)
........................
EG iterations: 24
abstracting: (1<=p24)
states: 1,194,048 (6)
abstracting: (p24<=1)
states: 3,332,017 (6)
.........................
EG iterations: 25
abstracting: (1<=p3)
states: 1,169,424 (6)
abstracting: (p3<=1)
states: 3,332,017 (6)
abstracting: (1<=p81)
states: 104,976 (5)
abstracting: (p81<=1)
states: 3,332,017 (6)
-> the formula is FALSE
FORMULA AutoFlight-PT-04a-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.365sec
checking: E [[p46<=1 & 1<=p46] U E [[A [AF [[[p21<=1 & 1<=p21] & [p56<=1 & 1<=p56]]] U AF [[[p35<=1 & 1<=p35] & [p95<=1 & 1<=p95]]]] | [[p86<=1 & 1<=p86] & [p104<=1 & 1<=p104]]] U [p16<=1 & 1<=p16]]]
normalized: E [[p46<=1 & 1<=p46] U E [[[[p104<=1 & 1<=p104] & [p86<=1 & 1<=p86]] | [~ [EG [EG [~ [[[p95<=1 & 1<=p95] & [p35<=1 & 1<=p35]]]]]] & ~ [E [EG [~ [[[p95<=1 & 1<=p95] & [p35<=1 & 1<=p35]]]] U [EG [~ [[[p56<=1 & 1<=p56] & [p21<=1 & 1<=p21]]]] & EG [~ [[[p95<=1 & 1<=p95] & [p35<=1 & 1<=p35]]]]]]]]] U [p16<=1 & 1<=p16]]]
abstracting: (1<=p16)
states: 967,248 (5)
abstracting: (p16<=1)
states: 3,332,017 (6)
abstracting: (1<=p35)
states: 1,666,008 (6)
abstracting: (p35<=1)
states: 3,332,017 (6)
abstracting: (1<=p95)
states: 104,976 (5)
abstracting: (p95<=1)
states: 3,332,017 (6)
......................
EG iterations: 22
abstracting: (1<=p21)
states: 3,332,016 (6)
abstracting: (p21<=1)
states: 3,332,017 (6)
abstracting: (1<=p56)
states: 20,736 (4)
abstracting: (p56<=1)
states: 3,332,017 (6)
..............................
EG iterations: 30
abstracting: (1<=p35)
states: 1,666,008 (6)
abstracting: (p35<=1)
states: 3,332,017 (6)
abstracting: (1<=p95)
states: 104,976 (5)
abstracting: (p95<=1)
states: 3,332,017 (6)
......................
EG iterations: 22
abstracting: (1<=p35)
states: 1,666,008 (6)
abstracting: (p35<=1)
states: 3,332,017 (6)
abstracting: (1<=p95)
states: 104,976 (5)
abstracting: (p95<=1)
states: 3,332,017 (6)
......................
EG iterations: 22
.
EG iterations: 1
abstracting: (1<=p86)
states: 104,976 (5)
abstracting: (p86<=1)
states: 3,332,017 (6)
abstracting: (1<=p104)
states: 3,227,040 (6)
abstracting: (p104<=1)
states: 3,332,017 (6)
abstracting: (1<=p46)
states: 20,736 (4)
abstracting: (p46<=1)
states: 3,332,017 (6)
-> the formula is FALSE
FORMULA AutoFlight-PT-04a-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.159sec
checking: EF [EG [[AG [~ [E [[[p21<=1 & 1<=p21] & [p74<=1 & 1<=p74]] U [[p21<=1 & 1<=p21] & [p56<=1 & 1<=p56]]]]] & AF [[[[[p28<=1 & 1<=p28] & [p67<=1 & 1<=p67]] | [[p7<=1 & 1<=p7] & [p42<=1 & 1<=p42]]] & [[p33<=1 & 1<=p33] | [p69<=1 & 1<=p69]]]]]]]
normalized: E [true U EG [[~ [EG [~ [[[[p69<=1 & 1<=p69] | [p33<=1 & 1<=p33]] & [[[p42<=1 & 1<=p42] & [p7<=1 & 1<=p7]] | [[p67<=1 & 1<=p67] & [p28<=1 & 1<=p28]]]]]]] & ~ [E [true U E [[[p74<=1 & 1<=p74] & [p21<=1 & 1<=p21]] U [[p56<=1 & 1<=p56] & [p21<=1 & 1<=p21]]]]]]]]
abstracting: (1<=p21)
states: 3,332,016 (6)
abstracting: (p21<=1)
states: 3,332,017 (6)
abstracting: (1<=p56)
states: 20,736 (4)
abstracting: (p56<=1)
states: 3,332,017 (6)
abstracting: (1<=p21)
states: 3,332,016 (6)
abstracting: (p21<=1)
states: 3,332,017 (6)
abstracting: (1<=p74)
states: 20,736 (4)
abstracting: (p74<=1)
states: 3,332,017 (6)
abstracting: (1<=p28)
states: 3,332,016 (6)
abstracting: (p28<=1)
states: 3,332,017 (6)
abstracting: (1<=p67)
states: 20,736 (4)
abstracting: (p67<=1)
states: 3,332,017 (6)
abstracting: (1<=p7)
states: 3,332,016 (6)
abstracting: (p7<=1)
states: 3,332,017 (6)
abstracting: (1<=p42)
states: 20,736 (4)
abstracting: (p42<=1)
states: 3,332,017 (6)
abstracting: (1<=p33)
states: 1,666,008 (6)
abstracting: (p33<=1)
states: 3,332,017 (6)
abstracting: (1<=p69)
states: 20,736 (4)
abstracting: (p69<=1)
states: 3,332,017 (6)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA AutoFlight-PT-04a-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: EX [[EG [[[~ [A [[p9<=1 & 1<=p9] U [[p40<=1 & 1<=p40] & [p101<=1 & 1<=p101]]]] | [p6<=0 & 0<=p6]] | [[p91<=0 & 0<=p91] | [[p103<=0 & 0<=p103] | [[p18<=1 & 1<=p18] & [p78<=1 & 1<=p78]]]]]] | [AX [EF [[p39<=0 & 0<=p39]]] & EG [[[p33<=1 & 1<=p33] & [p20<=1 & 1<=p20]]]]]]
normalized: EX [[[EG [[[p20<=1 & 1<=p20] & [p33<=1 & 1<=p33]]] & ~ [EX [~ [E [true U [p39<=0 & 0<=p39]]]]]] | EG [[[[[[p78<=1 & 1<=p78] & [p18<=1 & 1<=p18]] | [p103<=0 & 0<=p103]] | [p91<=0 & 0<=p91]] | [[p6<=0 & 0<=p6] | ~ [[~ [EG [~ [[[p101<=1 & 1<=p101] & [p40<=1 & 1<=p40]]]]] & ~ [E [~ [[[p101<=1 & 1<=p101] & [p40<=1 & 1<=p40]]] U [~ [[p9<=1 & 1<=p9]] & ~ [[[p101<=1 & 1<=p101] & [p40<=1 & 1<=p40]]]]]]]]]]]]]
abstracting: (1<=p40)
states: 3,332,016 (6)
abstracting: (p40<=1)
states: 3,332,017 (6)
abstracting: (1<=p101)
states: 104,976 (5)
abstracting: (p101<=1)
states: 3,332,017 (6)
abstracting: (1<=p9)
states: 982,800 (5)
abstracting: (p9<=1)
states: 3,332,017 (6)
abstracting: (1<=p40)
states: 3,332,016 (6)
abstracting: (p40<=1)
states: 3,332,017 (6)
abstracting: (1<=p101)
states: 104,976 (5)
abstracting: (p101<=1)
states: 3,332,017 (6)
abstracting: (1<=p40)
states: 3,332,016 (6)
abstracting: (p40<=1)
states: 3,332,017 (6)
abstracting: (1<=p101)
states: 104,976 (5)
abstracting: (p101<=1)
states: 3,332,017 (6)
.
EG iterations: 1
abstracting: (0<=p6)
states: 3,332,017 (6)
abstracting: (p6<=0)
states: 2,176,417 (6)
abstracting: (0<=p91)
states: 3,332,017 (6)
abstracting: (p91<=0)
states: 524,881 (5)
abstracting: (0<=p103)
states: 3,332,017 (6)
abstracting: (p103<=0)
states: 3,227,041 (6)
abstracting: (1<=p18)
states: 1,168,560 (6)
abstracting: (p18<=1)
states: 3,332,017 (6)
abstracting: (1<=p78)
states: 69,984 (4)
abstracting: (p78<=1)
states: 3,332,017 (6)
EG iterations: 0
abstracting: (0<=p39)
states: 3,332,017 (6)
abstracting: (p39<=0)
states: 1,666,009 (6)
.abstracting: (1<=p33)
states: 1,666,008 (6)
abstracting: (p33<=1)
states: 3,332,017 (6)
abstracting: (1<=p20)
states: 1,168,560 (6)
abstracting: (p20<=1)
states: 3,332,017 (6)
......................
EG iterations: 22
.-> the formula is TRUE
FORMULA AutoFlight-PT-04a-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.078sec
checking: A [A [AX [~ [[[[p24<=1 & 1<=p24] | [p23<=1 & 1<=p23]] | [[p39<=1 & 1<=p39] | [[p37<=1 & 1<=p37] & [p96<=1 & 1<=p96]]]]]] U [[p1<=1 & 1<=p1] & [p58<=1 & 1<=p58]]] U ~ [AF [[[[[p41<=1 & 1<=p41] & [p104<=1 & 1<=p104]] | [p26<=1 & 1<=p26]] & ~ [[p0<=1 & 1<=p0]]]]]]
normalized: [~ [EG [~ [EG [~ [[~ [[p0<=1 & 1<=p0]] & [[p26<=1 & 1<=p26] | [[p104<=1 & 1<=p104] & [p41<=1 & 1<=p41]]]]]]]]] & ~ [E [~ [EG [~ [[~ [[p0<=1 & 1<=p0]] & [[p26<=1 & 1<=p26] | [[p104<=1 & 1<=p104] & [p41<=1 & 1<=p41]]]]]]] U [~ [[~ [EG [~ [[[p58<=1 & 1<=p58] & [p1<=1 & 1<=p1]]]]] & ~ [E [~ [[[p58<=1 & 1<=p58] & [p1<=1 & 1<=p1]]] U [EX [[[[[p96<=1 & 1<=p96] & [p37<=1 & 1<=p37]] | [p39<=1 & 1<=p39]] | [[p23<=1 & 1<=p23] | [p24<=1 & 1<=p24]]]] & ~ [[[p58<=1 & 1<=p58] & [p1<=1 & 1<=p1]]]]]]]] & ~ [EG [~ [[~ [[p0<=1 & 1<=p0]] & [[p26<=1 & 1<=p26] | [[p104<=1 & 1<=p104] & [p41<=1 & 1<=p41]]]]]]]]]]]
abstracting: (1<=p41)
states: 20,736 (4)
abstracting: (p41<=1)
states: 3,332,017 (6)
abstracting: (1<=p104)
states: 3,227,040 (6)
abstracting: (p104<=1)
states: 3,332,017 (6)
abstracting: (1<=p26)
states: 971,568 (5)
abstracting: (p26<=1)
states: 3,332,017 (6)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 3,332,017 (6)
............................................
EG iterations: 44
abstracting: (1<=p1)
states: 1,169,424 (6)
abstracting: (p1<=1)
states: 3,332,017 (6)
abstracting: (1<=p58)
states: 31,104 (4)
abstracting: (p58<=1)
states: 3,332,017 (6)
abstracting: (1<=p24)
states: 1,194,048 (6)
abstracting: (p24<=1)
states: 3,332,017 (6)
abstracting: (1<=p23)
states: 943,920 (5)
abstracting: (p23<=1)
states: 3,332,017 (6)
abstracting: (1<=p39)
states: 1,666,008 (6)
abstracting: (p39<=1)
states: 3,332,017 (6)
abstracting: (1<=p37)
states: 3,332,016 (6)
abstracting: (p37<=1)
states: 3,332,017 (6)
abstracting: (1<=p96)
states: 104,976 (5)
abstracting: (p96<=1)
states: 3,332,017 (6)
.abstracting: (1<=p1)
states: 1,169,424 (6)
abstracting: (p1<=1)
states: 3,332,017 (6)
abstracting: (1<=p58)
states: 31,104 (4)
abstracting: (p58<=1)
states: 3,332,017 (6)
abstracting: (1<=p1)
states: 1,169,424 (6)
abstracting: (p1<=1)
states: 3,332,017 (6)
abstracting: (1<=p58)
states: 31,104 (4)
abstracting: (p58<=1)
states: 3,332,017 (6)
...........................
EG iterations: 27
abstracting: (1<=p41)
states: 20,736 (4)
abstracting: (p41<=1)
states: 3,332,017 (6)
abstracting: (1<=p104)
states: 3,227,040 (6)
abstracting: (p104<=1)
states: 3,332,017 (6)
abstracting: (1<=p26)
states: 971,568 (5)
abstracting: (p26<=1)
states: 3,332,017 (6)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 3,332,017 (6)
............................................
EG iterations: 44
abstracting: (1<=p41)
states: 20,736 (4)
abstracting: (p41<=1)
states: 3,332,017 (6)
abstracting: (1<=p104)
states: 3,227,040 (6)
abstracting: (p104<=1)
states: 3,332,017 (6)
abstracting: (1<=p26)
states: 971,568 (5)
abstracting: (p26<=1)
states: 3,332,017 (6)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 3,332,017 (6)
............................................
EG iterations: 44
.............................................
EG iterations: 45
-> the formula is TRUE
FORMULA AutoFlight-PT-04a-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.313sec
checking: E [~ [[p13<=1 & 1<=p13]] U [AG [~ [[[p86<=1 & 1<=p86] & [p104<=1 & 1<=p104]]]] | [~ [AG [A [[[p28<=1 & 1<=p28] & [p45<=1 & 1<=p45]] U [[p3<=1 & 1<=p3] & [p81<=1 & 1<=p81]]]]] & E [~ [E [[[p15<=1 & 1<=p15] & [p60<=1 & 1<=p60]] U [p20<=1 & 1<=p20]]] U EX [AF [[[p7<=1 & 1<=p7] & [p64<=1 & 1<=p64]]]]]]]]
normalized: E [~ [[p13<=1 & 1<=p13]] U [~ [E [true U [[p104<=1 & 1<=p104] & [p86<=1 & 1<=p86]]]] | [E [true U ~ [[~ [E [~ [[[p81<=1 & 1<=p81] & [p3<=1 & 1<=p3]]] U [~ [[[p45<=1 & 1<=p45] & [p28<=1 & 1<=p28]]] & ~ [[[p81<=1 & 1<=p81] & [p3<=1 & 1<=p3]]]]]] & ~ [EG [~ [[[p81<=1 & 1<=p81] & [p3<=1 & 1<=p3]]]]]]]] & E [~ [E [[[p15<=1 & 1<=p15] & [p60<=1 & 1<=p60]] U [p20<=1 & 1<=p20]]] U EX [~ [EG [~ [[[p7<=1 & 1<=p7] & [p64<=1 & 1<=p64]]]]]]]]]]
abstracting: (1<=p64)
states: 20,736 (4)
abstracting: (p64<=1)
states: 3,332,017 (6)
abstracting: (1<=p7)
states: 3,332,016 (6)
abstracting: (p7<=1)
states: 3,332,017 (6)
........................................
EG iterations: 40
.abstracting: (1<=p20)
states: 1,168,560 (6)
abstracting: (p20<=1)
states: 3,332,017 (6)
abstracting: (1<=p60)
states: 69,984 (4)
abstracting: (p60<=1)
states: 3,332,017 (6)
abstracting: (1<=p15)
states: 1,182,384 (6)
abstracting: (p15<=1)
states: 3,332,017 (6)
abstracting: (1<=p3)
states: 1,169,424 (6)
abstracting: (p3<=1)
states: 3,332,017 (6)
abstracting: (1<=p81)
states: 104,976 (5)
abstracting: (p81<=1)
states: 3,332,017 (6)
....................
EG iterations: 20
abstracting: (1<=p3)
states: 1,169,424 (6)
abstracting: (p3<=1)
states: 3,332,017 (6)
abstracting: (1<=p81)
states: 104,976 (5)
abstracting: (p81<=1)
states: 3,332,017 (6)
abstracting: (1<=p28)
states: 3,332,016 (6)
abstracting: (p28<=1)
states: 3,332,017 (6)
abstracting: (1<=p45)
states: 20,736 (4)
abstracting: (p45<=1)
states: 3,332,017 (6)
abstracting: (1<=p3)
states: 1,169,424 (6)
abstracting: (p3<=1)
states: 3,332,017 (6)
abstracting: (1<=p81)
states: 104,976 (5)
abstracting: (p81<=1)
states: 3,332,017 (6)
abstracting: (1<=p86)
states: 104,976 (5)
abstracting: (p86<=1)
states: 3,332,017 (6)
abstracting: (1<=p104)
states: 3,227,040 (6)
abstracting: (p104<=1)
states: 3,332,017 (6)
abstracting: (1<=p13)
states: 1,160,784 (6)
abstracting: (p13<=1)
states: 3,332,017 (6)
-> the formula is TRUE
FORMULA AutoFlight-PT-04a-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.274sec
checking: EG [[EG [A [AG [[[p10<=1 & 1<=p10] & [p87<=1 & 1<=p87]]] U EF [[p6<=1 & 1<=p6]]]] | [[p51<=1 & 1<=p51] & [[[AF [[[[p91<=1 & 1<=p91] & [p103<=1 & 1<=p103]] | [p20<=1 & 1<=p20]]] | [p22<=0 & 0<=p22]] | [[p61<=0 & 0<=p61] | [[p23<=1 & 1<=p23] & [[p15<=0 & 0<=p15] | [p60<=0 & 0<=p60]]]]] & [[p21<=0 & 0<=p21] | [p66<=0 & 0<=p66]]]]]]
normalized: EG [[[[[[p66<=0 & 0<=p66] | [p21<=0 & 0<=p21]] & [[[[[p60<=0 & 0<=p60] | [p15<=0 & 0<=p15]] & [p23<=1 & 1<=p23]] | [p61<=0 & 0<=p61]] | [[p22<=0 & 0<=p22] | ~ [EG [~ [[[p20<=1 & 1<=p20] | [[p103<=1 & 1<=p103] & [p91<=1 & 1<=p91]]]]]]]]] & [p51<=1 & 1<=p51]] | EG [[~ [EG [~ [E [true U [p6<=1 & 1<=p6]]]]] & ~ [E [~ [E [true U [p6<=1 & 1<=p6]]] U [E [true U ~ [[[p87<=1 & 1<=p87] & [p10<=1 & 1<=p10]]]] & ~ [E [true U [p6<=1 & 1<=p6]]]]]]]]]]
abstracting: (1<=p6)
states: 1,155,600 (6)
abstracting: (p6<=1)
states: 3,332,017 (6)
abstracting: (1<=p10)
states: 1,174,608 (6)
abstracting: (p10<=1)
states: 3,332,017 (6)
abstracting: (1<=p87)
states: 104,976 (5)
abstracting: (p87<=1)
states: 3,332,017 (6)
abstracting: (1<=p6)
states: 1,155,600 (6)
abstracting: (p6<=1)
states: 3,332,017 (6)
abstracting: (1<=p6)
states: 1,155,600 (6)
abstracting: (p6<=1)
states: 3,332,017 (6)
.
EG iterations: 1
........................
EG iterations: 24
abstracting: (1<=p51)
states: 20,736 (4)
abstracting: (p51<=1)
states: 3,332,017 (6)
abstracting: (1<=p91)
states: 2,807,136 (6)
abstracting: (p91<=1)
states: 3,332,017 (6)
abstracting: (1<=p103)
states: 104,976 (5)
abstracting: (p103<=1)
states: 3,332,017 (6)
abstracting: (1<=p20)
states: 1,168,560 (6)
abstracting: (p20<=1)
states: 3,332,017 (6)
............................................
EG iterations: 44
abstracting: (0<=p22)
states: 3,332,017 (6)
abstracting: (p22<=0)
states: 2,137,969 (6)
abstracting: (0<=p61)
states: 3,332,017 (6)
abstracting: (p61<=0)
states: 3,227,041 (6)
abstracting: (1<=p23)
states: 943,920 (5)
abstracting: (p23<=1)
states: 3,332,017 (6)
abstracting: (0<=p15)
states: 3,332,017 (6)
abstracting: (p15<=0)
states: 2,149,633 (6)
abstracting: (0<=p60)
states: 3,332,017 (6)
abstracting: (p60<=0)
states: 3,262,033 (6)
abstracting: (0<=p21)
states: 3,332,017 (6)
abstracting: (p21<=0)
states: 1
abstracting: (0<=p66)
states: 3,332,017 (6)
abstracting: (p66<=0)
states: 3,311,281 (6)
.
EG iterations: 1
-> the formula is TRUE
FORMULA AutoFlight-PT-04a-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.452sec
checking: E [[AG [[[p21<=1 & 1<=p21] & [p74<=1 & 1<=p74]]] | A [[E [[[p21<=1 & 1<=p21] & [p56<=1 & 1<=p56]] U [p3<=1 & 1<=p3]] & [[p21<=1 & 1<=p21] & [p74<=1 & 1<=p74]]] U [A [[p5<=1 & 1<=p5] U [p49<=1 & 1<=p49]] | E [[[p11<=1 & 1<=p11] & [p77<=1 & 1<=p77]] U [p24<=1 & 1<=p24]]]]] U E [[~ [[E [[p2<=1 & 1<=p2] U [[p62<=1 & 1<=p62] & [p103<=1 & 1<=p103]]] | [p3<=1 & 1<=p3]]] & AX [1<=0]] U AX [~ [AF [[p36<=1 & 1<=p36]]]]]]
normalized: E [[[~ [EG [~ [[E [[[p77<=1 & 1<=p77] & [p11<=1 & 1<=p11]] U [p24<=1 & 1<=p24]] | [~ [EG [~ [[p49<=1 & 1<=p49]]]] & ~ [E [~ [[p49<=1 & 1<=p49]] U [~ [[p5<=1 & 1<=p5]] & ~ [[p49<=1 & 1<=p49]]]]]]]]]] & ~ [E [~ [[E [[[p77<=1 & 1<=p77] & [p11<=1 & 1<=p11]] U [p24<=1 & 1<=p24]] | [~ [EG [~ [[p49<=1 & 1<=p49]]]] & ~ [E [~ [[p49<=1 & 1<=p49]] U [~ [[p5<=1 & 1<=p5]] & ~ [[p49<=1 & 1<=p49]]]]]]]] U [~ [[[[p74<=1 & 1<=p74] & [p21<=1 & 1<=p21]] & E [[[p56<=1 & 1<=p56] & [p21<=1 & 1<=p21]] U [p3<=1 & 1<=p3]]]] & ~ [[E [[[p77<=1 & 1<=p77] & [p11<=1 & 1<=p11]] U [p24<=1 & 1<=p24]] | [~ [EG [~ [[p49<=1 & 1<=p49]]]] & ~ [E [~ [[p49<=1 & 1<=p49]] U [~ [[p5<=1 & 1<=p5]] & ~ [[p49<=1 & 1<=p49]]]]]]]]]]]] | ~ [E [true U ~ [[[p74<=1 & 1<=p74] & [p21<=1 & 1<=p21]]]]]] U E [[~ [EX [~ [1<=0]]] & ~ [[[p3<=1 & 1<=p3] | E [[p2<=1 & 1<=p2] U [[p103<=1 & 1<=p103] & [p62<=1 & 1<=p62]]]]]] U ~ [EX [~ [EG [~ [[p36<=1 & 1<=p36]]]]]]]]
abstracting: (1<=p36)
states: 1,666,008 (6)
abstracting: (p36<=1)
states: 3,332,017 (6)
......................
EG iterations: 22
.abstracting: (1<=p62)
states: 2,726,784 (6)
abstracting: (p62<=1)
states: 3,332,017 (6)
abstracting: (1<=p103)
states: 104,976 (5)
abstracting: (p103<=1)
states: 3,332,017 (6)
abstracting: (1<=p2)
states: 993,168 (5)
abstracting: (p2<=1)
states: 3,332,017 (6)
abstracting: (1<=p3)
states: 1,169,424 (6)
abstracting: (p3<=1)
states: 3,332,017 (6)
abstracting: (1<=0)
states: 0
.abstracting: (1<=p21)
states: 3,332,016 (6)
abstracting: (p21<=1)
states: 3,332,017 (6)
abstracting: (1<=p74)
states: 20,736 (4)
abstracting: (p74<=1)
states: 3,332,017 (6)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 3,332,017 (6)
abstracting: (1<=p5)
states: 1,020,816 (6)
abstracting: (p5<=1)
states: 3,332,017 (6)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 3,332,017 (6)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 3,332,017 (6)
.....................................
EG iterations: 37
abstracting: (1<=p24)
states: 1,194,048 (6)
abstracting: (p24<=1)
states: 3,332,017 (6)
abstracting: (1<=p11)
states: 1,160,784 (6)
abstracting: (p11<=1)
states: 3,332,017 (6)
abstracting: (1<=p77)
states: 46,656 (4)
abstracting: (p77<=1)
states: 3,332,017 (6)
abstracting: (1<=p3)
states: 1,169,424 (6)
abstracting: (p3<=1)
states: 3,332,017 (6)
abstracting: (1<=p21)
states: 3,332,016 (6)
abstracting: (p21<=1)
states: 3,332,017 (6)
abstracting: (1<=p56)
states: 20,736 (4)
abstracting: (p56<=1)
states: 3,332,017 (6)
abstracting: (1<=p21)
states: 3,332,016 (6)
abstracting: (p21<=1)
states: 3,332,017 (6)
abstracting: (1<=p74)
states: 20,736 (4)
abstracting: (p74<=1)
states: 3,332,017 (6)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 3,332,017 (6)
abstracting: (1<=p5)
states: 1,020,816 (6)
abstracting: (p5<=1)
states: 3,332,017 (6)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 3,332,017 (6)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 3,332,017 (6)
.....................................
EG iterations: 37
abstracting: (1<=p24)
states: 1,194,048 (6)
abstracting: (p24<=1)
states: 3,332,017 (6)
abstracting: (1<=p11)
states: 1,160,784 (6)
abstracting: (p11<=1)
states: 3,332,017 (6)
abstracting: (1<=p77)
states: 46,656 (4)
abstracting: (p77<=1)
states: 3,332,017 (6)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 3,332,017 (6)
abstracting: (1<=p5)
states: 1,020,816 (6)
abstracting: (p5<=1)
states: 3,332,017 (6)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 3,332,017 (6)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 3,332,017 (6)
.....................................
EG iterations: 37
abstracting: (1<=p24)
states: 1,194,048 (6)
abstracting: (p24<=1)
states: 3,332,017 (6)
abstracting: (1<=p11)
states: 1,160,784 (6)
abstracting: (p11<=1)
states: 3,332,017 (6)
abstracting: (1<=p77)
states: 46,656 (4)
abstracting: (p77<=1)
states: 3,332,017 (6)
..................................
EG iterations: 34
-> the formula is FALSE
FORMULA AutoFlight-PT-04a-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.427sec
checking: [E [[~ [AG [[[p20<=1 & 1<=p20] & [p94<=1 & 1<=p94]]]] & [~ [[[~ [[p17<=1 & 1<=p17]] & [[[p7<=1 & 1<=p7] & [p54<=1 & 1<=p54]] | [p24<=1 & 1<=p24]]] | AG [[p5<=1 & 1<=p5]]]] | EG [EX [[p20<=1 & 1<=p20]]]]] U [[~ [[[p17<=1 & 1<=p17] & [[p25<=1 & 1<=p25] & [p79<=1 & 1<=p79]]]] & EX [[p16<=1 & 1<=p16]]] | [[p97<=1 & 1<=p97] & [p104<=1 & 1<=p104]]]] & EG [EX [[AF [[[p86<=0 & 0<=p86] | [p104<=0 & 0<=p104]]] & [[p86<=0 & 0<=p86] | [p104<=0 & 0<=p104]]]]]]
normalized: [E [[[~ [[[[[p24<=1 & 1<=p24] | [[p54<=1 & 1<=p54] & [p7<=1 & 1<=p7]]] & ~ [[p17<=1 & 1<=p17]]] | ~ [E [true U ~ [[p5<=1 & 1<=p5]]]]]] | EG [EX [[p20<=1 & 1<=p20]]]] & E [true U ~ [[[p94<=1 & 1<=p94] & [p20<=1 & 1<=p20]]]]] U [[[p104<=1 & 1<=p104] & [p97<=1 & 1<=p97]] | [EX [[p16<=1 & 1<=p16]] & ~ [[[[p79<=1 & 1<=p79] & [p25<=1 & 1<=p25]] & [p17<=1 & 1<=p17]]]]]] & EG [EX [[~ [EG [~ [[[p104<=0 & 0<=p104] | [p86<=0 & 0<=p86]]]]] & [[p86<=0 & 0<=p86] | [p104<=0 & 0<=p104]]]]]]
abstracting: (0<=p104)
states: 3,332,017 (6)
abstracting: (p104<=0)
states: 104,977 (5)
abstracting: (0<=p86)
states: 3,332,017 (6)
abstracting: (p86<=0)
states: 3,227,041 (6)
abstracting: (0<=p86)
states: 3,332,017 (6)
abstracting: (p86<=0)
states: 3,227,041 (6)
abstracting: (0<=p104)
states: 3,332,017 (6)
abstracting: (p104<=0)
states: 104,977 (5)
......................
EG iterations: 22
.........................
EG iterations: 24
abstracting: (1<=p17)
states: 1,182,384 (6)
abstracting: (p17<=1)
states: 3,332,017 (6)
abstracting: (1<=p25)
states: 1,180,224 (6)
abstracting: (p25<=1)
states: 3,332,017 (6)
abstracting: (1<=p79)
states: 104,976 (5)
abstracting: (p79<=1)
states: 3,332,017 (6)
abstracting: (1<=p16)
states: 967,248 (5)
abstracting: (p16<=1)
states: 3,332,017 (6)
.abstracting: (1<=p97)
states: 104,976 (5)
abstracting: (p97<=1)
states: 3,332,017 (6)
abstracting: (1<=p104)
states: 3,227,040 (6)
abstracting: (p104<=1)
states: 3,332,017 (6)
abstracting: (1<=p20)
states: 1,168,560 (6)
abstracting: (p20<=1)
states: 3,332,017 (6)
abstracting: (1<=p94)
states: 104,976 (5)
abstracting: (p94<=1)
states: 3,332,017 (6)
abstracting: (1<=p20)
states: 1,168,560 (6)
abstracting: (p20<=1)
states: 3,332,017 (6)
........................
EG iterations: 23
abstracting: (1<=p5)
states: 1,020,816 (6)
abstracting: (p5<=1)
states: 3,332,017 (6)
abstracting: (1<=p17)
states: 1,182,384 (6)
abstracting: (p17<=1)
states: 3,332,017 (6)
abstracting: (1<=p7)
states: 3,332,016 (6)
abstracting: (p7<=1)
states: 3,332,017 (6)
abstracting: (1<=p54)
states: 20,736 (4)
abstracting: (p54<=1)
states: 3,332,017 (6)
abstracting: (1<=p24)
states: 1,194,048 (6)
abstracting: (p24<=1)
states: 3,332,017 (6)
-> the formula is TRUE
FORMULA AutoFlight-PT-04a-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.113sec
totally nodes used: 4201839 (4.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3595160 7611840 11207000
used/not used/entry size/cache size: 10657718 56451146 16 1024MB
basic ops cache: hits/miss/sum: 354986 961323 1316309
used/not used/entry size/cache size: 1936413 14840803 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: 4175 12855 17030
used/not used/entry size/cache size: 12848 8375760 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 63167470
1 3701977
2 219980
3 17948
4 1393
5 90
6 6
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 8.390sec
BK_STOP 1678688468578
--------------------
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:1487 (17), effective:211 (2)
initing FirstDep: 0m 0.000sec
iterations count:89 (1), effective:1 (0)
iterations count:91 (1), effective:1 (0)
iterations count:90 (1), effective:1 (0)
iterations count:85 (1), effective:0 (0)
iterations count:801 (9), effective:87 (1)
iterations count:88 (1), effective:1 (0)
iterations count:1774 (20), effective:202 (2)
iterations count:215 (2), effective:14 (0)
iterations count:85 (1), effective:0 (0)
iterations count:85 (1), effective:0 (0)
iterations count:85 (1), effective:0 (0)
iterations count:812 (9), effective:87 (1)
iterations count:87 (1), effective:1 (0)
iterations count:86 (1), effective:1 (0)
iterations count:629 (7), effective:69 (0)
iterations count:138 (1), effective:9 (0)
iterations count:87 (1), effective:1 (0)
iterations count:558 (6), effective:59 (0)
iterations count:91 (1), effective:1 (0)
iterations count:86 (1), effective:1 (0)
iterations count:1726 (20), effective:206 (2)
iterations count:222 (2), effective:19 (0)
iterations count:801 (9), effective:82 (0)
iterations count:86 (1), effective:1 (0)
iterations count:801 (9), effective:82 (0)
iterations count:85 (1), effective:0 (0)
iterations count:801 (9), effective:82 (0)
iterations count:499 (5), effective:50 (0)
iterations count:85 (1), effective:0 (0)
iterations count:88 (1), effective:1 (0)
iterations count:87 (1), effective:1 (0)
iterations count:86 (1), effective:1 (0)
iterations count:85 (1), effective:0 (0)
iterations count:87 (1), effective:1 (0)
iterations count:86 (1), effective:1 (0)
iterations count:88 (1), effective:1 (0)
iterations count:87 (1), effective:1 (0)
iterations count:86 (1), effective:1 (0)
iterations count:118 (1), effective:5 (0)
iterations count:111 (1), effective:1 (0)
iterations count:87 (1), effective:1 (0)
iterations count:1727 (20), effective:217 (2)
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-04a"
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-04a, 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-167813599000418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-04a.tgz
mv AutoFlight-PT-04a 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 ;