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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 1002507.00 0.00 0.00 T?TTTTFTTTFFFTFF normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.5K Mar 23 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 23 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 23 15:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K 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 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Mar 23 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Mar 23 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K 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 12K 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-D05N025-CTLFireability-00
FORMULA_NAME PGCD-PT-D05N025-CTLFireability-01
FORMULA_NAME PGCD-PT-D05N025-CTLFireability-02
FORMULA_NAME PGCD-PT-D05N025-CTLFireability-03
FORMULA_NAME PGCD-PT-D05N025-CTLFireability-04
FORMULA_NAME PGCD-PT-D05N025-CTLFireability-05
FORMULA_NAME PGCD-PT-D05N025-CTLFireability-06
FORMULA_NAME PGCD-PT-D05N025-CTLFireability-07
FORMULA_NAME PGCD-PT-D05N025-CTLFireability-08
FORMULA_NAME PGCD-PT-D05N025-CTLFireability-09
FORMULA_NAME PGCD-PT-D05N025-CTLFireability-10
FORMULA_NAME PGCD-PT-D05N025-CTLFireability-11
FORMULA_NAME PGCD-PT-D05N025-CTLFireability-12
FORMULA_NAME PGCD-PT-D05N025-CTLFireability-13
FORMULA_NAME PGCD-PT-D05N025-CTLFireability-14
FORMULA_NAME PGCD-PT-D05N025-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680819700737

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-D05N025
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 22:21:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 22:21:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:21:42] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-04-06 22:21:42] [INFO ] Transformed 18 places.
[2023-04-06 22:21:42] [INFO ] Transformed 18 transitions.
[2023-04-06 22:21:42] [INFO ] Parsed PT model containing 18 places and 18 transitions and 84 arcs in 79 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PGCD-PT-D05N025-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-PT-D05N025-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-PT-D05N025-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 9 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2023-04-06 22:21:42] [INFO ] Computed 7 invariants in 10 ms
[2023-04-06 22:21:42] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
[2023-04-06 22:21:42] [INFO ] Invariant cache hit.
[2023-04-06 22:21:42] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-06 22:21:42] [INFO ] Invariant cache hit.
[2023-04-06 22:21:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 22:21:42] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-06 22:21:42] [INFO ] Invariant cache hit.
[2023-04-06 22:21:42] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 18/18 places, 18/18 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-06 22:21:42] [INFO ] Flatten gal took : 14 ms
[2023-04-06 22:21:42] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:21:42] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 2749 steps, including 0 resets, run visited all 31 properties in 29 ms. (steps per millisecond=94 )
Parikh walk visited 0 properties in 0 ms.
[2023-04-06 22:21:42] [INFO ] Flatten gal took : 4 ms
[2023-04-06 22:21:42] [INFO ] Flatten gal took : 3 ms
[2023-04-06 22:21:42] [INFO ] Input system was already deterministic with 18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 22:21:42] [INFO ] Invariant cache hit.
[2023-04-06 22:21:43] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 3 ms
[2023-04-06 22:21:43] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 22:21:43] [INFO ] Invariant cache hit.
[2023-04-06 22:21:43] [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 : 18/18 places, 18/18 transitions.
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:21:43] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 22:21:43] [INFO ] Invariant cache hit.
[2023-04-06 22:21:43] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:21:43] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 22:21:43] [INFO ] Invariant cache hit.
[2023-04-06 22:21:43] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:21:43] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 22:21:43] [INFO ] Invariant cache hit.
[2023-04-06 22:21:43] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:21:43] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 22:21:43] [INFO ] Invariant cache hit.
[2023-04-06 22:21:43] [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 : 18/18 places, 18/18 transitions.
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:21:43] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 22:21:43] [INFO ] Invariant cache hit.
[2023-04-06 22:21:43] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:21:43] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 22:21:43] [INFO ] Invariant cache hit.
[2023-04-06 22:21:43] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:21:43] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 22:21:43] [INFO ] Invariant cache hit.
[2023-04-06 22:21:43] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:21:43] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 7 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 22:21:43] [INFO ] Invariant cache hit.
[2023-04-06 22:21:43] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:21:43] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 22:21:43] [INFO ] Invariant cache hit.
[2023-04-06 22:21:43] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 2 ms
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:21:43] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 22:21:43] [INFO ] Invariant cache hit.
[2023-04-06 22:21:43] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:21:43] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-06 22:21:43] [INFO ] Invariant cache hit.
[2023-04-06 22:21:43] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:21:43] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 82 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=82 )
FORMULA PGCD-PT-D05N025-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Parikh walk visited 0 properties in 0 ms.
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:21:43] [INFO ] Flatten gal took : 1 ms
[2023-04-06 22:21:43] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-04-06 22:21:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 18 transitions and 84 arcs took 0 ms.
Total runtime 1375 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: 18 NrTr: 18 NrArc: 84)

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

net check time: 0m 0.000sec

init dd package: 0m 2.734sec


RS generation: 0m21.762sec


-> reachability set: #nodes 35891 (3.6e+04) #states 1,585,536,525,017,640 (15)



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

checking: EF [EG [AF [AX [AG [[3<=p3 & 1<=p15]]]]]]
normalized: E [true U EG [~ [EG [EX [E [true U ~ [[3<=p3 & 1<=p15]]]]]]]]

abstracting: (1<=p15)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p3)
states: 1,288,265,167,040,904 (15)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA PGCD-PT-D05N025-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 6.371sec

checking: AF [EG [[3<=p4 & 1<=p16]]]
normalized: ~ [EG [~ [EG [[3<=p4 & 1<=p16]]]]]

abstracting: (1<=p16)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p4)
states: 1,288,265,167,040,904 (15)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 2.571sec

checking: EX [AG [[1<=p4 & [1<=p10 & 1<=p16]]]]
normalized: EX [~ [E [true U ~ [[1<=p4 & [1<=p10 & 1<=p16]]]]]]

abstracting: (1<=p16)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p10)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p4)
states: 1,478,081,241,198,900 (15)
.-> the formula is FALSE

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

MC time: 0m 6.922sec

checking: E [EX [[3<=p5 & 1<=p17]] U ~ [[1<=p0 & 1<=p6]]]
normalized: E [EX [[3<=p5 & 1<=p17]] U ~ [[1<=p0 & 1<=p6]]]

abstracting: (1<=p6)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p0)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p17)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p5)
states: 1,288,265,167,040,904 (15)
.-> the formula is FALSE

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

MC time: 0m 5.161sec

checking: AG [~ [E [[[AF [~ [[3<=p3 & 1<=p15]]] & 1<=p3] & [1<=p9 & 1<=p15]] U AG [AX [[3<=p1 & 1<=p13]]]]]]
normalized: ~ [E [true U E [[[1<=p9 & 1<=p15] & [1<=p3 & ~ [EG [[3<=p3 & 1<=p15]]]]] U ~ [E [true U EX [~ [[3<=p1 & 1<=p13]]]]]]]]

abstracting: (1<=p13)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p1)
states: 1,288,265,167,040,904 (15)
.abstracting: (1<=p15)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p3)
states: 1,288,265,167,040,904 (15)
.
EG iterations: 1
abstracting: (1<=p3)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p15)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p9)
states: 1,478,081,079,561,424 (15)
MC time: 7m12.075sec

checking: AG [[EF [[1<=p3 & 1<=p9]] | AX [[EF [[3<=p4 & 1<=p16]] | [EX [[1<=p3 & 1<=p9]] | [[p0<=0 | [p6<=0 | p12<=0]] & [3<=p1 & 1<=p13]]]]]]]
normalized: ~ [E [true U ~ [[~ [EX [~ [[[[[3<=p1 & 1<=p13] & [p0<=0 | [p6<=0 | p12<=0]]] | EX [[1<=p3 & 1<=p9]]] | E [true U [3<=p4 & 1<=p16]]]]]] | E [true U [1<=p3 & 1<=p9]]]]]]

abstracting: (1<=p9)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p3)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p16)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p4)
states: 1,288,265,167,040,904 (15)
abstracting: (1<=p9)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p3)
states: 1,478,081,241,198,900 (15)
.abstracting: (p12<=0)
states: 107,455,283,818,740 (14)
abstracting: (p6<=0)
states: 107,455,445,456,216 (14)
abstracting: (p0<=0)
states: 107,455,283,818,740 (14)
abstracting: (1<=p13)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p1)
states: 1,288,265,167,040,904 (15)
.-> the formula is TRUE

FORMULA PGCD-PT-D05N025-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.758sec

checking: [A [AF [[1<=p4 & 1<=p10]] U [AX [~ [AG [[1<=p2 & [1<=p8 & 1<=p14]]]]] & [EF [[1<=p5 & 1<=p11]] & ~ [[3<=p4 & 1<=p16]]]]] | EX [[1<=p1 & 1<=p7]]]
normalized: [EX [[1<=p1 & 1<=p7]] | [~ [EG [~ [[[~ [[3<=p4 & 1<=p16]] & E [true U [1<=p5 & 1<=p11]]] & ~ [EX [~ [E [true U ~ [[1<=p2 & [1<=p8 & 1<=p14]]]]]]]]]]] & ~ [E [~ [[[~ [[3<=p4 & 1<=p16]] & E [true U [1<=p5 & 1<=p11]]] & ~ [EX [~ [E [true U ~ [[1<=p2 & [1<=p8 & 1<=p14]]]]]]]]] U [EG [~ [[1<=p4 & 1<=p10]]] & ~ [[[~ [[3<=p4 & 1<=p16]] & E [true U [1<=p5 & 1<=p11]]] & ~ [EX [~ [E [true U ~ [[1<=p2 & [1<=p8 & 1<=p14]]]]]]]]]]]]]]

abstracting: (1<=p14)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p8)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p2)
states: 1,478,081,241,198,900 (15)
.abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p16)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p4)
states: 1,288,265,167,040,904 (15)
abstracting: (1<=p10)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p4)
states: 1,478,081,241,198,900 (15)
.......
EG iterations: 7
abstracting: (1<=p14)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p8)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p2)
states: 1,478,081,241,198,900 (15)
.abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p16)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p4)
states: 1,288,265,167,040,904 (15)
abstracting: (1<=p14)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p8)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p2)
states: 1,478,081,241,198,900 (15)
.abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p16)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p4)
states: 1,288,265,167,040,904 (15)
.
EG iterations: 1
abstracting: (1<=p7)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p1)
states: 1,478,081,241,198,900 (15)
.-> the formula is TRUE

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

MC time: 0m30.046sec

checking: AG [[AF [[1<=p5 & [1<=p11 & ~ [A [[1<=p2 & [1<=p8 & 1<=p14]] U [1<=p5 & 1<=p11]]]]]] & AF [[[3<=p3 & 1<=p15] & [3<=p1 & 1<=p13]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[3<=p1 & 1<=p13] & [3<=p3 & 1<=p15]]]]] & ~ [EG [~ [[1<=p5 & [1<=p11 & ~ [[~ [EG [~ [[1<=p5 & 1<=p11]]]] & ~ [E [~ [[1<=p5 & 1<=p11]] U [~ [[1<=p2 & [1<=p8 & 1<=p14]]] & ~ [[1<=p5 & 1<=p11]]]]]]]]]]]]]]]]

abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p14)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p8)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p2)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
.......
EG iterations: 7
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)

EG iterations: 0
abstracting: (1<=p15)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p3)
states: 1,288,265,167,040,904 (15)
abstracting: (1<=p13)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p1)
states: 1,288,265,167,040,904 (15)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PGCD-PT-D05N025-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.493sec

checking: [EG [[EX [[[[[p2<=0 | p8<=0] | [p5<=0 | p11<=0]] & 1<=p3] & [1<=p9 & 1<=p15]]] & EF [[[EG [[p0<=0 | [p6<=0 | p12<=0]]] | [p2<=0 | p8<=0]] | [[p14<=0 | p4<=0] | [p10<=0 | p16<=0]]]]]] & EF [AG [AX [[[1<=p2 & 1<=p8] & [1<=p1 & [1<=p7 & A [[3<=p2 & 1<=p14] U [1<=p3 & 1<=p9]]]]]]]]]
normalized: [E [true U ~ [E [true U EX [~ [[[1<=p1 & [1<=p7 & [~ [EG [~ [[1<=p3 & 1<=p9]]]] & ~ [E [~ [[1<=p3 & 1<=p9]] U [~ [[3<=p2 & 1<=p14]] & ~ [[1<=p3 & 1<=p9]]]]]]]] & [1<=p2 & 1<=p8]]]]]]] & EG [[E [true U [[[p10<=0 | p16<=0] | [p14<=0 | p4<=0]] | [[p2<=0 | p8<=0] | EG [[p0<=0 | [p6<=0 | p12<=0]]]]]] & EX [[[1<=p9 & 1<=p15] & [1<=p3 & [[p5<=0 | p11<=0] | [p2<=0 | p8<=0]]]]]]]]

abstracting: (p8<=0)
states: 107,455,445,456,216 (14)
abstracting: (p2<=0)
states: 107,455,283,818,740 (14)
abstracting: (p11<=0)
states: 107,455,445,456,216 (14)
abstracting: (p5<=0)
states: 107,455,283,818,740 (14)
abstracting: (1<=p3)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p15)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p9)
states: 1,478,081,079,561,424 (15)
.abstracting: (p12<=0)
states: 107,455,283,818,740 (14)
abstracting: (p6<=0)
states: 107,455,445,456,216 (14)
abstracting: (p0<=0)
states: 107,455,283,818,740 (14)
.......
EG iterations: 7
abstracting: (p8<=0)
states: 107,455,445,456,216 (14)
abstracting: (p2<=0)
states: 107,455,283,818,740 (14)
abstracting: (p4<=0)
states: 107,455,283,818,740 (14)
abstracting: (p14<=0)
states: 107,455,283,818,740 (14)
abstracting: (p16<=0)
states: 107,455,283,818,740 (14)
abstracting: (p10<=0)
states: 107,455,445,456,216 (14)
..
EG iterations: 2
abstracting: (1<=p8)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p2)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p9)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p3)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p14)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p2)
states: 1,288,265,167,040,904 (15)
abstracting: (1<=p9)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p3)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p9)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p3)
states: 1,478,081,241,198,900 (15)
.......
EG iterations: 7
abstracting: (1<=p7)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p1)
states: 1,478,081,241,198,900 (15)
.-> the formula is TRUE

FORMULA PGCD-PT-D05N025-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m17.639sec

checking: [AG [[[[1<=p0 & 1<=p6] | [1<=p5 & 1<=p11]] | [AX [[p4<=0 | [p10<=0 | p16<=0]]] | [A [AX [[3<=p1 & 1<=p13]] U AX [[1<=p2 & [1<=p8 & 1<=p14]]]] | EF [[[3<=p4 & 1<=p16] | [1<=p5 & [1<=p11 & 1<=p17]]]]]]]] & AX [[[1<=p0 & [1<=p6 & 1<=p12]] | EG [A [[1<=p3 & 1<=p9] U [1<=p2 & 1<=p8]]]]]]
normalized: [~ [EX [~ [[EG [[~ [E [~ [[1<=p2 & 1<=p8]] U [~ [[1<=p3 & 1<=p9]] & ~ [[1<=p2 & 1<=p8]]]]] & ~ [EG [~ [[1<=p2 & 1<=p8]]]]]] | [1<=p0 & [1<=p6 & 1<=p12]]]]]] & ~ [E [true U ~ [[[[E [true U [[1<=p5 & [1<=p11 & 1<=p17]] | [3<=p4 & 1<=p16]]] | [~ [EG [EX [~ [[1<=p2 & [1<=p8 & 1<=p14]]]]]] & ~ [E [EX [~ [[1<=p2 & [1<=p8 & 1<=p14]]]] U [EX [~ [[3<=p1 & 1<=p13]]] & EX [~ [[1<=p2 & [1<=p8 & 1<=p14]]]]]]]]] | ~ [EX [~ [[p4<=0 | [p10<=0 | p16<=0]]]]]] | [[1<=p5 & 1<=p11] | [1<=p0 & 1<=p6]]]]]]]

abstracting: (1<=p6)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p0)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (p16<=0)
states: 107,455,283,818,740 (14)
abstracting: (p10<=0)
states: 107,455,445,456,216 (14)
abstracting: (p4<=0)
states: 107,455,283,818,740 (14)
.abstracting: (1<=p14)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p8)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p2)
states: 1,478,081,241,198,900 (15)
.abstracting: (1<=p13)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p1)
states: 1,288,265,167,040,904 (15)
.abstracting: (1<=p14)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p8)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p2)
states: 1,478,081,241,198,900 (15)
.abstracting: (1<=p14)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p8)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p2)
states: 1,478,081,241,198,900 (15)
..
EG iterations: 1
abstracting: (1<=p16)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p4)
states: 1,288,265,167,040,904 (15)
abstracting: (1<=p17)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p12)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p6)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p0)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p8)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p2)
states: 1,478,081,241,198,900 (15)
.......
EG iterations: 7
abstracting: (1<=p8)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p2)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p9)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p3)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p8)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p2)
states: 1,478,081,241,198,900 (15)
..
EG iterations: 2
.-> the formula is TRUE

FORMULA PGCD-PT-D05N025-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.589sec

checking: A [E [[[~ [[3<=p0 & [1<=p12 & A [[1<=p1 & [1<=p7 & 1<=p13]] U [1<=p5 & [1<=p11 & 1<=p17]]]]]] & 1<=p5] & [1<=p11 & 1<=p17]] U ~ [[AF [E [[3<=p3 & 1<=p15] U [3<=p1 & 1<=p13]]] & A [[1<=p4 & [1<=p10 & 1<=p16]] U EF [[3<=p1 & 1<=p13]]]]]] U [[1<=p4 & 1<=p10] & [1<=p16 & [~ [AX [A [[3<=p1 & 1<=p13] U [1<=p5 & 1<=p11]]]] | AX [~ [A [[1<=p1 & [1<=p7 & 1<=p13]] U [1<=p0 & 1<=p6]]]]]]]]
normalized: [~ [EG [~ [[[1<=p16 & [~ [EX [[~ [EG [~ [[1<=p0 & 1<=p6]]]] & ~ [E [~ [[1<=p0 & 1<=p6]] U [~ [[1<=p1 & [1<=p7 & 1<=p13]]] & ~ [[1<=p0 & 1<=p6]]]]]]]] | EX [~ [[~ [EG [~ [[1<=p5 & 1<=p11]]]] & ~ [E [~ [[1<=p5 & 1<=p11]] U [~ [[3<=p1 & 1<=p13]] & ~ [[1<=p5 & 1<=p11]]]]]]]]]] & [1<=p4 & 1<=p10]]]]] & ~ [E [~ [[[1<=p16 & [~ [EX [[~ [EG [~ [[1<=p0 & 1<=p6]]]] & ~ [E [~ [[1<=p0 & 1<=p6]] U [~ [[1<=p1 & [1<=p7 & 1<=p13]]] & ~ [[1<=p0 & 1<=p6]]]]]]]] | EX [~ [[~ [EG [~ [[1<=p5 & 1<=p11]]]] & ~ [E [~ [[1<=p5 & 1<=p11]] U [~ [[3<=p1 & 1<=p13]] & ~ [[1<=p5 & 1<=p11]]]]]]]]]] & [1<=p4 & 1<=p10]]] U [~ [E [[[1<=p11 & 1<=p17] & [1<=p5 & ~ [[3<=p0 & [1<=p12 & [~ [EG [~ [[1<=p5 & [1<=p11 & 1<=p17]]]]] & ~ [E [~ [[1<=p5 & [1<=p11 & 1<=p17]]] U [~ [[1<=p1 & [1<=p7 & 1<=p13]]] & ~ [[1<=p5 & [1<=p11 & 1<=p17]]]]]]]]]]]] U ~ [[[~ [EG [~ [E [true U [3<=p1 & 1<=p13]]]]] & ~ [E [~ [E [true U [3<=p1 & 1<=p13]]] U [~ [[1<=p4 & [1<=p10 & 1<=p16]]] & ~ [E [true U [3<=p1 & 1<=p13]]]]]]] & ~ [EG [~ [E [[3<=p3 & 1<=p15] U [3<=p1 & 1<=p13]]]]]]]]] & ~ [[[1<=p16 & [~ [EX [[~ [EG [~ [[1<=p0 & 1<=p6]]]] & ~ [E [~ [[1<=p0 & 1<=p6]] U [~ [[1<=p1 & [1<=p7 & 1<=p13]]] & ~ [[1<=p0 & 1<=p6]]]]]]]] | EX [~ [[~ [EG [~ [[1<=p5 & 1<=p11]]]] & ~ [E [~ [[1<=p5 & 1<=p11]] U [~ [[3<=p1 & 1<=p13]] & ~ [[1<=p5 & 1<=p11]]]]]]]]]] & [1<=p4 & 1<=p10]]]]]]]

abstracting: (1<=p10)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p4)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p13)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p1)
states: 1,288,265,167,040,904 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
.......
EG iterations: 7
.abstracting: (1<=p6)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p0)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p13)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p7)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p1)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p6)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p0)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p6)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p0)
states: 1,478,081,241,198,900 (15)
.......
EG iterations: 7
.abstracting: (1<=p16)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p13)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p1)
states: 1,288,265,167,040,904 (15)
abstracting: (1<=p15)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p3)
states: 1,288,265,167,040,904 (15)
.
EG iterations: 1
abstracting: (1<=p13)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p1)
states: 1,288,265,167,040,904 (15)
abstracting: (1<=p16)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p10)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p4)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p13)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p1)
states: 1,288,265,167,040,904 (15)
abstracting: (1<=p13)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p1)
states: 1,288,265,167,040,904 (15)
.
EG iterations: 1
abstracting: (1<=p17)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p13)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p7)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p1)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p17)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p17)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
.......
EG iterations: 7
abstracting: (1<=p12)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p0)
states: 1,288,265,167,040,904 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p17)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p10)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p4)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p13)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p1)
states: 1,288,265,167,040,904 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
.......
EG iterations: 7
.abstracting: (1<=p6)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p0)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p13)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p7)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p1)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p6)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p0)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p6)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p0)
states: 1,478,081,241,198,900 (15)
.......
EG iterations: 7
.abstracting: (1<=p16)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p10)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p4)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p13)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p1)
states: 1,288,265,167,040,904 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
.......
EG iterations: 7
.abstracting: (1<=p6)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p0)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p13)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p7)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p1)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p6)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p0)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p6)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p0)
states: 1,478,081,241,198,900 (15)
.......
EG iterations: 7
.abstracting: (1<=p16)
states: 1,478,081,241,198,900 (15)
.......
EG iterations: 7
-> the formula is TRUE

FORMULA PGCD-PT-D05N025-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.724sec

checking: ~ [E [EX [[[1<=p14 & 1<=p8] & 1<=p2]] U [[[[[[1<=p2 & 1<=p8] & [1<=p14 & ~ [[1<=p4 & [1<=p10 & 1<=p16]]]]] | [[[[1<=p4 & 1<=p10] | [1<=p1 & 1<=p7]] | [[1<=p1 & [1<=p7 & 1<=p13]] | [1<=p5 & [1<=p11 & 1<=p17]]]] & ~ [AF [[3<=p4 & 1<=p16]]]]] & AG [[1<=p2 & 1<=p8]]] & [~ [[3<=p3 & 1<=p15]] & [~ [[1<=p0 & [1<=p6 & 1<=p12]]] & 1<=p5]]] & [[1<=p11 & [1<=p17 & 1<=p3]] & [1<=p9 & [[[1<=p3 & [1<=p9 & 1<=p15]] | [1<=p2 & [1<=p8 & 1<=p14]]] & ~ [EG [[E [[1<=p5 & 1<=p11] U [1<=p4 & [1<=p10 & 1<=p16]]] | AX [[3<=p1 & 1<=p13]]]]]]]]]]]
normalized: ~ [E [EX [[1<=p2 & [1<=p14 & 1<=p8]]] U [[[1<=p9 & [~ [EG [[~ [EX [~ [[3<=p1 & 1<=p13]]]] | E [[1<=p5 & 1<=p11] U [1<=p4 & [1<=p10 & 1<=p16]]]]]] & [[1<=p2 & [1<=p8 & 1<=p14]] | [1<=p3 & [1<=p9 & 1<=p15]]]]] & [1<=p11 & [1<=p17 & 1<=p3]]] & [[[1<=p5 & ~ [[1<=p0 & [1<=p6 & 1<=p12]]]] & ~ [[3<=p3 & 1<=p15]]] & [~ [E [true U ~ [[1<=p2 & 1<=p8]]]] & [[EG [~ [[3<=p4 & 1<=p16]]] & [[[1<=p5 & [1<=p11 & 1<=p17]] | [1<=p1 & [1<=p7 & 1<=p13]]] | [[1<=p1 & 1<=p7] | [1<=p4 & 1<=p10]]]] | [[1<=p14 & ~ [[1<=p4 & [1<=p10 & 1<=p16]]]] & [1<=p2 & 1<=p8]]]]]]]]

abstracting: (1<=p8)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p2)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p16)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p10)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p4)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p14)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p10)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p4)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p7)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p1)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p13)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p7)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p1)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p17)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p16)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p4)
states: 1,288,265,167,040,904 (15)
.
EG iterations: 1
abstracting: (1<=p8)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p2)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p15)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p3)
states: 1,288,265,167,040,904 (15)
abstracting: (1<=p12)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p6)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p0)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p3)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p17)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p15)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p9)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p3)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p14)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p8)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p2)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p16)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p10)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p4)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p11)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p5)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p13)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p1)
states: 1,288,265,167,040,904 (15)
...
EG iterations: 2
abstracting: (1<=p9)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p8)
states: 1,478,081,079,561,424 (15)
abstracting: (1<=p14)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p2)
states: 1,478,081,241,198,900 (15)
.-> the formula is TRUE

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

MC time: 0m 5.010sec

checking: AG [~ [E [[[AF [~ [[3<=p3 & 1<=p15]]] & 1<=p3] & [1<=p9 & 1<=p15]] U AG [AX [[3<=p1 & 1<=p13]]]]]]
normalized: ~ [E [true U E [[[1<=p9 & 1<=p15] & [1<=p3 & ~ [EG [[3<=p3 & 1<=p15]]]]] U ~ [E [true U EX [~ [[3<=p1 & 1<=p13]]]]]]]]

abstracting: (1<=p13)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p1)
states: 1,288,265,167,040,904 (15)
.abstracting: (1<=p15)
states: 1,478,081,241,198,900 (15)
abstracting: (3<=p3)
states: 1,288,265,167,040,904 (15)
.
EG iterations: 1
abstracting: (1<=p3)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p15)
states: 1,478,081,241,198,900 (15)
abstracting: (1<=p9)
states: 1,478,081,079,561,424 (15)

BK_STOP 1680820703244

--------------------
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:28101 (1561), effective:9917 (550)

initing FirstDep: 0m 0.000sec


iterations count:557 (30), effective:154 (8)

iterations count:7313 (406), effective:2365 (131)

iterations count:330 (18), effective:78 (4)

iterations count:169 (9), effective:151 (8)

iterations count:706 (39), effective:153 (8)

sat_reach.icc:155: Timeout: after 429 sec


iterations count:67 (3), effective:11 (0)

iterations count:166 (9), effective:35 (1)

iterations count:330 (18), effective:78 (4)

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

iterations count:330 (18), effective:78 (4)

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

iterations count:510 (28), effective:159 (8)

iterations count:330 (18), effective:78 (4)

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

iterations count:330 (18), effective:78 (4)

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

iterations count:169 (9), effective:151 (8)

iterations count:480 (26), effective:154 (8)

iterations count:310 (17), effective:73 (4)

iterations count:7313 (406), effective:2365 (131)

iterations count:1006 (55), effective:228 (12)

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

iterations count:330 (18), effective:78 (4)

iterations count:711 (39), effective:154 (8)

iterations count:408 (22), effective:78 (4)

iterations count:321 (17), effective:78 (4)

iterations count:283 (15), effective:69 (3)

iterations count:283 (15), effective:69 (3)

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

iterations count:283 (15), effective:69 (3)

iterations count:408 (22), effective:78 (4)

iterations count:1238 (68), effective:306 (17)

iterations count:711 (39), effective:154 (8)

iterations count:408 (22), effective:78 (4)

iterations count:296 (16), effective:72 (4)

iterations count:711 (39), effective:154 (8)

iterations count:408 (22), effective:78 (4)

iterations count:330 (18), effective:78 (4)

iterations count:69 (3), effective:12 (0)

iterations count:706 (39), effective:153 (8)

iterations count:6408 (356), effective:2042 (113)
/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 519 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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

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