About the Execution of Marcie+red for AutoFlight-PT-02a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5451.604 | 11486.00 | 20951.00 | 37.20 | TTTTFFFFFFFTTFTF | 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-167813599000385.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-02a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599000385
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.5K Feb 25 18:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 18:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 18:14 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.6K Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 18:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 25 18:16 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 16K 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-02a-CTLCardinality-00
FORMULA_NAME AutoFlight-PT-02a-CTLCardinality-01
FORMULA_NAME AutoFlight-PT-02a-CTLCardinality-02
FORMULA_NAME AutoFlight-PT-02a-CTLCardinality-03
FORMULA_NAME AutoFlight-PT-02a-CTLCardinality-04
FORMULA_NAME AutoFlight-PT-02a-CTLCardinality-05
FORMULA_NAME AutoFlight-PT-02a-CTLCardinality-06
FORMULA_NAME AutoFlight-PT-02a-CTLCardinality-07
FORMULA_NAME AutoFlight-PT-02a-CTLCardinality-08
FORMULA_NAME AutoFlight-PT-02a-CTLCardinality-09
FORMULA_NAME AutoFlight-PT-02a-CTLCardinality-10
FORMULA_NAME AutoFlight-PT-02a-CTLCardinality-11
FORMULA_NAME AutoFlight-PT-02a-CTLCardinality-12
FORMULA_NAME AutoFlight-PT-02a-CTLCardinality-13
FORMULA_NAME AutoFlight-PT-02a-CTLCardinality-14
FORMULA_NAME AutoFlight-PT-02a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678687441970
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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-02a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 06:04:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 06:04:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:04:04] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-13 06:04:04] [INFO ] Transformed 57 places.
[2023-03-13 06:04:04] [INFO ] Transformed 55 transitions.
[2023-03-13 06:04:04] [INFO ] Found NUPN structural information;
[2023-03-13 06:04:04] [INFO ] Parsed PT model containing 57 places and 55 transitions and 180 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA AutoFlight-PT-02a-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Applied a total of 0 rules in 19 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 57 cols
[2023-03-13 06:04:04] [INFO ] Computed 16 place invariants in 6 ms
[2023-03-13 06:04:05] [INFO ] Implicit Places using invariants in 568 ms returned []
[2023-03-13 06:04:05] [INFO ] Invariant cache hit.
[2023-03-13 06:04:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 06:04:05] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2023-03-13 06:04:05] [INFO ] Invariant cache hit.
[2023-03-13 06:04:05] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 987 ms. Remains : 57/57 places, 45/45 transitions.
Support contains 53 out of 57 places after structural reductions.
[2023-03-13 06:04:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 06:04:06] [INFO ] Flatten gal took : 36 ms
FORMULA AutoFlight-PT-02a-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 06:04:06] [INFO ] Flatten gal took : 11 ms
[2023-03-13 06:04:06] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 52 out of 57 places (down from 53) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 403 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 58) seen :48
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 137 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-13 06:04:07] [INFO ] Invariant cache hit.
[2023-03-13 06:04:07] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 06:04:07] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-13 06:04:07] [INFO ] After 134ms SMT Verify possible using state equation in real domain returned unsat :5 sat :3
[2023-03-13 06:04:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 06:04:07] [INFO ] After 25ms SMT Verify possible using 10 Read/Feed constraints in real domain returned unsat :5 sat :3
[2023-03-13 06:04:07] [INFO ] After 51ms SMT Verify possible using trap constraints in real domain returned unsat :5 sat :3
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-13 06:04:07] [INFO ] After 362ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :3
Fused 8 Parikh solutions to 1 different solutions.
Finished Parikh walk after 8 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 3 properties in 1 ms.
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
[2023-03-13 06:04:07] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutoFlight-PT-02a-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 06:04:07] [INFO ] Flatten gal took : 7 ms
[2023-03-13 06:04:07] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 49 out of 57 places (down from 50) after GAL structural reductions.
Computed a total of 5 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 57 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 53 transition count 41
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 53 transition count 37
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 49 transition count 37
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 2 with 8 rules applied. Total rules applied 24 place count 45 transition count 33
Applied a total of 24 rules in 13 ms. Remains 45 /57 variables (removed 12) and now considering 33/45 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 45/57 places, 33/45 transitions.
[2023-03-13 06:04:07] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:07] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:08] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 57/57 places, 45/45 transitions.
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:08] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 57/57 places, 45/45 transitions.
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:08] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 57/57 places, 45/45 transitions.
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:08] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 57/57 places, 45/45 transitions.
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:08] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 44
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 56 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 55 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 8 place count 53 transition count 41
Applied a total of 8 rules in 8 ms. Remains 53 /57 variables (removed 4) and now considering 41/45 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 53/57 places, 41/45 transitions.
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:08] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 57/57 places, 45/45 transitions.
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:08] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 4 places and 0 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 14 rules applied. Total rules applied 14 place count 52 transition count 34
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 25 place count 42 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 41 transition count 33
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 26 place count 41 transition count 28
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 38 place count 34 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 38 place count 34 transition count 26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 32 transition count 26
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 50 place count 28 transition count 22
Applied a total of 50 rules in 5 ms. Remains 28 /57 variables (removed 29) and now considering 22/45 (removed 23) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 28/57 places, 22/45 transitions.
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 1 ms
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 1 ms
[2023-03-13 06:04:08] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 57/57 places, 45/45 transitions.
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:08] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 57/57 places, 45/45 transitions.
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:08] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 57/57 places, 45/45 transitions.
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:08] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 57/57 places, 45/45 transitions.
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:08] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 57/57 places, 45/45 transitions.
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:04:08] [INFO ] Input system was already deterministic with 45 transitions.
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:04:08] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-13 06:04:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 57 places, 45 transitions and 160 arcs took 1 ms.
Total runtime 3706 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=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 57 NrTr: 45 NrArc: 160)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 2.940sec
RS generation: 0m 0.004sec
-> reachability set: #nodes 348 (3.5e+02) #states 6,949 (3)
starting MCC model checker
--------------------------
checking: EX [0<=0]
normalized: EX [0<=0]
abstracting: (0<=0)
states: 6,949 (3)
.-> the formula is TRUE
FORMULA AutoFlight-PT-02a-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [EF [[p14<=1 & 1<=p14]]]
normalized: ~ [E [true U ~ [E [true U [p14<=1 & 1<=p14]]]]]
abstracting: (1<=p14)
states: 6,948 (3)
abstracting: (p14<=1)
states: 6,949 (3)
-> the formula is TRUE
FORMULA AutoFlight-PT-02a-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [AG [EX [[p42<=1 & 1<=p42]]]]
normalized: E [true U ~ [E [true U ~ [EX [[p42<=1 & 1<=p42]]]]]]
abstracting: (1<=p42)
states: 5,400 (3)
abstracting: (p42<=1)
states: 6,949 (3)
.-> the formula is FALSE
FORMULA AutoFlight-PT-02a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: AG [EF [[p38<=1 & 1<=p38]]]
normalized: ~ [E [true U ~ [E [true U [p38<=1 & 1<=p38]]]]]
abstracting: (1<=p38)
states: 144
abstracting: (p38<=1)
states: 6,949 (3)
-> the formula is FALSE
FORMULA AutoFlight-PT-02a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: EX [[p24<=0 & 0<=p24]]
normalized: EX [[p24<=0 & 0<=p24]]
abstracting: (0<=p24)
states: 6,949 (3)
abstracting: (p24<=0)
states: 6,805 (3)
.-> the formula is TRUE
FORMULA AutoFlight-PT-02a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [[AG [AF [[p12<=1 & 1<=p12]]] & AX [AF [[[p4<=0 & 0<=p4] | [p15<=1 & 1<=p15]]]]]]
normalized: ~ [EG [~ [[~ [EX [EG [~ [[[p15<=1 & 1<=p15] | [p4<=0 & 0<=p4]]]]]] & ~ [E [true U EG [~ [[p12<=1 & 1<=p12]]]]]]]]]
abstracting: (1<=p12)
states: 1,908 (3)
abstracting: (p12<=1)
states: 6,949 (3)
.
EG iterations: 1
abstracting: (0<=p4)
states: 6,949 (3)
abstracting: (p4<=0)
states: 4,465 (3)
abstracting: (1<=p15)
states: 3,474 (3)
abstracting: (p15<=1)
states: 6,949 (3)
............
EG iterations: 12
.
EG iterations: 0
-> the formula is FALSE
FORMULA AutoFlight-PT-02a-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: AG [[[p23<=0 & 0<=p23] | [EF [[p29<=0 & 0<=p29]] | EX [[p24<=0 & 0<=p24]]]]]
normalized: ~ [E [true U ~ [[[EX [[p24<=0 & 0<=p24]] | E [true U [p29<=0 & 0<=p29]]] | [p23<=0 & 0<=p23]]]]]
abstracting: (0<=p23)
states: 6,949 (3)
abstracting: (p23<=0)
states: 6,805 (3)
abstracting: (0<=p29)
states: 6,949 (3)
abstracting: (p29<=0)
states: 6,805 (3)
abstracting: (0<=p24)
states: 6,949 (3)
abstracting: (p24<=0)
states: 6,805 (3)
.-> the formula is TRUE
FORMULA AutoFlight-PT-02a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [AF [[[p27<=0 & 0<=p27] | [EX [[p54<=1 & 1<=p54]] | AX [[[p19<=0 & 0<=p19] & [p54<=1 & 1<=p54]]]]]]]
normalized: ~ [E [true U EG [~ [[[~ [EX [~ [[[p54<=1 & 1<=p54] & [p19<=0 & 0<=p19]]]]] | EX [[p54<=1 & 1<=p54]]] | [p27<=0 & 0<=p27]]]]]]
abstracting: (0<=p27)
states: 6,949 (3)
abstracting: (p27<=0)
states: 6,805 (3)
abstracting: (1<=p54)
states: 5,328 (3)
abstracting: (p54<=1)
states: 6,949 (3)
.abstracting: (0<=p19)
states: 6,949 (3)
abstracting: (p19<=0)
states: 3,475 (3)
abstracting: (1<=p54)
states: 5,328 (3)
abstracting: (p54<=1)
states: 6,949 (3)
..
EG iterations: 1
-> the formula is TRUE
FORMULA AutoFlight-PT-02a-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: [EF [~ [A [~ [A [[p44<=0 & 0<=p44] U [p5<=0 & 0<=p5]]] U EF [EX [[p31<=0 & 0<=p31]]]]]] & EX [AX [[[~ [[p21<=0 & 0<=p21]] & ~ [[p32<=1 & 1<=p32]]] | ~ [[p22<=0 & 0<=p22]]]]]]
normalized: [EX [~ [EX [~ [[~ [[p22<=0 & 0<=p22]] | [~ [[p32<=1 & 1<=p32]] & ~ [[p21<=0 & 0<=p21]]]]]]]] & E [true U ~ [[~ [EG [~ [E [true U EX [[p31<=0 & 0<=p31]]]]]] & ~ [E [~ [E [true U EX [[p31<=0 & 0<=p31]]]] U [[~ [EG [~ [[p5<=0 & 0<=p5]]]] & ~ [E [~ [[p5<=0 & 0<=p5]] U [~ [[p44<=0 & 0<=p44]] & ~ [[p5<=0 & 0<=p5]]]]]] & ~ [E [true U EX [[p31<=0 & 0<=p31]]]]]]]]]]]
abstracting: (0<=p31)
states: 6,949 (3)
abstracting: (p31<=0)
states: 6,625 (3)
.abstracting: (0<=p5)
states: 6,949 (3)
abstracting: (p5<=0)
states: 4,969 (3)
abstracting: (0<=p44)
states: 6,949 (3)
abstracting: (p44<=0)
states: 6,625 (3)
abstracting: (0<=p5)
states: 6,949 (3)
abstracting: (p5<=0)
states: 4,969 (3)
abstracting: (0<=p5)
states: 6,949 (3)
abstracting: (p5<=0)
states: 4,969 (3)
.............
EG iterations: 13
abstracting: (0<=p31)
states: 6,949 (3)
abstracting: (p31<=0)
states: 6,625 (3)
.abstracting: (0<=p31)
states: 6,949 (3)
abstracting: (p31<=0)
states: 6,625 (3)
..
EG iterations: 1
abstracting: (0<=p21)
states: 6,949 (3)
abstracting: (p21<=0)
states: 6,805 (3)
abstracting: (1<=p32)
states: 5,112 (3)
abstracting: (p32<=1)
states: 6,949 (3)
abstracting: (0<=p22)
states: 6,949 (3)
abstracting: (p22<=0)
states: 6,805 (3)
..-> the formula is FALSE
FORMULA AutoFlight-PT-02a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: EF [[AX [[p50<=1 & 1<=p50]] & [[[EX [~ [[p48<=1 & 1<=p48]]] | ~ [[p56<=1 & 1<=p56]]] | [[~ [[p44<=0 & 0<=p44]] & ~ [[p51<=1 & 1<=p51]]] | [~ [[p48<=1 & 1<=p48]] & ~ [[p23<=0 & 0<=p23]]]]] & [[~ [[p40<=0 & 0<=p40]] & ~ [[p16<=1 & 1<=p16]]] | [~ [[p0<=0 & 0<=p0]] & ~ [[p25<=0 & 0<=p25]]]]]]]
normalized: E [true U [[[[~ [[p25<=0 & 0<=p25]] & ~ [[p0<=0 & 0<=p0]]] | [~ [[p16<=1 & 1<=p16]] & ~ [[p40<=0 & 0<=p40]]]] & [[[~ [[p23<=0 & 0<=p23]] & ~ [[p48<=1 & 1<=p48]]] | [~ [[p51<=1 & 1<=p51]] & ~ [[p44<=0 & 0<=p44]]]] | [~ [[p56<=1 & 1<=p56]] | EX [~ [[p48<=1 & 1<=p48]]]]]] & ~ [EX [~ [[p50<=1 & 1<=p50]]]]]]
abstracting: (1<=p50)
states: 324
abstracting: (p50<=1)
states: 6,949 (3)
.abstracting: (1<=p48)
states: 5,328 (3)
abstracting: (p48<=1)
states: 6,949 (3)
.abstracting: (1<=p56)
states: 6,624 (3)
abstracting: (p56<=1)
states: 6,949 (3)
abstracting: (0<=p44)
states: 6,949 (3)
abstracting: (p44<=0)
states: 6,625 (3)
abstracting: (1<=p51)
states: 324
abstracting: (p51<=1)
states: 6,949 (3)
abstracting: (1<=p48)
states: 5,328 (3)
abstracting: (p48<=1)
states: 6,949 (3)
abstracting: (0<=p23)
states: 6,949 (3)
abstracting: (p23<=0)
states: 6,805 (3)
abstracting: (0<=p40)
states: 6,949 (3)
abstracting: (p40<=0)
states: 6,733 (3)
abstracting: (1<=p16)
states: 3,474 (3)
abstracting: (p16<=1)
states: 6,949 (3)
abstracting: (0<=p0)
states: 6,949 (3)
abstracting: (p0<=0)
states: 6,948 (3)
abstracting: (0<=p25)
states: 6,949 (3)
abstracting: (p25<=0)
states: 6,805 (3)
-> the formula is FALSE
FORMULA AutoFlight-PT-02a-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: E [[[p29<=0 & 0<=p29] | [p15<=1 & 1<=p15]] U ~ [AF [[[EF [[[p2<=0 & 0<=p2] | [p51<=1 & 1<=p51]]] | A [~ [[[p38<=0 & 0<=p38] | [p36<=1 & 1<=p36]]] U [[[p54<=0 & 0<=p54] | [p13<=1 & 1<=p13]] & [[p33<=0 & 0<=p33] | [p36<=1 & 1<=p36]]]]] | [[p56<=0 & 0<=p56] | [[p19<=0 & 0<=p19] | [p26<=1 & 1<=p26]]]]]]]
normalized: E [[[p15<=1 & 1<=p15] | [p29<=0 & 0<=p29]] U EG [~ [[[[[p26<=1 & 1<=p26] | [p19<=0 & 0<=p19]] | [p56<=0 & 0<=p56]] | [[~ [EG [~ [[[[p36<=1 & 1<=p36] | [p33<=0 & 0<=p33]] & [[p13<=1 & 1<=p13] | [p54<=0 & 0<=p54]]]]]] & ~ [E [~ [[[[p36<=1 & 1<=p36] | [p33<=0 & 0<=p33]] & [[p13<=1 & 1<=p13] | [p54<=0 & 0<=p54]]]] U [[[p36<=1 & 1<=p36] | [p38<=0 & 0<=p38]] & ~ [[[[p36<=1 & 1<=p36] | [p33<=0 & 0<=p33]] & [[p13<=1 & 1<=p13] | [p54<=0 & 0<=p54]]]]]]]] | E [true U [[p51<=1 & 1<=p51] | [p2<=0 & 0<=p2]]]]]]]]
abstracting: (0<=p2)
states: 6,949 (3)
abstracting: (p2<=0)
states: 5,065 (3)
abstracting: (1<=p51)
states: 324
abstracting: (p51<=1)
states: 6,949 (3)
abstracting: (0<=p54)
states: 6,949 (3)
abstracting: (p54<=0)
states: 1,621 (3)
abstracting: (1<=p13)
states: 2,520 (3)
abstracting: (p13<=1)
states: 6,949 (3)
abstracting: (0<=p33)
states: 6,949 (3)
abstracting: (p33<=0)
states: 6,805 (3)
abstracting: (1<=p36)
states: 144
abstracting: (p36<=1)
states: 6,949 (3)
abstracting: (0<=p38)
states: 6,949 (3)
abstracting: (p38<=0)
states: 6,805 (3)
abstracting: (1<=p36)
states: 144
abstracting: (p36<=1)
states: 6,949 (3)
abstracting: (0<=p54)
states: 6,949 (3)
abstracting: (p54<=0)
states: 1,621 (3)
abstracting: (1<=p13)
states: 2,520 (3)
abstracting: (p13<=1)
states: 6,949 (3)
abstracting: (0<=p33)
states: 6,949 (3)
abstracting: (p33<=0)
states: 6,805 (3)
abstracting: (1<=p36)
states: 144
abstracting: (p36<=1)
states: 6,949 (3)
abstracting: (0<=p54)
states: 6,949 (3)
abstracting: (p54<=0)
states: 1,621 (3)
abstracting: (1<=p13)
states: 2,520 (3)
abstracting: (p13<=1)
states: 6,949 (3)
abstracting: (0<=p33)
states: 6,949 (3)
abstracting: (p33<=0)
states: 6,805 (3)
abstracting: (1<=p36)
states: 144
abstracting: (p36<=1)
states: 6,949 (3)
.............
EG iterations: 13
abstracting: (0<=p56)
states: 6,949 (3)
abstracting: (p56<=0)
states: 325
abstracting: (0<=p19)
states: 6,949 (3)
abstracting: (p19<=0)
states: 3,475 (3)
abstracting: (1<=p26)
states: 144
abstracting: (p26<=1)
states: 6,949 (3)
.
EG iterations: 1
abstracting: (0<=p29)
states: 6,949 (3)
abstracting: (p29<=0)
states: 6,805 (3)
abstracting: (1<=p15)
states: 3,474 (3)
abstracting: (p15<=1)
states: 6,949 (3)
-> the formula is FALSE
FORMULA AutoFlight-PT-02a-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: [AF [EX [EF [[p24<=0 & 0<=p24]]]] & [E [~ [[A [[[p50<=1 & 1<=p50] | [p37<=1 & 1<=p37]] U ~ [[p44<=0 & 0<=p44]]] | [[p12<=0 & 0<=p12] | [p45<=1 & 1<=p45]]]] U [~ [E [[p19<=1 & 1<=p19] U [p19<=0 & 0<=p19]]] | ~ [[EF [[p9<=1 & 1<=p9]] & [[p21<=0 & 0<=p21] | [p33<=1 & 1<=p33]]]]]] | [E [[p2<=0 & 0<=p2] U ~ [EF [[p36<=0 & 0<=p36]]]] | EG [AG [[p49<=1 & 1<=p49]]]]]]
normalized: [[[EG [~ [E [true U ~ [[p49<=1 & 1<=p49]]]]] | E [[p2<=0 & 0<=p2] U ~ [E [true U [p36<=0 & 0<=p36]]]]] | E [~ [[[[p45<=1 & 1<=p45] | [p12<=0 & 0<=p12]] | [~ [EG [[p44<=0 & 0<=p44]]] & ~ [E [[p44<=0 & 0<=p44] U [~ [[[p37<=1 & 1<=p37] | [p50<=1 & 1<=p50]]] & [p44<=0 & 0<=p44]]]]]]] U [~ [[[[p33<=1 & 1<=p33] | [p21<=0 & 0<=p21]] & E [true U [p9<=1 & 1<=p9]]]] | ~ [E [[p19<=1 & 1<=p19] U [p19<=0 & 0<=p19]]]]]] & ~ [EG [~ [EX [E [true U [p24<=0 & 0<=p24]]]]]]]
abstracting: (0<=p24)
states: 6,949 (3)
abstracting: (p24<=0)
states: 6,805 (3)
..
EG iterations: 1
abstracting: (0<=p19)
states: 6,949 (3)
abstracting: (p19<=0)
states: 3,475 (3)
abstracting: (1<=p19)
states: 3,474 (3)
abstracting: (p19<=1)
states: 6,949 (3)
abstracting: (1<=p9)
states: 1,812 (3)
abstracting: (p9<=1)
states: 6,949 (3)
abstracting: (0<=p21)
states: 6,949 (3)
abstracting: (p21<=0)
states: 6,805 (3)
abstracting: (1<=p33)
states: 144
abstracting: (p33<=1)
states: 6,949 (3)
abstracting: (0<=p44)
states: 6,949 (3)
abstracting: (p44<=0)
states: 6,625 (3)
abstracting: (1<=p50)
states: 324
abstracting: (p50<=1)
states: 6,949 (3)
abstracting: (1<=p37)
states: 144
abstracting: (p37<=1)
states: 6,949 (3)
abstracting: (0<=p44)
states: 6,949 (3)
abstracting: (p44<=0)
states: 6,625 (3)
abstracting: (0<=p44)
states: 6,949 (3)
abstracting: (p44<=0)
states: 6,625 (3)
.
EG iterations: 1
abstracting: (0<=p12)
states: 6,949 (3)
abstracting: (p12<=0)
states: 5,041 (3)
abstracting: (1<=p45)
states: 324
abstracting: (p45<=1)
states: 6,949 (3)
abstracting: (0<=p36)
states: 6,949 (3)
abstracting: (p36<=0)
states: 6,805 (3)
abstracting: (0<=p2)
states: 6,949 (3)
abstracting: (p2<=0)
states: 5,065 (3)
abstracting: (1<=p49)
states: 324
abstracting: (p49<=1)
states: 6,949 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA AutoFlight-PT-02a-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.022sec
checking: [A [[[[[[p28<=0 & 0<=p28] | [p11<=1 & 1<=p11]] & AG [[[p41<=0 & 0<=p41] | [p37<=1 & 1<=p37]]]] | A [[[p48<=0 & 0<=p48] | [[p7<=0 & 0<=p7] | [p8<=1 & 1<=p8]]] U [[p35<=1 & 1<=p35] | [[p52<=0 & 0<=p52] | [p55<=1 & 1<=p55]]]]] & [A [AX [[p47<=1 & 1<=p47]] U AF [[p17<=1 & 1<=p17]]] & EG [[A [[p7<=1 & 1<=p7] U [p6<=0 & 0<=p6]] & [[p20<=0 & 0<=p20] | [p31<=1 & 1<=p31]]]]]] U [p18<=1 & 1<=p18]] & EF [[A [~ [[p10<=0 & 0<=p10]] U [[p8<=1 & 1<=p8] | [[p51<=0 & 0<=p51] | [p55<=1 & 1<=p55]]]] | [AX [[p13<=1 & 1<=p13]] & EF [~ [[p21<=1 & 1<=p21]]]]]]]
normalized: [E [true U [[E [true U ~ [[p21<=1 & 1<=p21]]] & ~ [EX [~ [[p13<=1 & 1<=p13]]]]] | [~ [EG [~ [[[[p55<=1 & 1<=p55] | [p51<=0 & 0<=p51]] | [p8<=1 & 1<=p8]]]]] & ~ [E [~ [[[[p55<=1 & 1<=p55] | [p51<=0 & 0<=p51]] | [p8<=1 & 1<=p8]]] U [[p10<=0 & 0<=p10] & ~ [[[[p55<=1 & 1<=p55] | [p51<=0 & 0<=p51]] | [p8<=1 & 1<=p8]]]]]]]]] & [~ [EG [~ [[p18<=1 & 1<=p18]]]] & ~ [E [~ [[p18<=1 & 1<=p18]] U [~ [[[EG [[[[p31<=1 & 1<=p31] | [p20<=0 & 0<=p20]] & [~ [EG [~ [[p6<=0 & 0<=p6]]]] & ~ [E [~ [[p6<=0 & 0<=p6]] U [~ [[p7<=1 & 1<=p7]] & ~ [[p6<=0 & 0<=p6]]]]]]]] & [~ [EG [EG [~ [[p17<=1 & 1<=p17]]]]] & ~ [E [EG [~ [[p17<=1 & 1<=p17]]] U [EX [~ [[p47<=1 & 1<=p47]]] & EG [~ [[p17<=1 & 1<=p17]]]]]]]] & [[~ [EG [~ [[[[p55<=1 & 1<=p55] | [p52<=0 & 0<=p52]] | [p35<=1 & 1<=p35]]]]] & ~ [E [~ [[[[p55<=1 & 1<=p55] | [p52<=0 & 0<=p52]] | [p35<=1 & 1<=p35]]] U [~ [[[[p8<=1 & 1<=p8] | [p7<=0 & 0<=p7]] | [p48<=0 & 0<=p48]]] & ~ [[[[p55<=1 & 1<=p55] | [p52<=0 & 0<=p52]] | [p35<=1 & 1<=p35]]]]]]] | [~ [E [true U ~ [[[p37<=1 & 1<=p37] | [p41<=0 & 0<=p41]]]]] & [[p11<=1 & 1<=p11] | [p28<=0 & 0<=p28]]]]]] & ~ [[p18<=1 & 1<=p18]]]]]]]
abstracting: (1<=p18)
states: 3,474 (3)
abstracting: (p18<=1)
states: 6,949 (3)
abstracting: (0<=p28)
states: 6,949 (3)
abstracting: (p28<=0)
states: 6,805 (3)
abstracting: (1<=p11)
states: 2,520 (3)
abstracting: (p11<=1)
states: 6,949 (3)
abstracting: (0<=p41)
states: 6,949 (3)
abstracting: (p41<=0)
states: 6,625 (3)
abstracting: (1<=p37)
states: 144
abstracting: (p37<=1)
states: 6,949 (3)
abstracting: (1<=p35)
states: 144
abstracting: (p35<=1)
states: 6,949 (3)
abstracting: (0<=p52)
states: 6,949 (3)
abstracting: (p52<=0)
states: 6,625 (3)
abstracting: (1<=p55)
states: 324
abstracting: (p55<=1)
states: 6,949 (3)
abstracting: (0<=p48)
states: 6,949 (3)
abstracting: (p48<=0)
states: 1,621 (3)
abstracting: (0<=p7)
states: 6,949 (3)
abstracting: (p7<=0)
states: 1
abstracting: (1<=p8)
states: 2,568 (3)
abstracting: (p8<=1)
states: 6,949 (3)
abstracting: (1<=p35)
states: 144
abstracting: (p35<=1)
states: 6,949 (3)
abstracting: (0<=p52)
states: 6,949 (3)
abstracting: (p52<=0)
states: 6,625 (3)
abstracting: (1<=p55)
states: 324
abstracting: (p55<=1)
states: 6,949 (3)
abstracting: (1<=p35)
states: 144
abstracting: (p35<=1)
states: 6,949 (3)
abstracting: (0<=p52)
states: 6,949 (3)
abstracting: (p52<=0)
states: 6,625 (3)
abstracting: (1<=p55)
states: 324
abstracting: (p55<=1)
states: 6,949 (3)
............
EG iterations: 12
abstracting: (1<=p17)
states: 6,948 (3)
abstracting: (p17<=1)
states: 6,949 (3)
..
EG iterations: 2
abstracting: (1<=p47)
states: 324
abstracting: (p47<=1)
states: 6,949 (3)
.abstracting: (1<=p17)
states: 6,948 (3)
abstracting: (p17<=1)
states: 6,949 (3)
..
EG iterations: 2
abstracting: (1<=p17)
states: 6,948 (3)
abstracting: (p17<=1)
states: 6,949 (3)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (0<=p6)
states: 6,949 (3)
abstracting: (p6<=0)
states: 4,465 (3)
abstracting: (1<=p7)
states: 6,948 (3)
abstracting: (p7<=1)
states: 6,949 (3)
abstracting: (0<=p6)
states: 6,949 (3)
abstracting: (p6<=0)
states: 4,465 (3)
abstracting: (0<=p6)
states: 6,949 (3)
abstracting: (p6<=0)
states: 4,465 (3)
.............
EG iterations: 13
abstracting: (0<=p20)
states: 6,949 (3)
abstracting: (p20<=0)
states: 1
abstracting: (1<=p31)
states: 324
abstracting: (p31<=1)
states: 6,949 (3)
..........
EG iterations: 10
abstracting: (1<=p18)
states: 3,474 (3)
abstracting: (p18<=1)
states: 6,949 (3)
abstracting: (1<=p18)
states: 3,474 (3)
abstracting: (p18<=1)
states: 6,949 (3)
..............
EG iterations: 14
abstracting: (1<=p8)
states: 2,568 (3)
abstracting: (p8<=1)
states: 6,949 (3)
abstracting: (0<=p51)
states: 6,949 (3)
abstracting: (p51<=0)
states: 6,625 (3)
abstracting: (1<=p55)
states: 324
abstracting: (p55<=1)
states: 6,949 (3)
abstracting: (0<=p10)
states: 6,949 (3)
abstracting: (p10<=0)
states: 4,381 (3)
abstracting: (1<=p8)
states: 2,568 (3)
abstracting: (p8<=1)
states: 6,949 (3)
abstracting: (0<=p51)
states: 6,949 (3)
abstracting: (p51<=0)
states: 6,625 (3)
abstracting: (1<=p55)
states: 324
abstracting: (p55<=1)
states: 6,949 (3)
abstracting: (1<=p8)
states: 2,568 (3)
abstracting: (p8<=1)
states: 6,949 (3)
abstracting: (0<=p51)
states: 6,949 (3)
abstracting: (p51<=0)
states: 6,625 (3)
abstracting: (1<=p55)
states: 324
abstracting: (p55<=1)
states: 6,949 (3)
...........
EG iterations: 11
abstracting: (1<=p13)
states: 2,520 (3)
abstracting: (p13<=1)
states: 6,949 (3)
.abstracting: (1<=p21)
states: 144
abstracting: (p21<=1)
states: 6,949 (3)
-> the formula is FALSE
FORMULA AutoFlight-PT-02a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.051sec
totally nodes used: 137783 (1.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 159927 383011 542938
used/not used/entry size/cache size: 523491 66585373 16 1024MB
basic ops cache: hits/miss/sum: 33121 96120 129241
used/not used/entry size/cache size: 176620 16600596 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: 1868 4127 5995
used/not used/entry size/cache size: 4127 8384481 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 66973676
1 132667
2 2448
3 72
4 1
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.893sec
BK_STOP 1678687453456
--------------------
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 CTLCardinality -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:551 (12), effective:89 (1)
initing FirstDep: 0m 0.000sec
iterations count:78 (1), effective:1 (0)
iterations count:313 (6), effective:55 (1)
iterations count:333 (7), effective:45 (1)
iterations count:300 (6), effective:41 (0)
iterations count:47 (1), effective:1 (0)
iterations count:54 (1), effective:1 (0)
iterations count:49 (1), effective:2 (0)
iterations count:45 (1), effective:0 (0)
iterations count:49 (1), effective:2 (0)
iterations count:45 (1), effective:0 (0)
iterations count:49 (1), effective:2 (0)
iterations count:298 (6), effective:48 (1)
iterations count:75 (1), effective:10 (0)
iterations count:59 (1), effective:1 (0)
iterations count:47 (1), effective:1 (0)
iterations count:46 (1), effective:1 (0)
iterations count:732 (16), effective:102 (2)
iterations count:54 (1), effective:3 (0)
iterations count:159 (3), effective:25 (0)
iterations count:47 (1), effective:1 (0)
iterations count:51 (1), effective:1 (0)
iterations count:333 (7), effective:43 (0)
iterations count:45 (1), effective:0 (0)
iterations count:45 (1), effective:0 (0)
iterations count:45 (1), effective:0 (0)
iterations count:48 (1), effective:1 (0)
iterations count:46 (1), effective:1 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-02a"
export BK_EXAMINATION="CTLCardinality"
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-02a, examination is CTLCardinality"
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-167813599000385"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-02a.tgz
mv AutoFlight-PT-02a execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;