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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 5.9K Feb 25 15:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 15:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 15:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 15:26 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 4.0K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 16K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 15:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 15:27 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 35K 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-R003C005-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R003C005-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R003C005-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R003C005-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R003C005-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R003C005-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R003C005-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R003C005-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R003C005-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R003C005-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R003C005-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C005-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C005-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C005-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C005-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C005-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679180731949

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-R003C005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:05:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:05:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:05:33] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2023-03-18 23:05:33] [INFO ] Transformed 30 places.
[2023-03-18 23:05:33] [INFO ] Transformed 20 transitions.
[2023-03-18 23:05:33] [INFO ] Parsed PT model containing 30 places and 20 transitions and 84 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Initial state reduction rules removed 3 formulas.
FORMULA ResAllocation-PT-R003C005-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C005-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C005-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 30 cols
[2023-03-18 23:05:33] [INFO ] Computed 15 place invariants in 9 ms
[2023-03-18 23:05:33] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-18 23:05:33] [INFO ] Invariant cache hit.
[2023-03-18 23:05:33] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-18 23:05:33] [INFO ] Invariant cache hit.
[2023-03-18 23:05:33] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 30/30 places, 20/20 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 16 ms
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:05:34] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10000 steps, including 762 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 37) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 197 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 172 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 185 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-18 23:05:34] [INFO ] Invariant cache hit.
[2023-03-18 23:05:34] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-18 23:05:34] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:05:34] [INFO ] Input system was already deterministic with 20 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:34] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:05:34] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:34] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:34] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:34] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 25 transition count 16
Applied a total of 9 rules in 7 ms. Remains 25 /30 variables (removed 5) and now considering 16/20 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 25/30 places, 16/20 transitions.
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:05:34] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:34] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 24 transition count 15
Applied a total of 11 rules in 4 ms. Remains 24 /30 variables (removed 6) and now considering 15/20 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 24/30 places, 15/20 transitions.
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:34] [INFO ] Input system was already deterministic with 15 transitions.
Finished random walk after 13 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
FORMULA ResAllocation-PT-R003C005-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:05:34] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:34] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 20/20 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 28 transition count 19
Applied a total of 3 rules in 2 ms. Remains 28 /30 variables (removed 2) and now considering 19/20 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 28/30 places, 19/20 transitions.
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:34] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:34] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:05:34] [INFO ] Input system was already deterministic with 20 transitions.
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:34] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:34] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-18 23:05:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 20 transitions and 84 arcs took 1 ms.
Total runtime 1654 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: 30 NrTr: 20 NrArc: 84)

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

net check time: 0m 0.000sec

init dd package: 0m 2.858sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 166 (1.7e+02) #states 1,200 (3)



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

checking: EF [EX [0<=0]]
normalized: E [true U EX [0<=0]]

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

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

MC time: 0m 0.002sec

checking: AX [AX [EX [EG [p28<=0]]]]
normalized: ~ [EX [EX [~ [EX [EG [p28<=0]]]]]]

abstracting: (p28<=0)
states: 832
.
EG iterations: 1
...-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: AF [p1<=0]
normalized: ~ [EG [~ [p1<=0]]]

abstracting: (p1<=0)
states: 640
...........
EG iterations: 11
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: [EX [AX [1<=0]] | EF [[1<=p0 & 1<=p3]]]
normalized: [E [true U [1<=p0 & 1<=p3]] | EX [~ [EX [~ [1<=0]]]]]

abstracting: (1<=0)
states: 0
..abstracting: (1<=p3)
states: 528
abstracting: (1<=p0)
states: 560
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: AF [EX [[1<=p1 & [1<=p7 & 1<=p8]]]]
normalized: ~ [EG [~ [EX [[[1<=p7 & 1<=p8] & 1<=p1]]]]]

abstracting: (1<=p1)
states: 560
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
.....
EG iterations: 4
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EG [EX [AG [[AX [[1<=p1 & [1<=p7 & 1<=p8]]] | [1<=p17 & 1<=p23]]]]]
normalized: EG [EX [~ [E [true U ~ [[[1<=p17 & 1<=p23] | ~ [EX [~ [[[1<=p7 & 1<=p8] & 1<=p1]]]]]]]]]]

abstracting: (1<=p1)
states: 560
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
.abstracting: (1<=p23)
states: 480
abstracting: (1<=p17)
states: 592
....
EG iterations: 3
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: AF [AG [[EX [EG [[1<=p23 & [1<=p26 & 1<=p29]]]] & A [1<=p28 U EX [[1<=p11 & [1<=p14 & 1<=p17]]]]]]]
normalized: ~ [EG [E [true U ~ [[EX [EG [[1<=p23 & [1<=p26 & 1<=p29]]]] & [~ [EG [~ [EX [[1<=p11 & [1<=p14 & 1<=p17]]]]]] & ~ [E [~ [EX [[1<=p11 & [1<=p14 & 1<=p17]]]] U [~ [1<=p28] & ~ [EX [[1<=p11 & [1<=p14 & 1<=p17]]]]]]]]]]]]]

abstracting: (1<=p17)
states: 592
abstracting: (1<=p14)
states: 416
abstracting: (1<=p11)
states: 592
.abstracting: (1<=p28)
states: 368
abstracting: (1<=p17)
states: 592
abstracting: (1<=p14)
states: 416
abstracting: (1<=p11)
states: 592
.abstracting: (1<=p17)
states: 592
abstracting: (1<=p14)
states: 416
abstracting: (1<=p11)
states: 592
..
EG iterations: 1
abstracting: (1<=p29)
states: 832
abstracting: (1<=p26)
states: 488
abstracting: (1<=p23)
states: 480
........
EG iterations: 8
.
EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C005-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [AX [[[[AX [[1<=p15 & [1<=p21 & 1<=p22]]] & AX [[1<=p3 & [1<=p9 & 1<=p10]]]] & [AF [1<=p4] & 1<=p17]] & [[1<=p23 & 1<=p1] & [1<=p7 & 1<=p8]]]]]
normalized: ~ [E [true U EX [~ [[[[1<=p7 & 1<=p8] & [1<=p23 & 1<=p1]] & [[~ [EG [~ [1<=p4]]] & 1<=p17] & [~ [EX [~ [[[1<=p9 & 1<=p10] & 1<=p3]]]] & ~ [EX [~ [[[1<=p21 & 1<=p22] & 1<=p15]]]]]]]]]]]

abstracting: (1<=p15)
states: 600
abstracting: (1<=p22)
states: 352
abstracting: (1<=p21)
states: 528
.abstracting: (1<=p3)
states: 528
abstracting: (1<=p10)
states: 352
abstracting: (1<=p9)
states: 600
.abstracting: (1<=p17)
states: 592
abstracting: (1<=p4)
states: 368
.
EG iterations: 1
abstracting: (1<=p1)
states: 560
abstracting: (1<=p23)
states: 480
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C005-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AF [[[1<=p15 & [1<=p21 & 1<=p22]] | [1<=p7 & [1<=p13 & [AG [[[p13<=0 | p19<=0] | [p20<=0 | [p5<=0 | p11<=0]]]] | [1<=p19 & [1<=p20 & [p15<=0 | [p21<=0 | p22<=0]]]]]]]]]
normalized: ~ [EG [~ [[[[[[[[[p21<=0 | p22<=0] | p15<=0] & 1<=p20] & 1<=p19] | ~ [E [true U ~ [[[[p5<=0 | p11<=0] | p20<=0] | [p13<=0 | p19<=0]]]]]] & 1<=p13] & 1<=p7] | [[1<=p21 & 1<=p22] & 1<=p15]]]]]

abstracting: (1<=p15)
states: 600
abstracting: (1<=p22)
states: 352
abstracting: (1<=p21)
states: 528
abstracting: (1<=p7)
states: 592
abstracting: (1<=p13)
states: 592
abstracting: (p19<=0)
states: 640
abstracting: (p13<=0)
states: 608
abstracting: (p20<=0)
states: 1,016 (3)
abstracting: (p11<=0)
states: 608
abstracting: (p5<=0)
states: 720
abstracting: (1<=p19)
states: 560
abstracting: (1<=p20)
states: 184
abstracting: (p15<=0)
states: 600
abstracting: (p22<=0)
states: 848
abstracting: (p21<=0)
states: 672
......
EG iterations: 6
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C005-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EG [AX [[EG [[p11<=0 | [p14<=0 | p17<=0]]] & [EF [[1<=p2 & [1<=p5 & 1<=p1]]] & [[[AF [[1<=p3 & [1<=p9 & 1<=p10]]] & 1<=p9] & [1<=p12 & [1<=p15 & [p3<=0 | [p9<=0 | p10<=0]]]]] | [EX [[1<=p21 & [1<=p24 & 1<=p27]]] & [1<=p19 & 1<=p25]]]]]]]
normalized: EG [~ [EX [~ [[[[[[1<=p19 & 1<=p25] & EX [[[1<=p24 & 1<=p27] & 1<=p21]]] | [[[[[p9<=0 | p10<=0] | p3<=0] & 1<=p15] & 1<=p12] & [~ [EG [~ [[[1<=p9 & 1<=p10] & 1<=p3]]]] & 1<=p9]]] & E [true U [[1<=p5 & 1<=p1] & 1<=p2]]] & EG [[[p14<=0 | p17<=0] | p11<=0]]]]]]]

abstracting: (p11<=0)
states: 608
abstracting: (p17<=0)
states: 608
abstracting: (p14<=0)
states: 784
.
EG iterations: 1
abstracting: (1<=p2)
states: 488
abstracting: (1<=p1)
states: 560
abstracting: (1<=p5)
states: 480
abstracting: (1<=p9)
states: 600
abstracting: (1<=p3)
states: 528
abstracting: (1<=p10)
states: 352
abstracting: (1<=p9)
states: 600
.
EG iterations: 1
abstracting: (1<=p12)
states: 528
abstracting: (1<=p15)
states: 600
abstracting: (p3<=0)
states: 672
abstracting: (p10<=0)
states: 848
abstracting: (p9<=0)
states: 600
abstracting: (1<=p21)
states: 528
abstracting: (1<=p27)
states: 712
abstracting: (1<=p24)
states: 560
.abstracting: (1<=p25)
states: 640
abstracting: (1<=p19)
states: 560
..
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C005-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: A [EG [A [EF [[1<=p19 & 1<=p25]] U [1<=p1 & [1<=p7 & 1<=p8]]]] U [A [AX [[[1<=p1 & [1<=p7 & 1<=p8]] | [1<=p17 & 1<=p23]]] U [AG [[[1<=p3 & [1<=p9 & 1<=p10]] | 1<=p6]] | A [[1<=p21 & [1<=p24 & 1<=p27]] U 1<=p4]]] | E [AF [[[1<=p21 & 1<=p24] & [1<=p27 & 1<=p1]]] U EX [[AX [[1<=p1 & [1<=p7 & 1<=p8]]] | ~ [[1<=p1 & [1<=p7 & 1<=p8]]]]]]]]
normalized: [~ [EG [~ [[E [~ [EG [~ [[[1<=p27 & 1<=p1] & [1<=p21 & 1<=p24]]]]] U EX [[~ [[[1<=p7 & 1<=p8] & 1<=p1]] | ~ [EX [~ [[[1<=p7 & 1<=p8] & 1<=p1]]]]]]] | [~ [EG [~ [[[~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [[[1<=p24 & 1<=p27] & 1<=p21]] & ~ [1<=p4]]]]] | ~ [E [true U ~ [[[[1<=p9 & 1<=p10] & 1<=p3] | 1<=p6]]]]]]]] & ~ [E [~ [[[~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [[[1<=p24 & 1<=p27] & 1<=p21]] & ~ [1<=p4]]]]] | ~ [E [true U ~ [[[[1<=p9 & 1<=p10] & 1<=p3] | 1<=p6]]]]]] U [EX [~ [[[1<=p17 & 1<=p23] | [[1<=p7 & 1<=p8] & 1<=p1]]]] & ~ [[[~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [[[1<=p24 & 1<=p27] & 1<=p21]] & ~ [1<=p4]]]]] | ~ [E [true U ~ [[[[1<=p9 & 1<=p10] & 1<=p3] | 1<=p6]]]]]]]]]]]]]] & ~ [E [~ [[E [~ [EG [~ [[[1<=p27 & 1<=p1] & [1<=p21 & 1<=p24]]]]] U EX [[~ [[[1<=p7 & 1<=p8] & 1<=p1]] | ~ [EX [~ [[[1<=p7 & 1<=p8] & 1<=p1]]]]]]] | [~ [EG [~ [[[~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [[[1<=p24 & 1<=p27] & 1<=p21]] & ~ [1<=p4]]]]] | ~ [E [true U ~ [[[[1<=p9 & 1<=p10] & 1<=p3] | 1<=p6]]]]]]]] & ~ [E [~ [[[~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [[[1<=p24 & 1<=p27] & 1<=p21]] & ~ [1<=p4]]]]] | ~ [E [true U ~ [[[[1<=p9 & 1<=p10] & 1<=p3] | 1<=p6]]]]]] U [EX [~ [[[1<=p17 & 1<=p23] | [[1<=p7 & 1<=p8] & 1<=p1]]]] & ~ [[[~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [[[1<=p24 & 1<=p27] & 1<=p21]] & ~ [1<=p4]]]]] | ~ [E [true U ~ [[[[1<=p9 & 1<=p10] & 1<=p3] | 1<=p6]]]]]]]]]]]] U [~ [EG [[~ [EG [~ [[[1<=p7 & 1<=p8] & 1<=p1]]]] & ~ [E [~ [[[1<=p7 & 1<=p8] & 1<=p1]] U [~ [E [true U [1<=p19 & 1<=p25]]] & ~ [[[1<=p7 & 1<=p8] & 1<=p1]]]]]]]] & ~ [[E [~ [EG [~ [[[1<=p27 & 1<=p1] & [1<=p21 & 1<=p24]]]]] U EX [[~ [[[1<=p7 & 1<=p8] & 1<=p1]] | ~ [EX [~ [[[1<=p7 & 1<=p8] & 1<=p1]]]]]]] | [~ [EG [~ [[[~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [[[1<=p24 & 1<=p27] & 1<=p21]] & ~ [1<=p4]]]]] | ~ [E [true U ~ [[[[1<=p9 & 1<=p10] & 1<=p3] | 1<=p6]]]]]]]] & ~ [E [~ [[[~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [[[1<=p24 & 1<=p27] & 1<=p21]] & ~ [1<=p4]]]]] | ~ [E [true U ~ [[[[1<=p9 & 1<=p10] & 1<=p3] | 1<=p6]]]]]] U [EX [~ [[[1<=p17 & 1<=p23] | [[1<=p7 & 1<=p8] & 1<=p1]]]] & ~ [[[~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [[[1<=p24 & 1<=p27] & 1<=p21]] & ~ [1<=p4]]]]] | ~ [E [true U ~ [[[[1<=p9 & 1<=p10] & 1<=p3] | 1<=p6]]]]]]]]]]]]]]]]

abstracting: (1<=p6)
states: 80
abstracting: (1<=p3)
states: 528
abstracting: (1<=p10)
states: 352
abstracting: (1<=p9)
states: 600
abstracting: (1<=p4)
states: 368
abstracting: (1<=p21)
states: 528
abstracting: (1<=p27)
states: 712
abstracting: (1<=p24)
states: 560
abstracting: (1<=p4)
states: 368
abstracting: (1<=p4)
states: 368
.
EG iterations: 1
abstracting: (1<=p1)
states: 560
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
abstracting: (1<=p23)
states: 480
abstracting: (1<=p17)
states: 592
.abstracting: (1<=p6)
states: 80
abstracting: (1<=p3)
states: 528
abstracting: (1<=p10)
states: 352
abstracting: (1<=p9)
states: 600
abstracting: (1<=p4)
states: 368
abstracting: (1<=p21)
states: 528
abstracting: (1<=p27)
states: 712
abstracting: (1<=p24)
states: 560
abstracting: (1<=p4)
states: 368
abstracting: (1<=p4)
states: 368
.
EG iterations: 1
abstracting: (1<=p6)
states: 80
abstracting: (1<=p3)
states: 528
abstracting: (1<=p10)
states: 352
abstracting: (1<=p9)
states: 600
abstracting: (1<=p4)
states: 368
abstracting: (1<=p21)
states: 528
abstracting: (1<=p27)
states: 712
abstracting: (1<=p24)
states: 560
abstracting: (1<=p4)
states: 368
abstracting: (1<=p4)
states: 368
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p1)
states: 560
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
.abstracting: (1<=p1)
states: 560
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
.abstracting: (1<=p24)
states: 560
abstracting: (1<=p21)
states: 528
abstracting: (1<=p1)
states: 560
abstracting: (1<=p27)
states: 712
.
EG iterations: 1
abstracting: (1<=p1)
states: 560
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
abstracting: (1<=p25)
states: 640
abstracting: (1<=p19)
states: 560
abstracting: (1<=p1)
states: 560
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
abstracting: (1<=p1)
states: 560
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
.....
EG iterations: 5
.....
EG iterations: 5
abstracting: (1<=p6)
states: 80
abstracting: (1<=p3)
states: 528
abstracting: (1<=p10)
states: 352
abstracting: (1<=p9)
states: 600
abstracting: (1<=p4)
states: 368
abstracting: (1<=p21)
states: 528
abstracting: (1<=p27)
states: 712
abstracting: (1<=p24)
states: 560
abstracting: (1<=p4)
states: 368
abstracting: (1<=p4)
states: 368
.
EG iterations: 1
abstracting: (1<=p1)
states: 560
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
abstracting: (1<=p23)
states: 480
abstracting: (1<=p17)
states: 592
.abstracting: (1<=p6)
states: 80
abstracting: (1<=p3)
states: 528
abstracting: (1<=p10)
states: 352
abstracting: (1<=p9)
states: 600
abstracting: (1<=p4)
states: 368
abstracting: (1<=p21)
states: 528
abstracting: (1<=p27)
states: 712
abstracting: (1<=p24)
states: 560
abstracting: (1<=p4)
states: 368
abstracting: (1<=p4)
states: 368
.
EG iterations: 1
abstracting: (1<=p6)
states: 80
abstracting: (1<=p3)
states: 528
abstracting: (1<=p10)
states: 352
abstracting: (1<=p9)
states: 600
abstracting: (1<=p4)
states: 368
abstracting: (1<=p21)
states: 528
abstracting: (1<=p27)
states: 712
abstracting: (1<=p24)
states: 560
abstracting: (1<=p4)
states: 368
abstracting: (1<=p4)
states: 368
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p1)
states: 560
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
.abstracting: (1<=p1)
states: 560
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
.abstracting: (1<=p24)
states: 560
abstracting: (1<=p21)
states: 528
abstracting: (1<=p1)
states: 560
abstracting: (1<=p27)
states: 712
.
EG iterations: 1
abstracting: (1<=p6)
states: 80
abstracting: (1<=p3)
states: 528
abstracting: (1<=p10)
states: 352
abstracting: (1<=p9)
states: 600
abstracting: (1<=p4)
states: 368
abstracting: (1<=p21)
states: 528
abstracting: (1<=p27)
states: 712
abstracting: (1<=p24)
states: 560
abstracting: (1<=p4)
states: 368
abstracting: (1<=p4)
states: 368
.
EG iterations: 1
abstracting: (1<=p1)
states: 560
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
abstracting: (1<=p23)
states: 480
abstracting: (1<=p17)
states: 592
.abstracting: (1<=p6)
states: 80
abstracting: (1<=p3)
states: 528
abstracting: (1<=p10)
states: 352
abstracting: (1<=p9)
states: 600
abstracting: (1<=p4)
states: 368
abstracting: (1<=p21)
states: 528
abstracting: (1<=p27)
states: 712
abstracting: (1<=p24)
states: 560
abstracting: (1<=p4)
states: 368
abstracting: (1<=p4)
states: 368
.
EG iterations: 1
abstracting: (1<=p6)
states: 80
abstracting: (1<=p3)
states: 528
abstracting: (1<=p10)
states: 352
abstracting: (1<=p9)
states: 600
abstracting: (1<=p4)
states: 368
abstracting: (1<=p21)
states: 528
abstracting: (1<=p27)
states: 712
abstracting: (1<=p24)
states: 560
abstracting: (1<=p4)
states: 368
abstracting: (1<=p4)
states: 368
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p1)
states: 560
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
.abstracting: (1<=p1)
states: 560
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
.abstracting: (1<=p24)
states: 560
abstracting: (1<=p21)
states: 528
abstracting: (1<=p1)
states: 560
abstracting: (1<=p27)
states: 712
.
EG iterations: 1
..
EG iterations: 2
-> the formula is TRUE

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

MC time: 0m 0.010sec

checking: E [[AX [[[[A [[1<=p21 & [1<=p24 & 1<=p27]] U [1<=p17 & 1<=p23]] & E [[1<=p9 & [1<=p12 & 1<=p15]] U [1<=p7 & 1<=p13]]] & [1<=p1 & 1<=p21]] & [[1<=p24 & 1<=p27] & [1<=p5 & 1<=p11]]]] & E [[AX [[1<=p17 & 1<=p23]] & [A [1<=p1 U [1<=p13 & [1<=p19 & 1<=p20]]] & [~ [[1<=p7 & 1<=p13]] | AF [[1<=p23 & [1<=p26 & 1<=p29]]]]]] U AF [[[[1<=p21 & [1<=p24 & 1<=p27]] | [1<=p5 & 1<=p11]] | [[1<=p1 & [1<=p7 & 1<=p8]] | [1<=p13 & [1<=p19 & 1<=p20]]]]]]] U [EG [[AF [[1<=p7 & 1<=p13]] | [[1<=p23 & [1<=p26 & 1<=p29]] | AG [E [[1<=p21 & [1<=p24 & 1<=p27]] U 1<=p18]]]]] & [~ [AX [~ [[1<=p11 & [1<=p14 & 1<=p17]]]]] | [~ [A [A [1<=p18 U 1<=p18] U [[1<=p13 & [1<=p19 & 1<=p20]] & [1<=p1 & [1<=p7 & 1<=p8]]]]] | ~ [[AG [EX [[1<=p2 & 1<=p5]]] | ~ [[AG [[1<=p0 & 1<=p3]] | [[1<=p23 & [1<=p26 & 1<=p29]] | [1<=p3 & [1<=p9 & 1<=p10]]]]]]]]]]]
normalized: E [[E [[[[~ [EG [~ [[[1<=p26 & 1<=p29] & 1<=p23]]]] | ~ [[1<=p7 & 1<=p13]]] & [~ [EG [~ [[[1<=p19 & 1<=p20] & 1<=p13]]]] & ~ [E [~ [[[1<=p19 & 1<=p20] & 1<=p13]] U [~ [1<=p1] & ~ [[[1<=p19 & 1<=p20] & 1<=p13]]]]]]] & ~ [EX [~ [[1<=p17 & 1<=p23]]]]] U ~ [EG [~ [[[[[1<=p19 & 1<=p20] & 1<=p13] | [[1<=p7 & 1<=p8] & 1<=p1]] | [[1<=p5 & 1<=p11] | [[1<=p24 & 1<=p27] & 1<=p21]]]]]]] & ~ [EX [~ [[[[1<=p5 & 1<=p11] & [1<=p24 & 1<=p27]] & [[1<=p1 & 1<=p21] & [E [[[1<=p12 & 1<=p15] & 1<=p9] U [1<=p7 & 1<=p13]] & [~ [EG [~ [[1<=p17 & 1<=p23]]]] & ~ [E [~ [[1<=p17 & 1<=p23]] U [~ [[[1<=p24 & 1<=p27] & 1<=p21]] & ~ [[1<=p17 & 1<=p23]]]]]]]]]]]]] U [[[~ [[~ [[[[[1<=p9 & 1<=p10] & 1<=p3] | [[1<=p26 & 1<=p29] & 1<=p23]] | ~ [E [true U ~ [[1<=p0 & 1<=p3]]]]]] | ~ [E [true U ~ [EX [[1<=p2 & 1<=p5]]]]]]] | ~ [[~ [EG [~ [[[[1<=p7 & 1<=p8] & 1<=p1] & [[1<=p19 & 1<=p20] & 1<=p13]]]]] & ~ [E [~ [[[[1<=p7 & 1<=p8] & 1<=p1] & [[1<=p19 & 1<=p20] & 1<=p13]]] U [~ [[~ [EG [~ [1<=p18]]] & ~ [E [~ [1<=p18] U [~ [1<=p18] & ~ [1<=p18]]]]]] & ~ [[[[1<=p7 & 1<=p8] & 1<=p1] & [[1<=p19 & 1<=p20] & 1<=p13]]]]]]]]] | EX [[[1<=p14 & 1<=p17] & 1<=p11]]] & EG [[[~ [E [true U ~ [E [[[1<=p24 & 1<=p27] & 1<=p21] U 1<=p18]]]] | [[1<=p26 & 1<=p29] & 1<=p23]] | ~ [EG [~ [[1<=p7 & 1<=p13]]]]]]]]

abstracting: (1<=p13)
states: 592
abstracting: (1<=p7)
states: 592
.......
EG iterations: 7
abstracting: (1<=p23)
states: 480
abstracting: (1<=p29)
states: 832
abstracting: (1<=p26)
states: 488
abstracting: (1<=p18)
states: 80
abstracting: (1<=p21)
states: 528
abstracting: (1<=p27)
states: 712
abstracting: (1<=p24)
states: 560
........
EG iterations: 8
abstracting: (1<=p11)
states: 592
abstracting: (1<=p17)
states: 592
abstracting: (1<=p14)
states: 416
.abstracting: (1<=p13)
states: 592
abstracting: (1<=p20)
states: 184
abstracting: (1<=p19)
states: 560
abstracting: (1<=p1)
states: 560
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
abstracting: (1<=p18)
states: 80
abstracting: (1<=p18)
states: 80
abstracting: (1<=p18)
states: 80
abstracting: (1<=p18)
states: 80
.
EG iterations: 1
abstracting: (1<=p13)
states: 592
abstracting: (1<=p20)
states: 184
abstracting: (1<=p19)
states: 560
abstracting: (1<=p1)
states: 560
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
abstracting: (1<=p13)
states: 592
abstracting: (1<=p20)
states: 184
abstracting: (1<=p19)
states: 560
abstracting: (1<=p1)
states: 560
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
.
EG iterations: 1
abstracting: (1<=p5)
states: 480
abstracting: (1<=p2)
states: 488
.abstracting: (1<=p3)
states: 528
abstracting: (1<=p0)
states: 560
abstracting: (1<=p23)
states: 480
abstracting: (1<=p29)
states: 832
abstracting: (1<=p26)
states: 488
abstracting: (1<=p3)
states: 528
abstracting: (1<=p10)
states: 352
abstracting: (1<=p9)
states: 600
abstracting: (1<=p23)
states: 480
abstracting: (1<=p17)
states: 592
abstracting: (1<=p21)
states: 528
abstracting: (1<=p27)
states: 712
abstracting: (1<=p24)
states: 560
abstracting: (1<=p23)
states: 480
abstracting: (1<=p17)
states: 592
abstracting: (1<=p23)
states: 480
abstracting: (1<=p17)
states: 592
..........
EG iterations: 10
abstracting: (1<=p13)
states: 592
abstracting: (1<=p7)
states: 592
abstracting: (1<=p9)
states: 600
abstracting: (1<=p15)
states: 600
abstracting: (1<=p12)
states: 528
abstracting: (1<=p21)
states: 528
abstracting: (1<=p1)
states: 560
abstracting: (1<=p27)
states: 712
abstracting: (1<=p24)
states: 560
abstracting: (1<=p11)
states: 592
abstracting: (1<=p5)
states: 480
.abstracting: (1<=p21)
states: 528
abstracting: (1<=p27)
states: 712
abstracting: (1<=p24)
states: 560
abstracting: (1<=p11)
states: 592
abstracting: (1<=p5)
states: 480
abstracting: (1<=p1)
states: 560
abstracting: (1<=p8)
states: 184
abstracting: (1<=p7)
states: 592
abstracting: (1<=p13)
states: 592
abstracting: (1<=p20)
states: 184
abstracting: (1<=p19)
states: 560
..........
EG iterations: 10
abstracting: (1<=p23)
states: 480
abstracting: (1<=p17)
states: 592
.abstracting: (1<=p13)
states: 592
abstracting: (1<=p20)
states: 184
abstracting: (1<=p19)
states: 560
abstracting: (1<=p1)
states: 560
abstracting: (1<=p13)
states: 592
abstracting: (1<=p20)
states: 184
abstracting: (1<=p19)
states: 560
abstracting: (1<=p13)
states: 592
abstracting: (1<=p20)
states: 184
abstracting: (1<=p19)
states: 560
.....
EG iterations: 5
abstracting: (1<=p13)
states: 592
abstracting: (1<=p7)
states: 592
abstracting: (1<=p23)
states: 480
abstracting: (1<=p29)
states: 832
abstracting: (1<=p26)
states: 488
........
EG iterations: 8
-> the formula is TRUE

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

MC time: 0m 0.022sec

totally nodes used: 58361 (5.8e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 26085 106584 132669
used/not used/entry size/cache size: 152390 66956474 16 1024MB
basic ops cache: hits/miss/sum: 11056 39015 50071
used/not used/entry size/cache size: 78118 16699098 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: 821 2370 3191
used/not used/entry size/cache size: 2370 8386238 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 67052007
1 55407
2 1396
3 54
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.816sec


BK_STOP 1679180740773

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:154 (7), effective:30 (1)

initing FirstDep: 0m 0.000sec


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

iterations count:39 (1), effective:6 (0)

iterations count:80 (4), effective:12 (0)

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

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

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

iterations count:138 (6), effective:19 (0)

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

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

iterations count:68 (3), effective:7 (0)

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

iterations count:68 (3), effective:7 (0)

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

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

iterations count:68 (3), effective:7 (0)

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

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

iterations count:100 (5), effective:12 (0)

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

iterations count:68 (3), effective:7 (0)

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

iterations count:68 (3), effective:7 (0)

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

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

iterations count:68 (3), effective:7 (0)

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

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

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

iterations count:68 (3), effective:7 (0)

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

iterations count:68 (3), effective:7 (0)

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

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

iterations count:68 (3), effective:7 (0)

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

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

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

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

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

iterations count:31 (1), effective:5 (0)

iterations count:32 (1), effective:4 (0)

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

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

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

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

iterations count:20 (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-R003C005"
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-R003C005, 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-167889203600682"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C005.tgz
mv ResAllocation-PT-R003C005 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 ;