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-167813599000370.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-01a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599000370
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 7.5K Feb 25 18:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 18:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 18:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 18:12 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.8K Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 18:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 25 18:12 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 8.7K 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-01a-CTLFireability-00
FORMULA_NAME AutoFlight-PT-01a-CTLFireability-01
FORMULA_NAME AutoFlight-PT-01a-CTLFireability-02
FORMULA_NAME AutoFlight-PT-01a-CTLFireability-03
FORMULA_NAME AutoFlight-PT-01a-CTLFireability-04
FORMULA_NAME AutoFlight-PT-01a-CTLFireability-05
FORMULA_NAME AutoFlight-PT-01a-CTLFireability-06
FORMULA_NAME AutoFlight-PT-01a-CTLFireability-07
FORMULA_NAME AutoFlight-PT-01a-CTLFireability-08
FORMULA_NAME AutoFlight-PT-01a-CTLFireability-09
FORMULA_NAME AutoFlight-PT-01a-CTLFireability-10
FORMULA_NAME AutoFlight-PT-01a-CTLFireability-11
FORMULA_NAME AutoFlight-PT-01a-CTLFireability-12
FORMULA_NAME AutoFlight-PT-01a-CTLFireability-13
FORMULA_NAME AutoFlight-PT-01a-CTLFireability-14
FORMULA_NAME AutoFlight-PT-01a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678687064495

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-01a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 05:57:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 05:57:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 05:57:47] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-13 05:57:47] [INFO ] Transformed 32 places.
[2023-03-13 05:57:47] [INFO ] Transformed 30 transitions.
[2023-03-13 05:57:47] [INFO ] Found NUPN structural information;
[2023-03-13 05:57:47] [INFO ] Parsed PT model containing 32 places and 30 transitions and 100 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
FORMULA AutoFlight-PT-01a-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01a-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01a-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 25/25 transitions.
Applied a total of 0 rules in 10 ms. Remains 32 /32 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 32 cols
[2023-03-13 05:57:47] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-13 05:57:48] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-13 05:57:48] [INFO ] Invariant cache hit.
[2023-03-13 05:57:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 05:57:48] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2023-03-13 05:57:48] [INFO ] Invariant cache hit.
[2023-03-13 05:57:48] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 721 ms. Remains : 32/32 places, 25/25 transitions.
Support contains 31 out of 32 places after structural reductions.
[2023-03-13 05:57:48] [INFO ] Flatten gal took : 16 ms
[2023-03-13 05:57:48] [INFO ] Flatten gal took : 6 ms
[2023-03-13 05:57:49] [INFO ] Input system was already deterministic with 25 transitions.
Incomplete random walk after 10000 steps, including 414 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 46) seen :41
Incomplete Best-First random walk after 10000 steps, including 250 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 370 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 186 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-13 05:57:49] [INFO ] Invariant cache hit.
[2023-03-13 05:57:49] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-13 05:57:49] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 05:57:50] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
[2023-03-13 05:57:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 4 ms
FORMULA AutoFlight-PT-01a-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 29 ms
[2023-03-13 05:57:50] [INFO ] Input system was already deterministic with 25 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 25/25 transitions.
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:57:50] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 25/25 transitions.
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:57:50] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 25/25 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 32 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 29 transition count 22
Applied a total of 6 rules in 7 ms. Remains 29 /32 variables (removed 3) and now considering 22/25 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 29/32 places, 22/25 transitions.
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 1 ms
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 6 ms
[2023-03-13 05:57:50] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 32/32 places, 25/25 transitions.
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 9 ms
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:57:50] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 25/25 transitions.
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 1 ms
[2023-03-13 05:57:50] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 25/25 transitions.
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 1 ms
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 1 ms
[2023-03-13 05:57:50] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 25/25 transitions.
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 1 ms
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:57:50] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 32/32 places, 25/25 transitions.
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 1 ms
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:57:50] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 32/32 places, 25/25 transitions.
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:57:50] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 25/25 transitions.
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:57:50] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 32/32 places, 25/25 transitions.
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 1 ms
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:57:50] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 25/25 transitions.
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 1 ms
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:57:50] [INFO ] Input system was already deterministic with 25 transitions.
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:57:50] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:57:50] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-13 05:57:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 25 transitions and 90 arcs took 1 ms.
Total runtime 2992 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: 32 NrTr: 25 NrArc: 90)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.960sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 160 (1.6e+02) #states 253



starting MCC model checker
--------------------------

checking: EG [AX [EF [[[p6<=1 & 1<=p6] & [p26<=1 & 1<=p26]]]]]
normalized: EG [~ [EX [~ [E [true U [[p6<=1 & 1<=p6] & [p26<=1 & 1<=p26]]]]]]]

abstracting: (1<=p26)
states: 18
abstracting: (p26<=1)
states: 253
abstracting: (1<=p6)
states: 92
abstracting: (p6<=1)
states: 253
............
EG iterations: 11
-> the formula is TRUE

FORMULA AutoFlight-PT-01a-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EX [[AF [AX [[[p17<=0 & 0<=p17] | [p30<=0 & 0<=p30]]]] & EF [[p9<=1 & 1<=p9]]]]
normalized: EX [[~ [EG [EX [~ [[[p30<=0 & 0<=p30] | [p17<=0 & 0<=p17]]]]]] & E [true U [p9<=1 & 1<=p9]]]]

abstracting: (1<=p9)
states: 126
abstracting: (p9<=1)
states: 253
abstracting: (0<=p17)
states: 253
abstracting: (p17<=0)
states: 79
abstracting: (0<=p30)
states: 253
abstracting: (p30<=0)
states: 235
........
EG iterations: 7
.-> the formula is TRUE

FORMULA AutoFlight-PT-01a-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EX [A [[p5<=1 & 1<=p5] U [AG [AX [[p6<=1 & 1<=p6]]] | ~ [[p2<=1 & 1<=p2]]]]]
normalized: EX [[~ [EG [~ [[~ [E [true U EX [~ [[p6<=1 & 1<=p6]]]]] | ~ [[p2<=1 & 1<=p2]]]]]] & ~ [E [~ [[~ [E [true U EX [~ [[p6<=1 & 1<=p6]]]]] | ~ [[p2<=1 & 1<=p2]]]] U [~ [[~ [E [true U EX [~ [[p6<=1 & 1<=p6]]]]] | ~ [[p2<=1 & 1<=p2]]]] & ~ [[p5<=1 & 1<=p5]]]]]]]

abstracting: (1<=p5)
states: 68
abstracting: (p5<=1)
states: 253
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 253
abstracting: (1<=p6)
states: 92
abstracting: (p6<=1)
states: 253
.abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 253
abstracting: (1<=p6)
states: 92
abstracting: (p6<=1)
states: 253
.abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 253
abstracting: (1<=p6)
states: 92
abstracting: (p6<=1)
states: 253
...........
EG iterations: 10
.-> the formula is TRUE

FORMULA AutoFlight-PT-01a-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EG [AF [[AX [[[p7<=1 & 1<=p7] & [p21<=1 & 1<=p21]]] & [AX [[p6<=1 & 1<=p6]] & AF [AG [[p5<=0 & 0<=p5]]]]]]]
normalized: EG [~ [EG [~ [[[~ [EG [E [true U ~ [[p5<=0 & 0<=p5]]]]] & ~ [EX [~ [[p6<=1 & 1<=p6]]]]] & ~ [EX [~ [[[p21<=1 & 1<=p21] & [p7<=1 & 1<=p7]]]]]]]]]]

abstracting: (1<=p7)
states: 252
abstracting: (p7<=1)
states: 253
abstracting: (1<=p21)
states: 12
abstracting: (p21<=1)
states: 253
.abstracting: (1<=p6)
states: 92
abstracting: (p6<=1)
states: 253
.abstracting: (0<=p5)
states: 253
abstracting: (p5<=0)
states: 185
........
EG iterations: 8
.........
EG iterations: 9
.
EG iterations: 1
-> the formula is FALSE

FORMULA AutoFlight-PT-01a-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AX [[E [[~ [EG [[p2<=1 & 1<=p2]]] | EF [~ [[p0<=1 & 1<=p0]]]] U ~ [AX [E [[[p6<=1 & 1<=p6] & [p26<=1 & 1<=p26]] U [p5<=1 & 1<=p5]]]]] | [[p2<=1 & 1<=p2] | [[p29<=1 & 1<=p29] & [p30<=1 & 1<=p30]]]]]
normalized: ~ [EX [~ [[[[[p30<=1 & 1<=p30] & [p29<=1 & 1<=p29]] | [p2<=1 & 1<=p2]] | E [[E [true U ~ [[p0<=1 & 1<=p0]]] | ~ [EG [[p2<=1 & 1<=p2]]]] U EX [~ [E [[[p26<=1 & 1<=p26] & [p6<=1 & 1<=p6]] U [p5<=1 & 1<=p5]]]]]]]]]

abstracting: (1<=p5)
states: 68
abstracting: (p5<=1)
states: 253
abstracting: (1<=p6)
states: 92
abstracting: (p6<=1)
states: 253
abstracting: (1<=p26)
states: 18
abstracting: (p26<=1)
states: 253
.abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 253
..........
EG iterations: 10
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 253
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 253
abstracting: (1<=p29)
states: 162
abstracting: (p29<=1)
states: 253
abstracting: (1<=p30)
states: 18
abstracting: (p30<=1)
states: 253
.-> the formula is TRUE

FORMULA AutoFlight-PT-01a-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [~ [E [[EF [~ [[[p7<=1 & 1<=p7] & [p15<=1 & 1<=p15]]]] | EX [[[p5<=1 & 1<=p5] | [[p7<=1 & 1<=p7] & [p19<=1 & 1<=p19]]]]] U ~ [[[p24<=1 & 1<=p24] & [[p31<=1 & 1<=p31] & ~ [[p3<=1 & 1<=p3]]]]]]]]
normalized: ~ [EG [E [[EX [[[[p19<=1 & 1<=p19] & [p7<=1 & 1<=p7]] | [p5<=1 & 1<=p5]]] | E [true U ~ [[[p15<=1 & 1<=p15] & [p7<=1 & 1<=p7]]]]] U ~ [[[~ [[p3<=1 & 1<=p3]] & [p31<=1 & 1<=p31]] & [p24<=1 & 1<=p24]]]]]]

abstracting: (1<=p24)
states: 18
abstracting: (p24<=1)
states: 253
abstracting: (1<=p31)
states: 234
abstracting: (p31<=1)
states: 253
abstracting: (1<=p3)
states: 94
abstracting: (p3<=1)
states: 253
abstracting: (1<=p7)
states: 252
abstracting: (p7<=1)
states: 253
abstracting: (1<=p15)
states: 12
abstracting: (p15<=1)
states: 253
abstracting: (1<=p5)
states: 68
abstracting: (p5<=1)
states: 253
abstracting: (1<=p7)
states: 252
abstracting: (p7<=1)
states: 253
abstracting: (1<=p19)
states: 12
abstracting: (p19<=1)
states: 253
.
EG iterations: 0
-> the formula is FALSE

FORMULA AutoFlight-PT-01a-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [E [EF [[[p3<=1 & 1<=p3] & [p25<=1 & 1<=p25]]] U [A [A [[p3<=1 & 1<=p3] U [[p11<=1 & 1<=p11] & [p31<=1 & 1<=p31]]] U AX [[p2<=1 & 1<=p2]]] & [[p24<=1 & 1<=p24] & [p31<=1 & 1<=p31]]]] | EG [AG [AF [[[p7<=0 & 0<=p7] | [p12<=0 & 0<=p12]]]]]]
normalized: [EG [~ [E [true U EG [~ [[[p12<=0 & 0<=p12] | [p7<=0 & 0<=p7]]]]]]] | E [E [true U [[p25<=1 & 1<=p25] & [p3<=1 & 1<=p3]]] U [[[p31<=1 & 1<=p31] & [p24<=1 & 1<=p24]] & [~ [EG [EX [~ [[p2<=1 & 1<=p2]]]]] & ~ [E [EX [~ [[p2<=1 & 1<=p2]]] U [~ [[~ [EG [~ [[[p31<=1 & 1<=p31] & [p11<=1 & 1<=p11]]]]] & ~ [E [~ [[[p31<=1 & 1<=p31] & [p11<=1 & 1<=p11]]] U [~ [[p3<=1 & 1<=p3]] & ~ [[[p31<=1 & 1<=p31] & [p11<=1 & 1<=p11]]]]]]]] & EX [~ [[p2<=1 & 1<=p2]]]]]]]]]]

abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 253
.abstracting: (1<=p11)
states: 12
abstracting: (p11<=1)
states: 253
abstracting: (1<=p31)
states: 234
abstracting: (p31<=1)
states: 253
abstracting: (1<=p3)
states: 94
abstracting: (p3<=1)
states: 253
abstracting: (1<=p11)
states: 12
abstracting: (p11<=1)
states: 253
abstracting: (1<=p31)
states: 234
abstracting: (p31<=1)
states: 253
abstracting: (1<=p11)
states: 12
abstracting: (p11<=1)
states: 253
abstracting: (1<=p31)
states: 234
abstracting: (p31<=1)
states: 253
............
EG iterations: 12
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 253
.abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 253
..........
EG iterations: 9
abstracting: (1<=p24)
states: 18
abstracting: (p24<=1)
states: 253
abstracting: (1<=p31)
states: 234
abstracting: (p31<=1)
states: 253
abstracting: (1<=p3)
states: 94
abstracting: (p3<=1)
states: 253
abstracting: (1<=p25)
states: 18
abstracting: (p25<=1)
states: 253
abstracting: (0<=p7)
states: 253
abstracting: (p7<=0)
states: 1
abstracting: (0<=p12)
states: 253
abstracting: (p12<=0)
states: 241
......
EG iterations: 6

EG iterations: 0
-> the formula is TRUE

FORMULA AutoFlight-PT-01a-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AF [[[p13<=1 & 1<=p13] | [AG [AF [[[p10<=0 & 0<=p10] | [p28<=0 & 0<=p28]]]] & E [[[EF [[p3<=1 & 1<=p3]] | E [[p2<=1 & 1<=p2] U [p2<=1 & 1<=p2]]] & A [[[p10<=1 & 1<=p10] & [p28<=1 & 1<=p28]] U [p14<=1 & 1<=p14]]] U ~ [[A [[p13<=1 & 1<=p13] U [[p7<=1 & 1<=p7] & [p15<=1 & 1<=p15]]] & [[p7<=1 & 1<=p7] & [p12<=1 & 1<=p12]]]]]]]]
normalized: ~ [EG [~ [[[E [[[~ [EG [~ [[p14<=1 & 1<=p14]]]] & ~ [E [~ [[p14<=1 & 1<=p14]] U [~ [[[p28<=1 & 1<=p28] & [p10<=1 & 1<=p10]]] & ~ [[p14<=1 & 1<=p14]]]]]] & [E [[p2<=1 & 1<=p2] U [p2<=1 & 1<=p2]] | E [true U [p3<=1 & 1<=p3]]]] U ~ [[[[p12<=1 & 1<=p12] & [p7<=1 & 1<=p7]] & [~ [EG [~ [[[p15<=1 & 1<=p15] & [p7<=1 & 1<=p7]]]]] & ~ [E [~ [[[p15<=1 & 1<=p15] & [p7<=1 & 1<=p7]]] U [~ [[p13<=1 & 1<=p13]] & ~ [[[p15<=1 & 1<=p15] & [p7<=1 & 1<=p7]]]]]]]]]] & ~ [E [true U EG [~ [[[p28<=0 & 0<=p28] | [p10<=0 & 0<=p10]]]]]]] | [p13<=1 & 1<=p13]]]]]

abstracting: (1<=p13)
states: 12
abstracting: (p13<=1)
states: 253
abstracting: (0<=p10)
states: 253
abstracting: (p10<=0)
states: 1
abstracting: (0<=p28)
states: 253
abstracting: (p28<=0)
states: 235
.......
EG iterations: 7
abstracting: (1<=p7)
states: 252
abstracting: (p7<=1)
states: 253
abstracting: (1<=p15)
states: 12
abstracting: (p15<=1)
states: 253
abstracting: (1<=p13)
states: 12
abstracting: (p13<=1)
states: 253
abstracting: (1<=p7)
states: 252
abstracting: (p7<=1)
states: 253
abstracting: (1<=p15)
states: 12
abstracting: (p15<=1)
states: 253
abstracting: (1<=p7)
states: 252
abstracting: (p7<=1)
states: 253
abstracting: (1<=p15)
states: 12
abstracting: (p15<=1)
states: 253
.......
EG iterations: 7
abstracting: (1<=p7)
states: 252
abstracting: (p7<=1)
states: 253
abstracting: (1<=p12)
states: 12
abstracting: (p12<=1)
states: 253
abstracting: (1<=p3)
states: 94
abstracting: (p3<=1)
states: 253
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 253
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 253
abstracting: (1<=p14)
states: 12
abstracting: (p14<=1)
states: 253
abstracting: (1<=p10)
states: 252
abstracting: (p10<=1)
states: 253
abstracting: (1<=p28)
states: 18
abstracting: (p28<=1)
states: 253
abstracting: (1<=p14)
states: 12
abstracting: (p14<=1)
states: 253
abstracting: (1<=p14)
states: 12
abstracting: (p14<=1)
states: 253
.........
EG iterations: 9
.
EG iterations: 1
-> the formula is TRUE

FORMULA AutoFlight-PT-01a-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AX [[E [[EF [[p5<=1 & 1<=p5]] & AG [[p6<=1 & 1<=p6]]] U [AX [[[p11<=1 & 1<=p11] & [p31<=1 & 1<=p31]]] | E [[[p1<=1 & 1<=p1] & [p16<=1 & 1<=p16]] U [[p6<=1 & 1<=p6] & [p26<=1 & 1<=p26]]]]] & [AG [[AX [[[p17<=1 & 1<=p17] & [p30<=1 & 1<=p30]]] | [[p11<=1 & 1<=p11] & [p31<=1 & 1<=p31]]]] & [[p5<=1 & 1<=p5] | [p0<=1 & 1<=p0]]]]]
normalized: ~ [EX [~ [[[[[p0<=1 & 1<=p0] | [p5<=1 & 1<=p5]] & ~ [E [true U ~ [[[[p31<=1 & 1<=p31] & [p11<=1 & 1<=p11]] | ~ [EX [~ [[[p30<=1 & 1<=p30] & [p17<=1 & 1<=p17]]]]]]]]]] & E [[~ [E [true U ~ [[p6<=1 & 1<=p6]]]] & E [true U [p5<=1 & 1<=p5]]] U [E [[[p16<=1 & 1<=p16] & [p1<=1 & 1<=p1]] U [[p26<=1 & 1<=p26] & [p6<=1 & 1<=p6]]] | ~ [EX [~ [[[p31<=1 & 1<=p31] & [p11<=1 & 1<=p11]]]]]]]]]]]

abstracting: (1<=p11)
states: 12
abstracting: (p11<=1)
states: 253
abstracting: (1<=p31)
states: 234
abstracting: (p31<=1)
states: 253
.abstracting: (1<=p6)
states: 92
abstracting: (p6<=1)
states: 253
abstracting: (1<=p26)
states: 18
abstracting: (p26<=1)
states: 253
abstracting: (1<=p1)
states: 94
abstracting: (p1<=1)
states: 253
abstracting: (1<=p16)
states: 18
abstracting: (p16<=1)
states: 253
abstracting: (1<=p5)
states: 68
abstracting: (p5<=1)
states: 253
abstracting: (1<=p6)
states: 92
abstracting: (p6<=1)
states: 253
abstracting: (1<=p17)
states: 174
abstracting: (p17<=1)
states: 253
abstracting: (1<=p30)
states: 18
abstracting: (p30<=1)
states: 253
.abstracting: (1<=p11)
states: 12
abstracting: (p11<=1)
states: 253
abstracting: (1<=p31)
states: 234
abstracting: (p31<=1)
states: 253
abstracting: (1<=p5)
states: 68
abstracting: (p5<=1)
states: 253
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 253
.-> the formula is FALSE

FORMULA AutoFlight-PT-01a-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [~ [E [[~ [EX [[[p7<=1 & 1<=p7] & [p21<=1 & 1<=p21]]]] | [[[p4<=1 & 1<=p4] & [p22<=1 & 1<=p22]] | [p2<=1 & 1<=p2]]] U [[[p7<=1 & 1<=p7] & [p21<=1 & 1<=p21]] | A [[[p6<=1 & 1<=p6] & [p26<=1 & 1<=p26]] U [[p1<=1 & 1<=p1] & [p16<=1 & 1<=p16]]]]]] & [AG [[[[p23<=1 & 1<=p23] & [p30<=1 & 1<=p30]] | EF [[[p3<=0 & 0<=p3] & [[p7<=0 & 0<=p7] | [p21<=0 & 0<=p21]]]]]] & EX [EX [AF [[[p11<=0 & 0<=p11] | [p31<=0 & 0<=p31]]]]]]]
normalized: [[EX [EX [~ [EG [~ [[[p31<=0 & 0<=p31] | [p11<=0 & 0<=p11]]]]]]] & ~ [E [true U ~ [[E [true U [[[p21<=0 & 0<=p21] | [p7<=0 & 0<=p7]] & [p3<=0 & 0<=p3]]] | [[p30<=1 & 1<=p30] & [p23<=1 & 1<=p23]]]]]]] & ~ [E [[[[p2<=1 & 1<=p2] | [[p22<=1 & 1<=p22] & [p4<=1 & 1<=p4]]] | ~ [EX [[[p21<=1 & 1<=p21] & [p7<=1 & 1<=p7]]]]] U [[~ [EG [~ [[[p16<=1 & 1<=p16] & [p1<=1 & 1<=p1]]]]] & ~ [E [~ [[[p16<=1 & 1<=p16] & [p1<=1 & 1<=p1]]] U [~ [[[p26<=1 & 1<=p26] & [p6<=1 & 1<=p6]]] & ~ [[[p16<=1 & 1<=p16] & [p1<=1 & 1<=p1]]]]]]] | [[p21<=1 & 1<=p21] & [p7<=1 & 1<=p7]]]]]]

abstracting: (1<=p7)
states: 252
abstracting: (p7<=1)
states: 253
abstracting: (1<=p21)
states: 12
abstracting: (p21<=1)
states: 253
abstracting: (1<=p1)
states: 94
abstracting: (p1<=1)
states: 253
abstracting: (1<=p16)
states: 18
abstracting: (p16<=1)
states: 253
abstracting: (1<=p6)
states: 92
abstracting: (p6<=1)
states: 253
abstracting: (1<=p26)
states: 18
abstracting: (p26<=1)
states: 253
abstracting: (1<=p1)
states: 94
abstracting: (p1<=1)
states: 253
abstracting: (1<=p16)
states: 18
abstracting: (p16<=1)
states: 253
abstracting: (1<=p1)
states: 94
abstracting: (p1<=1)
states: 253
abstracting: (1<=p16)
states: 18
abstracting: (p16<=1)
states: 253
......
EG iterations: 6
abstracting: (1<=p7)
states: 252
abstracting: (p7<=1)
states: 253
abstracting: (1<=p21)
states: 12
abstracting: (p21<=1)
states: 253
.abstracting: (1<=p4)
states: 92
abstracting: (p4<=1)
states: 253
abstracting: (1<=p22)
states: 18
abstracting: (p22<=1)
states: 253
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 253
abstracting: (1<=p23)
states: 186
abstracting: (p23<=1)
states: 253
abstracting: (1<=p30)
states: 18
abstracting: (p30<=1)
states: 253
abstracting: (0<=p3)
states: 253
abstracting: (p3<=0)
states: 159
abstracting: (0<=p7)
states: 253
abstracting: (p7<=0)
states: 1
abstracting: (0<=p21)
states: 253
abstracting: (p21<=0)
states: 241
abstracting: (0<=p11)
states: 253
abstracting: (p11<=0)
states: 241
abstracting: (0<=p31)
states: 253
abstracting: (p31<=0)
states: 19
......
EG iterations: 6
..-> the formula is FALSE

FORMULA AutoFlight-PT-01a-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[[AG [AX [[1<=p5 & p5<=1]]] | [AG [[[p29<=1 & 1<=p29] & [p30<=1 & 1<=p30]]] | [p13<=1 & 1<=p13]]] | [[[~ [E [[[p23<=1 & 1<=p23] & [p30<=1 & 1<=p30]] U [[p7<=1 & 1<=p7] & [p12<=1 & 1<=p12]]]] & [AF [[p9<=1 & 1<=p9]] & [[p3<=1 & 1<=p3] | [[p7<=1 & 1<=p7] & [p21<=1 & 1<=p21]]]]] | [AX [[p3<=1 & 1<=p3]] & [[p13<=1 & 1<=p13] | A [[[p17<=1 & 1<=p17] & [p30<=1 & 1<=p30]] U [p14<=1 & 1<=p14]]]]] | [[[p18<=1 & 1<=p18] & [p31<=1 & 1<=p31]] | [[p3<=0 & 0<=p3] & [[p7<=1 & 1<=p7] & [p15<=1 & 1<=p15]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[p15<=1 & 1<=p15] & [p7<=1 & 1<=p7]] & [p3<=0 & 0<=p3]] | [[p31<=1 & 1<=p31] & [p18<=1 & 1<=p18]]] | [[[[~ [EG [~ [[p14<=1 & 1<=p14]]]] & ~ [E [~ [[p14<=1 & 1<=p14]] U [~ [[[p30<=1 & 1<=p30] & [p17<=1 & 1<=p17]]] & ~ [[p14<=1 & 1<=p14]]]]]] | [p13<=1 & 1<=p13]] & ~ [EX [~ [[p3<=1 & 1<=p3]]]]] | [[[[[p21<=1 & 1<=p21] & [p7<=1 & 1<=p7]] | [p3<=1 & 1<=p3]] & ~ [EG [~ [[p9<=1 & 1<=p9]]]]] & ~ [E [[[p30<=1 & 1<=p30] & [p23<=1 & 1<=p23]] U [[p12<=1 & 1<=p12] & [p7<=1 & 1<=p7]]]]]]] | [[[p13<=1 & 1<=p13] | ~ [E [true U ~ [[[p30<=1 & 1<=p30] & [p29<=1 & 1<=p29]]]]]] | ~ [E [true U EX [~ [[1<=p5 & p5<=1]]]]]]]]]]

abstracting: (p5<=1)
states: 253
abstracting: (1<=p5)
states: 68
.abstracting: (1<=p29)
states: 162
abstracting: (p29<=1)
states: 253
abstracting: (1<=p30)
states: 18
abstracting: (p30<=1)
states: 253
abstracting: (1<=p13)
states: 12
abstracting: (p13<=1)
states: 253
abstracting: (1<=p7)
states: 252
abstracting: (p7<=1)
states: 253
abstracting: (1<=p12)
states: 12
abstracting: (p12<=1)
states: 253
abstracting: (1<=p23)
states: 186
abstracting: (p23<=1)
states: 253
abstracting: (1<=p30)
states: 18
abstracting: (p30<=1)
states: 253
abstracting: (1<=p9)
states: 126
abstracting: (p9<=1)
states: 253
.......
EG iterations: 7
abstracting: (1<=p3)
states: 94
abstracting: (p3<=1)
states: 253
abstracting: (1<=p7)
states: 252
abstracting: (p7<=1)
states: 253
abstracting: (1<=p21)
states: 12
abstracting: (p21<=1)
states: 253
abstracting: (1<=p3)
states: 94
abstracting: (p3<=1)
states: 253
.abstracting: (1<=p13)
states: 12
abstracting: (p13<=1)
states: 253
abstracting: (1<=p14)
states: 12
abstracting: (p14<=1)
states: 253
abstracting: (1<=p17)
states: 174
abstracting: (p17<=1)
states: 253
abstracting: (1<=p30)
states: 18
abstracting: (p30<=1)
states: 253
abstracting: (1<=p14)
states: 12
abstracting: (p14<=1)
states: 253
abstracting: (1<=p14)
states: 12
abstracting: (p14<=1)
states: 253
.........
EG iterations: 9
abstracting: (1<=p18)
states: 12
abstracting: (p18<=1)
states: 253
abstracting: (1<=p31)
states: 234
abstracting: (p31<=1)
states: 253
abstracting: (0<=p3)
states: 253
abstracting: (p3<=0)
states: 159
abstracting: (1<=p7)
states: 252
abstracting: (p7<=1)
states: 253
abstracting: (1<=p15)
states: 12
abstracting: (p15<=1)
states: 253
-> the formula is FALSE

FORMULA AutoFlight-PT-01a-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[EF [[[AF [[[p7<=0 & 0<=p7] | [p19<=0 & 0<=p19]]] | [[p6<=0 & 0<=p6] | [p9<=0 & 0<=p9]]] & ~ [A [[p5<=1 & 1<=p5] U [p5<=1 & 1<=p5]]]]] | ~ [E [[[E [[[p7<=1 & 1<=p7] & [p12<=1 & 1<=p12]] U [p2<=1 & 1<=p2]] | [[p18<=1 & 1<=p18] & [p31<=1 & 1<=p31]]] | [[[p1<=1 & 1<=p1] & [p16<=1 & 1<=p16]] | [[[p7<=1 & 1<=p7] & [[p21<=1 & 1<=p21] & [p14<=1 & 1<=p14]]] | [[[p24<=1 & 1<=p24] & [p31<=1 & 1<=p31]] & [[p8<=1 & 1<=p8] & [p27<=1 & 1<=p27]]]]]] U A [[[[p6<=1 & 1<=p6] & [p26<=1 & 1<=p26]] | [[p7<=1 & 1<=p7] & [p21<=1 & 1<=p21]]] U [p6<=1 & 1<=p6]]]]]]
normalized: ~ [E [true U ~ [[~ [E [[[[[[[p27<=1 & 1<=p27] & [p8<=1 & 1<=p8]] & [[p31<=1 & 1<=p31] & [p24<=1 & 1<=p24]]] | [[[p14<=1 & 1<=p14] & [p21<=1 & 1<=p21]] & [p7<=1 & 1<=p7]]] | [[p16<=1 & 1<=p16] & [p1<=1 & 1<=p1]]] | [[[p31<=1 & 1<=p31] & [p18<=1 & 1<=p18]] | E [[[p12<=1 & 1<=p12] & [p7<=1 & 1<=p7]] U [p2<=1 & 1<=p2]]]] U [~ [EG [~ [[p6<=1 & 1<=p6]]]] & ~ [E [~ [[p6<=1 & 1<=p6]] U [~ [[[[p21<=1 & 1<=p21] & [p7<=1 & 1<=p7]] | [[p26<=1 & 1<=p26] & [p6<=1 & 1<=p6]]]] & ~ [[p6<=1 & 1<=p6]]]]]]]] | E [true U [~ [[~ [EG [~ [[p5<=1 & 1<=p5]]]] & ~ [E [~ [[p5<=1 & 1<=p5]] U [~ [[p5<=1 & 1<=p5]] & ~ [[p5<=1 & 1<=p5]]]]]]] & [[[p9<=0 & 0<=p9] | [p6<=0 & 0<=p6]] | ~ [EG [~ [[[p19<=0 & 0<=p19] | [p7<=0 & 0<=p7]]]]]]]]]]]]

abstracting: (0<=p7)
states: 253
abstracting: (p7<=0)
states: 1
abstracting: (0<=p19)
states: 253
abstracting: (p19<=0)
states: 241
......
EG iterations: 6
abstracting: (0<=p6)
states: 253
abstracting: (p6<=0)
states: 161
abstracting: (0<=p9)
states: 253
abstracting: (p9<=0)
states: 127
abstracting: (1<=p5)
states: 68
abstracting: (p5<=1)
states: 253
abstracting: (1<=p5)
states: 68
abstracting: (p5<=1)
states: 253
abstracting: (1<=p5)
states: 68
abstracting: (p5<=1)
states: 253
abstracting: (1<=p5)
states: 68
abstracting: (p5<=1)
states: 253
.
EG iterations: 1
abstracting: (1<=p6)
states: 92
abstracting: (p6<=1)
states: 253
abstracting: (1<=p6)
states: 92
abstracting: (p6<=1)
states: 253
abstracting: (1<=p26)
states: 18
abstracting: (p26<=1)
states: 253
abstracting: (1<=p7)
states: 252
abstracting: (p7<=1)
states: 253
abstracting: (1<=p21)
states: 12
abstracting: (p21<=1)
states: 253
abstracting: (1<=p6)
states: 92
abstracting: (p6<=1)
states: 253
abstracting: (1<=p6)
states: 92
abstracting: (p6<=1)
states: 253
........
EG iterations: 8
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 253
abstracting: (1<=p7)
states: 252
abstracting: (p7<=1)
states: 253
abstracting: (1<=p12)
states: 12
abstracting: (p12<=1)
states: 253
abstracting: (1<=p18)
states: 12
abstracting: (p18<=1)
states: 253
abstracting: (1<=p31)
states: 234
abstracting: (p31<=1)
states: 253
abstracting: (1<=p1)
states: 94
abstracting: (p1<=1)
states: 253
abstracting: (1<=p16)
states: 18
abstracting: (p16<=1)
states: 253
abstracting: (1<=p7)
states: 252
abstracting: (p7<=1)
states: 253
abstracting: (1<=p21)
states: 12
abstracting: (p21<=1)
states: 253
abstracting: (1<=p14)
states: 12
abstracting: (p14<=1)
states: 253
abstracting: (1<=p24)
states: 18
abstracting: (p24<=1)
states: 253
abstracting: (1<=p31)
states: 234
abstracting: (p31<=1)
states: 253
abstracting: (1<=p8)
states: 126
abstracting: (p8<=1)
states: 253
abstracting: (1<=p27)
states: 18
abstracting: (p27<=1)
states: 253
-> the formula is TRUE

FORMULA AutoFlight-PT-01a-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

totally nodes used: 31918 (3.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 39264 83031 122295
used/not used/entry size/cache size: 111971 66996893 16 1024MB
basic ops cache: hits/miss/sum: 10608 25440 36048
used/not used/entry size/cache size: 46459 16730757 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: 743 1253 1996
used/not used/entry size/cache size: 1253 8387355 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 67077156
1 31499
2 208
3 1
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.818sec


BK_STOP 1678687075772

--------------------
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:217 (8), effective:37 (1)

initing FirstDep: 0m 0.000sec


iterations count:238 (9), effective:40 (1)

iterations count:161 (6), effective:24 (0)

iterations count:54 (2), effective:3 (0)

iterations count:54 (2), effective:3 (0)

iterations count:27 (1), effective:1 (0)

iterations count:54 (2), effective:3 (0)

iterations count:247 (9), effective:39 (1)

iterations count:38 (1), effective:1 (0)

iterations count:43 (1), effective:1 (0)

iterations count:27 (1), effective:1 (0)

iterations count:34 (1), effective:1 (0)

iterations count:29 (1), effective:1 (0)

iterations count:33 (1), effective:2 (0)

iterations count:27 (1), effective:1 (0)

iterations count:283 (11), effective:46 (1)

iterations count:27 (1), effective:1 (0)

iterations count:136 (5), effective:17 (0)

iterations count:25 (1), effective:0 (0)

iterations count:27 (1), effective:1 (0)

iterations count:25 (1), effective:0 (0)

iterations count:25 (1), effective:0 (0)

iterations count:247 (9), effective:39 (1)

iterations count:63 (2), effective:11 (0)

iterations count:25 (1), effective:0 (0)

iterations count:52 (2), effective:4 (0)

iterations count:38 (1), effective:1 (0)

iterations count:151 (6), effective:23 (0)

iterations count:41 (1), effective:3 (0)

iterations count:25 (1), effective:0 (0)

iterations count:27 (1), effective:1 (0)

iterations count:25 (1), effective:0 (0)

iterations count:27 (1), effective:1 (0)

iterations count:45 (1), effective:7 (0)

iterations count:25 (1), effective:0 (0)

iterations count:27 (1), effective:1 (0)

iterations count:33 (1), effective:1 (0)

iterations count:25 (1), effective:0 (0)

iterations count:78 (3), effective:8 (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-01a"
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-01a, 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-167813599000370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-01a.tgz
mv AutoFlight-PT-01a 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;