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-167889203600666.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-R003C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203600666
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 8.0K Feb 25 15:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 15:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 15:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 15:17 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.9K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 15:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Feb 25 15:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 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 14K 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-R003C002-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R003C002-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R003C002-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R003C002-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R003C002-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R003C002-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R003C002-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R003C002-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R003C002-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R003C002-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R003C002-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C002-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C002-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C002-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C002-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679180604596

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-R003C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:03:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:03:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:03:26] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-18 23:03:26] [INFO ] Transformed 12 places.
[2023-03-18 23:03:26] [INFO ] Transformed 8 transitions.
[2023-03-18 23:03:26] [INFO ] Found NUPN structural information;
[2023-03-18 23:03:26] [INFO ] Parsed PT model containing 12 places and 8 transitions and 30 arcs in 80 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 2 formulas.
FORMULA ResAllocation-PT-R003C002-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C002-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 8 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-18 23:03:26] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-18 23:03:26] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-18 23:03:26] [INFO ] Invariant cache hit.
[2023-03-18 23:03:26] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-18 23:03:26] [INFO ] Invariant cache hit.
[2023-03-18 23:03:26] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 12/12 places, 8/8 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-18 23:03:26] [INFO ] Flatten gal took : 14 ms
[2023-03-18 23:03:26] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:03:26] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10000 steps, including 1504 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 26) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 909 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 376 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 610 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 872 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 909 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 909 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 23:03:27] [INFO ] Invariant cache hit.
[2023-03-18 23:03:27] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-18 23:03:27] [INFO ] After 6ms SMT Verify possible using state equation in real domain returned unsat :6 sat :1
[2023-03-18 23:03:27] [INFO ] After 11ms SMT Verify possible using trap constraints in real domain returned unsat :6 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-18 23:03:27] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :1
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 8/8 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 7
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 9 transition count 6
Applied a total of 5 rules in 7 ms. Remains 9 /12 variables (removed 3) and now considering 6/8 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 9/12 places, 6/8 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Probably explored full state space saw : 7 states, properties seen :0
Probabilistic random walk after 17 steps, saw 7 distinct states, run finished after 14 ms. (steps per millisecond=1 ) properties seen :0
Explored full state space saw : 7 states, properties seen :0
Exhaustive walk after 17 steps, saw 7 distinct states, run finished after 1 ms. (steps per millisecond=17 ) properties seen :0
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
[2023-03-18 23:03:27] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:03:27] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:03:27] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:03:28] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 9 transition count 6
Applied a total of 5 rules in 2 ms. Remains 9 /12 variables (removed 3) and now considering 6/8 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 9/12 places, 6/8 transitions.
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA ResAllocation-PT-R003C002-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 0 ms
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 0 ms
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 0 ms
[2023-03-18 23:03:28] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 0 ms
[2023-03-18 23:03:28] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 0 ms
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 0 ms
[2023-03-18 23:03:28] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:03:28] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-18 23:03:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 8 transitions and 30 arcs took 1 ms.
Total runtime 1769 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: 8 NrArc: 30)

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

net check time: 0m 0.000sec

init dd package: 0m 2.740sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 39 (3.9e+01) #states 20



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

checking: [AX [1<=0] | EX [0<=0]]
normalized: [~ [EX [~ [1<=0]]] | EX [0<=0]]

abstracting: (0<=0)
states: 20
.abstracting: (1<=0)
states: 0
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C002-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EX [[p6<=1 & 1<=p6]]
normalized: EX [[p6<=1 & 1<=p6]]

abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C002-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [EX [AF [[[p2<=0 & 0<=p2] | [p5<=0 & 0<=p5]]]]]
normalized: E [true U EX [~ [EG [~ [[[p5<=0 & 0<=p5] | [p2<=0 & 0<=p2]]]]]]]

abstracting: (0<=p2)
states: 20
abstracting: (p2<=0)
states: 14
abstracting: (0<=p5)
states: 20
abstracting: (p5<=0)
states: 12
...
EG iterations: 3
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C002-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
....
EG iterations: 3
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C002-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [[[p5<=1 & 1<=p5] & [p11<=1 & 1<=p11]] U ~ [EX [[AF [[[p2<=1 & 1<=p2] & [p5<=1 & 1<=p5]]] | EX [[[p2<=1 & 1<=p2] & [p5<=1 & 1<=p5]]]]]]]
normalized: [~ [EG [EX [[EX [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]] | ~ [EG [~ [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]]]]]]]] & ~ [E [EX [[EX [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]] | ~ [EG [~ [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]]]]]] U [~ [[[p11<=1 & 1<=p11] & [p5<=1 & 1<=p5]]] & EX [[EX [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]] | ~ [EG [~ [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]]]]]]]]]]

abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
...
EG iterations: 3
abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
..abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (1<=p11)
states: 12
abstracting: (p11<=1)
states: 20
abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
...
EG iterations: 3
abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
..abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
...
EG iterations: 3
abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
......
EG iterations: 4
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C002-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [[AX [[[p6<=0 & 0<=p6] | [[p5<=0 & 0<=p5] | [p11<=0 & 0<=p11]]]] | [[p3<=1 & 1<=p3] & [[p9<=1 & 1<=p9] & [p10<=1 & 1<=p10]]]]]
normalized: ~ [EG [~ [[~ [EX [~ [[[[p11<=0 & 0<=p11] | [p5<=0 & 0<=p5]] | [p6<=0 & 0<=p6]]]]] | [[[p10<=1 & 1<=p10] & [p9<=1 & 1<=p9]] & [p3<=1 & 1<=p3]]]]]]

abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
abstracting: (1<=p9)
states: 14
abstracting: (p9<=1)
states: 20
abstracting: (1<=p10)
states: 8
abstracting: (p10<=1)
states: 20
abstracting: (0<=p6)
states: 20
abstracting: (p6<=0)
states: 16
abstracting: (0<=p5)
states: 20
abstracting: (p5<=0)
states: 12
abstracting: (0<=p11)
states: 20
abstracting: (p11<=0)
states: 8
...
EG iterations: 2
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C002-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [[EX [AX [AF [[[p2<=1 & 1<=p2] & [p5<=1 & 1<=p5]]]]] | E [EF [[EG [[p1<=1 & 1<=p1]] & [p4<=1 & 1<=p4]]] U EG [EX [[[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]]]]]]
normalized: EG [[E [E [true U [[p4<=1 & 1<=p4] & EG [[p1<=1 & 1<=p1]]]] U EG [EX [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]]]]] | EX [~ [EX [EG [~ [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]]]]]]]]

abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
...
EG iterations: 3
..abstracting: (1<=p0)
states: 8
abstracting: (p0<=1)
states: 20
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
.....
EG iterations: 4
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
........
EG iterations: 8
abstracting: (1<=p4)
states: 4
abstracting: (p4<=1)
states: 20
....
EG iterations: 4
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C002-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
.
EG iterations: 1
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
.abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
........
EG iterations: 8
abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
.abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (1<=p11)
states: 12
abstracting: (p11<=1)
states: 20
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
.
EG iterations: 1
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
.abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
........
EG iterations: 8
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
.
EG iterations: 1
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
.abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
........
EG iterations: 8

EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C002-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [EF [[p4<=1 & 1<=p4]] U [~ [[E [[[p5<=1 & 1<=p5] & [p11<=1 & 1<=p11]] U A [[[p2<=1 & 1<=p2] & [p5<=1 & 1<=p5]] U [p6<=1 & 1<=p6]]] & ~ [[AF [[[p2<=1 & 1<=p2] & [p5<=1 & 1<=p5]]] | [[[p6<=1 & 1<=p6] & [[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]] | [[p2<=1 & 1<=p2] & [p5<=1 & 1<=p5]]]]]]] & AX [[[p5<=1 & 1<=p5] & [p11<=1 & 1<=p11]]]]]
normalized: E [E [true U [p4<=1 & 1<=p4]] U [~ [EX [~ [[[p11<=1 & 1<=p11] & [p5<=1 & 1<=p5]]]]] & ~ [[~ [[[[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]] | [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]] & [p6<=1 & 1<=p6]]] | ~ [EG [~ [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]]]]]] & E [[[p11<=1 & 1<=p11] & [p5<=1 & 1<=p5]] U [~ [EG [~ [[p6<=1 & 1<=p6]]]] & ~ [E [~ [[p6<=1 & 1<=p6]] U [~ [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]] & ~ [[p6<=1 & 1<=p6]]]]]]]]]]]

abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
.
EG iterations: 1
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (1<=p11)
states: 12
abstracting: (p11<=1)
states: 20
abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
...
EG iterations: 3
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
abstracting: (1<=p0)
states: 8
abstracting: (p0<=1)
states: 20
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (1<=p11)
states: 12
abstracting: (p11<=1)
states: 20
.abstracting: (1<=p4)
states: 4
abstracting: (p4<=1)
states: 20
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C002-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [~ [EG [E [[[[[p5<=1 & 1<=p5] & [p11<=1 & 1<=p11]] & [[p3<=1 & 1<=p3] & [[p9<=1 & 1<=p9] & [p10<=1 & 1<=p10]]]] | [[p4<=1 & 1<=p4] | [[p1<=1 & 1<=p1] & [[p7<=1 & 1<=p7] & [p8<=1 & 1<=p8]]]]] U A [[p6<=1 & 1<=p6] U [[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]]]]] U [[p1<=1 & 1<=p1] & [[p7<=1 & 1<=p7] & [p8<=1 & 1<=p8]]]]
normalized: [~ [EG [~ [[[[p8<=1 & 1<=p8] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]]]]] & ~ [E [~ [[[[p8<=1 & 1<=p8] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]]] U [EG [E [[[[[[p8<=1 & 1<=p8] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]] | [p4<=1 & 1<=p4]] | [[[[p10<=1 & 1<=p10] & [p9<=1 & 1<=p9]] & [p3<=1 & 1<=p3]] & [[p11<=1 & 1<=p11] & [p5<=1 & 1<=p5]]]] U [~ [EG [~ [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]]]]] & ~ [E [~ [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]]] U [~ [[p6<=1 & 1<=p6]] & ~ [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]]]]]]]]] & ~ [[[[p8<=1 & 1<=p8] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]]]]]]]

abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 20
abstracting: (1<=p8)
states: 6
abstracting: (p8<=1)
states: 20
abstracting: (1<=p0)
states: 8
abstracting: (p0<=1)
states: 20
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
abstracting: (1<=p0)
states: 8
abstracting: (p0<=1)
states: 20
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
abstracting: (1<=p0)
states: 8
abstracting: (p0<=1)
states: 20
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
.
EG iterations: 1
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (1<=p11)
states: 12
abstracting: (p11<=1)
states: 20
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
abstracting: (1<=p9)
states: 14
abstracting: (p9<=1)
states: 20
abstracting: (1<=p10)
states: 8
abstracting: (p10<=1)
states: 20
abstracting: (1<=p4)
states: 4
abstracting: (p4<=1)
states: 20
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 20
abstracting: (1<=p8)
states: 6
abstracting: (p8<=1)
states: 20
.....
EG iterations: 5
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 20
abstracting: (1<=p8)
states: 6
abstracting: (p8<=1)
states: 20
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 20
abstracting: (1<=p8)
states: 6
abstracting: (p8<=1)
states: 20
...
EG iterations: 3
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C002-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [[[p5<=1 & 1<=p5] & [[p11<=1 & 1<=p11] & [EG [EX [[[p0<=0 & 0<=p0] | [p3<=0 & 0<=p3]]]] | [[AF [[p6<=0 & 0<=p6]] & [[p6<=1 & 1<=p6] | [[[p1<=1 & 1<=p1] & [[p7<=1 & 1<=p7] & [p8<=1 & 1<=p8]]] | [[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]]]] & [[[p4<=0 & 0<=p4] | [p1<=0 & 0<=p1]] & [[p6<=1 & 1<=p6] | [p1<=1 & 1<=p1]]]]]]]]
normalized: EX [[[[[[[[p1<=1 & 1<=p1] | [p6<=1 & 1<=p6]] & [[p1<=0 & 0<=p1] | [p4<=0 & 0<=p4]]] & [[[[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]] | [[[p8<=1 & 1<=p8] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]]] | [p6<=1 & 1<=p6]] & ~ [EG [~ [[p6<=0 & 0<=p6]]]]]] | EG [EX [[[p3<=0 & 0<=p3] | [p0<=0 & 0<=p0]]]]] & [p11<=1 & 1<=p11]] & [p5<=1 & 1<=p5]]]

abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (1<=p11)
states: 12
abstracting: (p11<=1)
states: 20
abstracting: (0<=p0)
states: 20
abstracting: (p0<=0)
states: 12
abstracting: (0<=p3)
states: 20
abstracting: (p3<=0)
states: 12
....
EG iterations: 3
abstracting: (0<=p6)
states: 20
abstracting: (p6<=0)
states: 16
.....
EG iterations: 5
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 20
abstracting: (1<=p8)
states: 6
abstracting: (p8<=1)
states: 20
abstracting: (1<=p0)
states: 8
abstracting: (p0<=1)
states: 20
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
abstracting: (0<=p4)
states: 20
abstracting: (p4<=0)
states: 16
abstracting: (0<=p1)
states: 20
abstracting: (p1<=0)
states: 12
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C002-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [AF [AX [EG [[[p5<=0 & 0<=p5] | [0<=p2 & p2<=0]]]]] & [EX [[AF [[[p3<=0 & 0<=p3] | [[p9<=0 & 0<=p9] | [p10<=0 & 0<=p10]]]] | EF [[[p5<=1 & 1<=p5] & [p11<=1 & 1<=p11]]]]] | [EX [[[[p0<=0 & 0<=p0] | [p3<=0 & 0<=p3]] & [~ [E [[[p5<=1 & 1<=p5] & [p11<=1 & 1<=p11]] U [[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]]] & E [[[p1<=1 & 1<=p1] & [[p7<=1 & 1<=p7] & [p8<=1 & 1<=p8]]] U [p6<=1 & 1<=p6]]]]] | AX [AX [[p1<=1 & 1<=p1]]]]]]
normalized: [[[~ [EX [EX [~ [[p1<=1 & 1<=p1]]]]] | EX [[[E [[[[p8<=1 & 1<=p8] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]] U [p6<=1 & 1<=p6]] & ~ [E [[[p11<=1 & 1<=p11] & [p5<=1 & 1<=p5]] U [[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]]]]] & [[p3<=0 & 0<=p3] | [p0<=0 & 0<=p0]]]]] | EX [[E [true U [[p11<=1 & 1<=p11] & [p5<=1 & 1<=p5]]] | ~ [EG [~ [[[[p10<=0 & 0<=p10] | [p9<=0 & 0<=p9]] | [p3<=0 & 0<=p3]]]]]]]] & ~ [EG [EX [~ [EG [[[0<=p2 & p2<=0] | [p5<=0 & 0<=p5]]]]]]]]

abstracting: (0<=p5)
states: 20
abstracting: (p5<=0)
states: 12
abstracting: (p2<=0)
states: 14
abstracting: (0<=p2)
states: 20
...
EG iterations: 3
.....
EG iterations: 4
abstracting: (0<=p3)
states: 20
abstracting: (p3<=0)
states: 12
abstracting: (0<=p9)
states: 20
abstracting: (p9<=0)
states: 6
abstracting: (0<=p10)
states: 20
abstracting: (p10<=0)
states: 12
....
EG iterations: 4
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (1<=p11)
states: 12
abstracting: (p11<=1)
states: 20
.abstracting: (0<=p0)
states: 20
abstracting: (p0<=0)
states: 12
abstracting: (0<=p3)
states: 20
abstracting: (p3<=0)
states: 12
abstracting: (1<=p0)
states: 8
abstracting: (p0<=1)
states: 20
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (1<=p11)
states: 12
abstracting: (p11<=1)
states: 20
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 20
abstracting: (1<=p8)
states: 6
abstracting: (p8<=1)
states: 20
.abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
..-> the formula is TRUE

FORMULA ResAllocation-PT-R003C002-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [E [~ [EG [[[[[p3<=1 & 1<=p3] & [[p9<=1 & 1<=p9] & [p10<=1 & 1<=p10]]] | A [[[p2<=1 & 1<=p2] & [p5<=1 & 1<=p5]] U [[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]]] & [AX [[[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]] | [[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]]]]] U [[[p1<=1 & 1<=p1] & [[p7<=1 & 1<=p7] & [p8<=1 & 1<=p8]]] | [[AF [[[p3<=1 & 1<=p3] & [[p9<=1 & 1<=p9] & [p10<=1 & 1<=p10]]]] & [[[p1<=1 & 1<=p1] & [[p7<=1 & 1<=p7] & [p8<=1 & 1<=p8]]] | [[[p2<=1 & 1<=p2] & [p5<=1 & 1<=p5]] | [[p1<=1 & 1<=p1] & [[p7<=1 & 1<=p7] & [p8<=1 & 1<=p8]]]]]] | [EG [[p6<=1 & 1<=p6]] & [p1<=1 & 1<=p1]]]]] | AF [[[p1<=1 & 1<=p1] & [[p7<=1 & 1<=p7] & [p8<=1 & 1<=p8]]]]]
normalized: [E [~ [EG [[[[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]] | ~ [EX [~ [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]]]]]] & [[~ [EG [~ [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]]]]] & ~ [E [~ [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]]] U [~ [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]] & ~ [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]]]]]]] | [[[p10<=1 & 1<=p10] & [p9<=1 & 1<=p9]] & [p3<=1 & 1<=p3]]]]]] U [[[[[[[p2<=1 & 1<=p2] & [p5<=1 & 1<=p5]] | [[[p8<=1 & 1<=p8] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]]] | [[[p8<=1 & 1<=p8] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]]] & ~ [EG [~ [[[[p10<=1 & 1<=p10] & [p9<=1 & 1<=p9]] & [p3<=1 & 1<=p3]]]]]] | [[p1<=1 & 1<=p1] & EG [[p6<=1 & 1<=p6]]]] | [[[p8<=1 & 1<=p8] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]]]] | ~ [EG [~ [[[[p8<=1 & 1<=p8] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]]]]]]

abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 20
abstracting: (1<=p8)
states: 6
abstracting: (p8<=1)
states: 20
...
EG iterations: 3
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 20
abstracting: (1<=p8)
states: 6
abstracting: (p8<=1)
states: 20
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
.....
EG iterations: 5
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
abstracting: (1<=p9)
states: 14
abstracting: (p9<=1)
states: 20
abstracting: (1<=p10)
states: 8
abstracting: (p10<=1)
states: 20
.
EG iterations: 1
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 20
abstracting: (1<=p8)
states: 6
abstracting: (p8<=1)
states: 20
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 20
abstracting: (1<=p8)
states: 6
abstracting: (p8<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
abstracting: (1<=p9)
states: 14
abstracting: (p9<=1)
states: 20
abstracting: (1<=p10)
states: 8
abstracting: (p10<=1)
states: 20
abstracting: (1<=p0)
states: 8
abstracting: (p0<=1)
states: 20
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (1<=p0)
states: 8
abstracting: (p0<=1)
states: 20
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
abstracting: (1<=p0)
states: 8
abstracting: (p0<=1)
states: 20
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
.
EG iterations: 1
abstracting: (1<=p0)
states: 8
abstracting: (p0<=1)
states: 20
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
.abstracting: (1<=p0)
states: 8
abstracting: (p0<=1)
states: 20
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
....
EG iterations: 4
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C002-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 1412 (1.4e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1676 3951 5627
used/not used/entry size/cache size: 4929 67103935 16 1024MB
basic ops cache: hits/miss/sum: 1420 2814 4234
used/not used/entry size/cache size: 4943 16772273 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: 392 172 564
used/not used/entry size/cache size: 172 8388436 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 67107465
1 1386
2 13
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.343sec


BK_STOP 1679180613567

--------------------
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:56 (7), effective:12 (1)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:37 (4), effective:9 (1)

iterations count:36 (4), effective:8 (1)

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

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

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

iterations count:22 (2), effective:5 (0)

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

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

iterations count:30 (3), effective:9 (1)

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-R003C002"
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-R003C002, 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-167889203600666"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C002.tgz
mv ResAllocation-PT-R003C002 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;