fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r522-tall-167987247400442
Last Updated
May 14, 2023

About the Execution of Marcie+red for PGCD-PT-D02N006

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5449.592 8524.00 11703.00 316.10 TTFFFTFTFTFTTFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r522-tall-167987247400442.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 PGCD-PT-D02N006, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247400442
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 23 15:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 23 15:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Mar 23 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 5.6K Mar 31 16:48 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 PGCD-PT-D02N006-CTLFireability-00
FORMULA_NAME PGCD-PT-D02N006-CTLFireability-01
FORMULA_NAME PGCD-PT-D02N006-CTLFireability-02
FORMULA_NAME PGCD-PT-D02N006-CTLFireability-03
FORMULA_NAME PGCD-PT-D02N006-CTLFireability-04
FORMULA_NAME PGCD-PT-D02N006-CTLFireability-05
FORMULA_NAME PGCD-PT-D02N006-CTLFireability-06
FORMULA_NAME PGCD-PT-D02N006-CTLFireability-07
FORMULA_NAME PGCD-PT-D02N006-CTLFireability-08
FORMULA_NAME PGCD-PT-D02N006-CTLFireability-09
FORMULA_NAME PGCD-PT-D02N006-CTLFireability-10
FORMULA_NAME PGCD-PT-D02N006-CTLFireability-11
FORMULA_NAME PGCD-PT-D02N006-CTLFireability-12
FORMULA_NAME PGCD-PT-D02N006-CTLFireability-13
FORMULA_NAME PGCD-PT-D02N006-CTLFireability-14
FORMULA_NAME PGCD-PT-D02N006-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680818184865

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=PGCD-PT-D02N006
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 21:56:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 21:56:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 21:56:26] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-04-06 21:56:26] [INFO ] Transformed 9 places.
[2023-04-06 21:56:26] [INFO ] Transformed 9 transitions.
[2023-04-06 21:56:26] [INFO ] Parsed PT model containing 9 places and 9 transitions and 42 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 9 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-04-06 21:56:26] [INFO ] Computed 4 invariants in 7 ms
[2023-04-06 21:56:26] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
[2023-04-06 21:56:26] [INFO ] Invariant cache hit.
[2023-04-06 21:56:26] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-06 21:56:26] [INFO ] Invariant cache hit.
[2023-04-06 21:56:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 21:56:26] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-06 21:56:26] [INFO ] Invariant cache hit.
[2023-04-06 21:56:26] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 9/9 places, 9/9 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-04-06 21:56:26] [INFO ] Flatten gal took : 14 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 3 ms
[2023-04-06 21:56:27] [INFO ] Input system was already deterministic with 9 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 29) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:56:27] [INFO ] Invariant cache hit.
[2023-04-06 21:56:27] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 3 ms
[2023-04-06 21:56:27] [INFO ] Input system was already deterministic with 9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:56:27] [INFO ] Invariant cache hit.
[2023-04-06 21:56:27] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:56:27] [INFO ] Invariant cache hit.
[2023-04-06 21:56:27] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:56:27] [INFO ] Invariant cache hit.
[2023-04-06 21:56:27] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:56:27] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 4 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:56:27] [INFO ] Invariant cache hit.
[2023-04-06 21:56:27] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:56:27] [INFO ] Invariant cache hit.
[2023-04-06 21:56:27] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:56:27] [INFO ] Invariant cache hit.
[2023-04-06 21:56:27] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Input system was already deterministic with 9 transitions.
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
FORMULA PGCD-PT-D02N006-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:56:27] [INFO ] Invariant cache hit.
[2023-04-06 21:56:27] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:56:27] [INFO ] Invariant cache hit.
[2023-04-06 21:56:27] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:56:27] [INFO ] Invariant cache hit.
[2023-04-06 21:56:27] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:56:27] [INFO ] Invariant cache hit.
[2023-04-06 21:56:27] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:56:27] [INFO ] Invariant cache hit.
[2023-04-06 21:56:27] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:56:27] [INFO ] Invariant cache hit.
[2023-04-06 21:56:27] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:56:27] [INFO ] Invariant cache hit.
[2023-04-06 21:56:27] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:56:27] [INFO ] Invariant cache hit.
[2023-04-06 21:56:27] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:56:27] [INFO ] Invariant cache hit.
[2023-04-06 21:56:27] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 0 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 5 ms
[2023-04-06 21:56:27] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:56:27] [INFO ] Invariant cache hit.
[2023-04-06 21:56:27] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:56:27] [INFO ] Input system was already deterministic with 9 transitions.
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:56:27] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:56:27] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-04-06 21:56:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 9 transitions and 42 arcs took 0 ms.
Total runtime 1480 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: 9 NrTr: 9 NrArc: 42)

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

net check time: 0m 0.000sec

init dd package: 0m 2.854sec


RS generation: 0m 0.005sec


-> reachability set: #nodes 422 (4.2e+02) #states 15,670 (4)



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

checking: EX [[p2<=0 | p5<=0]]
normalized: EX [[p2<=0 | p5<=0]]

abstracting: (p5<=0)
states: 2,813 (3)
abstracting: (p2<=0)
states: 2,636 (3)
.-> the formula is TRUE

FORMULA PGCD-PT-D02N006-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [EX [EX [[[p2<=0 | p5<=0] | [p8<=0 | [1<=p0 & [1<=p3 & 1<=p6]]]]]]]
normalized: ~ [E [true U ~ [EX [EX [[[[[1<=p3 & 1<=p6] & 1<=p0] | p8<=0] | [p2<=0 | p5<=0]]]]]]]

abstracting: (p5<=0)
states: 2,813 (3)
abstracting: (p2<=0)
states: 2,636 (3)
abstracting: (p8<=0)
states: 2,636 (3)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p3)
states: 12,857 (4)
..-> the formula is TRUE

FORMULA PGCD-PT-D02N006-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [AG [[[p2<=2 | p8<=0] & [AG [[3<=p1 & 1<=p7]] | [p0<=2 | p6<=0]]]]]
normalized: E [true U ~ [E [true U ~ [[[[p0<=2 | p6<=0] | ~ [E [true U ~ [[3<=p1 & 1<=p7]]]]] & [p2<=2 | p8<=0]]]]]]

abstracting: (p8<=0)
states: 2,636 (3)
abstracting: (p2<=2)
states: 7,365 (3)
abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (3<=p1)
states: 8,305 (3)
abstracting: (p6<=0)
states: 2,636 (3)
abstracting: (p0<=2)
states: 7,365 (3)
-> the formula is FALSE

FORMULA PGCD-PT-D02N006-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EG [EF [[A [AX [[1<=p2 & [1<=p5 & 1<=p8]]] U EX [[3<=p2 & 1<=p8]]] & AX [[1<=p0 & [1<=p3 & 1<=p6]]]]]]
normalized: EG [E [true U [~ [EX [~ [[[1<=p3 & 1<=p6] & 1<=p0]]]] & [~ [EG [~ [EX [[3<=p2 & 1<=p8]]]]] & ~ [E [~ [EX [[3<=p2 & 1<=p8]]] U [EX [~ [[[1<=p5 & 1<=p8] & 1<=p2]]] & ~ [EX [[3<=p2 & 1<=p8]]]]]]]]]]

abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
.abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (1<=p5)
states: 12,857 (4)
.abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
.abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
..
EG iterations: 1
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p3)
states: 12,857 (4)
.
EG iterations: 0
-> the formula is TRUE

FORMULA PGCD-PT-D02N006-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AG [[EF [[1<=p7 & 3<=p1]] | ~ [A [[1<=p1 & [1<=p4 & 1<=p7]] U EX [E [[1<=p1 & 1<=p4] U [1<=p2 & 1<=p5]]]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [EG [~ [EX [E [[1<=p1 & 1<=p4] U [1<=p2 & 1<=p5]]]]]] & ~ [E [~ [EX [E [[1<=p1 & 1<=p4] U [1<=p2 & 1<=p5]]]] U [~ [[1<=p1 & [1<=p4 & 1<=p7]]] & ~ [EX [E [[1<=p1 & 1<=p4] U [1<=p2 & 1<=p5]]]]]]]]] | E [true U [1<=p7 & 3<=p1]]]]]]

abstracting: (3<=p1)
states: 8,305 (3)
abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (1<=p5)
states: 12,857 (4)
abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p4)
states: 12,857 (4)
abstracting: (1<=p1)
states: 13,034 (4)
.abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (1<=p4)
states: 12,857 (4)
abstracting: (1<=p1)
states: 13,034 (4)
abstracting: (1<=p5)
states: 12,857 (4)
abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p4)
states: 12,857 (4)
abstracting: (1<=p1)
states: 13,034 (4)
.abstracting: (1<=p5)
states: 12,857 (4)
abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p4)
states: 12,857 (4)
abstracting: (1<=p1)
states: 13,034 (4)
...
EG iterations: 2
-> the formula is TRUE

FORMULA PGCD-PT-D02N006-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AX [[EX [~ [E [[3<=p0 & 1<=p6] U [1<=p0 & [1<=p3 & 1<=p6]]]]] & A [[1<=p2 & [1<=p5 & 1<=p8]] U [1<=p2 & [1<=p5 & 1<=p8]]]]]
normalized: ~ [EX [~ [[[~ [E [~ [[[1<=p5 & 1<=p8] & 1<=p2]] U [~ [[[1<=p5 & 1<=p8] & 1<=p2]] & ~ [[[1<=p5 & 1<=p8] & 1<=p2]]]]] & ~ [EG [~ [[[1<=p5 & 1<=p8] & 1<=p2]]]]] & EX [~ [E [[3<=p0 & 1<=p6] U [[1<=p3 & 1<=p6] & 1<=p0]]]]]]]]

abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
.abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (1<=p5)
states: 12,857 (4)
..
EG iterations: 2
abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (1<=p5)
states: 12,857 (4)
abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (1<=p5)
states: 12,857 (4)
abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (1<=p5)
states: 12,857 (4)
.-> the formula is FALSE

FORMULA PGCD-PT-D02N006-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: [~ [A [[3<=p0 & 1<=p6] U AX [[1<=p2 & [1<=p5 & 1<=p8]]]]] & AF [AG [~ [E [[[3<=p2 & 1<=p8] & [3<=p1 & 1<=p7]] U ~ [[1<=p1 & 1<=p4]]]]]]]
normalized: [~ [EG [E [true U E [[[3<=p1 & 1<=p7] & [3<=p2 & 1<=p8]] U ~ [[1<=p1 & 1<=p4]]]]]] & ~ [[~ [EG [EX [~ [[[1<=p5 & 1<=p8] & 1<=p2]]]]] & ~ [E [EX [~ [[[1<=p5 & 1<=p8] & 1<=p2]]] U [~ [[3<=p0 & 1<=p6]] & EX [~ [[[1<=p5 & 1<=p8] & 1<=p2]]]]]]]]]

abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (1<=p5)
states: 12,857 (4)
.abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (1<=p5)
states: 12,857 (4)
.abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (1<=p5)
states: 12,857 (4)
..
EG iterations: 1
abstracting: (1<=p4)
states: 12,857 (4)
abstracting: (1<=p1)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (3<=p1)
states: 8,305 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA PGCD-PT-D02N006-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [AG [A [[3<=p0 & 1<=p6] U [AF [[1<=p0 & [1<=p3 & 1<=p6]]] & [[1<=p1 & 1<=p4] | [[3<=p1 & 1<=p7] | [[1<=p0 & 1<=p3] & [1<=p6 & 3<=p0]]]]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [EG [~ [[[[[[1<=p6 & 3<=p0] & [1<=p0 & 1<=p3]] | [3<=p1 & 1<=p7]] | [1<=p1 & 1<=p4]] & ~ [EG [~ [[[1<=p3 & 1<=p6] & 1<=p0]]]]]]]] & ~ [E [~ [[[[[[1<=p6 & 3<=p0] & [1<=p0 & 1<=p3]] | [3<=p1 & 1<=p7]] | [1<=p1 & 1<=p4]] & ~ [EG [~ [[[1<=p3 & 1<=p6] & 1<=p0]]]]]] U [~ [[3<=p0 & 1<=p6]] & ~ [[[[[[1<=p6 & 3<=p0] & [1<=p0 & 1<=p3]] | [3<=p1 & 1<=p7]] | [1<=p1 & 1<=p4]] & ~ [EG [~ [[[1<=p3 & 1<=p6] & 1<=p0]]]]]]]]]]]]]]

abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p3)
states: 12,857 (4)
..
EG iterations: 2
abstracting: (1<=p4)
states: 12,857 (4)
abstracting: (1<=p1)
states: 13,034 (4)
abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (3<=p1)
states: 8,305 (3)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p3)
states: 12,857 (4)
..
EG iterations: 2
abstracting: (1<=p4)
states: 12,857 (4)
abstracting: (1<=p1)
states: 13,034 (4)
abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (3<=p1)
states: 8,305 (3)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p3)
states: 12,857 (4)
..
EG iterations: 2
abstracting: (1<=p4)
states: 12,857 (4)
abstracting: (1<=p1)
states: 13,034 (4)
abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (3<=p1)
states: 8,305 (3)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p6)
states: 13,034 (4)
..
EG iterations: 2
-> the formula is FALSE

FORMULA PGCD-PT-D02N006-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: A [AX [[EF [[1<=p2 & [1<=p5 & 1<=p8]]] & ~ [[AX [[1<=p1 & [1<=p4 & 1<=p7]]] | [~ [[3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]] U EF [AG [[1<=p2 & [1<=p5 & 1<=p8]]]]]
normalized: [~ [EG [~ [E [true U ~ [E [true U ~ [[[1<=p5 & 1<=p8] & 1<=p2]]]]]]]] & ~ [E [~ [E [true U ~ [E [true U ~ [[[1<=p5 & 1<=p8] & 1<=p2]]]]]] U [EX [~ [[~ [[[[3<=p0 & 1<=p6] | ~ [[3<=p1 & 1<=p7]]] | ~ [EX [~ [[[1<=p4 & 1<=p7] & 1<=p1]]]]]] & E [true U [[1<=p5 & 1<=p8] & 1<=p2]]]]] & ~ [E [true U ~ [E [true U ~ [[[1<=p5 & 1<=p8] & 1<=p2]]]]]]]]]]

abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (1<=p5)
states: 12,857 (4)
abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (1<=p5)
states: 12,857 (4)
abstracting: (1<=p1)
states: 13,034 (4)
abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (1<=p4)
states: 12,857 (4)
.abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (3<=p1)
states: 8,305 (3)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
.abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (1<=p5)
states: 12,857 (4)
abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (1<=p5)
states: 12,857 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA PGCD-PT-D02N006-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [EF [EG [[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] & [p2<=2 | p8<=0]]]] & AF [[EX [EF [[p2<=0 | p5<=0]]] & [EF [[3<=p1 & 1<=p7]] & AG [AF [[p2<=0 | [p5<=0 | p8<=0]]]]]]]]
normalized: [~ [EG [~ [[[~ [E [true U EG [~ [[[p5<=0 | p8<=0] | p2<=0]]]]] & E [true U [3<=p1 & 1<=p7]]] & EX [E [true U [p2<=0 | p5<=0]]]]]]] & E [true U EG [[[p2<=2 | p8<=0] & [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]]]]

abstracting: (1<=p5)
states: 12,857 (4)
abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p4)
states: 12,857 (4)
abstracting: (1<=p1)
states: 13,034 (4)
abstracting: (p8<=0)
states: 2,636 (3)
abstracting: (p2<=2)
states: 7,365 (3)
.
EG iterations: 1
abstracting: (p5<=0)
states: 2,813 (3)
abstracting: (p2<=0)
states: 2,636 (3)
.abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (3<=p1)
states: 8,305 (3)
abstracting: (p2<=0)
states: 2,636 (3)
abstracting: (p8<=0)
states: 2,636 (3)
abstracting: (p5<=0)
states: 2,813 (3)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA PGCD-PT-D02N006-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

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

abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (1<=p5)
states: 12,857 (4)
.
EG iterations: 1
abstracting: (1<=p5)
states: 12,857 (4)
abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (1<=p5)
states: 12,857 (4)
.
EG iterations: 1
abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (1<=p5)
states: 12,857 (4)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=p1)
states: 13,034 (4)
abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (1<=p4)
states: 12,857 (4)
.abstracting: (p1<=0)
states: 2,636 (3)
abstracting: (p0<=0)
states: 2,636 (3)
abstracting: (p6<=0)
states: 2,636 (3)
abstracting: (p3<=0)
states: 2,813 (3)
abstracting: (p6<=0)
states: 2,636 (3)
abstracting: (p0<=2)
states: 7,365 (3)
abstracting: (p7<=0)
states: 2,636 (3)
abstracting: (p4<=0)
states: 2,813 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA PGCD-PT-D02N006-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AF [[EG [EF [[[[1<=p2 & 1<=p5] & [1<=p8 & [3<=p1 & 1<=p7]]] | [p1<=0 | p4<=0]]]] & E [E [[3<=p1 & [1<=p7 & ~ [[3<=p0 & 1<=p6]]]] U [[AG [[3<=p0 & 1<=p6]] & 3<=p1] & [1<=p7 & [1<=p1 & 1<=p4]]]] U ~ [E [[[1<=p2 & 1<=p5] | [3<=p2 & 1<=p8]] U ~ [[3<=p1 & 1<=p7]]]]]]]
normalized: ~ [EG [~ [[EG [E [true U [[[[3<=p1 & 1<=p7] & 1<=p8] & [1<=p2 & 1<=p5]] | [p1<=0 | p4<=0]]]] & E [E [[[~ [[3<=p0 & 1<=p6]] & 1<=p7] & 3<=p1] U [[[1<=p1 & 1<=p4] & 1<=p7] & [~ [E [true U ~ [[3<=p0 & 1<=p6]]]] & 3<=p1]]] U ~ [E [[[3<=p2 & 1<=p8] | [1<=p2 & 1<=p5]] U ~ [[3<=p1 & 1<=p7]]]]]]]]]

abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (3<=p1)
states: 8,305 (3)
abstracting: (1<=p5)
states: 12,857 (4)
abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
abstracting: (3<=p1)
states: 8,305 (3)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (1<=p4)
states: 12,857 (4)
abstracting: (1<=p1)
states: 13,034 (4)
abstracting: (3<=p1)
states: 8,305 (3)
abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (p4<=0)
states: 2,813 (3)
abstracting: (p1<=0)
states: 2,636 (3)
abstracting: (1<=p5)
states: 12,857 (4)
abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (3<=p1)
states: 8,305 (3)

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

FORMULA PGCD-PT-D02N006-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[AG [AF [[p0<=0 | [p3<=0 | [[1<=p1 & 1<=p4] & [3<=p1 & 1<=p7]]]]]] & [[[AF [[1<=p1 & 1<=p4]] | E [~ [[1<=p0 & [1<=p3 & 1<=p6]]] U EG [[1<=p1 & 1<=p4]]]] | [EG [EF [[3<=p0 & 1<=p6]]] | [p0<=0 | p3<=0]]] | [[p6<=0 | p1<=0] | [p4<=0 | [p7<=0 | [[1<=p0 & 1<=p3] & [3<=p1 & 1<=p7]]]]]]]]
normalized: E [true U [[[[[[[3<=p1 & 1<=p7] & [1<=p0 & 1<=p3]] | p7<=0] | p4<=0] | [p6<=0 | p1<=0]] | [[[p0<=0 | p3<=0] | EG [E [true U [3<=p0 & 1<=p6]]]] | [E [~ [[[1<=p3 & 1<=p6] & 1<=p0]] U EG [[1<=p1 & 1<=p4]]] | ~ [EG [~ [[1<=p1 & 1<=p4]]]]]]] & ~ [E [true U EG [~ [[[[[3<=p1 & 1<=p7] & [1<=p1 & 1<=p4]] | p3<=0] | p0<=0]]]]]]]

abstracting: (p0<=0)
states: 2,636 (3)
abstracting: (p3<=0)
states: 2,813 (3)
abstracting: (1<=p4)
states: 12,857 (4)
abstracting: (1<=p1)
states: 13,034 (4)
abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (3<=p1)
states: 8,305 (3)
...
EG iterations: 3
abstracting: (1<=p4)
states: 12,857 (4)
abstracting: (1<=p1)
states: 13,034 (4)
..
EG iterations: 2
abstracting: (1<=p4)
states: 12,857 (4)
abstracting: (1<=p1)
states: 13,034 (4)
.
EG iterations: 1
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)

EG iterations: 0
abstracting: (p3<=0)
states: 2,813 (3)
abstracting: (p0<=0)
states: 2,636 (3)
abstracting: (p1<=0)
states: 2,636 (3)
abstracting: (p6<=0)
states: 2,636 (3)
abstracting: (p4<=0)
states: 2,813 (3)
abstracting: (p7<=0)
states: 2,636 (3)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (3<=p1)
states: 8,305 (3)
-> the formula is FALSE

FORMULA PGCD-PT-D02N006-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

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

abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p5)
states: 12,857 (4)
abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (3<=p1)
states: 8,305 (3)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p2)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (1<=p5)
states: 12,857 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p3)
states: 12,857 (4)
...
EG iterations: 2
abstracting: (1<=p1)
states: 13,034 (4)
abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (1<=p4)
states: 12,857 (4)
abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (3<=p1)
states: 8,305 (3)
-> the formula is TRUE

FORMULA PGCD-PT-D02N006-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: [EF [AX [[~ [E [[1<=p1 & 1<=p4] U [1<=p0 & 1<=p3]]] & [3<=p2 & 1<=p8]]]] & A [[1<=p1 & [1<=p4 & 1<=p7]] U [[A [[3<=p0 & 1<=p6] U [[[3<=p2 & 1<=p8] | [3<=p0 & 1<=p6]] & [1<=p0 & 1<=p3]]] | E [[AX [[1<=p0 & 1<=p3]] & [[3<=p2 & 1<=p8] | [3<=p0 & 1<=p6]]] U AG [AX [[1<=p0 & [1<=p3 & 1<=p6]]]]]] | [[1<=p0 & 1<=p3] | [1<=p0 & [1<=p3 & 1<=p6]]]]]]
normalized: [[~ [EG [~ [[[E [[[[3<=p0 & 1<=p6] | [3<=p2 & 1<=p8]] & ~ [EX [~ [[1<=p0 & 1<=p3]]]]] U ~ [E [true U EX [~ [[[1<=p3 & 1<=p6] & 1<=p0]]]]]] | [~ [EG [~ [[[1<=p0 & 1<=p3] & [[3<=p0 & 1<=p6] | [3<=p2 & 1<=p8]]]]]] & ~ [E [~ [[[1<=p0 & 1<=p3] & [[3<=p0 & 1<=p6] | [3<=p2 & 1<=p8]]]] U [~ [[3<=p0 & 1<=p6]] & ~ [[[1<=p0 & 1<=p3] & [[3<=p0 & 1<=p6] | [3<=p2 & 1<=p8]]]]]]]]] | [[[1<=p3 & 1<=p6] & 1<=p0] | [1<=p0 & 1<=p3]]]]]] & ~ [E [~ [[[E [[[[3<=p0 & 1<=p6] | [3<=p2 & 1<=p8]] & ~ [EX [~ [[1<=p0 & 1<=p3]]]]] U ~ [E [true U EX [~ [[[1<=p3 & 1<=p6] & 1<=p0]]]]]] | [~ [EG [~ [[[1<=p0 & 1<=p3] & [[3<=p0 & 1<=p6] | [3<=p2 & 1<=p8]]]]]] & ~ [E [~ [[[1<=p0 & 1<=p3] & [[3<=p0 & 1<=p6] | [3<=p2 & 1<=p8]]]] U [~ [[3<=p0 & 1<=p6]] & ~ [[[1<=p0 & 1<=p3] & [[3<=p0 & 1<=p6] | [3<=p2 & 1<=p8]]]]]]]]] | [[[1<=p3 & 1<=p6] & 1<=p0] | [1<=p0 & 1<=p3]]]] U [~ [[[E [[[[3<=p0 & 1<=p6] | [3<=p2 & 1<=p8]] & ~ [EX [~ [[1<=p0 & 1<=p3]]]]] U ~ [E [true U EX [~ [[[1<=p3 & 1<=p6] & 1<=p0]]]]]] | [~ [EG [~ [[[1<=p0 & 1<=p3] & [[3<=p0 & 1<=p6] | [3<=p2 & 1<=p8]]]]]] & ~ [E [~ [[[1<=p0 & 1<=p3] & [[3<=p0 & 1<=p6] | [3<=p2 & 1<=p8]]]] U [~ [[3<=p0 & 1<=p6]] & ~ [[[1<=p0 & 1<=p3] & [[3<=p0 & 1<=p6] | [3<=p2 & 1<=p8]]]]]]]]] | [[[1<=p3 & 1<=p6] & 1<=p0] | [1<=p0 & 1<=p3]]]] & ~ [[[1<=p4 & 1<=p7] & 1<=p1]]]]]] & E [true U ~ [EX [~ [[[3<=p2 & 1<=p8] & ~ [E [[1<=p1 & 1<=p4] U [1<=p0 & 1<=p3]]]]]]]]]

abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p4)
states: 12,857 (4)
abstracting: (1<=p1)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
.abstracting: (1<=p1)
states: 13,034 (4)
abstracting: (1<=p7)
states: 13,034 (4)
abstracting: (1<=p4)
states: 12,857 (4)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
..
EG iterations: 2
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p3)
states: 12,857 (4)
.abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
.abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
..
EG iterations: 2
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p3)
states: 12,857 (4)
.abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
.abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
..
EG iterations: 2
abstracting: (1<=p0)
states: 13,034 (4)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (1<=p3)
states: 12,857 (4)
.abstracting: (1<=p3)
states: 12,857 (4)
abstracting: (1<=p0)
states: 13,034 (4)
.abstracting: (1<=p8)
states: 13,034 (4)
abstracting: (3<=p2)
states: 8,305 (3)
abstracting: (1<=p6)
states: 13,034 (4)
abstracting: (3<=p0)
states: 8,305 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA PGCD-PT-D02N006-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

totally nodes used: 34665 (3.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 203783 85231 289014
used/not used/entry size/cache size: 112673 66996191 16 1024MB
basic ops cache: hits/miss/sum: 90894 44969 135863
used/not used/entry size/cache size: 83924 16693292 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: 5701 2342 8043
used/not used/entry size/cache size: 2342 8386266 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 67078718
1 28003
2 1403
3 372
4 158
5 60
6 32
7 17
8 10
9 18
>= 10 73

Total processing time: 0m 4.597sec


BK_STOP 1680818193389

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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:509 (56), effective:169 (18)

initing FirstDep: 0m 0.000sec


iterations count:85 (9), effective:17 (1)

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

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

iterations count:91 (10), effective:26 (2)

iterations count:84 (9), effective:22 (2)

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

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

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

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

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

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

iterations count:43 (4), effective:17 (1)

iterations count:65 (7), effective:14 (1)

iterations count:61 (6), effective:16 (1)

iterations count:83 (9), effective:17 (1)

iterations count:59 (6), effective:33 (3)

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

iterations count:29 (3), effective:5 (0)

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

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

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

iterations count:72 (8), effective:20 (2)

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

iterations count:84 (9), effective:22 (2)

iterations count:29 (3), effective:5 (0)

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

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

iterations count:53 (5), effective:18 (2)

iterations count:76 (8), effective:15 (1)

iterations count:43 (4), effective:17 (1)

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

iterations count:60 (6), effective:15 (1)

iterations count:75 (8), effective:16 (1)

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

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

iterations count:129 (14), effective:55 (6)

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

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

iterations count:27 (3), effective:5 (0)

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

iterations count:172 (19), effective:55 (6)

iterations count:56 (6), effective:16 (1)

iterations count:27 (3), effective:17 (1)

iterations count:56 (6), effective:16 (1)

iterations count:27 (3), effective:17 (1)

iterations count:54 (6), effective:9 (1)

iterations count:56 (6), effective:16 (1)

iterations count:27 (3), effective:17 (1)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PGCD-PT-D02N006"
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 PGCD-PT-D02N006, 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 r522-tall-167987247400442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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