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.r266-smll-167863541000458.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 PermAdmissibility-COL-01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863541000458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 01:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 01:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 01:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 54K 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 PermAdmissibility-COL-01-CTLFireability-00
FORMULA_NAME PermAdmissibility-COL-01-CTLFireability-01
FORMULA_NAME PermAdmissibility-COL-01-CTLFireability-02
FORMULA_NAME PermAdmissibility-COL-01-CTLFireability-03
FORMULA_NAME PermAdmissibility-COL-01-CTLFireability-04
FORMULA_NAME PermAdmissibility-COL-01-CTLFireability-05
FORMULA_NAME PermAdmissibility-COL-01-CTLFireability-06
FORMULA_NAME PermAdmissibility-COL-01-CTLFireability-07
FORMULA_NAME PermAdmissibility-COL-01-CTLFireability-08
FORMULA_NAME PermAdmissibility-COL-01-CTLFireability-09
FORMULA_NAME PermAdmissibility-COL-01-CTLFireability-10
FORMULA_NAME PermAdmissibility-COL-01-CTLFireability-11
FORMULA_NAME PermAdmissibility-COL-01-CTLFireability-12
FORMULA_NAME PermAdmissibility-COL-01-CTLFireability-13
FORMULA_NAME PermAdmissibility-COL-01-CTLFireability-14
FORMULA_NAME PermAdmissibility-COL-01-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679075818447

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=PermAdmissibility-COL-01
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 17:57:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 17:57:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 17:57:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-17 17:57:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 17:57:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 743 ms
[2023-03-17 17:57:01] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
[2023-03-17 17:57:01] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 6 ms.
[2023-03-17 17:57:01] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 8 formulas.
FORMULA PermAdmissibility-COL-01-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 588 resets, run finished after 647 ms. (steps per millisecond=15 ) properties (out of 21) seen :16
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 602 ms. (steps per millisecond=16 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 16 rows 40 cols
[2023-03-17 17:57:04] [INFO ] Computed 24 place invariants in 8 ms
[2023-03-17 17:57:04] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 24 ms returned sat
[2023-03-17 17:57:04] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:1
[2023-03-17 17:57:04] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-17 17:57:04] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 5 atomic propositions for a total of 10 simplifications.
[2023-03-17 17:57:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-17 17:57:04] [INFO ] Flatten gal took : 29 ms
[2023-03-17 17:57:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PermAdmissibility-COL-01-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 17:57:04] [INFO ] Flatten gal took : 9 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2023-03-17 17:57:04] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 13 ms.
[2023-03-17 17:57:04] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Support contains 32 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 9 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 32 cols
[2023-03-17 17:57:04] [INFO ] Computed 16 place invariants in 10 ms
[2023-03-17 17:57:04] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-17 17:57:04] [INFO ] Invariant cache hit.
[2023-03-17 17:57:04] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-17 17:57:04] [INFO ] Invariant cache hit.
[2023-03-17 17:57:04] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/40 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 32/40 places, 16/16 transitions.
Support contains 32 out of 32 places after structural reductions.
[2023-03-17 17:57:04] [INFO ] Flatten gal took : 7 ms
[2023-03-17 17:57:04] [INFO ] Flatten gal took : 8 ms
[2023-03-17 17:57:04] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10000 steps, including 588 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 28) seen :23
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-17 17:57:06] [INFO ] Invariant cache hit.
[2023-03-17 17:57:06] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 6 ms returned sat
[2023-03-17 17:57:06] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 17:57:06] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 6 ms returned sat
[2023-03-17 17:57:06] [INFO ] After 111ms SMT Verify possible using all constraints in natural 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-17 17:57:06] [INFO ] Flatten gal took : 15 ms
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 16 ms
[2023-03-17 17:57:07] [INFO ] Input system was already deterministic with 16 transitions.
FORMULA PermAdmissibility-COL-01-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 32 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 28 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 8 ms. Remains 26 /32 variables (removed 6) and now considering 14/16 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 26/32 places, 14/16 transitions.
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 3 ms
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 3 ms
[2023-03-17 17:57:07] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 16/16 transitions.
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 3 ms
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 3 ms
[2023-03-17 17:57:07] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/32 places, 16/16 transitions.
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 2 ms
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 2 ms
[2023-03-17 17:57:07] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/32 places, 16/16 transitions.
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 2 ms
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 3 ms
[2023-03-17 17:57:07] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/32 places, 16/16 transitions.
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 3 ms
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 3 ms
[2023-03-17 17:57:07] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 0 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/32 places, 16/16 transitions.
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 3 ms
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 3 ms
[2023-03-17 17:57:07] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 28 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 3 ms. Remains 27 /32 variables (removed 5) and now considering 14/16 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 27/32 places, 14/16 transitions.
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 1 ms
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 2 ms
[2023-03-17 17:57:07] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/32 places, 16/16 transitions.
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 2 ms
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 3 ms
[2023-03-17 17:57:07] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 32/32 places, 16/16 transitions.
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 3 ms
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 3 ms
[2023-03-17 17:57:07] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 16/16 transitions.
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 2 ms
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 11 ms
[2023-03-17 17:57:07] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 2 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/32 places, 16/16 transitions.
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 2 ms
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 3 ms
[2023-03-17 17:57:07] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 16/16 transitions.
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 5 ms
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 4 ms
[2023-03-17 17:57:07] [INFO ] Input system was already deterministic with 16 transitions.
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 5 ms
[2023-03-17 17:57:07] [INFO ] Flatten gal took : 4 ms
[2023-03-17 17:57:07] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-17 17:57:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 16 transitions and 75 arcs took 1 ms.
Total runtime 6384 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: 32 NrTr: 16 NrArc: 75)

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

net check time: 0m 0.000sec

init dd package: 0m 3.404sec


RS generation: 0m 0.003sec


-> reachability set: #nodes 159 (1.6e+02) #states 17



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

checking: AX [EF [[1<=p24 & [1<=p28 & 1<=p29]]]]
normalized: ~ [EX [~ [E [true U [[1<=p28 & 1<=p29] & 1<=p24]]]]]

abstracting: (1<=p24)
states: 4
abstracting: (1<=p29)
states: 1
abstracting: (1<=p28)
states: 6
.-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [AF [EG [AG [[p18<=0 | [p20<=0 | p22<=0]]]]]]
normalized: EX [~ [EG [~ [EG [~ [E [true U ~ [[[p20<=0 | p22<=0] | p18<=0]]]]]]]]]

abstracting: (p18<=0)
states: 14
abstracting: (p22<=0)
states: 16
abstracting: (p20<=0)
states: 12
.
EG iterations: 1
.......
EG iterations: 7
.-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[AF [[[1<=p30 & 1<=p27] & 1<=p25]] & EF [AG [[p25<=0 | [p27<=0 | p30<=0]]]]]]
normalized: E [true U [E [true U ~ [E [true U ~ [[[p27<=0 | p30<=0] | p25<=0]]]]] & ~ [EG [~ [[[1<=p30 & 1<=p27] & 1<=p25]]]]]]

abstracting: (1<=p25)
states: 5
abstracting: (1<=p27)
states: 3
abstracting: (1<=p30)
states: 1
..............
EG iterations: 14
abstracting: (p25<=0)
states: 12
abstracting: (p30<=0)
states: 16
abstracting: (p27<=0)
states: 14
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[EX [[EX [[1<=p8 & [1<=p9 & 1<=p13]]] | EF [[1<=p11 & [1<=p14 & 1<=p15]]]]] | [1<=p12 & [1<=p14 & 1<=p15]]]]
normalized: ~ [E [true U ~ [[EX [[E [true U [[1<=p14 & 1<=p15] & 1<=p11]] | EX [[1<=p8 & [1<=p9 & 1<=p13]]]]] | [[1<=p14 & 1<=p15] & 1<=p12]]]]]

abstracting: (1<=p12)
states: 1
abstracting: (1<=p15)
states: 4
abstracting: (1<=p14)
states: 4
abstracting: (1<=p13)
states: 2
abstracting: (1<=p9)
states: 1
abstracting: (1<=p8)
states: 2
.abstracting: (1<=p11)
states: 1
abstracting: (1<=p15)
states: 4
abstracting: (1<=p14)
states: 4
.-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [EX [~ [[1<=p24 & [1<=p28 & 1<=p31]]]] U [[AX [[1<=p24 & [1<=p28 & 1<=p29]]] & 1<=p12] & [1<=p14 & 1<=p15]]]
normalized: [~ [EG [~ [[[1<=p14 & 1<=p15] & [~ [EX [~ [[[1<=p28 & 1<=p29] & 1<=p24]]]] & 1<=p12]]]]] & ~ [E [~ [[[1<=p14 & 1<=p15] & [~ [EX [~ [[[1<=p28 & 1<=p29] & 1<=p24]]]] & 1<=p12]]] U [~ [EX [~ [[[1<=p28 & 1<=p31] & 1<=p24]]]] & ~ [[[1<=p14 & 1<=p15] & [~ [EX [~ [[[1<=p28 & 1<=p29] & 1<=p24]]]] & 1<=p12]]]]]]]

abstracting: (1<=p12)
states: 1
abstracting: (1<=p24)
states: 4
abstracting: (1<=p29)
states: 1
abstracting: (1<=p28)
states: 6
.abstracting: (1<=p15)
states: 4
abstracting: (1<=p14)
states: 4
abstracting: (1<=p24)
states: 4
abstracting: (1<=p31)
states: 1
abstracting: (1<=p28)
states: 6
.abstracting: (1<=p12)
states: 1
abstracting: (1<=p24)
states: 4
abstracting: (1<=p29)
states: 1
abstracting: (1<=p28)
states: 6
.abstracting: (1<=p15)
states: 4
abstracting: (1<=p14)
states: 4
abstracting: (1<=p12)
states: 1
abstracting: (1<=p24)
states: 4
abstracting: (1<=p29)
states: 1
abstracting: (1<=p28)
states: 6
.abstracting: (1<=p15)
states: 4
abstracting: (1<=p14)
states: 4

EG iterations: 0
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[E [[1<=p11 & [1<=p14 & 1<=p15]] U [1<=p1 & [1<=p5 & 1<=p7]]] | EF [EX [[1<=p12 & [1<=p14 & 1<=p15]]]]]]
normalized: ~ [E [true U ~ [[E [true U EX [[[1<=p14 & 1<=p15] & 1<=p12]]] | E [[[1<=p14 & 1<=p15] & 1<=p11] U [[1<=p5 & 1<=p7] & 1<=p1]]]]]]

abstracting: (1<=p1)
states: 1
abstracting: (1<=p7)
states: 4
abstracting: (1<=p5)
states: 6
abstracting: (1<=p11)
states: 1
abstracting: (1<=p15)
states: 4
abstracting: (1<=p14)
states: 4
abstracting: (1<=p12)
states: 1
abstracting: (1<=p15)
states: 4
abstracting: (1<=p14)
states: 4
.-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [AF [AG [E [[[1<=p8 & [1<=p9 & 1<=p13]] | [1<=p8 & [1<=p10 & 1<=p13]]] U [[1<=p16 & [1<=p17 & 1<=p23]] | [1<=p25 & [1<=p26 & 1<=p27]]]]]]]
normalized: EG [~ [EG [E [true U ~ [E [[[[1<=p10 & 1<=p13] & 1<=p8] | [[1<=p9 & 1<=p13] & 1<=p8]] U [[[1<=p26 & 1<=p27] & 1<=p25] | [[1<=p17 & 1<=p23] & 1<=p16]]]]]]]]

abstracting: (1<=p16)
states: 4
abstracting: (1<=p23)
states: 1
abstracting: (1<=p17)
states: 6
abstracting: (1<=p25)
states: 5
abstracting: (1<=p27)
states: 3
abstracting: (1<=p26)
states: 1
abstracting: (1<=p8)
states: 2
abstracting: (1<=p13)
states: 2
abstracting: (1<=p9)
states: 1
abstracting: (1<=p8)
states: 2
abstracting: (1<=p13)
states: 2
abstracting: (1<=p10)
states: 1

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [EG [EF [[[[p1<=0 | p5<=0] | [p7<=0 | [1<=p11 & [1<=p14 & 1<=p15]]]] & [[p25<=0 | p27<=0] | [p30<=0 | [[1<=p16 & [1<=p17 & 1<=p23]] | [1<=p1 & [1<=p5 & 1<=p7]]]]]]]]]
normalized: EX [EG [E [true U [[[[[[1<=p5 & 1<=p7] & 1<=p1] | [[1<=p17 & 1<=p23] & 1<=p16]] | p30<=0] | [p25<=0 | p27<=0]] & [[[[1<=p14 & 1<=p15] & 1<=p11] | p7<=0] | [p1<=0 | p5<=0]]]]]]

abstracting: (p5<=0)
states: 11
abstracting: (p1<=0)
states: 16
abstracting: (p7<=0)
states: 13
abstracting: (1<=p11)
states: 1
abstracting: (1<=p15)
states: 4
abstracting: (1<=p14)
states: 4
abstracting: (p27<=0)
states: 14
abstracting: (p25<=0)
states: 12
abstracting: (p30<=0)
states: 16
abstracting: (1<=p16)
states: 4
abstracting: (1<=p23)
states: 1
abstracting: (1<=p17)
states: 6
abstracting: (1<=p1)
states: 1
abstracting: (1<=p7)
states: 4
abstracting: (1<=p5)
states: 6

EG iterations: 0
.-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[EX [~ [A [[1<=p24 & [1<=p28 & 1<=p29]] U [1<=p18 & [1<=p20 & 1<=p22]]]]] | [p24<=0 | p28<=0]] | [p29<=0 | [[1<=p12 & [1<=p14 & 1<=p15]] | A [~ [[1<=p1 & [1<=p5 & 1<=p7]]] U EG [[1<=p11 & [1<=p14 & 1<=p15]]]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [EG [~ [EG [[[1<=p14 & 1<=p15] & 1<=p11]]]]] & ~ [E [~ [EG [[[1<=p14 & 1<=p15] & 1<=p11]]] U [[[1<=p5 & 1<=p7] & 1<=p1] & ~ [EG [[[1<=p14 & 1<=p15] & 1<=p11]]]]]]] | [[1<=p14 & 1<=p15] & 1<=p12]] | p29<=0] | [[p24<=0 | p28<=0] | EX [~ [[~ [EG [~ [[[1<=p20 & 1<=p22] & 1<=p18]]]] & ~ [E [~ [[[1<=p20 & 1<=p22] & 1<=p18]] U [~ [[[1<=p28 & 1<=p29] & 1<=p24]] & ~ [[[1<=p20 & 1<=p22] & 1<=p18]]]]]]]]]]]]]

abstracting: (1<=p18)
states: 3
abstracting: (1<=p22)
states: 1
abstracting: (1<=p20)
states: 5
abstracting: (1<=p24)
states: 4
abstracting: (1<=p29)
states: 1
abstracting: (1<=p28)
states: 6
abstracting: (1<=p18)
states: 3
abstracting: (1<=p22)
states: 1
abstracting: (1<=p20)
states: 5
abstracting: (1<=p18)
states: 3
abstracting: (1<=p22)
states: 1
abstracting: (1<=p20)
states: 5
......
EG iterations: 6
.abstracting: (p28<=0)
states: 11
abstracting: (p24<=0)
states: 13
abstracting: (p29<=0)
states: 16
abstracting: (1<=p12)
states: 1
abstracting: (1<=p15)
states: 4
abstracting: (1<=p14)
states: 4
abstracting: (1<=p11)
states: 1
abstracting: (1<=p15)
states: 4
abstracting: (1<=p14)
states: 4
..
EG iterations: 2
abstracting: (1<=p1)
states: 1
abstracting: (1<=p7)
states: 4
abstracting: (1<=p5)
states: 6
abstracting: (1<=p11)
states: 1
abstracting: (1<=p15)
states: 4
abstracting: (1<=p14)
states: 4
..
EG iterations: 2
abstracting: (1<=p11)
states: 1
abstracting: (1<=p15)
states: 4
abstracting: (1<=p14)
states: 4
..
EG iterations: 2

EG iterations: 0
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [E [AX [E [EG [[1<=p16 & [1<=p17 & 1<=p21]]] U AG [[1<=p25 & [1<=p27 & 1<=p30]]]]] U AX [~ [[EX [[1<=p25 & [1<=p26 & 1<=p27]]] & [~ [[1<=p18 & [1<=p19 & 1<=p20]]] & E [[1<=p12 & [1<=p14 & 1<=p15]] U [1<=p0 & [1<=p5 & 1<=p7]]]]]]]] & AX [A [EF [AG [[1<=p8 & [1<=p9 & 1<=p13]]]] U A [AG [[1<=p18 & [1<=p19 & 1<=p20]]] U [[1<=p25 & [1<=p26 & 1<=p27]] | [[1<=p25 & [1<=p27 & 1<=p30]] | [1<=p24 & [1<=p28 & 1<=p31]]]]]]]]
normalized: [E [~ [EX [~ [E [EG [[[1<=p17 & 1<=p21] & 1<=p16]] U ~ [E [true U ~ [[[1<=p27 & 1<=p30] & 1<=p25]]]]]]]] U ~ [EX [[[E [[[1<=p14 & 1<=p15] & 1<=p12] U [[1<=p5 & 1<=p7] & 1<=p0]] & ~ [[[1<=p19 & 1<=p20] & 1<=p18]]] & EX [[[1<=p26 & 1<=p27] & 1<=p25]]]]]] & ~ [EX [~ [[~ [EG [~ [[~ [EG [~ [[[[[1<=p28 & 1<=p31] & 1<=p24] | [[1<=p27 & 1<=p30] & 1<=p25]] | [[1<=p26 & 1<=p27] & 1<=p25]]]]] & ~ [E [~ [[[[[1<=p28 & 1<=p31] & 1<=p24] | [[1<=p27 & 1<=p30] & 1<=p25]] | [[1<=p26 & 1<=p27] & 1<=p25]]] U [E [true U ~ [[[1<=p19 & 1<=p20] & 1<=p18]]] & ~ [[[[[1<=p28 & 1<=p31] & 1<=p24] | [[1<=p27 & 1<=p30] & 1<=p25]] | [[1<=p26 & 1<=p27] & 1<=p25]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[[[1<=p28 & 1<=p31] & 1<=p24] | [[1<=p27 & 1<=p30] & 1<=p25]] | [[1<=p26 & 1<=p27] & 1<=p25]]]]] & ~ [E [~ [[[[[1<=p28 & 1<=p31] & 1<=p24] | [[1<=p27 & 1<=p30] & 1<=p25]] | [[1<=p26 & 1<=p27] & 1<=p25]]] U [E [true U ~ [[[1<=p19 & 1<=p20] & 1<=p18]]] & ~ [[[[[1<=p28 & 1<=p31] & 1<=p24] | [[1<=p27 & 1<=p30] & 1<=p25]] | [[1<=p26 & 1<=p27] & 1<=p25]]]]]]]] U [~ [E [true U ~ [E [true U ~ [[[1<=p9 & 1<=p13] & 1<=p8]]]]]] & ~ [[~ [EG [~ [[[[[1<=p28 & 1<=p31] & 1<=p24] | [[1<=p27 & 1<=p30] & 1<=p25]] | [[1<=p26 & 1<=p27] & 1<=p25]]]]] & ~ [E [~ [[[[[1<=p28 & 1<=p31] & 1<=p24] | [[1<=p27 & 1<=p30] & 1<=p25]] | [[1<=p26 & 1<=p27] & 1<=p25]]] U [E [true U ~ [[[1<=p19 & 1<=p20] & 1<=p18]]] & ~ [[[[[1<=p28 & 1<=p31] & 1<=p24] | [[1<=p27 & 1<=p30] & 1<=p25]] | [[1<=p26 & 1<=p27] & 1<=p25]]]]]]]]]]]]]]]]

abstracting: (1<=p25)
states: 5
abstracting: (1<=p27)
states: 3
abstracting: (1<=p26)
states: 1
abstracting: (1<=p25)
states: 5
abstracting: (1<=p30)
states: 1
abstracting: (1<=p27)
states: 3
abstracting: (1<=p24)
states: 4
abstracting: (1<=p31)
states: 1
abstracting: (1<=p28)
states: 6
abstracting: (1<=p18)
states: 3
abstracting: (1<=p20)
states: 5
abstracting: (1<=p19)
states: 1
abstracting: (1<=p25)
states: 5
abstracting: (1<=p27)
states: 3
abstracting: (1<=p26)
states: 1
abstracting: (1<=p25)
states: 5
abstracting: (1<=p30)
states: 1
abstracting: (1<=p27)
states: 3
abstracting: (1<=p24)
states: 4
abstracting: (1<=p31)
states: 1
abstracting: (1<=p28)
states: 6
abstracting: (1<=p25)
states: 5
abstracting: (1<=p27)
states: 3
abstracting: (1<=p26)
states: 1
abstracting: (1<=p25)
states: 5
abstracting: (1<=p30)
states: 1
abstracting: (1<=p27)
states: 3
abstracting: (1<=p24)
states: 4
abstracting: (1<=p31)
states: 1
abstracting: (1<=p28)
states: 6
.............
EG iterations: 13
abstracting: (1<=p8)
states: 2
abstracting: (1<=p13)
states: 2
abstracting: (1<=p9)
states: 1
abstracting: (1<=p25)
states: 5
abstracting: (1<=p27)
states: 3
abstracting: (1<=p26)
states: 1
abstracting: (1<=p25)
states: 5
abstracting: (1<=p30)
states: 1
abstracting: (1<=p27)
states: 3
abstracting: (1<=p24)
states: 4
abstracting: (1<=p31)
states: 1
abstracting: (1<=p28)
states: 6
abstracting: (1<=p18)
states: 3
abstracting: (1<=p20)
states: 5
abstracting: (1<=p19)
states: 1
abstracting: (1<=p25)
states: 5
abstracting: (1<=p27)
states: 3
abstracting: (1<=p26)
states: 1
abstracting: (1<=p25)
states: 5
abstracting: (1<=p30)
states: 1
abstracting: (1<=p27)
states: 3
abstracting: (1<=p24)
states: 4
abstracting: (1<=p31)
states: 1
abstracting: (1<=p28)
states: 6
abstracting: (1<=p25)
states: 5
abstracting: (1<=p27)
states: 3
abstracting: (1<=p26)
states: 1
abstracting: (1<=p25)
states: 5
abstracting: (1<=p30)
states: 1
abstracting: (1<=p27)
states: 3
abstracting: (1<=p24)
states: 4
abstracting: (1<=p31)
states: 1
abstracting: (1<=p28)
states: 6
.............
EG iterations: 13
abstracting: (1<=p25)
states: 5
abstracting: (1<=p27)
states: 3
abstracting: (1<=p26)
states: 1
abstracting: (1<=p25)
states: 5
abstracting: (1<=p30)
states: 1
abstracting: (1<=p27)
states: 3
abstracting: (1<=p24)
states: 4
abstracting: (1<=p31)
states: 1
abstracting: (1<=p28)
states: 6
abstracting: (1<=p18)
states: 3
abstracting: (1<=p20)
states: 5
abstracting: (1<=p19)
states: 1
abstracting: (1<=p25)
states: 5
abstracting: (1<=p27)
states: 3
abstracting: (1<=p26)
states: 1
abstracting: (1<=p25)
states: 5
abstracting: (1<=p30)
states: 1
abstracting: (1<=p27)
states: 3
abstracting: (1<=p24)
states: 4
abstracting: (1<=p31)
states: 1
abstracting: (1<=p28)
states: 6
abstracting: (1<=p25)
states: 5
abstracting: (1<=p27)
states: 3
abstracting: (1<=p26)
states: 1
abstracting: (1<=p25)
states: 5
abstracting: (1<=p30)
states: 1
abstracting: (1<=p27)
states: 3
abstracting: (1<=p24)
states: 4
abstracting: (1<=p31)
states: 1
abstracting: (1<=p28)
states: 6
.............
EG iterations: 13
.............
EG iterations: 13
.abstracting: (1<=p25)
states: 5
abstracting: (1<=p27)
states: 3
abstracting: (1<=p26)
states: 1
.abstracting: (1<=p18)
states: 3
abstracting: (1<=p20)
states: 5
abstracting: (1<=p19)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p7)
states: 4
abstracting: (1<=p5)
states: 6
abstracting: (1<=p12)
states: 1
abstracting: (1<=p15)
states: 4
abstracting: (1<=p14)
states: 4
.abstracting: (1<=p25)
states: 5
abstracting: (1<=p30)
states: 1
abstracting: (1<=p27)
states: 3
abstracting: (1<=p16)
states: 4
abstracting: (1<=p21)
states: 1
abstracting: (1<=p17)
states: 6
..
EG iterations: 2
.-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [[AX [[1<=p11 & [1<=p14 & 1<=p15]]] | [AX [[AG [[p2<=0 | [p4<=0 | p6<=0]]] | AF [[1<=p8 & [1<=p10 & 1<=p13]]]]] | [[AG [E [[1<=p24 & [1<=p28 & 1<=p31]] U [1<=p18 & [1<=p20 & 1<=p22]]]] & EF [[p24<=0 | [p28<=0 | p31<=0]]]] & [EX [[1<=p3 & [1<=p4 & 1<=p6]]] & [[AX [[1<=p3 & [1<=p4 & 1<=p6]]] | [EF [[1<=p1 & [1<=p5 & 1<=p7]]] & [p25<=0 | [p26<=0 | p27<=0]]]] & [p1<=0 | [p5<=0 | p7<=0]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[p5<=0 | p7<=0] | p1<=0] & [[[[p26<=0 | p27<=0] | p25<=0] & E [true U [[1<=p5 & 1<=p7] & 1<=p1]]] | ~ [EX [~ [[[1<=p4 & 1<=p6] & 1<=p3]]]]]] & EX [[[1<=p4 & 1<=p6] & 1<=p3]]] & [E [true U [[p28<=0 | p31<=0] | p24<=0]] & ~ [E [true U ~ [E [[[1<=p28 & 1<=p31] & 1<=p24] U [[1<=p20 & 1<=p22] & 1<=p18]]]]]]] | ~ [EX [~ [[~ [EG [~ [[[1<=p10 & 1<=p13] & 1<=p8]]]] | ~ [E [true U ~ [[[p4<=0 | p6<=0] | p2<=0]]]]]]]]] | ~ [EX [~ [[[1<=p14 & 1<=p15] & 1<=p11]]]]]]]]

abstracting: (1<=p11)
states: 1
abstracting: (1<=p15)
states: 4
abstracting: (1<=p14)
states: 4
.abstracting: (p2<=0)
states: 16
abstracting: (p6<=0)
states: 14
abstracting: (p4<=0)
states: 12
abstracting: (1<=p8)
states: 2
abstracting: (1<=p13)
states: 2
abstracting: (1<=p10)
states: 1
.
EG iterations: 1
.abstracting: (1<=p18)
states: 3
abstracting: (1<=p22)
states: 1
abstracting: (1<=p20)
states: 5
abstracting: (1<=p24)
states: 4
abstracting: (1<=p31)
states: 1
abstracting: (1<=p28)
states: 6
abstracting: (p24<=0)
states: 13
abstracting: (p31<=0)
states: 16
abstracting: (p28<=0)
states: 11
abstracting: (1<=p3)
states: 1
abstracting: (1<=p6)
states: 3
abstracting: (1<=p4)
states: 5
.abstracting: (1<=p3)
states: 1
abstracting: (1<=p6)
states: 3
abstracting: (1<=p4)
states: 5
.abstracting: (1<=p1)
states: 1
abstracting: (1<=p7)
states: 4
abstracting: (1<=p5)
states: 6
abstracting: (p25<=0)
states: 12
abstracting: (p27<=0)
states: 14
abstracting: (p26<=0)
states: 16
abstracting: (p1<=0)
states: 16
abstracting: (p7<=0)
states: 13
abstracting: (p5<=0)
states: 11
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[E [[~ [[1<=p11 & [1<=p14 & 1<=p15]]] & [E [[1<=p25 & [1<=p27 & 1<=p30]] U [1<=p25 & [1<=p27 & 1<=p30]]] | [AF [[1<=p12 & [1<=p14 & 1<=p15]]] | EX [[1<=p0 & [1<=p5 & 1<=p7]]]]]] U [[EX [[1<=p18 & [1<=p20 & 1<=p22]]] & AG [[1<=p16 & [1<=p17 & 1<=p21]]]] | EX [[1<=p8 & [1<=p10 & 1<=p13]]]]] | [EX [[1<=p25 & [1<=p27 & 1<=p30]]] | [[[E [[1<=p12 & [1<=p14 & 1<=p15]] U [1<=p25 & [1<=p27 & 1<=p30]]] | p0<=0] | [p5<=0 | p7<=0]] & [EF [[1<=p11 & [1<=p14 & 1<=p15]]] | [[1<=p24 & [1<=p28 & 1<=p31]] | [1<=p25 & [1<=p27 & 1<=p30]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[1<=p27 & 1<=p30] & 1<=p25] | [[1<=p28 & 1<=p31] & 1<=p24]] | E [true U [[1<=p14 & 1<=p15] & 1<=p11]]] & [[p5<=0 | p7<=0] | [E [[[1<=p14 & 1<=p15] & 1<=p12] U [[1<=p27 & 1<=p30] & 1<=p25]] | p0<=0]]] | EX [[[1<=p27 & 1<=p30] & 1<=p25]]] | E [[[[EX [[[1<=p5 & 1<=p7] & 1<=p0]] | ~ [EG [~ [[[1<=p14 & 1<=p15] & 1<=p12]]]]] | E [[[1<=p27 & 1<=p30] & 1<=p25] U [[1<=p27 & 1<=p30] & 1<=p25]]] & ~ [[[1<=p14 & 1<=p15] & 1<=p11]]] U [EX [[[1<=p10 & 1<=p13] & 1<=p8]] | [~ [E [true U ~ [[[1<=p17 & 1<=p21] & 1<=p16]]]] & EX [[[1<=p20 & 1<=p22] & 1<=p18]]]]]]]]]

abstracting: (1<=p18)
states: 3
abstracting: (1<=p22)
states: 1
abstracting: (1<=p20)
states: 5
.abstracting: (1<=p16)
states: 4
abstracting: (1<=p21)
states: 1
abstracting: (1<=p17)
states: 6
abstracting: (1<=p8)
states: 2
abstracting: (1<=p13)
states: 2
abstracting: (1<=p10)
states: 1
.abstracting: (1<=p11)
states: 1
abstracting: (1<=p15)
states: 4
abstracting: (1<=p14)
states: 4
abstracting: (1<=p25)
states: 5
abstracting: (1<=p30)
states: 1
abstracting: (1<=p27)
states: 3
abstracting: (1<=p25)
states: 5
abstracting: (1<=p30)
states: 1
abstracting: (1<=p27)
states: 3
abstracting: (1<=p12)
states: 1
abstracting: (1<=p15)
states: 4
abstracting: (1<=p14)
states: 4
...
EG iterations: 3
abstracting: (1<=p0)
states: 1
abstracting: (1<=p7)
states: 4
abstracting: (1<=p5)
states: 6
.abstracting: (1<=p25)
states: 5
abstracting: (1<=p30)
states: 1
abstracting: (1<=p27)
states: 3
.abstracting: (p0<=0)
states: 16
abstracting: (1<=p25)
states: 5
abstracting: (1<=p30)
states: 1
abstracting: (1<=p27)
states: 3
abstracting: (1<=p12)
states: 1
abstracting: (1<=p15)
states: 4
abstracting: (1<=p14)
states: 4
abstracting: (p7<=0)
states: 13
abstracting: (p5<=0)
states: 11
abstracting: (1<=p11)
states: 1
abstracting: (1<=p15)
states: 4
abstracting: (1<=p14)
states: 4
abstracting: (1<=p24)
states: 4
abstracting: (1<=p31)
states: 1
abstracting: (1<=p28)
states: 6
abstracting: (1<=p25)
states: 5
abstracting: (1<=p30)
states: 1
abstracting: (1<=p27)
states: 3
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

totally nodes used: 3185 (3.2e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5029 13868 18897
used/not used/entry size/cache size: 16728 67092136 16 1024MB
basic ops cache: hits/miss/sum: 1797 7901 9698
used/not used/entry size/cache size: 12521 16764695 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 683 1075
used/not used/entry size/cache size: 683 8387925 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 67105808
1 2978
2 49
3 21
4 2
5 3
6 1
7 1
8 0
9 0
>= 10 1

Total processing time: 0m 5.023sec


BK_STOP 1679075833585

--------------------
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:91 (5), effective:16 (1)

initing FirstDep: 0m 0.000sec


iterations count:87 (5), effective:15 (0)

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

iterations count:74 (4), effective:13 (0)

iterations count:82 (5), effective:14 (0)

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

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

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

iterations count:83 (5), effective:15 (0)

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

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

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

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

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

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

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

iterations count:61 (3), effective:10 (0)

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

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

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

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

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

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

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

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

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

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

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

iterations count:52 (3), effective:9 (0)

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

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

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

iterations count:61 (3), effective:10 (0)

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

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

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

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

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

iterations count:41 (2), effective:7 (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="PermAdmissibility-COL-01"
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 PermAdmissibility-COL-01, 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 r266-smll-167863541000458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-01.tgz
mv PermAdmissibility-COL-01 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 ;