About the Execution of Marcie+red for ResAllocation-PT-R015C002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5680.119 | 12504.00 | 18063.00 | 378.20 | FFFFFTFFFTTTFFTT | 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.r330-tall-167889203700746.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 ResAllocation-PT-R015C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203700746
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 15:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 15:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 64K 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 ResAllocation-PT-R015C002-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679181684030
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=ResAllocation-PT-R015C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:21:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:21:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:21:25] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2023-03-18 23:21:25] [INFO ] Transformed 60 places.
[2023-03-18 23:21:25] [INFO ] Transformed 32 transitions.
[2023-03-18 23:21:25] [INFO ] Parsed PT model containing 60 places and 32 transitions and 150 arcs in 95 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 60 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 9 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 60 cols
[2023-03-18 23:21:25] [INFO ] Computed 30 place invariants in 9 ms
[2023-03-18 23:21:26] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-18 23:21:26] [INFO ] Invariant cache hit.
[2023-03-18 23:21:26] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2023-03-18 23:21:26] [INFO ] Invariant cache hit.
[2023-03-18 23:21:26] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 60/60 places, 32/32 transitions.
Support contains 60 out of 60 places after structural reductions.
[2023-03-18 23:21:26] [INFO ] Flatten gal took : 22 ms
[2023-03-18 23:21:26] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:21:26] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 10000 steps, including 146 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 55) seen :45
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-18 23:21:27] [INFO ] Invariant cache hit.
[2023-03-18 23:21:27] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2023-03-18 23:21:27] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-18 23:21:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2023-03-18 23:21:27] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-18 23:21:27] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 3 ms to minimize.
[2023-03-18 23:21:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-18 23:21:27] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-18 23:21:27] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 4 ms.
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 58 transition count 31
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 56 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 54 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 54 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 52 transition count 28
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 52 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 50 transition count 27
Applied a total of 15 rules in 17 ms. Remains 50 /60 variables (removed 10) and now considering 27/32 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 50/60 places, 27/32 transitions.
Incomplete random walk after 10000 steps, including 215 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Probably explored full state space saw : 32768 states, properties seen :1
Probabilistic random walk after 159744 steps, saw 32768 distinct states, run finished after 335 ms. (steps per millisecond=476 ) properties seen :1
Explored full state space saw : 32768 states, properties seen :0
Exhaustive walk after 159744 steps, saw 32768 distinct states, run finished after 124 ms. (steps per millisecond=1288 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:21:28] [INFO ] Input system was already deterministic with 32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:21:28] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:21:28] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:21:28] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:28] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:28] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 59 transition count 31
Applied a total of 2 rules in 5 ms. Remains 59 /60 variables (removed 1) and now considering 31/32 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 59/60 places, 31/32 transitions.
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:28] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 59 transition count 31
Applied a total of 2 rules in 4 ms. Remains 59 /60 variables (removed 1) and now considering 31/32 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 59/60 places, 31/32 transitions.
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:28] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 59 transition count 31
Applied a total of 2 rules in 4 ms. Remains 59 /60 variables (removed 1) and now considering 31/32 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 59/60 places, 31/32 transitions.
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:21:28] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:28] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:28] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 60/60 places, 32/32 transitions.
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:28] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 60/60 places, 32/32 transitions.
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:28] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:28] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 60/60 places, 32/32 transitions.
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:28] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 60/60 places, 32/32 transitions.
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:28] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 60/60 places, 32/32 transitions.
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:28] [INFO ] Input system was already deterministic with 32 transitions.
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:21:28] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:21:28] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-18 23:21:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 60 places, 32 transitions and 150 arcs took 1 ms.
Total runtime 3001 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: 60 NrTr: 32 NrArc: 150)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.739sec
RS generation: 0m 0.005sec
-> reachability set: #nodes 171 (1.7e+02) #states 278,528 (5)
starting MCC model checker
--------------------------
checking: EX [AX [AG [EX [[p8<=0 | p11<=0]]]]]
normalized: EX [~ [EX [E [true U ~ [EX [[p8<=0 | p11<=0]]]]]]]
abstracting: (p11<=0)
states: 147,456 (5)
abstracting: (p8<=0)
states: 180,224 (5)
...-> the formula is FALSE
FORMULA ResAllocation-PT-R015C002-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.027sec
checking: AF [AG [~ [A [AX [[1<=p17 & [1<=p47 & 1<=p48]]] U [1<=p13 & [1<=p43 & 1<=p44]]]]]]
normalized: ~ [EG [E [true U [~ [EG [~ [[[1<=p43 & 1<=p44] & 1<=p13]]]] & ~ [E [~ [[[1<=p43 & 1<=p44] & 1<=p13]] U [EX [~ [[[1<=p47 & 1<=p48] & 1<=p17]]] & ~ [[[1<=p43 & 1<=p44] & 1<=p13]]]]]]]]]
abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p44)
states: 73,728 (4)
abstracting: (1<=p43)
states: 212,992 (5)
abstracting: (1<=p17)
states: 131,072 (5)
abstracting: (1<=p48)
states: 90,112 (4)
abstracting: (1<=p47)
states: 196,608 (5)
.abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p44)
states: 73,728 (4)
abstracting: (1<=p43)
states: 212,992 (5)
abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p44)
states: 73,728 (4)
abstracting: (1<=p43)
states: 212,992 (5)
...............................................
EG iterations: 47
.................................................................................................
EG iterations: 97
-> the formula is FALSE
FORMULA ResAllocation-PT-R015C002-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.161sec
checking: AF [AG [[p18<=0 | [p21<=0 | [[1<=p7 & 1<=p37] & [1<=p38 & [[p16<=0 | p19<=0] | [p1<=0 | [p31<=0 | p32<=0]]]]]]]]]
normalized: ~ [EG [E [true U ~ [[[[[[[[p31<=0 | p32<=0] | p1<=0] | [p16<=0 | p19<=0]] & 1<=p38] & [1<=p7 & 1<=p37]] | p21<=0] | p18<=0]]]]]
abstracting: (p18<=0)
states: 221,184 (5)
abstracting: (p21<=0)
states: 147,456 (5)
abstracting: (1<=p37)
states: 237,568 (5)
abstracting: (1<=p7)
states: 131,072 (5)
abstracting: (1<=p38)
states: 49,152 (4)
abstracting: (p19<=0)
states: 147,456 (5)
abstracting: (p16<=0)
states: 212,992 (5)
abstracting: (p1<=0)
states: 147,456 (5)
abstracting: (p32<=0)
states: 253,952 (5)
abstracting: (p31<=0)
states: 16,384 (4)
...............................................................................................
EG iterations: 95
-> the formula is FALSE
FORMULA ResAllocation-PT-R015C002-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.071sec
checking: AF [[EG [[EX [[p15<=0 | [p45<=0 | p46<=0]]] | [[1<=p27 & [1<=p57 & 1<=p58]] | [1<=p8 & 1<=p11]]]] & [p25<=0 | [p55<=0 | p56<=0]]]]
normalized: ~ [EG [~ [[[[p55<=0 | p56<=0] | p25<=0] & EG [[[[1<=p8 & 1<=p11] | [[1<=p57 & 1<=p58] & 1<=p27]] | EX [[[p45<=0 | p46<=0] | p15<=0]]]]]]]]
abstracting: (p15<=0)
states: 147,456 (5)
abstracting: (p46<=0)
states: 196,608 (5)
abstracting: (p45<=0)
states: 73,728 (4)
.abstracting: (1<=p27)
states: 131,072 (5)
abstracting: (1<=p58)
states: 131,072 (5)
abstracting: (1<=p57)
states: 155,648 (5)
abstracting: (1<=p11)
states: 131,072 (5)
abstracting: (1<=p8)
states: 98,304 (4)
.........................................................................................................
EG iterations: 105
abstracting: (p25<=0)
states: 147,456 (5)
abstracting: (p56<=0)
states: 155,648 (5)
abstracting: (p55<=0)
states: 114,688 (5)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ResAllocation-PT-R015C002-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.156sec
checking: [AX [1<=p1] | AX [~ [A [EX [~ [[1<=p3 & [1<=p33 & 1<=p34]]]] U [[AX [[1<=p29 & 1<=p59]] | [[1<=p18 & 1<=p21] | [1<=p25 & [1<=p55 & 1<=p56]]]] & [p1<=0 | [1<=p7 & [1<=p37 & 1<=p38]]]]]]]]
normalized: [~ [EX [[~ [EG [~ [[[[[1<=p37 & 1<=p38] & 1<=p7] | p1<=0] & [[[[1<=p55 & 1<=p56] & 1<=p25] | [1<=p18 & 1<=p21]] | ~ [EX [~ [[1<=p29 & 1<=p59]]]]]]]]] & ~ [E [~ [[[[[1<=p37 & 1<=p38] & 1<=p7] | p1<=0] & [[[[1<=p55 & 1<=p56] & 1<=p25] | [1<=p18 & 1<=p21]] | ~ [EX [~ [[1<=p29 & 1<=p59]]]]]]] U [~ [EX [~ [[[1<=p33 & 1<=p34] & 1<=p3]]]] & ~ [[[[[1<=p37 & 1<=p38] & 1<=p7] | p1<=0] & [[[[1<=p55 & 1<=p56] & 1<=p25] | [1<=p18 & 1<=p21]] | ~ [EX [~ [[1<=p29 & 1<=p59]]]]]]]]]]]]] | ~ [EX [~ [1<=p1]]]]
abstracting: (1<=p1)
states: 131,072 (5)
.abstracting: (1<=p59)
states: 147,456 (5)
abstracting: (1<=p29)
states: 131,072 (5)
.abstracting: (1<=p21)
states: 131,072 (5)
abstracting: (1<=p18)
states: 57,344 (4)
abstracting: (1<=p25)
states: 131,072 (5)
abstracting: (1<=p56)
states: 122,880 (5)
abstracting: (1<=p55)
states: 163,840 (5)
abstracting: (p1<=0)
states: 147,456 (5)
abstracting: (1<=p7)
states: 131,072 (5)
abstracting: (1<=p38)
states: 49,152 (4)
abstracting: (1<=p37)
states: 237,568 (5)
abstracting: (1<=p3)
states: 131,072 (5)
abstracting: (1<=p34)
states: 32,768 (4)
abstracting: (1<=p33)
states: 253,952 (5)
.abstracting: (1<=p59)
states: 147,456 (5)
abstracting: (1<=p29)
states: 131,072 (5)
.abstracting: (1<=p21)
states: 131,072 (5)
abstracting: (1<=p18)
states: 57,344 (4)
abstracting: (1<=p25)
states: 131,072 (5)
abstracting: (1<=p56)
states: 122,880 (5)
abstracting: (1<=p55)
states: 163,840 (5)
abstracting: (p1<=0)
states: 147,456 (5)
abstracting: (1<=p7)
states: 131,072 (5)
abstracting: (1<=p38)
states: 49,152 (4)
abstracting: (1<=p37)
states: 237,568 (5)
abstracting: (1<=p59)
states: 147,456 (5)
abstracting: (1<=p29)
states: 131,072 (5)
.abstracting: (1<=p21)
states: 131,072 (5)
abstracting: (1<=p18)
states: 57,344 (4)
abstracting: (1<=p25)
states: 131,072 (5)
abstracting: (1<=p56)
states: 122,880 (5)
abstracting: (1<=p55)
states: 163,840 (5)
abstracting: (p1<=0)
states: 147,456 (5)
abstracting: (1<=p7)
states: 131,072 (5)
abstracting: (1<=p38)
states: 49,152 (4)
abstracting: (1<=p37)
states: 237,568 (5)
.........................................................................................................
EG iterations: 105
.-> the formula is TRUE
FORMULA ResAllocation-PT-R015C002-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.258sec
checking: EF [[AX [[[AG [[1<=p20 & 1<=p23]] & [1<=p10 & 1<=p13]] & [1<=p21 & [1<=p51 & 1<=p52]]]] & [[1<=p1 | [1<=p16 & 1<=p19]] | [[1<=p5 & [1<=p35 & 1<=p36]] | [[1<=p10 & 1<=p13] | [1<=p26 & 1<=p29]]]]]]
normalized: E [true U [[[[1<=p16 & 1<=p19] | 1<=p1] | [[[1<=p35 & 1<=p36] & 1<=p5] | [[1<=p10 & 1<=p13] | [1<=p26 & 1<=p29]]]] & ~ [EX [~ [[[~ [E [true U ~ [[1<=p20 & 1<=p23]]]] & [1<=p10 & 1<=p13]] & [[1<=p51 & 1<=p52] & 1<=p21]]]]]]]
abstracting: (1<=p21)
states: 131,072 (5)
abstracting: (1<=p52)
states: 106,496 (5)
abstracting: (1<=p51)
states: 180,224 (5)
abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p10)
states: 90,112 (4)
abstracting: (1<=p23)
states: 131,072 (5)
abstracting: (1<=p20)
states: 49,152 (4)
.abstracting: (1<=p29)
states: 131,072 (5)
abstracting: (1<=p26)
states: 24,576 (4)
abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p10)
states: 90,112 (4)
abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p36)
states: 40,960 (4)
abstracting: (1<=p35)
states: 245,760 (5)
abstracting: (1<=p1)
states: 131,072 (5)
abstracting: (1<=p19)
states: 131,072 (5)
abstracting: (1<=p16)
states: 65,536 (4)
-> the formula is FALSE
FORMULA ResAllocation-PT-R015C002-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: A [[1<=p6 & 1<=p9] U [~ [[[p19<=0 | [p49<=0 | p50<=0]] & A [[1<=p26 & 1<=p29] U [1<=p10 & 1<=p13]]]] & [[EX [A [1<=p30 U [1<=p5 & [1<=p35 & 1<=p36]]]] | ~ [EF [AX [[1<=p21 & [1<=p51 & 1<=p52]]]]]] & [1<=p1 | AX [AF [AG [[1<=p20 & 1<=p23]]]]]]]]
normalized: [~ [EG [~ [[[[~ [EX [EG [E [true U ~ [[1<=p20 & 1<=p23]]]]]] | 1<=p1] & [~ [E [true U ~ [EX [~ [[[1<=p51 & 1<=p52] & 1<=p21]]]]]] | EX [[~ [EG [~ [[[1<=p35 & 1<=p36] & 1<=p5]]]] & ~ [E [~ [[[1<=p35 & 1<=p36] & 1<=p5]] U [~ [1<=p30] & ~ [[[1<=p35 & 1<=p36] & 1<=p5]]]]]]]]] & ~ [[[~ [EG [~ [[1<=p10 & 1<=p13]]]] & ~ [E [~ [[1<=p10 & 1<=p13]] U [~ [[1<=p26 & 1<=p29]] & ~ [[1<=p10 & 1<=p13]]]]]] & [[p49<=0 | p50<=0] | p19<=0]]]]]]] & ~ [E [~ [[[[~ [EX [EG [E [true U ~ [[1<=p20 & 1<=p23]]]]]] | 1<=p1] & [~ [E [true U ~ [EX [~ [[[1<=p51 & 1<=p52] & 1<=p21]]]]]] | EX [[~ [EG [~ [[[1<=p35 & 1<=p36] & 1<=p5]]]] & ~ [E [~ [[[1<=p35 & 1<=p36] & 1<=p5]] U [~ [1<=p30] & ~ [[[1<=p35 & 1<=p36] & 1<=p5]]]]]]]]] & ~ [[[~ [EG [~ [[1<=p10 & 1<=p13]]]] & ~ [E [~ [[1<=p10 & 1<=p13]] U [~ [[1<=p26 & 1<=p29]] & ~ [[1<=p10 & 1<=p13]]]]]] & [[p49<=0 | p50<=0] | p19<=0]]]]] U [~ [[1<=p6 & 1<=p9]] & ~ [[[[~ [EX [EG [E [true U ~ [[1<=p20 & 1<=p23]]]]]] | 1<=p1] & [~ [E [true U ~ [EX [~ [[[1<=p51 & 1<=p52] & 1<=p21]]]]]] | EX [[~ [EG [~ [[[1<=p35 & 1<=p36] & 1<=p5]]]] & ~ [E [~ [[[1<=p35 & 1<=p36] & 1<=p5]] U [~ [1<=p30] & ~ [[[1<=p35 & 1<=p36] & 1<=p5]]]]]]]]] & ~ [[[~ [EG [~ [[1<=p10 & 1<=p13]]]] & ~ [E [~ [[1<=p10 & 1<=p13]] U [~ [[1<=p26 & 1<=p29]] & ~ [[1<=p10 & 1<=p13]]]]]] & [[p49<=0 | p50<=0] | p19<=0]]]]]]]]]
abstracting: (p19<=0)
states: 147,456 (5)
abstracting: (p50<=0)
states: 180,224 (5)
abstracting: (p49<=0)
states: 90,112 (4)
abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p10)
states: 90,112 (4)
abstracting: (1<=p29)
states: 131,072 (5)
abstracting: (1<=p26)
states: 24,576 (4)
abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p10)
states: 90,112 (4)
abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p10)
states: 90,112 (4)
............................................
EG iterations: 44
abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p36)
states: 40,960 (4)
abstracting: (1<=p35)
states: 245,760 (5)
abstracting: (1<=p30)
states: 16,384 (4)
abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p36)
states: 40,960 (4)
abstracting: (1<=p35)
states: 245,760 (5)
abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p36)
states: 40,960 (4)
abstracting: (1<=p35)
states: 245,760 (5)
....................................................................
EG iterations: 68
.abstracting: (1<=p21)
states: 131,072 (5)
abstracting: (1<=p52)
states: 106,496 (5)
abstracting: (1<=p51)
states: 180,224 (5)
.abstracting: (1<=p1)
states: 131,072 (5)
abstracting: (1<=p23)
states: 131,072 (5)
abstracting: (1<=p20)
states: 49,152 (4)
EG iterations: 0
.abstracting: (1<=p9)
states: 131,072 (5)
abstracting: (1<=p6)
states: 106,496 (5)
abstracting: (p19<=0)
states: 147,456 (5)
abstracting: (p50<=0)
states: 180,224 (5)
abstracting: (p49<=0)
states: 90,112 (4)
abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p10)
states: 90,112 (4)
abstracting: (1<=p29)
states: 131,072 (5)
abstracting: (1<=p26)
states: 24,576 (4)
abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p10)
states: 90,112 (4)
abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p10)
states: 90,112 (4)
............................................
EG iterations: 44
abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p36)
states: 40,960 (4)
abstracting: (1<=p35)
states: 245,760 (5)
abstracting: (1<=p30)
states: 16,384 (4)
abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p36)
states: 40,960 (4)
abstracting: (1<=p35)
states: 245,760 (5)
abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p36)
states: 40,960 (4)
abstracting: (1<=p35)
states: 245,760 (5)
....................................................................
EG iterations: 68
.abstracting: (1<=p21)
states: 131,072 (5)
abstracting: (1<=p52)
states: 106,496 (5)
abstracting: (1<=p51)
states: 180,224 (5)
.abstracting: (1<=p1)
states: 131,072 (5)
abstracting: (1<=p23)
states: 131,072 (5)
abstracting: (1<=p20)
states: 49,152 (4)
EG iterations: 0
.abstracting: (p19<=0)
states: 147,456 (5)
abstracting: (p50<=0)
states: 180,224 (5)
abstracting: (p49<=0)
states: 90,112 (4)
abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p10)
states: 90,112 (4)
abstracting: (1<=p29)
states: 131,072 (5)
abstracting: (1<=p26)
states: 24,576 (4)
abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p10)
states: 90,112 (4)
abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p10)
states: 90,112 (4)
............................................
EG iterations: 44
abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p36)
states: 40,960 (4)
abstracting: (1<=p35)
states: 245,760 (5)
abstracting: (1<=p30)
states: 16,384 (4)
abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p36)
states: 40,960 (4)
abstracting: (1<=p35)
states: 245,760 (5)
abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p36)
states: 40,960 (4)
abstracting: (1<=p35)
states: 245,760 (5)
....................................................................
EG iterations: 68
.abstracting: (1<=p21)
states: 131,072 (5)
abstracting: (1<=p52)
states: 106,496 (5)
abstracting: (1<=p51)
states: 180,224 (5)
.abstracting: (1<=p1)
states: 131,072 (5)
abstracting: (1<=p23)
states: 131,072 (5)
abstracting: (1<=p20)
states: 49,152 (4)
EG iterations: 0
..
EG iterations: 1
-> the formula is FALSE
FORMULA ResAllocation-PT-R015C002-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.085sec
checking: EG [[[[~ [E [[1<=p22 & 1<=p25] U ~ [[1<=p9 & [1<=p39 & 1<=p40]]]]] | AG [[1<=p3 & [1<=p33 & 1<=p34]]]] | [p11<=0 | [p41<=0 | p42<=0]]] | [[1<=p1 | [p15<=0 | p45<=0]] | [p46<=0 | [[1<=p17 & [1<=p47 & 1<=p48]] | [1<=p10 & 1<=p13]]]]]]
normalized: EG [[[[[[1<=p10 & 1<=p13] | [[1<=p47 & 1<=p48] & 1<=p17]] | p46<=0] | [[p15<=0 | p45<=0] | 1<=p1]] | [[[p41<=0 | p42<=0] | p11<=0] | [~ [E [true U ~ [[[1<=p33 & 1<=p34] & 1<=p3]]]] | ~ [E [[1<=p22 & 1<=p25] U ~ [[[1<=p39 & 1<=p40] & 1<=p9]]]]]]]]
abstracting: (1<=p9)
states: 131,072 (5)
abstracting: (1<=p40)
states: 57,344 (4)
abstracting: (1<=p39)
states: 229,376 (5)
abstracting: (1<=p25)
states: 131,072 (5)
abstracting: (1<=p22)
states: 40,960 (4)
abstracting: (1<=p3)
states: 131,072 (5)
abstracting: (1<=p34)
states: 32,768 (4)
abstracting: (1<=p33)
states: 253,952 (5)
abstracting: (p11<=0)
states: 147,456 (5)
abstracting: (p42<=0)
states: 212,992 (5)
abstracting: (p41<=0)
states: 57,344 (4)
abstracting: (1<=p1)
states: 131,072 (5)
abstracting: (p45<=0)
states: 73,728 (4)
abstracting: (p15<=0)
states: 147,456 (5)
abstracting: (p46<=0)
states: 196,608 (5)
abstracting: (1<=p17)
states: 131,072 (5)
abstracting: (1<=p48)
states: 90,112 (4)
abstracting: (1<=p47)
states: 196,608 (5)
abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p10)
states: 90,112 (4)
.........................
EG iterations: 25
-> the formula is TRUE
FORMULA ResAllocation-PT-R015C002-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: AX [[[~ [E [AG [[1<=p9 & [1<=p39 & 1<=p40]]] U [EF [[1<=p2 & 1<=p5]] | [1<=p7 & [1<=p37 & 1<=p38]]]]] | E [[1<=p13 & [1<=p43 & 1<=p44]] U [1<=p15 & [1<=p45 & 1<=p46]]]] | [EG [[p25<=0 | [p55<=0 | p56<=0]]] | AG [[1<=p17 & [1<=p47 & 1<=p48]]]]]]
normalized: ~ [EX [~ [[[~ [E [true U ~ [[[1<=p47 & 1<=p48] & 1<=p17]]]] | EG [[[p55<=0 | p56<=0] | p25<=0]]] | [E [[[1<=p43 & 1<=p44] & 1<=p13] U [[1<=p45 & 1<=p46] & 1<=p15]] | ~ [E [~ [E [true U ~ [[[1<=p39 & 1<=p40] & 1<=p9]]]] U [[[1<=p37 & 1<=p38] & 1<=p7] | E [true U [1<=p2 & 1<=p5]]]]]]]]]]
abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p2)
states: 122,880 (5)
abstracting: (1<=p7)
states: 131,072 (5)
abstracting: (1<=p38)
states: 49,152 (4)
abstracting: (1<=p37)
states: 237,568 (5)
abstracting: (1<=p9)
states: 131,072 (5)
abstracting: (1<=p40)
states: 57,344 (4)
abstracting: (1<=p39)
states: 229,376 (5)
abstracting: (1<=p15)
states: 131,072 (5)
abstracting: (1<=p46)
states: 81,920 (4)
abstracting: (1<=p45)
states: 204,800 (5)
abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p44)
states: 73,728 (4)
abstracting: (1<=p43)
states: 212,992 (5)
abstracting: (p25<=0)
states: 147,456 (5)
abstracting: (p56<=0)
states: 155,648 (5)
abstracting: (p55<=0)
states: 114,688 (5)
....................................................................
EG iterations: 68
abstracting: (1<=p17)
states: 131,072 (5)
abstracting: (1<=p48)
states: 90,112 (4)
abstracting: (1<=p47)
states: 196,608 (5)
.-> the formula is TRUE
FORMULA ResAllocation-PT-R015C002-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.109sec
checking: AG [[AF [[[[[p34<=0 | p33<=0] | p3<=0] & [p10<=0 | p13<=0]] | [1<=p24 & 1<=p27]]] & A [AF [[[1<=p25 & [1<=p55 & 1<=p56]] & [1<=p18 & [1<=p21 & 1<=p1]]]] U E [[EX [[1<=p23 & [1<=p53 & 1<=p54]]] | [1<=p25 & [1<=p55 & 1<=p56]]] U EF [[1<=p23 & [1<=p53 & 1<=p54]]]]]]]
normalized: ~ [E [true U ~ [[[~ [EG [~ [E [[[[1<=p55 & 1<=p56] & 1<=p25] | EX [[[1<=p53 & 1<=p54] & 1<=p23]]] U E [true U [[1<=p53 & 1<=p54] & 1<=p23]]]]]] & ~ [E [~ [E [[[[1<=p55 & 1<=p56] & 1<=p25] | EX [[[1<=p53 & 1<=p54] & 1<=p23]]] U E [true U [[1<=p53 & 1<=p54] & 1<=p23]]]] U [~ [E [[[[1<=p55 & 1<=p56] & 1<=p25] | EX [[[1<=p53 & 1<=p54] & 1<=p23]]] U E [true U [[1<=p53 & 1<=p54] & 1<=p23]]]] & EG [~ [[[[1<=p21 & 1<=p1] & 1<=p18] & [[1<=p55 & 1<=p56] & 1<=p25]]]]]]]] & ~ [EG [~ [[[1<=p24 & 1<=p27] | [[p10<=0 | p13<=0] & [[p34<=0 | p33<=0] | p3<=0]]]]]]]]]]
abstracting: (p3<=0)
states: 147,456 (5)
abstracting: (p33<=0)
states: 24,576 (4)
abstracting: (p34<=0)
states: 245,760 (5)
abstracting: (p13<=0)
states: 147,456 (5)
abstracting: (p10<=0)
states: 188,416 (5)
abstracting: (1<=p27)
states: 131,072 (5)
abstracting: (1<=p24)
states: 32,768 (4)
..................................................................................
EG iterations: 82
abstracting: (1<=p25)
states: 131,072 (5)
abstracting: (1<=p56)
states: 122,880 (5)
abstracting: (1<=p55)
states: 163,840 (5)
abstracting: (1<=p18)
states: 57,344 (4)
abstracting: (1<=p1)
states: 131,072 (5)
abstracting: (1<=p21)
states: 131,072 (5)
.
EG iterations: 1
abstracting: (1<=p23)
states: 131,072 (5)
abstracting: (1<=p54)
states: 114,688 (5)
abstracting: (1<=p53)
states: 172,032 (5)
abstracting: (1<=p23)
states: 131,072 (5)
abstracting: (1<=p54)
states: 114,688 (5)
abstracting: (1<=p53)
states: 172,032 (5)
.abstracting: (1<=p25)
states: 131,072 (5)
abstracting: (1<=p56)
states: 122,880 (5)
abstracting: (1<=p55)
states: 163,840 (5)
abstracting: (1<=p23)
states: 131,072 (5)
abstracting: (1<=p54)
states: 114,688 (5)
abstracting: (1<=p53)
states: 172,032 (5)
abstracting: (1<=p23)
states: 131,072 (5)
abstracting: (1<=p54)
states: 114,688 (5)
abstracting: (1<=p53)
states: 172,032 (5)
.abstracting: (1<=p25)
states: 131,072 (5)
abstracting: (1<=p56)
states: 122,880 (5)
abstracting: (1<=p55)
states: 163,840 (5)
abstracting: (1<=p23)
states: 131,072 (5)
abstracting: (1<=p54)
states: 114,688 (5)
abstracting: (1<=p53)
states: 172,032 (5)
abstracting: (1<=p23)
states: 131,072 (5)
abstracting: (1<=p54)
states: 114,688 (5)
abstracting: (1<=p53)
states: 172,032 (5)
.abstracting: (1<=p25)
states: 131,072 (5)
abstracting: (1<=p56)
states: 122,880 (5)
abstracting: (1<=p55)
states: 163,840 (5)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ResAllocation-PT-R015C002-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.057sec
checking: AF [[[AX [[EG [[p19<=0 | [p49<=0 | p50<=0]]] | AX [[p23<=0 | [p53<=0 | p54<=0]]]]] & 1<=p2] & [1<=p5 & [E [~ [A [[1<=p3 & [1<=p33 & 1<=p34]] U [1<=p7 & [1<=p37 & 1<=p38]]]] U AG [[1<=p4 & 1<=p7]]] | [[1<=p9 & [1<=p39 & 1<=p40]] | [1<=p17 & [1<=p47 & 1<=p48]]]]]]]
normalized: ~ [EG [~ [[[[[[[1<=p47 & 1<=p48] & 1<=p17] | [[1<=p39 & 1<=p40] & 1<=p9]] | E [~ [[~ [EG [~ [[[1<=p37 & 1<=p38] & 1<=p7]]]] & ~ [E [~ [[[1<=p37 & 1<=p38] & 1<=p7]] U [~ [[[1<=p33 & 1<=p34] & 1<=p3]] & ~ [[[1<=p37 & 1<=p38] & 1<=p7]]]]]]] U ~ [E [true U ~ [[1<=p4 & 1<=p7]]]]]] & 1<=p5] & [~ [EX [~ [[~ [EX [~ [[[p53<=0 | p54<=0] | p23<=0]]]] | EG [[[p49<=0 | p50<=0] | p19<=0]]]]]] & 1<=p2]]]]]
abstracting: (1<=p2)
states: 122,880 (5)
abstracting: (p19<=0)
states: 147,456 (5)
abstracting: (p50<=0)
states: 180,224 (5)
abstracting: (p49<=0)
states: 90,112 (4)
...............................................
EG iterations: 47
abstracting: (p23<=0)
states: 147,456 (5)
abstracting: (p54<=0)
states: 163,840 (5)
abstracting: (p53<=0)
states: 106,496 (5)
..abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p7)
states: 131,072 (5)
abstracting: (1<=p4)
states: 114,688 (5)
abstracting: (1<=p7)
states: 131,072 (5)
abstracting: (1<=p38)
states: 49,152 (4)
abstracting: (1<=p37)
states: 237,568 (5)
abstracting: (1<=p3)
states: 131,072 (5)
abstracting: (1<=p34)
states: 32,768 (4)
abstracting: (1<=p33)
states: 253,952 (5)
abstracting: (1<=p7)
states: 131,072 (5)
abstracting: (1<=p38)
states: 49,152 (4)
abstracting: (1<=p37)
states: 237,568 (5)
abstracting: (1<=p7)
states: 131,072 (5)
abstracting: (1<=p38)
states: 49,152 (4)
abstracting: (1<=p37)
states: 237,568 (5)
....................................................................
EG iterations: 68
abstracting: (1<=p9)
states: 131,072 (5)
abstracting: (1<=p40)
states: 57,344 (4)
abstracting: (1<=p39)
states: 229,376 (5)
abstracting: (1<=p17)
states: 131,072 (5)
abstracting: (1<=p48)
states: 90,112 (4)
abstracting: (1<=p47)
states: 196,608 (5)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ResAllocation-PT-R015C002-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.130sec
checking: EG [[AF [[[p24<=0 | p27<=0] & [[1<=p2 & 1<=p5] | [1<=p20 & 1<=p23]]]] | [~ [A [[EX [[1<=p7 & [1<=p37 & 1<=p38]]] | [1<=p12 & 1<=p15]] U [[1<=p2 & 1<=p5] | [[1<=p7 & [1<=p37 & 1<=p38]] | ~ [[1<=p15 & [1<=p45 & 1<=p46]]]]]]] & [AX [[p2<=0 | p5<=0]] | [p18<=0 | p21<=0]]]]]
normalized: EG [[[[[p18<=0 | p21<=0] | ~ [EX [~ [[p2<=0 | p5<=0]]]]] & ~ [[~ [EG [~ [[[~ [[[1<=p45 & 1<=p46] & 1<=p15]] | [[1<=p37 & 1<=p38] & 1<=p7]] | [1<=p2 & 1<=p5]]]]] & ~ [E [~ [[[~ [[[1<=p45 & 1<=p46] & 1<=p15]] | [[1<=p37 & 1<=p38] & 1<=p7]] | [1<=p2 & 1<=p5]]] U [~ [[[1<=p12 & 1<=p15] | EX [[[1<=p37 & 1<=p38] & 1<=p7]]]] & ~ [[[~ [[[1<=p45 & 1<=p46] & 1<=p15]] | [[1<=p37 & 1<=p38] & 1<=p7]] | [1<=p2 & 1<=p5]]]]]]]]] | ~ [EG [~ [[[[1<=p20 & 1<=p23] | [1<=p2 & 1<=p5]] & [p24<=0 | p27<=0]]]]]]]
abstracting: (p27<=0)
states: 147,456 (5)
abstracting: (p24<=0)
states: 245,760 (5)
abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p2)
states: 122,880 (5)
abstracting: (1<=p23)
states: 131,072 (5)
abstracting: (1<=p20)
states: 49,152 (4)
........................................................................
EG iterations: 72
abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p2)
states: 122,880 (5)
abstracting: (1<=p7)
states: 131,072 (5)
abstracting: (1<=p38)
states: 49,152 (4)
abstracting: (1<=p37)
states: 237,568 (5)
abstracting: (1<=p15)
states: 131,072 (5)
abstracting: (1<=p46)
states: 81,920 (4)
abstracting: (1<=p45)
states: 204,800 (5)
abstracting: (1<=p7)
states: 131,072 (5)
abstracting: (1<=p38)
states: 49,152 (4)
abstracting: (1<=p37)
states: 237,568 (5)
.abstracting: (1<=p15)
states: 131,072 (5)
abstracting: (1<=p12)
states: 81,920 (4)
abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p2)
states: 122,880 (5)
abstracting: (1<=p7)
states: 131,072 (5)
abstracting: (1<=p38)
states: 49,152 (4)
abstracting: (1<=p37)
states: 237,568 (5)
abstracting: (1<=p15)
states: 131,072 (5)
abstracting: (1<=p46)
states: 81,920 (4)
abstracting: (1<=p45)
states: 204,800 (5)
abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p2)
states: 122,880 (5)
abstracting: (1<=p7)
states: 131,072 (5)
abstracting: (1<=p38)
states: 49,152 (4)
abstracting: (1<=p37)
states: 237,568 (5)
abstracting: (1<=p15)
states: 131,072 (5)
abstracting: (1<=p46)
states: 81,920 (4)
abstracting: (1<=p45)
states: 204,800 (5)
...................................
EG iterations: 35
abstracting: (p5<=0)
states: 147,456 (5)
abstracting: (p2<=0)
states: 155,648 (5)
.abstracting: (p21<=0)
states: 147,456 (5)
abstracting: (p18<=0)
states: 221,184 (5)
............................................................................................
EG iterations: 92
-> the formula is FALSE
FORMULA ResAllocation-PT-R015C002-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.441sec
checking: E [~ [[E [~ [[~ [[1<=p2 & 1<=p5]] & EX [[1<=p25 & [1<=p55 & 1<=p56]]]]] U EF [[[1<=p24 & 1<=p27] | [1<=p7 & [1<=p37 & 1<=p38]]]]] & [AX [EF [[1<=p11 & [1<=p41 & 1<=p42]]]] | [~ [[EG [[1<=p5 & [1<=p35 & 1<=p36]]] | AG [[1<=p13 & [1<=p43 & 1<=p44]]]]] | AG [[1<=p10 & 1<=p13]]]]]] U [AF [[E [[1<=p26 & 1<=p29] U [1<=p10 & 1<=p13]] | [1<=p5 & [1<=p35 & 1<=p36]]]] | [1<=p22 & 1<=p25]]]
normalized: E [~ [[[~ [EX [~ [E [true U [[1<=p41 & 1<=p42] & 1<=p11]]]]] | [~ [E [true U ~ [[1<=p10 & 1<=p13]]]] | ~ [[EG [[[1<=p35 & 1<=p36] & 1<=p5]] | ~ [E [true U ~ [[[1<=p43 & 1<=p44] & 1<=p13]]]]]]]] & E [~ [[EX [[[1<=p55 & 1<=p56] & 1<=p25]] & ~ [[1<=p2 & 1<=p5]]]] U E [true U [[[1<=p37 & 1<=p38] & 1<=p7] | [1<=p24 & 1<=p27]]]]]] U [~ [EG [~ [[E [[1<=p26 & 1<=p29] U [1<=p10 & 1<=p13]] | [[1<=p35 & 1<=p36] & 1<=p5]]]]] | [1<=p22 & 1<=p25]]]
abstracting: (1<=p25)
states: 131,072 (5)
abstracting: (1<=p22)
states: 40,960 (4)
abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p36)
states: 40,960 (4)
abstracting: (1<=p35)
states: 245,760 (5)
abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p10)
states: 90,112 (4)
abstracting: (1<=p29)
states: 131,072 (5)
abstracting: (1<=p26)
states: 24,576 (4)
....................................................................
EG iterations: 68
abstracting: (1<=p27)
states: 131,072 (5)
abstracting: (1<=p24)
states: 32,768 (4)
abstracting: (1<=p7)
states: 131,072 (5)
abstracting: (1<=p38)
states: 49,152 (4)
abstracting: (1<=p37)
states: 237,568 (5)
abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p2)
states: 122,880 (5)
abstracting: (1<=p25)
states: 131,072 (5)
abstracting: (1<=p56)
states: 122,880 (5)
abstracting: (1<=p55)
states: 163,840 (5)
.abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p44)
states: 73,728 (4)
abstracting: (1<=p43)
states: 212,992 (5)
abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p36)
states: 40,960 (4)
abstracting: (1<=p35)
states: 245,760 (5)
..........................................................................
EG iterations: 74
abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p10)
states: 90,112 (4)
abstracting: (1<=p11)
states: 131,072 (5)
abstracting: (1<=p42)
states: 65,536 (4)
abstracting: (1<=p41)
states: 221,184 (5)
.-> the formula is FALSE
FORMULA ResAllocation-PT-R015C002-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.076sec
checking: E [[1<=p8 & 1<=p11] U [AG [E [1<=p30 U [[1<=p22 & 1<=p25] | [1<=p27 & [1<=p57 & 1<=p58]]]]] | [[1<=p12 & 1<=p15] | [EF [[1<=p21 & [1<=p51 & 1<=p52]]] & [E [[[1<=p14 & 1<=p17] & [1<=p24 & 1<=p27]] U ~ [[1<=p9 & [1<=p39 & 1<=p40]]]] & [A [[[1<=p22 & 1<=p25] | [1<=p21 & [1<=p51 & 1<=p52]]] U [1<=p18 & 1<=p21]] | AF [[1<=p25 & [1<=p55 & 1<=p56]]]]]]]]]
normalized: E [[1<=p8 & 1<=p11] U [[[[[~ [EG [~ [[[1<=p55 & 1<=p56] & 1<=p25]]]] | [~ [EG [~ [[1<=p18 & 1<=p21]]]] & ~ [E [~ [[1<=p18 & 1<=p21]] U [~ [[[[1<=p51 & 1<=p52] & 1<=p21] | [1<=p22 & 1<=p25]]] & ~ [[1<=p18 & 1<=p21]]]]]]] & E [[[1<=p24 & 1<=p27] & [1<=p14 & 1<=p17]] U ~ [[[1<=p39 & 1<=p40] & 1<=p9]]]] & E [true U [[1<=p51 & 1<=p52] & 1<=p21]]] | [1<=p12 & 1<=p15]] | ~ [E [true U ~ [E [1<=p30 U [[[1<=p57 & 1<=p58] & 1<=p27] | [1<=p22 & 1<=p25]]]]]]]]
abstracting: (1<=p25)
states: 131,072 (5)
abstracting: (1<=p22)
states: 40,960 (4)
abstracting: (1<=p27)
states: 131,072 (5)
abstracting: (1<=p58)
states: 131,072 (5)
abstracting: (1<=p57)
states: 155,648 (5)
abstracting: (1<=p30)
states: 16,384 (4)
abstracting: (1<=p15)
states: 131,072 (5)
abstracting: (1<=p12)
states: 81,920 (4)
abstracting: (1<=p21)
states: 131,072 (5)
abstracting: (1<=p52)
states: 106,496 (5)
abstracting: (1<=p51)
states: 180,224 (5)
abstracting: (1<=p9)
states: 131,072 (5)
abstracting: (1<=p40)
states: 57,344 (4)
abstracting: (1<=p39)
states: 229,376 (5)
abstracting: (1<=p17)
states: 131,072 (5)
abstracting: (1<=p14)
states: 73,728 (4)
abstracting: (1<=p27)
states: 131,072 (5)
abstracting: (1<=p24)
states: 32,768 (4)
abstracting: (1<=p21)
states: 131,072 (5)
abstracting: (1<=p18)
states: 57,344 (4)
abstracting: (1<=p25)
states: 131,072 (5)
abstracting: (1<=p22)
states: 40,960 (4)
abstracting: (1<=p21)
states: 131,072 (5)
abstracting: (1<=p52)
states: 106,496 (5)
abstracting: (1<=p51)
states: 180,224 (5)
abstracting: (1<=p21)
states: 131,072 (5)
abstracting: (1<=p18)
states: 57,344 (4)
abstracting: (1<=p21)
states: 131,072 (5)
abstracting: (1<=p18)
states: 57,344 (4)
...........................................................
EG iterations: 59
abstracting: (1<=p25)
states: 131,072 (5)
abstracting: (1<=p56)
states: 122,880 (5)
abstracting: (1<=p55)
states: 163,840 (5)
....................................................................
EG iterations: 68
abstracting: (1<=p11)
states: 131,072 (5)
abstracting: (1<=p8)
states: 98,304 (4)
-> the formula is FALSE
FORMULA ResAllocation-PT-R015C002-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.060sec
checking: [EG [EX [[p11<=0 | [p41<=0 | p42<=0]]]] | [~ [E [~ [A [EG [[1<=p21 & [1<=p51 & 1<=p52]]] U [[1<=p9 & [1<=p39 & 1<=p40]] | [1<=p19 & [1<=p49 & 1<=p50]]]]] U [[[[1<=p28 | [1<=p11 & [1<=p41 & 1<=p42]]] & [[1<=p22 & 1<=p25] | [1<=p7 & [1<=p37 & 1<=p38]]]] | [1<=p1 & [1<=p31 & 1<=p32]]] | [[1<=p4 & 1<=p7] | [[1<=p17 & 1<=p47] & [1<=p48 & [1<=p6 & 1<=p9]]]]]]] & ~ [E [AF [[~ [[1<=p19 & [1<=p49 & 1<=p50]]] | [[1<=p17 & [1<=p47 & 1<=p48]] & [1<=p9 & [1<=p39 & 1<=p40]]]]] U EG [EX [[1<=p16 & 1<=p19]]]]]]]
normalized: [[~ [E [~ [EG [~ [[[[[1<=p47 & 1<=p48] & 1<=p17] & [[1<=p39 & 1<=p40] & 1<=p9]] | ~ [[[1<=p49 & 1<=p50] & 1<=p19]]]]]] U EG [EX [[1<=p16 & 1<=p19]]]]] & ~ [E [~ [[~ [EG [~ [[[[1<=p49 & 1<=p50] & 1<=p19] | [[1<=p39 & 1<=p40] & 1<=p9]]]]] & ~ [E [~ [[[[1<=p49 & 1<=p50] & 1<=p19] | [[1<=p39 & 1<=p40] & 1<=p9]]] U [~ [[[[1<=p49 & 1<=p50] & 1<=p19] | [[1<=p39 & 1<=p40] & 1<=p9]]] & ~ [EG [[[1<=p51 & 1<=p52] & 1<=p21]]]]]]]] U [[[[[1<=p6 & 1<=p9] & 1<=p48] & [1<=p17 & 1<=p47]] | [1<=p4 & 1<=p7]] | [[[1<=p31 & 1<=p32] & 1<=p1] | [[[[1<=p37 & 1<=p38] & 1<=p7] | [1<=p22 & 1<=p25]] & [[[1<=p41 & 1<=p42] & 1<=p11] | 1<=p28]]]]]]] | EG [EX [[[p41<=0 | p42<=0] | p11<=0]]]]
abstracting: (p11<=0)
states: 147,456 (5)
abstracting: (p42<=0)
states: 212,992 (5)
abstracting: (p41<=0)
states: 57,344 (4)
..........................................................................................................
EG iterations: 105
abstracting: (1<=p28)
states: 16,384 (4)
abstracting: (1<=p11)
states: 131,072 (5)
abstracting: (1<=p42)
states: 65,536 (4)
abstracting: (1<=p41)
states: 221,184 (5)
abstracting: (1<=p25)
states: 131,072 (5)
abstracting: (1<=p22)
states: 40,960 (4)
abstracting: (1<=p7)
states: 131,072 (5)
abstracting: (1<=p38)
states: 49,152 (4)
abstracting: (1<=p37)
states: 237,568 (5)
abstracting: (1<=p1)
states: 131,072 (5)
abstracting: (1<=p32)
states: 24,576 (4)
abstracting: (1<=p31)
states: 262,144 (5)
abstracting: (1<=p7)
states: 131,072 (5)
abstracting: (1<=p4)
states: 114,688 (5)
abstracting: (1<=p47)
states: 196,608 (5)
abstracting: (1<=p17)
states: 131,072 (5)
abstracting: (1<=p48)
states: 90,112 (4)
abstracting: (1<=p9)
states: 131,072 (5)
abstracting: (1<=p6)
states: 106,496 (5)
abstracting: (1<=p21)
states: 131,072 (5)
abstracting: (1<=p52)
states: 106,496 (5)
abstracting: (1<=p51)
states: 180,224 (5)
......................................................................................................................
EG iterations: 118
abstracting: (1<=p9)
states: 131,072 (5)
abstracting: (1<=p40)
states: 57,344 (4)
abstracting: (1<=p39)
states: 229,376 (5)
abstracting: (1<=p19)
states: 131,072 (5)
abstracting: (1<=p50)
states: 98,304 (4)
abstracting: (1<=p49)
states: 188,416 (5)
abstracting: (1<=p9)
states: 131,072 (5)
abstracting: (1<=p40)
states: 57,344 (4)
abstracting: (1<=p39)
states: 229,376 (5)
abstracting: (1<=p19)
states: 131,072 (5)
abstracting: (1<=p50)
states: 98,304 (4)
abstracting: (1<=p49)
states: 188,416 (5)
abstracting: (1<=p9)
states: 131,072 (5)
abstracting: (1<=p40)
states: 57,344 (4)
abstracting: (1<=p39)
states: 229,376 (5)
abstracting: (1<=p19)
states: 131,072 (5)
abstracting: (1<=p50)
states: 98,304 (4)
abstracting: (1<=p49)
states: 188,416 (5)
...............................................................
EG iterations: 63
abstracting: (1<=p19)
states: 131,072 (5)
abstracting: (1<=p16)
states: 65,536 (4)
.....................................................................
EG iterations: 68
abstracting: (1<=p19)
states: 131,072 (5)
abstracting: (1<=p50)
states: 98,304 (4)
abstracting: (1<=p49)
states: 188,416 (5)
abstracting: (1<=p9)
states: 131,072 (5)
abstracting: (1<=p40)
states: 57,344 (4)
abstracting: (1<=p39)
states: 229,376 (5)
abstracting: (1<=p17)
states: 131,072 (5)
abstracting: (1<=p48)
states: 90,112 (4)
abstracting: (1<=p47)
states: 196,608 (5)
......................................................................................................
EG iterations: 102
-> the formula is TRUE
FORMULA ResAllocation-PT-R015C002-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.311sec
checking: E [AX [[1<=p16 & 1<=p19]] U [~ [[[EX [p30<=0] | [[[A [[1<=p8 & 1<=p11] U [1<=p6 & 1<=p9]] & 1<=p5] & [1<=p35 & 1<=p36]] | A [[1<=p26 & 1<=p29] U [1<=p20 & 1<=p23]]]] | [[AG [[1<=p24 & 1<=p27]] | [[[1<=p23 & 1<=p53] & [1<=p54 & 1<=p19]] & [[1<=p49 & 1<=p50] & [1<=p1 & [1<=p0 & 1<=p3]]]]] | [[[1<=p29 & 1<=p59] & [1<=p4 & 1<=p7]] | [[1<=p19 & 1<=p49] & [1<=p50 & [1<=p8 & 1<=p11]]]]]]] | [E [[EG [[1<=p13 & [1<=p43 & 1<=p44]]] & AF [[1<=p27 & [1<=p57 & 1<=p58]]]] U ~ [[[1<=p8 & 1<=p11] & [1<=p26 & 1<=p29]]]] & [E [~ [AX [[1<=p3 & [1<=p33 & 1<=p34]]]] U [AX [[1<=p18 & 1<=p21]] | [EG [[1<=p12 & 1<=p15]] & AX [[1<=p18 & 1<=p21]]]]] & [p28<=0 | ~ [EG [1<=p1]]]]]]]
normalized: E [~ [EX [~ [[1<=p16 & 1<=p19]]]] U [[[[~ [EG [1<=p1]] | p28<=0] & E [EX [~ [[[1<=p33 & 1<=p34] & 1<=p3]]] U [[~ [EX [~ [[1<=p18 & 1<=p21]]]] & EG [[1<=p12 & 1<=p15]]] | ~ [EX [~ [[1<=p18 & 1<=p21]]]]]]] & E [[~ [EG [~ [[[1<=p57 & 1<=p58] & 1<=p27]]]] & EG [[[1<=p43 & 1<=p44] & 1<=p13]]] U ~ [[[1<=p26 & 1<=p29] & [1<=p8 & 1<=p11]]]]] | ~ [[[[[[[1<=p8 & 1<=p11] & 1<=p50] & [1<=p19 & 1<=p49]] | [[1<=p4 & 1<=p7] & [1<=p29 & 1<=p59]]] | [[[[[1<=p0 & 1<=p3] & 1<=p1] & [1<=p49 & 1<=p50]] & [[1<=p54 & 1<=p19] & [1<=p23 & 1<=p53]]] | ~ [E [true U ~ [[1<=p24 & 1<=p27]]]]]] | [[[~ [EG [~ [[1<=p20 & 1<=p23]]]] & ~ [E [~ [[1<=p20 & 1<=p23]] U [~ [[1<=p26 & 1<=p29]] & ~ [[1<=p20 & 1<=p23]]]]]] | [[1<=p35 & 1<=p36] & [[~ [EG [~ [[1<=p6 & 1<=p9]]]] & ~ [E [~ [[1<=p6 & 1<=p9]] U [~ [[1<=p8 & 1<=p11]] & ~ [[1<=p6 & 1<=p9]]]]]] & 1<=p5]]] | EX [p30<=0]]]]]]
abstracting: (p30<=0)
states: 262,144 (5)
.abstracting: (1<=p5)
states: 131,072 (5)
abstracting: (1<=p9)
states: 131,072 (5)
abstracting: (1<=p6)
states: 106,496 (5)
abstracting: (1<=p11)
states: 131,072 (5)
abstracting: (1<=p8)
states: 98,304 (4)
abstracting: (1<=p9)
states: 131,072 (5)
abstracting: (1<=p6)
states: 106,496 (5)
abstracting: (1<=p9)
states: 131,072 (5)
abstracting: (1<=p6)
states: 106,496 (5)
....................................................
EG iterations: 52
abstracting: (1<=p36)
states: 40,960 (4)
abstracting: (1<=p35)
states: 245,760 (5)
abstracting: (1<=p23)
states: 131,072 (5)
abstracting: (1<=p20)
states: 49,152 (4)
abstracting: (1<=p29)
states: 131,072 (5)
abstracting: (1<=p26)
states: 24,576 (4)
abstracting: (1<=p23)
states: 131,072 (5)
abstracting: (1<=p20)
states: 49,152 (4)
abstracting: (1<=p23)
states: 131,072 (5)
abstracting: (1<=p20)
states: 49,152 (4)
....................................................................
EG iterations: 68
abstracting: (1<=p27)
states: 131,072 (5)
abstracting: (1<=p24)
states: 32,768 (4)
abstracting: (1<=p53)
states: 172,032 (5)
abstracting: (1<=p23)
states: 131,072 (5)
abstracting: (1<=p19)
states: 131,072 (5)
abstracting: (1<=p54)
states: 114,688 (5)
abstracting: (1<=p50)
states: 98,304 (4)
abstracting: (1<=p49)
states: 188,416 (5)
abstracting: (1<=p1)
states: 131,072 (5)
abstracting: (1<=p3)
states: 131,072 (5)
abstracting: (1<=p0)
states: 131,072 (5)
abstracting: (1<=p59)
states: 147,456 (5)
abstracting: (1<=p29)
states: 131,072 (5)
abstracting: (1<=p7)
states: 131,072 (5)
abstracting: (1<=p4)
states: 114,688 (5)
abstracting: (1<=p49)
states: 188,416 (5)
abstracting: (1<=p19)
states: 131,072 (5)
abstracting: (1<=p50)
states: 98,304 (4)
abstracting: (1<=p11)
states: 131,072 (5)
abstracting: (1<=p8)
states: 98,304 (4)
abstracting: (1<=p11)
states: 131,072 (5)
abstracting: (1<=p8)
states: 98,304 (4)
abstracting: (1<=p29)
states: 131,072 (5)
abstracting: (1<=p26)
states: 24,576 (4)
abstracting: (1<=p13)
states: 131,072 (5)
abstracting: (1<=p44)
states: 73,728 (4)
abstracting: (1<=p43)
states: 212,992 (5)
........................................................................
EG iterations: 72
abstracting: (1<=p27)
states: 131,072 (5)
abstracting: (1<=p58)
states: 131,072 (5)
abstracting: (1<=p57)
states: 155,648 (5)
...............................................................................
EG iterations: 79
abstracting: (1<=p21)
states: 131,072 (5)
abstracting: (1<=p18)
states: 57,344 (4)
.abstracting: (1<=p15)
states: 131,072 (5)
abstracting: (1<=p12)
states: 81,920 (4)
...............................................................................
EG iterations: 79
abstracting: (1<=p21)
states: 131,072 (5)
abstracting: (1<=p18)
states: 57,344 (4)
.abstracting: (1<=p3)
states: 131,072 (5)
abstracting: (1<=p34)
states: 32,768 (4)
abstracting: (1<=p33)
states: 253,952 (5)
.abstracting: (p28<=0)
states: 262,144 (5)
abstracting: (1<=p1)
states: 131,072 (5)
....................................................................................................................................................................................................................
EG iterations: 212
abstracting: (1<=p19)
states: 131,072 (5)
abstracting: (1<=p16)
states: 65,536 (4)
.-> the formula is TRUE
FORMULA ResAllocation-PT-R015C002-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.437sec
totally nodes used: 3302726 (3.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1376436 4604439 5980875
used/not used/entry size/cache size: 6933391 60175473 16 1024MB
basic ops cache: hits/miss/sum: 375374 1215815 1591189
used/not used/entry size/cache size: 2427098 14350118 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: 1733 4162 5895
used/not used/entry size/cache size: 4162 8384446 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 64053316
1 2832164
2 201599
3 19928
4 1712
5 138
6 7
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 7.041sec
BK_STOP 1679181696534
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:914 (28), effective:240 (7)
initing FirstDep: 0m 0.000sec
iterations count:1735 (54), effective:521 (16)
iterations count:38 (1), effective:2 (0)
iterations count:318 (9), effective:88 (2)
iterations count:276 (8), effective:81 (2)
iterations count:62 (1), effective:11 (0)
iterations count:34 (1), effective:1 (0)
iterations count:34 (1), effective:1 (0)
iterations count:2209 (69), effective:653 (20)
iterations count:62 (1), effective:11 (0)
iterations count:34 (1), effective:1 (0)
iterations count:34 (1), effective:1 (0)
iterations count:2209 (69), effective:653 (20)
iterations count:62 (1), effective:11 (0)
iterations count:251 (7), effective:67 (2)
iterations count:34 (1), effective:1 (0)
iterations count:34 (1), effective:1 (0)
iterations count:2209 (69), effective:653 (20)
iterations count:62 (1), effective:11 (0)
iterations count:32 (1), effective:0 (0)
iterations count:35 (1), effective:1 (0)
iterations count:104 (3), effective:21 (0)
iterations count:35 (1), effective:1 (0)
iterations count:32 (1), effective:0 (0)
iterations count:35 (1), effective:1 (0)
iterations count:35 (1), effective:1 (0)
iterations count:102 (3), effective:25 (0)
iterations count:32 (1), effective:0 (0)
iterations count:102 (3), effective:25 (0)
iterations count:32 (1), effective:0 (0)
iterations count:36 (1), effective:1 (0)
iterations count:102 (3), effective:25 (0)
iterations count:32 (1), effective:0 (0)
iterations count:373 (11), effective:114 (3)
iterations count:294 (9), effective:79 (2)
iterations count:35 (1), effective:1 (0)
iterations count:36 (1), effective:1 (0)
iterations count:81 (2), effective:12 (0)
iterations count:121 (3), effective:29 (0)
iterations count:32 (1), effective:0 (0)
iterations count:35 (1), effective:1 (0)
iterations count:177 (5), effective:46 (1)
iterations count:258 (8), effective:70 (2)
iterations count:60 (1), effective:7 (0)
iterations count:73 (2), effective:13 (0)
iterations count:377 (11), effective:108 (3)
iterations count:118 (3), effective:30 (0)
iterations count:32 (1), effective:0 (0)
iterations count:54 (1), effective:8 (0)
iterations count:125 (3), effective:30 (0)
iterations count:32 (1), effective:0 (0)
iterations count:184 (5), effective:42 (1)
iterations count:212 (6), effective:56 (1)
iterations count:34 (1), effective:1 (0)
iterations count:40 (1), effective:3 (0)
iterations count:32 (1), effective:0 (0)
iterations count:2040 (63), effective:606 (18)
iterations count:32 (1), effective:0 (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="ResAllocation-PT-R015C002"
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 ResAllocation-PT-R015C002, 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 r330-tall-167889203700746"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R015C002.tgz
mv ResAllocation-PT-R015C002 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 ;