About the Execution of Marcie+red for SatelliteMemory-PT-X00100Y0003
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5650.088 | 16361.00 | 22004.00 | 512.50 | FTFTFTTFTFFTFTTF | 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.r362-smll-167891812600298.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is SatelliteMemory-PT-X00100Y0003, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812600298
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.8K Feb 26 12:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 12:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 12:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 12:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.2K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 26 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 12:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 12:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 12 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 5.5K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SatelliteMemory-PT-X00100Y0003-CTLFireability-00
FORMULA_NAME SatelliteMemory-PT-X00100Y0003-CTLFireability-01
FORMULA_NAME SatelliteMemory-PT-X00100Y0003-CTLFireability-02
FORMULA_NAME SatelliteMemory-PT-X00100Y0003-CTLFireability-03
FORMULA_NAME SatelliteMemory-PT-X00100Y0003-CTLFireability-04
FORMULA_NAME SatelliteMemory-PT-X00100Y0003-CTLFireability-05
FORMULA_NAME SatelliteMemory-PT-X00100Y0003-CTLFireability-06
FORMULA_NAME SatelliteMemory-PT-X00100Y0003-CTLFireability-07
FORMULA_NAME SatelliteMemory-PT-X00100Y0003-CTLFireability-08
FORMULA_NAME SatelliteMemory-PT-X00100Y0003-CTLFireability-09
FORMULA_NAME SatelliteMemory-PT-X00100Y0003-CTLFireability-10
FORMULA_NAME SatelliteMemory-PT-X00100Y0003-CTLFireability-11
FORMULA_NAME SatelliteMemory-PT-X00100Y0003-CTLFireability-12
FORMULA_NAME SatelliteMemory-PT-X00100Y0003-CTLFireability-13
FORMULA_NAME SatelliteMemory-PT-X00100Y0003-CTLFireability-14
FORMULA_NAME SatelliteMemory-PT-X00100Y0003-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679117554012
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=SatelliteMemory-PT-X00100Y0003
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 05:32:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 05:32:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 05:32:37] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-03-18 05:32:37] [INFO ] Transformed 13 places.
[2023-03-18 05:32:37] [INFO ] Transformed 10 transitions.
[2023-03-18 05:32:37] [INFO ] Parsed PT model containing 13 places and 10 transitions and 40 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Reduce places removed 1 places and 0 transitions.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 13 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-18 05:32:37] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-18 05:32:37] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
[2023-03-18 05:32:37] [INFO ] Invariant cache hit.
[2023-03-18 05:32:37] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-18 05:32:37] [INFO ] Invariant cache hit.
[2023-03-18 05:32:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 05:32:37] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-18 05:32:37] [INFO ] Invariant cache hit.
[2023-03-18 05:32:37] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 377 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 21 ms
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 7 ms
[2023-03-18 05:32:38] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 23) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 05:32:38] [INFO ] Invariant cache hit.
[2023-03-18 05:32:38] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-18 05:32:38] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 4 ms
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 11 ms
[2023-03-18 05:32:38] [INFO ] Input system was already deterministic with 10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 10 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-18 05:32:38] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 05:32:38] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 10/12 places, 9/10 transitions.
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 3 ms
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 3 ms
[2023-03-18 05:32:38] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-18 05:32:38] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-18 05:32:38] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 2 ms
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 2 ms
[2023-03-18 05:32:38] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-18 05:32:38] [INFO ] Invariant cache hit.
[2023-03-18 05:32:38] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 2 ms
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 2 ms
[2023-03-18 05:32:38] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-18 05:32:38] [INFO ] Invariant cache hit.
[2023-03-18 05:32:38] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 2 ms
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 2 ms
[2023-03-18 05:32:38] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-18 05:32:38] [INFO ] Invariant cache hit.
[2023-03-18 05:32:38] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 2 ms
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 2 ms
[2023-03-18 05:32:38] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-18 05:32:38] [INFO ] Invariant cache hit.
[2023-03-18 05:32:38] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 2 ms
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 1 ms
[2023-03-18 05:32:38] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-18 05:32:38] [INFO ] Invariant cache hit.
[2023-03-18 05:32:38] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 1 ms
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 1 ms
[2023-03-18 05:32:38] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-18 05:32:38] [INFO ] Invariant cache hit.
[2023-03-18 05:32:38] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 2 ms
[2023-03-18 05:32:38] [INFO ] Flatten gal took : 2 ms
[2023-03-18 05:32:38] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-18 05:32:38] [INFO ] Invariant cache hit.
[2023-03-18 05:32:38] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-18 05:32:39] [INFO ] Flatten gal took : 1 ms
[2023-03-18 05:32:39] [INFO ] Flatten gal took : 1 ms
[2023-03-18 05:32:39] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-18 05:32:39] [INFO ] Invariant cache hit.
[2023-03-18 05:32:39] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-18 05:32:39] [INFO ] Flatten gal took : 1 ms
[2023-03-18 05:32:39] [INFO ] Flatten gal took : 1 ms
[2023-03-18 05:32:39] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-18 05:32:39] [INFO ] Invariant cache hit.
[2023-03-18 05:32:39] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-18 05:32:39] [INFO ] Flatten gal took : 2 ms
[2023-03-18 05:32:39] [INFO ] Flatten gal took : 1 ms
[2023-03-18 05:32:39] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-18 05:32:39] [INFO ] Invariant cache hit.
[2023-03-18 05:32:39] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-18 05:32:39] [INFO ] Flatten gal took : 2 ms
[2023-03-18 05:32:39] [INFO ] Flatten gal took : 7 ms
[2023-03-18 05:32:39] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-18 05:32:39] [INFO ] Invariant cache hit.
[2023-03-18 05:32:39] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-18 05:32:39] [INFO ] Flatten gal took : 2 ms
[2023-03-18 05:32:39] [INFO ] Flatten gal took : 1 ms
[2023-03-18 05:32:39] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-18 05:32:39] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 05:32:39] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 10/12 places, 9/10 transitions.
[2023-03-18 05:32:39] [INFO ] Flatten gal took : 1 ms
[2023-03-18 05:32:39] [INFO ] Flatten gal took : 2 ms
[2023-03-18 05:32:39] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-18 05:32:39] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-18 05:32:39] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-18 05:32:39] [INFO ] Flatten gal took : 1 ms
[2023-03-18 05:32:39] [INFO ] Flatten gal took : 1 ms
[2023-03-18 05:32:39] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-18 05:32:39] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 05:32:39] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 10/12 places, 9/10 transitions.
[2023-03-18 05:32:39] [INFO ] Flatten gal took : 1 ms
[2023-03-18 05:32:39] [INFO ] Flatten gal took : 1 ms
[2023-03-18 05:32:39] [INFO ] Input system was already deterministic with 9 transitions.
[2023-03-18 05:32:39] [INFO ] Flatten gal took : 1 ms
[2023-03-18 05:32:39] [INFO ] Flatten gal took : 2 ms
[2023-03-18 05:32:39] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-18 05:32:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 10 transitions and 38 arcs took 0 ms.
Total runtime 2120 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: 12 NrTr: 10 NrArc: 38)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.357sec
RS generation: 0m 0.094sec
-> reachability set: #nodes 10410 (1.0e+04) #states 76,358 (4)
starting MCC model checker
--------------------------
checking: AG [EF [1<=p2]]
normalized: ~ [E [true U ~ [E [true U 1<=p2]]]]
abstracting: (1<=p2)
states: 38,179 (4)
-> the formula is TRUE
FORMULA SatelliteMemory-PT-X00100Y0003-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.074sec
checking: EF [EX [AX [[94<=p3 & 6<=p6]]]]
normalized: E [true U EX [~ [EX [~ [[94<=p3 & 6<=p6]]]]]]
abstracting: (6<=p6)
states: 71,810 (4)
abstracting: (94<=p3)
states: 406
..-> the formula is FALSE
FORMULA SatelliteMemory-PT-X00100Y0003-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: AG [EF [EG [[1<=p0 & 1<=p8]]]]
normalized: ~ [E [true U ~ [E [true U EG [[1<=p0 & 1<=p8]]]]]]
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p0)
states: 37,788 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA SatelliteMemory-PT-X00100Y0003-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: AF [[94<=p3 & 94<=p5]]
normalized: ~ [EG [~ [[94<=p3 & 94<=p5]]]]
abstracting: (94<=p5)
states: 4,930 (3)
abstracting: (94<=p3)
states: 406
.
EG iterations: 1
-> the formula is FALSE
FORMULA SatelliteMemory-PT-X00100Y0003-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: E [~ [AF [AX [AG [100<=p11]]]] U [94<=p3 & 6<=p6]]
normalized: E [EG [EX [E [true U ~ [100<=p11]]]] U [94<=p3 & 6<=p6]]
abstracting: (6<=p6)
states: 71,810 (4)
abstracting: (94<=p3)
states: 406
abstracting: (100<=p11)
states: 378
.
EG iterations: 0
-> the formula is TRUE
FORMULA SatelliteMemory-PT-X00100Y0003-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.349sec
checking: AG [~ [A [~ [[~ [AF [[94<=p5 & 94<=p3]]] & p5<=99]] U AF [100<=p5]]]]
normalized: ~ [E [true U [~ [EG [EG [~ [100<=p5]]]] & ~ [E [EG [~ [100<=p5]] U [[p5<=99 & EG [~ [[94<=p5 & 94<=p3]]]] & EG [~ [100<=p5]]]]]]]]
abstracting: (100<=p5)
states: 380
.
EG iterations: 1
abstracting: (94<=p3)
states: 406
abstracting: (94<=p5)
states: 4,930 (3)
.
EG iterations: 1
abstracting: (p5<=99)
states: 75,978 (4)
abstracting: (100<=p5)
states: 380
.
EG iterations: 1
abstracting: (100<=p5)
states: 380
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA SatelliteMemory-PT-X00100Y0003-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.024sec
checking: A [1<=p7 U EX [E [[E [1<=p7 U 1<=p7] & EF [1<=p2]] U [AG [1<=p2] & [A [1<=p7 U 1<=p7] | EF [100<=p5]]]]]]
normalized: [~ [EG [~ [EX [E [[E [true U 1<=p2] & E [1<=p7 U 1<=p7]] U [[E [true U 100<=p5] | [~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [1<=p7] & ~ [1<=p7]]]]]] & ~ [E [true U ~ [1<=p2]]]]]]]]] & ~ [E [~ [EX [E [[E [true U 1<=p2] & E [1<=p7 U 1<=p7]] U [[E [true U 100<=p5] | [~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [1<=p7] & ~ [1<=p7]]]]]] & ~ [E [true U ~ [1<=p2]]]]]]] U [~ [1<=p7] & ~ [EX [E [[E [true U 1<=p2] & E [1<=p7 U 1<=p7]] U [[E [true U 100<=p5] | [~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [1<=p7] & ~ [1<=p7]]]]]] & ~ [E [true U ~ [1<=p2]]]]]]]]]]]
abstracting: (1<=p2)
states: 38,179 (4)
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p7)
states: 38,179 (4)
.
EG iterations: 1
abstracting: (100<=p5)
states: 380
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p2)
states: 38,179 (4)
.abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p2)
states: 38,179 (4)
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p7)
states: 38,179 (4)
.
EG iterations: 1
abstracting: (100<=p5)
states: 380
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p2)
states: 38,179 (4)
.abstracting: (1<=p2)
states: 38,179 (4)
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p7)
states: 38,179 (4)
.
EG iterations: 1
abstracting: (100<=p5)
states: 380
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p2)
states: 38,179 (4)
.
EG iterations: 0
-> the formula is FALSE
FORMULA SatelliteMemory-PT-X00100Y0003-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.195sec
checking: [~ [E [EG [A [EF [100<=p5] U EF [100<=p11]]] U 100<=p5]] & AX [[A [[[94<=p3 & 94<=p5] | 1<=p2] U [1<=p0 & 1<=p8]] | 1<=p7]]]
normalized: [~ [EX [~ [[1<=p7 | [~ [EG [~ [[1<=p0 & 1<=p8]]]] & ~ [E [~ [[1<=p0 & 1<=p8]] U [~ [[1<=p2 | [94<=p3 & 94<=p5]]] & ~ [[1<=p0 & 1<=p8]]]]]]]]]] & ~ [E [EG [[~ [EG [~ [E [true U 100<=p11]]]] & ~ [E [~ [E [true U 100<=p11]] U [~ [E [true U 100<=p5]] & ~ [E [true U 100<=p11]]]]]]] U 100<=p5]]]
abstracting: (100<=p5)
states: 380
abstracting: (100<=p11)
states: 378
abstracting: (100<=p5)
states: 380
abstracting: (100<=p11)
states: 378
abstracting: (100<=p11)
states: 378
.
EG iterations: 1
EG iterations: 0
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p0)
states: 37,788 (4)
abstracting: (94<=p5)
states: 4,930 (3)
abstracting: (94<=p3)
states: 406
abstracting: (1<=p2)
states: 38,179 (4)
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p0)
states: 37,788 (4)
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p0)
states: 37,788 (4)
.
EG iterations: 1
abstracting: (1<=p7)
states: 38,179 (4)
.-> the formula is FALSE
FORMULA SatelliteMemory-PT-X00100Y0003-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.522sec
checking: EG [[EX [EG [[1<=p0 & 1<=p8]]] & [AG [[AX [[p3<=93 | p6<=5]] | 1<=p7]] & [[AX [[EG [1<=p7] & [94<=p3 & 6<=p6]]] | EF [[1<=p4 & [1<=p6 & 1<=p8]]]] | [AX [[94<=p3 & 94<=p5]] | EG [100<=p11]]]]]]
normalized: EG [[[[[EG [100<=p11] | ~ [EX [~ [[94<=p3 & 94<=p5]]]]] | [E [true U [1<=p4 & [1<=p6 & 1<=p8]]] | ~ [EX [~ [[[94<=p3 & 6<=p6] & EG [1<=p7]]]]]]] & ~ [E [true U ~ [[1<=p7 | ~ [EX [~ [[p3<=93 | p6<=5]]]]]]]]] & EX [EG [[1<=p0 & 1<=p8]]]]]
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p0)
states: 37,788 (4)
.
EG iterations: 1
.abstracting: (p6<=5)
states: 4,548 (3)
abstracting: (p3<=93)
states: 75,952 (4)
.abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p7)
states: 38,179 (4)
.
EG iterations: 1
abstracting: (6<=p6)
states: 71,810 (4)
abstracting: (94<=p3)
states: 406
.abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p6)
states: 75,602 (4)
abstracting: (1<=p4)
states: 38,570 (4)
abstracting: (94<=p5)
states: 4,930 (3)
abstracting: (94<=p3)
states: 406
.abstracting: (100<=p11)
states: 378
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA SatelliteMemory-PT-X00100Y0003-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.169sec
checking: EX [[E [[EX [AX [100<=p5]] & AX [AX [1<=p2]]] U EF [[[[1<=p0 & 1<=p8] | 100<=p5] & EG [[1<=p4 & [1<=p6 & 1<=p8]]]]]] | [EF [[94<=p3 & 94<=p5]] | EF [[[[p7<=0 | p1<=0] | [p3<=0 | [p7<=0 | p10<=0]]] & AG [p11<=99]]]]]]
normalized: EX [[[E [true U [~ [E [true U ~ [p11<=99]]] & [[p3<=0 | [p7<=0 | p10<=0]] | [p7<=0 | p1<=0]]]] | E [true U [94<=p3 & 94<=p5]]] | E [[~ [EX [EX [~ [1<=p2]]]] & EX [~ [EX [~ [100<=p5]]]]] U E [true U [EG [[1<=p4 & [1<=p6 & 1<=p8]]] & [100<=p5 | [1<=p0 & 1<=p8]]]]]]]
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p0)
states: 37,788 (4)
abstracting: (100<=p5)
states: 380
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p6)
states: 75,602 (4)
abstracting: (1<=p4)
states: 38,570 (4)
.
EG iterations: 1
abstracting: (100<=p5)
states: 380
..abstracting: (1<=p2)
states: 38,179 (4)
..abstracting: (94<=p5)
states: 4,930 (3)
abstracting: (94<=p3)
states: 406
abstracting: (p1<=0)
states: 756
abstracting: (p7<=0)
states: 38,179 (4)
abstracting: (p10<=0)
states: 37,990 (4)
abstracting: (p7<=0)
states: 38,179 (4)
abstracting: (p3<=0)
states: 808
abstracting: (p11<=99)
states: 75,980 (4)
.-> the formula is TRUE
FORMULA SatelliteMemory-PT-X00100Y0003-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.150sec
checking: [EF [[EX [[1<=p0 & 1<=p8]] & [[[EG [[94<=p3 & 6<=p6]] & 94<=p3] & [94<=p5 & 1<=p2]] | EF [[EF [[94<=p3 & 94<=p5]] | EG [[94<=p3 & 94<=p5]]]]]]] | AG [[[[EX [p2<=0] | p11<=99] & [p3<=93 | p6<=5]] | AF [EG [[p3<=0 | p9<=0]]]]]]
normalized: [~ [E [true U ~ [[~ [EG [~ [EG [[p3<=0 | p9<=0]]]]] | [[p3<=93 | p6<=5] & [p11<=99 | EX [p2<=0]]]]]]] | E [true U [[E [true U [EG [[94<=p3 & 94<=p5]] | E [true U [94<=p3 & 94<=p5]]]] | [[94<=p5 & 1<=p2] & [94<=p3 & EG [[94<=p3 & 6<=p6]]]]] & EX [[1<=p0 & 1<=p8]]]]]
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p0)
states: 37,788 (4)
.abstracting: (6<=p6)
states: 71,810 (4)
abstracting: (94<=p3)
states: 406
.
EG iterations: 1
abstracting: (94<=p3)
states: 406
abstracting: (1<=p2)
states: 38,179 (4)
abstracting: (94<=p5)
states: 4,930 (3)
abstracting: (94<=p5)
states: 4,930 (3)
abstracting: (94<=p3)
states: 406
abstracting: (94<=p5)
states: 4,930 (3)
abstracting: (94<=p3)
states: 406
.
EG iterations: 1
abstracting: (p2<=0)
states: 38,179 (4)
.abstracting: (p11<=99)
states: 75,980 (4)
abstracting: (p6<=5)
states: 4,548 (3)
abstracting: (p3<=93)
states: 75,952 (4)
abstracting: (p9<=0)
states: 38,368 (4)
abstracting: (p3<=0)
states: 808
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA SatelliteMemory-PT-X00100Y0003-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.192sec
checking: EF [[[[EF [p2<=0] & [1<=p3 & 1<=p9]] | [AX [[p3<=93 | p5<=93]] & 100<=p5]] & [~ [A [[1<=p4 & [1<=p6 & 1<=p8]] U [94<=p3 & 94<=p5]]] | [AG [[p4<=0 | [p6<=0 | p8<=0]]] & ~ [A [1<=p2 U [1<=p4 & [1<=p6 & 1<=p8]]]]]]]]
normalized: E [true U [[[~ [[~ [EG [~ [[1<=p4 & [1<=p6 & 1<=p8]]]]] & ~ [E [~ [[1<=p4 & [1<=p6 & 1<=p8]]] U [~ [1<=p2] & ~ [[1<=p4 & [1<=p6 & 1<=p8]]]]]]]] & ~ [E [true U ~ [[p4<=0 | [p6<=0 | p8<=0]]]]]] | ~ [[~ [EG [~ [[94<=p3 & 94<=p5]]]] & ~ [E [~ [[94<=p3 & 94<=p5]] U [~ [[1<=p4 & [1<=p6 & 1<=p8]]] & ~ [[94<=p3 & 94<=p5]]]]]]]] & [[100<=p5 & ~ [EX [~ [[p3<=93 | p5<=93]]]]] | [[1<=p3 & 1<=p9] & E [true U p2<=0]]]]]
abstracting: (p2<=0)
states: 38,179 (4)
abstracting: (1<=p9)
states: 37,990 (4)
abstracting: (1<=p3)
states: 75,550 (4)
abstracting: (p5<=93)
states: 71,428 (4)
abstracting: (p3<=93)
states: 75,952 (4)
.abstracting: (100<=p5)
states: 380
abstracting: (94<=p5)
states: 4,930 (3)
abstracting: (94<=p3)
states: 406
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p6)
states: 75,602 (4)
abstracting: (1<=p4)
states: 38,570 (4)
abstracting: (94<=p5)
states: 4,930 (3)
abstracting: (94<=p3)
states: 406
abstracting: (94<=p5)
states: 4,930 (3)
abstracting: (94<=p3)
states: 406
.
EG iterations: 1
abstracting: (p8<=0)
states: 406
abstracting: (p6<=0)
states: 756
abstracting: (p4<=0)
states: 37,788 (4)
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p6)
states: 75,602 (4)
abstracting: (1<=p4)
states: 38,570 (4)
abstracting: (1<=p2)
states: 38,179 (4)
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p6)
states: 75,602 (4)
abstracting: (1<=p4)
states: 38,570 (4)
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p6)
states: 75,602 (4)
abstracting: (1<=p4)
states: 38,570 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA SatelliteMemory-PT-X00100Y0003-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.091sec
checking: EF [[100<=p5 | [~ [A [[100<=p11 | [1<=p2 | [[1<=p4 & 1<=p6] & [1<=p8 & [94<=p3 & 6<=p6]]]]] U 1<=p7]] | [E [[AG [[[1<=p1 & 1<=p3] & [1<=p7 & 1<=p10]]] | AX [100<=p11]] U [100<=p5 | 1<=p7]] & AG [A [100<=p11 U [94<=p3 & 6<=p6]]]]]]]
normalized: E [true U [100<=p5 | [[~ [E [true U ~ [[~ [EG [~ [[94<=p3 & 6<=p6]]]] & ~ [E [~ [[94<=p3 & 6<=p6]] U [~ [100<=p11] & ~ [[94<=p3 & 6<=p6]]]]]]]]] & E [[~ [EX [~ [100<=p11]]] | ~ [E [true U ~ [[[1<=p7 & 1<=p10] & [1<=p1 & 1<=p3]]]]]] U [100<=p5 | 1<=p7]]] | ~ [[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [[100<=p11 | [1<=p2 | [[1<=p8 & [94<=p3 & 6<=p6]] & [1<=p4 & 1<=p6]]]]] & ~ [1<=p7]]]]]]]]]
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p6)
states: 75,602 (4)
abstracting: (1<=p4)
states: 38,570 (4)
abstracting: (6<=p6)
states: 71,810 (4)
abstracting: (94<=p3)
states: 406
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p2)
states: 38,179 (4)
abstracting: (100<=p11)
states: 378
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p7)
states: 38,179 (4)
.
EG iterations: 1
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (100<=p5)
states: 380
abstracting: (1<=p3)
states: 75,550 (4)
abstracting: (1<=p1)
states: 75,602 (4)
abstracting: (1<=p10)
states: 38,368 (4)
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (100<=p11)
states: 378
.abstracting: (6<=p6)
states: 71,810 (4)
abstracting: (94<=p3)
states: 406
abstracting: (100<=p11)
states: 378
abstracting: (6<=p6)
states: 71,810 (4)
abstracting: (94<=p3)
states: 406
abstracting: (6<=p6)
states: 71,810 (4)
abstracting: (94<=p3)
states: 406
.
EG iterations: 1
abstracting: (100<=p5)
states: 380
-> the formula is TRUE
FORMULA SatelliteMemory-PT-X00100Y0003-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.116sec
checking: [EF [EX [AG [p7<=0]]] & ~ [E [[[94<=p3 & 94<=p5] | [[AF [[1<=p0 & 1<=p8]] | EX [~ [[p3<=0 | p9<=0]]]] & [100<=p5 & [[[100<=p11 & 1<=p4] & [1<=p6 & 1<=p8]] | ~ [[1<=p4 & [1<=p6 & 1<=p8]]]]]]] U [[1<=p1 & 1<=p3] & [1<=p7 & 1<=p10]]]]]
normalized: [~ [E [[[[100<=p5 & [~ [[1<=p4 & [1<=p6 & 1<=p8]]] | [[1<=p6 & 1<=p8] & [100<=p11 & 1<=p4]]]] & [EX [~ [[p3<=0 | p9<=0]]] | ~ [EG [~ [[1<=p0 & 1<=p8]]]]]] | [94<=p3 & 94<=p5]] U [[1<=p7 & 1<=p10] & [1<=p1 & 1<=p3]]]] & E [true U EX [~ [E [true U ~ [p7<=0]]]]]]
abstracting: (p7<=0)
states: 38,179 (4)
.abstracting: (1<=p3)
states: 75,550 (4)
abstracting: (1<=p1)
states: 75,602 (4)
abstracting: (1<=p10)
states: 38,368 (4)
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (94<=p5)
states: 4,930 (3)
abstracting: (94<=p3)
states: 406
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p0)
states: 37,788 (4)
.
EG iterations: 1
abstracting: (p9<=0)
states: 38,368 (4)
abstracting: (p3<=0)
states: 808
.abstracting: (1<=p4)
states: 38,570 (4)
abstracting: (100<=p11)
states: 378
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p6)
states: 75,602 (4)
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p6)
states: 75,602 (4)
abstracting: (1<=p4)
states: 38,570 (4)
abstracting: (100<=p5)
states: 380
-> the formula is FALSE
FORMULA SatelliteMemory-PT-X00100Y0003-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.058sec
checking: AG [~ [A [[[~ [[1<=p7 & [94<=p3 & 94<=p5]]] | AF [[94<=p3 & 94<=p5]]] | [A [[1<=p4 & [1<=p6 & 1<=p8]] U 1<=p7] | [[AX [[[1<=p1 & 1<=p3] & [1<=p7 & 1<=p10]]] & 1<=p4] & [1<=p6 & 1<=p8]]]] U A [p2<=0 U EG [[[1<=p1 & 1<=p3] & [1<=p7 & 1<=p10]]]]]]]
normalized: ~ [E [true U [~ [EG [~ [[~ [EG [~ [EG [[[1<=p7 & 1<=p10] & [1<=p1 & 1<=p3]]]]]] & ~ [E [~ [EG [[[1<=p7 & 1<=p10] & [1<=p1 & 1<=p3]]]] U [~ [p2<=0] & ~ [EG [[[1<=p7 & 1<=p10] & [1<=p1 & 1<=p3]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [EG [[[1<=p7 & 1<=p10] & [1<=p1 & 1<=p3]]]]]] & ~ [E [~ [EG [[[1<=p7 & 1<=p10] & [1<=p1 & 1<=p3]]]] U [~ [p2<=0] & ~ [EG [[[1<=p7 & 1<=p10] & [1<=p1 & 1<=p3]]]]]]]]] U [~ [[[[[1<=p6 & 1<=p8] & [1<=p4 & ~ [EX [~ [[[1<=p7 & 1<=p10] & [1<=p1 & 1<=p3]]]]]]] | [~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [[1<=p4 & [1<=p6 & 1<=p8]]] & ~ [1<=p7]]]]]] | [~ [EG [~ [[94<=p3 & 94<=p5]]]] | ~ [[1<=p7 & [94<=p3 & 94<=p5]]]]]] & ~ [[~ [EG [~ [EG [[[1<=p7 & 1<=p10] & [1<=p1 & 1<=p3]]]]]] & ~ [E [~ [EG [[[1<=p7 & 1<=p10] & [1<=p1 & 1<=p3]]]] U [~ [p2<=0] & ~ [EG [[[1<=p7 & 1<=p10] & [1<=p1 & 1<=p3]]]]]]]]]]]]]]]
abstracting: (1<=p3)
states: 75,550 (4)
abstracting: (1<=p1)
states: 75,602 (4)
abstracting: (1<=p10)
states: 38,368 (4)
abstracting: (1<=p7)
states: 38,179 (4)
.............................................................................................................................................................................................
EG iterations: 189
abstracting: (p2<=0)
states: 38,179 (4)
abstracting: (1<=p3)
states: 75,550 (4)
abstracting: (1<=p1)
states: 75,602 (4)
abstracting: (1<=p10)
states: 38,368 (4)
abstracting: (1<=p7)
states: 38,179 (4)
.............................................................................................................................................................................................
EG iterations: 189
abstracting: (1<=p3)
states: 75,550 (4)
abstracting: (1<=p1)
states: 75,602 (4)
abstracting: (1<=p10)
states: 38,368 (4)
abstracting: (1<=p7)
states: 38,179 (4)
.............................................................................................................................................................................................
EG iterations: 189
EG iterations: 0
abstracting: (94<=p5)
states: 4,930 (3)
abstracting: (94<=p3)
states: 406
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (94<=p5)
states: 4,930 (3)
abstracting: (94<=p3)
states: 406
.
EG iterations: 1
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p6)
states: 75,602 (4)
abstracting: (1<=p4)
states: 38,570 (4)
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (1<=p7)
states: 38,179 (4)
.
EG iterations: 1
abstracting: (1<=p3)
states: 75,550 (4)
abstracting: (1<=p1)
states: 75,602 (4)
abstracting: (1<=p10)
states: 38,368 (4)
abstracting: (1<=p7)
states: 38,179 (4)
.abstracting: (1<=p4)
states: 38,570 (4)
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p6)
states: 75,602 (4)
abstracting: (1<=p3)
states: 75,550 (4)
abstracting: (1<=p1)
states: 75,602 (4)
abstracting: (1<=p10)
states: 38,368 (4)
abstracting: (1<=p7)
states: 38,179 (4)
.............................................................................................................................................................................................
EG iterations: 189
abstracting: (p2<=0)
states: 38,179 (4)
abstracting: (1<=p3)
states: 75,550 (4)
abstracting: (1<=p1)
states: 75,602 (4)
abstracting: (1<=p10)
states: 38,368 (4)
abstracting: (1<=p7)
states: 38,179 (4)
.............................................................................................................................................................................................
EG iterations: 189
abstracting: (1<=p3)
states: 75,550 (4)
abstracting: (1<=p1)
states: 75,602 (4)
abstracting: (1<=p10)
states: 38,368 (4)
abstracting: (1<=p7)
states: 38,179 (4)
.............................................................................................................................................................................................
EG iterations: 189
EG iterations: 0
abstracting: (1<=p3)
states: 75,550 (4)
abstracting: (1<=p1)
states: 75,602 (4)
abstracting: (1<=p10)
states: 38,368 (4)
abstracting: (1<=p7)
states: 38,179 (4)
.............................................................................................................................................................................................
EG iterations: 189
abstracting: (p2<=0)
states: 38,179 (4)
abstracting: (1<=p3)
states: 75,550 (4)
abstracting: (1<=p1)
states: 75,602 (4)
abstracting: (1<=p10)
states: 38,368 (4)
abstracting: (1<=p7)
states: 38,179 (4)
.............................................................................................................................................................................................
EG iterations: 189
abstracting: (1<=p3)
states: 75,550 (4)
abstracting: (1<=p1)
states: 75,602 (4)
abstracting: (1<=p10)
states: 38,368 (4)
abstracting: (1<=p7)
states: 38,179 (4)
.............................................................................................................................................................................................
EG iterations: 189
EG iterations: 0
EG iterations: 0
-> the formula is TRUE
FORMULA SatelliteMemory-PT-X00100Y0003-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.261sec
checking: [EF [[[[[[1<=p2 & 1<=p4] & [1<=p6 & 1<=p8]] & [[1<=p1 & 1<=p3] & [1<=p7 & 1<=p10]]] | 100<=p5] & AX [p5<=99]]] & [EX [[EG [[[p3<=0 | p9<=0] & AG [[94<=p3 & 6<=p6]]]] & EF [[1<=p3 & 1<=p9]]]] | EF [[[[p1<=0 | p3<=0] | [p7<=0 | p10<=0]] & [AF [p11<=99] & AF [[1<=p3 & 1<=p9]]]]]]]
normalized: [[E [true U [[~ [EG [~ [[1<=p3 & 1<=p9]]]] & ~ [EG [~ [p11<=99]]]] & [[p7<=0 | p10<=0] | [p1<=0 | p3<=0]]]] | EX [[E [true U [1<=p3 & 1<=p9]] & EG [[~ [E [true U ~ [[94<=p3 & 6<=p6]]]] & [p3<=0 | p9<=0]]]]]] & E [true U [~ [EX [~ [p5<=99]]] & [100<=p5 | [[[1<=p7 & 1<=p10] & [1<=p1 & 1<=p3]] & [[1<=p6 & 1<=p8] & [1<=p2 & 1<=p4]]]]]]]
abstracting: (1<=p4)
states: 38,570 (4)
abstracting: (1<=p2)
states: 38,179 (4)
abstracting: (1<=p8)
states: 75,952 (4)
abstracting: (1<=p6)
states: 75,602 (4)
abstracting: (1<=p3)
states: 75,550 (4)
abstracting: (1<=p1)
states: 75,602 (4)
abstracting: (1<=p10)
states: 38,368 (4)
abstracting: (1<=p7)
states: 38,179 (4)
abstracting: (100<=p5)
states: 380
abstracting: (p5<=99)
states: 75,978 (4)
.abstracting: (p9<=0)
states: 38,368 (4)
abstracting: (p3<=0)
states: 808
abstracting: (6<=p6)
states: 71,810 (4)
abstracting: (94<=p3)
states: 406
.
EG iterations: 1
abstracting: (1<=p9)
states: 37,990 (4)
abstracting: (1<=p3)
states: 75,550 (4)
.abstracting: (p3<=0)
states: 808
abstracting: (p1<=0)
states: 756
abstracting: (p10<=0)
states: 37,990 (4)
abstracting: (p7<=0)
states: 38,179 (4)
abstracting: (p11<=99)
states: 75,980 (4)
.
EG iterations: 1
abstracting: (1<=p9)
states: 37,990 (4)
abstracting: (1<=p3)
states: 75,550 (4)
.
EG iterations: 1
-> the formula is FALSE
FORMULA SatelliteMemory-PT-X00100Y0003-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.027sec
totally nodes used: 711857 (7.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7837507 1979614 9817121
used/not used/entry size/cache size: 2379666 64729198 16 1024MB
basic ops cache: hits/miss/sum: 5786095 950480 6736575
used/not used/entry size/cache size: 1601414 15175802 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: 151065 56909 207974
used/not used/entry size/cache size: 56830 8331778 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 66519265
1 502541
2 66161
3 10532
4 9752
5 317
6 48
7 44
8 11
9 86
>= 10 107
Total processing time: 0m 9.427sec
BK_STOP 1679117570373
--------------------
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:2835 (283), effective:877 (87)
initing FirstDep: 0m 0.000sec
iterations count:12 (1), effective:1 (0)
iterations count:32 (3), effective:7 (0)
iterations count:11 (1), effective:1 (0)
iterations count:1407 (140), effective:403 (40)
iterations count:19 (1), effective:4 (0)
iterations count:1460 (146), effective:482 (48)
iterations count:11 (1), effective:1 (0)
iterations count:10 (1), effective:0 (0)
iterations count:1460 (146), effective:482 (48)
iterations count:10 (1), effective:0 (0)
iterations count:12 (1), effective:1 (0)
iterations count:11 (1), effective:1 (0)
iterations count:10 (1), effective:0 (0)
iterations count:1460 (146), effective:482 (48)
iterations count:10 (1), effective:0 (0)
iterations count:12 (1), effective:1 (0)
iterations count:12 (1), effective:1 (0)
iterations count:11 (1), effective:1 (0)
iterations count:10 (1), effective:0 (0)
iterations count:1460 (146), effective:482 (48)
iterations count:10 (1), effective:0 (0)
iterations count:12 (1), effective:1 (0)
iterations count:1515 (151), effective:501 (50)
iterations count:1460 (146), effective:482 (48)
iterations count:1515 (151), effective:501 (50)
iterations count:1515 (151), effective:501 (50)
iterations count:1460 (146), effective:482 (48)
iterations count:20 (2), effective:5 (0)
iterations count:1404 (140), effective:403 (40)
iterations count:45 (4), effective:9 (0)
iterations count:2076 (207), effective:657 (65)
iterations count:1515 (151), effective:501 (50)
iterations count:2076 (207), effective:657 (65)
iterations count:10 (1), effective:0 (0)
iterations count:30 (3), effective:6 (0)
iterations count:1412 (141), effective:405 (40)
iterations count:11 (1), effective:1 (0)
iterations count:12 (1), effective:1 (0)
iterations count:45 (4), effective:9 (0)
iterations count:11 (1), effective:1 (0)
iterations count:32 (3), effective:9 (0)
iterations count:12 (1), effective:1 (0)
iterations count:10 (1), effective:0 (0)
iterations count:11 (1), effective:1 (0)
iterations count:18 (1), effective:3 (0)
iterations count:12 (1), effective:1 (0)
iterations count:11 (1), effective:1 (0)
iterations count:15 (1), effective:3 (0)
iterations count:12 (1), effective:1 (0)
iterations count:12 (1), effective:1 (0)
iterations count:12 (1), effective:1 (0)
iterations count:12 (1), effective:1 (0)
iterations count:18 (1), effective:3 (0)
iterations count:28 (2), effective:6 (0)
iterations count:28 (2), effective:6 (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="SatelliteMemory-PT-X00100Y0003"
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 SatelliteMemory-PT-X00100Y0003, 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 r362-smll-167891812600298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SatelliteMemory-PT-X00100Y0003.tgz
mv SatelliteMemory-PT-X00100Y0003 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;