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-167987247400446.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247400446
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME PGCD-PT-D02N006-ReachabilityCardinality-01
FORMULA_NAME PGCD-PT-D02N006-ReachabilityCardinality-02
FORMULA_NAME PGCD-PT-D02N006-ReachabilityCardinality-03
FORMULA_NAME PGCD-PT-D02N006-ReachabilityCardinality-04
FORMULA_NAME PGCD-PT-D02N006-ReachabilityCardinality-05
FORMULA_NAME PGCD-PT-D02N006-ReachabilityCardinality-06
FORMULA_NAME PGCD-PT-D02N006-ReachabilityCardinality-07
FORMULA_NAME PGCD-PT-D02N006-ReachabilityCardinality-08
FORMULA_NAME PGCD-PT-D02N006-ReachabilityCardinality-09
FORMULA_NAME PGCD-PT-D02N006-ReachabilityCardinality-10
FORMULA_NAME PGCD-PT-D02N006-ReachabilityCardinality-11
FORMULA_NAME PGCD-PT-D02N006-ReachabilityCardinality-12
FORMULA_NAME PGCD-PT-D02N006-ReachabilityCardinality-13
FORMULA_NAME PGCD-PT-D02N006-ReachabilityCardinality-14
FORMULA_NAME PGCD-PT-D02N006-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680818192934

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=ReachabilityCardinality
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:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-06 21:56:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 21:56:34] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-04-06 21:56:34] [INFO ] Transformed 9 places.
[2023-04-06 21:56:34] [INFO ] Transformed 9 transitions.
[2023-04-06 21:56:34] [INFO ] Parsed PT model containing 9 places and 9 transitions and 42 arcs in 76 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA PGCD-PT-D02N006-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-PT-D02N006-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-PT-D02N006-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-PT-D02N006-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-PT-D02N006-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10010 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 11) seen :6
FORMULA PGCD-PT-D02N006-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D02N006-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D02N006-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D02N006-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D02N006-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D02N006-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 9 rows 9 cols
[2023-04-06 21:56:35] [INFO ] Computed 4 invariants in 7 ms
[2023-04-06 21:56:35] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-04-06 21:56:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-06 21:56:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-06 21:56:35] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
FORMULA PGCD-PT-D02N006-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PGCD-PT-D02N006-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PGCD-PT-D02N006-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PGCD-PT-D02N006-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PGCD-PT-D02N006-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 1018 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: PGCD_PT_D02N006
(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.689sec


RS generation: 0m 0.005sec


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



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

checking: AG [1<=p2_2]
normalized: ~ [E [true U ~ [1<=p2_2]]]

abstracting: (1<=p2_2)
states: 13,034 (4)
-> the formula is FALSE

FORMULA PGCD-PT-D02N006-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [2<=p0_3]
normalized: ~ [E [true U ~ [2<=p0_3]]]

abstracting: (2<=p0_3)
states: 10,274 (4)
-> the formula is FALSE

FORMULA PGCD-PT-D02N006-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [p1_1<=3]
normalized: ~ [E [true U ~ [p1_1<=3]]]

abstracting: (p1_1<=3)
states: 9,542 (3)
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: EF [p0_1<=3]
normalized: E [true U p0_1<=3]

abstracting: (p0_1<=3)
states: 9,334 (3)
-> the formula is TRUE

FORMULA PGCD-PT-D02N006-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [p2_3<=p0_3]
normalized: ~ [E [true U ~ [p2_3<=p0_3]]]

abstracting: (p2_3<=p0_3)
states: 15,670 (4)
-> the formula is TRUE

FORMULA PGCD-PT-D02N006-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [p2_1<=p0_3]]
normalized: E [true U ~ [p2_1<=p0_3]]

abstracting: (p2_1<=p0_3)
states: 8,600 (3)
-> the formula is TRUE

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

MC time: 0m 0.004sec

checking: EF [[p2_1<=4 & [p0_2<=2 & [2<=p2_1 & p2_1<=4]]]]
normalized: E [true U [[[2<=p2_1 & p2_1<=4] & p0_2<=2] & p2_1<=4]]

abstracting: (p2_1<=4)
states: 10,654 (4)
abstracting: (p0_2<=2)
states: 7,365 (3)
abstracting: (p2_1<=4)
states: 10,654 (4)
abstracting: (2<=p2_1)
states: 10,274 (4)
-> the formula is TRUE

FORMULA PGCD-PT-D02N006-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[~ [[~ [[[5<=p2_3 & p0_2<=p0_2] | [~ [5<=p2_2] | ~ [5<=p1_2]]]] | [p0_1<=0 & [p0_1<=p2_2 & p2_1<=p2_3]]]] & p1_3<=3]]
normalized: ~ [E [true U ~ [[~ [[[[p0_1<=p2_2 & p2_1<=p2_3] & p0_1<=0] | ~ [[[~ [5<=p1_2] | ~ [5<=p2_2]] | [5<=p2_3 & p0_2<=p0_2]]]]] & p1_3<=3]]]]

abstracting: (p1_3<=3)
states: 9,542 (3)
abstracting: (p0_2<=p0_2)
states: 15,670 (4)
abstracting: (5<=p2_3)
states: 5,016 (3)
abstracting: (5<=p2_2)
states: 5,016 (3)
abstracting: (5<=p1_2)
states: 4,818 (3)
abstracting: (p0_1<=0)
states: 2,636 (3)
abstracting: (p2_1<=p2_3)
states: 8,600 (3)
abstracting: (p0_1<=p2_2)
states: 8,600 (3)
-> the formula is FALSE

FORMULA PGCD-PT-D02N006-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AG [[~ [[[~ [p2_3<=p2_1] & [~ [2<=p2_3] | ~ [[~ [[p0_3<=4 & 1<=p0_3]] | p2_2<=p2_1]]]] | 3<=p0_2]] | [~ [[p1_1<=5 & [~ [p1_1<=p2_2] | p1_2<=p2_1]]] | [p2_2<=p1_1 | [[~ [p2_2<=3] | ~ [p2_1<=p0_2]] & [~ [p2_2<=p0_3] | p2_1<=0]]]]]]
normalized: ~ [E [true U ~ [[[[[[~ [p2_2<=p0_3] | p2_1<=0] & [~ [p2_1<=p0_2] | ~ [p2_2<=3]]] | p2_2<=p1_1] | ~ [[[~ [p1_1<=p2_2] | p1_2<=p2_1] & p1_1<=5]]] | ~ [[[[~ [[~ [[p0_3<=4 & 1<=p0_3]] | p2_2<=p2_1]] | ~ [2<=p2_3]] & ~ [p2_3<=p2_1]] | 3<=p0_2]]]]]]

abstracting: (3<=p0_2)
states: 8,305 (3)
abstracting: (p2_3<=p2_1)
states: 8,600 (3)
abstracting: (2<=p2_3)
states: 10,274 (4)
abstracting: (p2_2<=p2_1)
states: 8,600 (3)
abstracting: (1<=p0_3)
states: 13,034 (4)
abstracting: (p0_3<=4)
states: 10,654 (4)
abstracting: (p1_1<=5)
states: 12,142 (4)
abstracting: (p1_2<=p2_1)
states: 8,785 (3)
abstracting: (p1_1<=p2_2)
states: 8,785 (3)
abstracting: (p2_2<=p1_1)
states: 8,519 (3)
abstracting: (p2_2<=3)
states: 9,334 (3)
abstracting: (p2_1<=p0_2)
states: 8,600 (3)
abstracting: (p2_1<=0)
states: 2,636 (3)
abstracting: (p2_2<=p0_3)
states: 8,600 (3)
-> the formula is FALSE

FORMULA PGCD-PT-D02N006-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: AG [[[p0_2<=3 & [p1_1<=p2_2 | [[[6<=p1_3 | 1<=p1_3] & [[[1<=p2_1 | p1_3<=3] | p1_3<=3] | [[~ [p2_3<=p1_2] | ~ [p2_2<=p1_2]] & [[p2_3<=p0_2 & 5<=p1_3] | [p1_3<=p1_3 | p0_3<=p0_3]]]]] & p1_3<=p0_3]]] | p0_2<=p0_2]]
normalized: ~ [E [true U ~ [[[[[[[[[[p1_3<=p1_3 | p0_3<=p0_3] | [p2_3<=p0_2 & 5<=p1_3]] & [~ [p2_2<=p1_2] | ~ [p2_3<=p1_2]]] | [[1<=p2_1 | p1_3<=3] | p1_3<=3]] & [6<=p1_3 | 1<=p1_3]] & p1_3<=p0_3] | p1_1<=p2_2] & p0_2<=3] | p0_2<=p0_2]]]]

abstracting: (p0_2<=p0_2)
states: 15,670 (4)
abstracting: (p0_2<=3)
states: 9,334 (3)
abstracting: (p1_1<=p2_2)
states: 8,785 (3)
abstracting: (p1_3<=p0_3)
states: 7,950 (3)
abstracting: (1<=p1_3)
states: 12,857 (4)
abstracting: (6<=p1_3)
states: 3,528 (3)
abstracting: (p1_3<=3)
states: 9,542 (3)
abstracting: (p1_3<=3)
states: 9,542 (3)
abstracting: (1<=p2_1)
states: 13,034 (4)
abstracting: (p2_3<=p1_2)
states: 8,519 (3)
abstracting: (p2_2<=p1_2)
states: 7,720 (3)
abstracting: (5<=p1_3)
states: 4,818 (3)
abstracting: (p2_3<=p0_2)
states: 8,600 (3)
abstracting: (p0_3<=p0_3)
states: 15,670 (4)
abstracting: (p1_3<=p1_3)
states: 15,670 (4)
-> the formula is TRUE

FORMULA PGCD-PT-D02N006-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[[p2_2<=p1_1 & [p2_3<=p2_1 & p0_3<=p2_2]] | [[[2<=p1_2 & [~ [[5<=p1_1 & ~ [p1_1<=p2_1]]] & p1_2<=p0_1]] | ~ [p0_3<=6]] & [5<=p0_2 & [[[~ [[[p2_2<=p2_2 & p2_1<=5] | 5<=p2_2]] & 5<=p0_1] | ~ [[~ [1<=p2_1] | [[5<=p1_2 & p0_2<=p0_2] | ~ [p0_1<=1]]]]] & p1_2<=4]]]]]
normalized: ~ [E [true U ~ [[[[[[~ [[[~ [p0_1<=1] | [5<=p1_2 & p0_2<=p0_2]] | ~ [1<=p2_1]]] | [~ [[[p2_2<=p2_2 & p2_1<=5] | 5<=p2_2]] & 5<=p0_1]] & p1_2<=4] & 5<=p0_2] & [~ [p0_3<=6] | [[~ [[~ [p1_1<=p2_1] & 5<=p1_1]] & p1_2<=p0_1] & 2<=p1_2]]] | [[p2_3<=p2_1 & p0_3<=p2_2] & p2_2<=p1_1]]]]]

abstracting: (p2_2<=p1_1)
states: 8,519 (3)
abstracting: (p0_3<=p2_2)
states: 8,600 (3)
abstracting: (p2_3<=p2_1)
states: 8,600 (3)
abstracting: (2<=p1_2)
states: 10,044 (4)
abstracting: (p1_2<=p0_1)
states: 8,785 (3)
abstracting: (5<=p1_1)
states: 4,818 (3)
abstracting: (p1_1<=p2_1)
states: 7,950 (3)
abstracting: (p0_3<=6)
states: 12,814 (4)
abstracting: (5<=p0_2)
states: 5,016 (3)
abstracting: (p1_2<=4)
states: 10,852 (4)
abstracting: (5<=p0_1)
states: 5,016 (3)
abstracting: (5<=p2_2)
states: 5,016 (3)
abstracting: (p2_1<=5)
states: 11,974 (4)
abstracting: (p2_2<=p2_2)
states: 15,670 (4)
abstracting: (1<=p2_1)
states: 13,034 (4)
abstracting: (p0_2<=p0_2)
states: 15,670 (4)
abstracting: (5<=p1_2)
states: 4,818 (3)
abstracting: (p0_1<=1)
states: 5,396 (3)
-> the formula is FALSE

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

MC time: 0m 0.008sec

checking: AG [[~ [[~ [[p0_1<=5 | p1_1<=p0_2]] & [[[~ [[[5<=p0_2 & p1_3<=p2_2] & [p2_2<=p1_2 & p1_1<=p2_2]]] & [p0_1<=p0_3 | p2_1<=1]] & [[[[2<=p1_1 | p1_3<=3] | ~ [3<=p2_1]] | p0_2<=5] & [[[p0_2<=p0_3 & p1_1<=p0_2] & ~ [p2_1<=p2_1]] | ~ [[p1_1<=1 & 6<=p2_2]]]]] | p1_3<=1]]] | p2_2<=p0_1]]
normalized: ~ [E [true U ~ [[~ [[[[[[~ [[p1_1<=1 & 6<=p2_2]] | [~ [p2_1<=p2_1] & [p0_2<=p0_3 & p1_1<=p0_2]]] & [[~ [3<=p2_1] | [2<=p1_1 | p1_3<=3]] | p0_2<=5]] & [[p0_1<=p0_3 | p2_1<=1] & ~ [[[p2_2<=p1_2 & p1_1<=p2_2] & [5<=p0_2 & p1_3<=p2_2]]]]] | p1_3<=1] & ~ [[p0_1<=5 | p1_1<=p0_2]]]] | p2_2<=p0_1]]]]

abstracting: (p2_2<=p0_1)
states: 8,600 (3)
abstracting: (p1_1<=p0_2)
states: 8,785 (3)
abstracting: (p0_1<=5)
states: 11,974 (4)
abstracting: (p1_3<=1)
states: 5,626 (3)
abstracting: (p1_3<=p2_2)
states: 8,785 (3)
abstracting: (5<=p0_2)
states: 5,016 (3)
abstracting: (p1_1<=p2_2)
states: 8,785 (3)
abstracting: (p2_2<=p1_2)
states: 7,720 (3)
abstracting: (p2_1<=1)
states: 5,396 (3)
abstracting: (p0_1<=p0_3)
states: 8,600 (3)
abstracting: (p0_2<=5)
states: 11,974 (4)
abstracting: (p1_3<=3)
states: 9,542 (3)
abstracting: (2<=p1_1)
states: 10,044 (4)
abstracting: (3<=p2_1)
states: 8,305 (3)
abstracting: (p1_1<=p0_2)
states: 8,785 (3)
abstracting: (p0_2<=p0_3)
states: 8,600 (3)
abstracting: (p2_1<=p2_1)
states: 15,670 (4)
abstracting: (6<=p2_2)
states: 3,696 (3)
abstracting: (p1_1<=1)
states: 5,626 (3)
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: EF [[[~ [[[[[[[p0_1<=p0_2 & p1_2<=p1_2] | [p1_1<=4 | p0_1<=p1_2]] | ~ [[p1_3<=p0_1 & p0_2<=4]]] | ~ [3<=p2_2]] | ~ [2<=p2_1]] | [p0_1<=2 | p0_3<=6]]] & p0_1<=p0_2] & ~ [[[~ [[[[[p1_3<=p0_3 & 6<=p1_3] | 5<=p2_1] | p1_2<=p2_2] & 6<=p2_3]] | ~ [[~ [[6<=p0_1 | 5<=p0_3]] | [4<=p2_3 & ~ [4<=p0_3]]]]] | [[1<=p1_3 | ~ [[[p2_2<=p0_3 & [p0_2<=4 & p2_2<=2]] & [p2_3<=p0_3 | [p0_2<=p2_2 & p2_3<=p1_2]]]]] & 6<=p2_3]]]]]
normalized: E [true U [~ [[[6<=p2_3 & [1<=p1_3 | ~ [[[p2_3<=p0_3 | [p0_2<=p2_2 & p2_3<=p1_2]] & [p2_2<=p0_3 & [p0_2<=4 & p2_2<=2]]]]]] | [~ [[[4<=p2_3 & ~ [4<=p0_3]] | ~ [[6<=p0_1 | 5<=p0_3]]]] | ~ [[6<=p2_3 & [p1_2<=p2_2 | [5<=p2_1 | [p1_3<=p0_3 & 6<=p1_3]]]]]]]] & [p0_1<=p0_2 & ~ [[[p0_1<=2 | p0_3<=6] | [~ [2<=p2_1] | [~ [3<=p2_2] | [~ [[p1_3<=p0_1 & p0_2<=4]] | [[p1_1<=4 | p0_1<=p1_2] | [p0_1<=p0_2 & p1_2<=p1_2]]]]]]]]]]

abstracting: (p1_2<=p1_2)
states: 15,670 (4)
abstracting: (p0_1<=p0_2)
states: 8,600 (3)
abstracting: (p0_1<=p1_2)
states: 8,519 (3)
abstracting: (p1_1<=4)
states: 10,852 (4)
abstracting: (p0_2<=4)
states: 10,654 (4)
abstracting: (p1_3<=p0_1)
states: 8,785 (3)
abstracting: (3<=p2_2)
states: 8,305 (3)
abstracting: (2<=p2_1)
states: 10,274 (4)
abstracting: (p0_3<=6)
states: 12,814 (4)
abstracting: (p0_1<=2)
states: 7,365 (3)
abstracting: (p0_1<=p0_2)
states: 8,600 (3)
abstracting: (6<=p1_3)
states: 3,528 (3)
abstracting: (p1_3<=p0_3)
states: 7,950 (3)
abstracting: (5<=p2_1)
states: 5,016 (3)
abstracting: (p1_2<=p2_2)
states: 7,950 (3)
abstracting: (6<=p2_3)
states: 3,696 (3)
abstracting: (5<=p0_3)
states: 5,016 (3)
abstracting: (6<=p0_1)
states: 3,696 (3)
abstracting: (4<=p0_3)
states: 6,336 (3)
abstracting: (4<=p2_3)
states: 6,336 (3)
abstracting: (p2_2<=2)
states: 7,365 (3)
abstracting: (p0_2<=4)
states: 10,654 (4)
abstracting: (p2_2<=p0_3)
states: 8,600 (3)
abstracting: (p2_3<=p1_2)
states: 8,519 (3)
abstracting: (p0_2<=p2_2)
states: 15,670 (4)
abstracting: (p2_3<=p0_3)
states: 15,670 (4)
abstracting: (1<=p1_3)
states: 12,857 (4)
abstracting: (6<=p2_3)
states: 3,696 (3)
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: AG [[[[~ [[[[[~ [p0_1<=5] | [p0_1<=1 | 1<=p1_1]] | p2_2<=3] | 1<=p1_2] | ~ [[p2_3<=p0_3 | ~ [5<=p2_2]]]]] & [[p2_3<=p0_2 | [[[p2_3<=p1_2 | ~ [2<=p1_3]] | [[p1_2<=3 | 4<=p0_1] & [p0_3<=2 & p0_3<=5]]] & ~ [[1<=p0_1 & p0_3<=p1_1]]]] & p0_3<=p1_3]] & [[~ [[~ [[p0_3<=p2_1 & 3<=p1_3]] | p2_1<=p2_1]] | p1_3<=p2_1] | [3<=p1_1 & [[[~ [3<=p0_2] | [[3<=p0_1 & 1<=p0_2] & [p1_3<=0 | p2_1<=4]]] & p2_3<=6] | ~ [[[[5<=p0_1 | p1_3<=p2_2] & [p0_3<=3 | 2<=p2_1]] & [[p2_2<=6 & p0_3<=p0_2] & ~ [p1_1<=0]]]]]]]] | [~ [[p0_1<=0 & p2_1<=5]] | [[[[p2_3<=p1_1 | 4<=p0_2] & p0_2<=p2_2] | [p1_1<=p2_3 & [p2_2<=p0_1 | 3<=p0_2]]] | [p2_2<=4 | ~ [p0_2<=1]]]]]]
normalized: ~ [E [true U ~ [[[[[p2_2<=4 | ~ [p0_2<=1]] | [[p1_1<=p2_3 & [p2_2<=p0_1 | 3<=p0_2]] | [p0_2<=p2_2 & [p2_3<=p1_1 | 4<=p0_2]]]] | ~ [[p0_1<=0 & p2_1<=5]]] | [[[3<=p1_1 & [~ [[[~ [p1_1<=0] & [p2_2<=6 & p0_3<=p0_2]] & [[p0_3<=3 | 2<=p2_1] & [5<=p0_1 | p1_3<=p2_2]]]] | [p2_3<=6 & [[[p1_3<=0 | p2_1<=4] & [3<=p0_1 & 1<=p0_2]] | ~ [3<=p0_2]]]]] | [p1_3<=p2_1 | ~ [[p2_1<=p2_1 | ~ [[p0_3<=p2_1 & 3<=p1_3]]]]]] & [[p0_3<=p1_3 & [p2_3<=p0_2 | [~ [[1<=p0_1 & p0_3<=p1_1]] & [[[p0_3<=2 & p0_3<=5] & [p1_2<=3 | 4<=p0_1]] | [p2_3<=p1_2 | ~ [2<=p1_3]]]]]] & ~ [[~ [[p2_3<=p0_3 | ~ [5<=p2_2]]] | [1<=p1_2 | [p2_2<=3 | [[p0_1<=1 | 1<=p1_1] | ~ [p0_1<=5]]]]]]]]]]]]

abstracting: (p0_1<=5)
states: 11,974 (4)
abstracting: (1<=p1_1)
states: 12,857 (4)
abstracting: (p0_1<=1)
states: 5,396 (3)
abstracting: (p2_2<=3)
states: 9,334 (3)
abstracting: (1<=p1_2)
states: 12,857 (4)
abstracting: (5<=p2_2)
states: 5,016 (3)
abstracting: (p2_3<=p0_3)
states: 15,670 (4)
abstracting: (2<=p1_3)
states: 10,044 (4)
abstracting: (p2_3<=p1_2)
states: 8,519 (3)
abstracting: (4<=p0_1)
states: 6,336 (3)
abstracting: (p1_2<=3)
states: 9,542 (3)
abstracting: (p0_3<=5)
states: 11,974 (4)
abstracting: (p0_3<=2)
states: 7,365 (3)
abstracting: (p0_3<=p1_1)
states: 8,519 (3)
abstracting: (1<=p0_1)
states: 13,034 (4)
abstracting: (p2_3<=p0_2)
states: 8,600 (3)
abstracting: (p0_3<=p1_3)
states: 7,720 (3)
abstracting: (3<=p1_3)
states: 8,075 (3)
abstracting: (p0_3<=p2_1)
states: 8,600 (3)
abstracting: (p2_1<=p2_1)
states: 15,670 (4)
abstracting: (p1_3<=p2_1)
states: 8,785 (3)
abstracting: (3<=p0_2)
states: 8,305 (3)
abstracting: (1<=p0_2)
states: 13,034 (4)
abstracting: (3<=p0_1)
states: 8,305 (3)
abstracting: (p2_1<=4)
states: 10,654 (4)
abstracting: (p1_3<=0)
states: 2,813 (3)
abstracting: (p2_3<=6)
states: 12,814 (4)
abstracting: (p1_3<=p2_2)
states: 8,785 (3)
abstracting: (5<=p0_1)
states: 5,016 (3)
abstracting: (2<=p2_1)
states: 10,274 (4)
abstracting: (p0_3<=3)
states: 9,334 (3)
abstracting: (p0_3<=p0_2)
states: 8,600 (3)
abstracting: (p2_2<=6)
states: 12,814 (4)
abstracting: (p1_1<=0)
states: 2,813 (3)
abstracting: (3<=p1_1)
states: 8,075 (3)
abstracting: (p2_1<=5)
states: 11,974 (4)
abstracting: (p0_1<=0)
states: 2,636 (3)
abstracting: (4<=p0_2)
states: 6,336 (3)
abstracting: (p2_3<=p1_1)
states: 8,519 (3)
abstracting: (p0_2<=p2_2)
states: 15,670 (4)
abstracting: (3<=p0_2)
states: 8,305 (3)
abstracting: (p2_2<=p0_1)
states: 8,600 (3)
abstracting: (p1_1<=p2_3)
states: 8,785 (3)
abstracting: (p0_2<=1)
states: 5,396 (3)
abstracting: (p2_2<=4)
states: 10,654 (4)
-> the formula is TRUE

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

MC time: 0m 0.010sec

checking: AG [[[[[[[p1_3<=p2_3 | ~ [[[6<=p1_2 & 6<=p0_1] | ~ [5<=p0_1]]]] | ~ [[~ [[p1_2<=5 & p2_2<=5]] | [[p0_3<=3 & 4<=p0_1] | [4<=p0_3 & p0_3<=1]]]]] & [[~ [[3<=p2_1 & p1_3<=p1_1]] & 3<=p0_1] & [~ [[[p0_1<=6 | 6<=p1_2] | ~ [p0_1<=0]]] & [[[p0_1<=0 & 1<=p2_1] & 2<=p2_2] | [~ [p0_2<=p2_2] | [p1_1<=p1_2 & p2_3<=p0_3]]]]]] & [[~ [[[6<=p1_1 | [p0_3<=5 & p2_1<=2]] & p1_1<=3]] & p1_2<=p1_2] | [[[~ [[2<=p1_1 | p1_3<=2]] | [[4<=p2_1 | p0_3<=p2_3] | [p2_1<=5 | p0_1<=p0_3]]] | [~ [p1_3<=p1_3] | [[p1_1<=5 | p0_3<=0] & ~ [p0_2<=p1_2]]]] & [~ [p1_3<=p1_1] & [[[p0_1<=p0_3 | p2_1<=4] & [p1_1<=p0_3 & 2<=p0_2]] | p2_3<=p0_2]]]]] | [~ [[[[~ [3<=p1_1] & [6<=p2_3 | p0_3<=3]] | [~ [p2_1<=6] & 6<=p2_1]] | p0_2<=6]] | ~ [[p1_1<=p2_1 | [p0_1<=p0_3 | ~ [[3<=p0_3 & [p2_1<=p2_1 & p1_3<=p2_1]]]]]]]] | p0_3<=6]]
normalized: ~ [E [true U ~ [[p0_3<=6 | [[~ [[p1_1<=p2_1 | [p0_1<=p0_3 | ~ [[3<=p0_3 & [p2_1<=p2_1 & p1_3<=p2_1]]]]]] | ~ [[p0_2<=6 | [[6<=p2_1 & ~ [p2_1<=6]] | [[6<=p2_3 | p0_3<=3] & ~ [3<=p1_1]]]]]] | [[[[[p2_3<=p0_2 | [[p1_1<=p0_3 & 2<=p0_2] & [p0_1<=p0_3 | p2_1<=4]]] & ~ [p1_3<=p1_1]] & [[[~ [p0_2<=p1_2] & [p1_1<=5 | p0_3<=0]] | ~ [p1_3<=p1_3]] | [[[p2_1<=5 | p0_1<=p0_3] | [4<=p2_1 | p0_3<=p2_3]] | ~ [[2<=p1_1 | p1_3<=2]]]]] | [p1_2<=p1_2 & ~ [[p1_1<=3 & [6<=p1_1 | [p0_3<=5 & p2_1<=2]]]]]] & [[[[[[p1_1<=p1_2 & p2_3<=p0_3] | ~ [p0_2<=p2_2]] | [2<=p2_2 & [p0_1<=0 & 1<=p2_1]]] & ~ [[~ [p0_1<=0] | [p0_1<=6 | 6<=p1_2]]]] & [3<=p0_1 & ~ [[3<=p2_1 & p1_3<=p1_1]]]] & [~ [[[[4<=p0_3 & p0_3<=1] | [p0_3<=3 & 4<=p0_1]] | ~ [[p1_2<=5 & p2_2<=5]]]] | [p1_3<=p2_3 | ~ [[~ [5<=p0_1] | [6<=p1_2 & 6<=p0_1]]]]]]]]]]]]

abstracting: (6<=p0_1)
states: 3,696 (3)
abstracting: (6<=p1_2)
states: 3,528 (3)
abstracting: (5<=p0_1)
states: 5,016 (3)
abstracting: (p1_3<=p2_3)
states: 7,950 (3)
abstracting: (p2_2<=5)
states: 11,974 (4)
abstracting: (p1_2<=5)
states: 12,142 (4)
abstracting: (4<=p0_1)
states: 6,336 (3)
abstracting: (p0_3<=3)
states: 9,334 (3)
abstracting: (p0_3<=1)
states: 5,396 (3)
abstracting: (4<=p0_3)
states: 6,336 (3)
abstracting: (p1_3<=p1_1)
states: 8,666 (3)
abstracting: (3<=p2_1)
states: 8,305 (3)
abstracting: (3<=p0_1)
states: 8,305 (3)
abstracting: (6<=p1_2)
states: 3,528 (3)
abstracting: (p0_1<=6)
states: 12,814 (4)
abstracting: (p0_1<=0)
states: 2,636 (3)
abstracting: (1<=p2_1)
states: 13,034 (4)
abstracting: (p0_1<=0)
states: 2,636 (3)
abstracting: (2<=p2_2)
states: 10,274 (4)
abstracting: (p0_2<=p2_2)
states: 15,670 (4)
abstracting: (p2_3<=p0_3)
states: 15,670 (4)
abstracting: (p1_1<=p1_2)
states: 8,666 (3)
abstracting: (p2_1<=2)
states: 7,365 (3)
abstracting: (p0_3<=5)
states: 11,974 (4)
abstracting: (6<=p1_1)
states: 3,528 (3)
abstracting: (p1_1<=3)
states: 9,542 (3)
abstracting: (p1_2<=p1_2)
states: 15,670 (4)
abstracting: (p1_3<=2)
states: 7,595 (3)
abstracting: (2<=p1_1)
states: 10,044 (4)
abstracting: (p0_3<=p2_3)
states: 15,670 (4)
abstracting: (4<=p2_1)
states: 6,336 (3)
abstracting: (p0_1<=p0_3)
states: 8,600 (3)
abstracting: (p2_1<=5)
states: 11,974 (4)
abstracting: (p1_3<=p1_3)
states: 15,670 (4)
abstracting: (p0_3<=0)
states: 2,636 (3)
abstracting: (p1_1<=5)
states: 12,142 (4)
abstracting: (p0_2<=p1_2)
states: 7,720 (3)
abstracting: (p1_3<=p1_1)
states: 8,666 (3)
abstracting: (p2_1<=4)
states: 10,654 (4)
abstracting: (p0_1<=p0_3)
states: 8,600 (3)
abstracting: (2<=p0_2)
states: 10,274 (4)
abstracting: (p1_1<=p0_3)
states: 8,785 (3)
abstracting: (p2_3<=p0_2)
states: 8,600 (3)
abstracting: (3<=p1_1)
states: 8,075 (3)
abstracting: (p0_3<=3)
states: 9,334 (3)
abstracting: (6<=p2_3)
states: 3,696 (3)
abstracting: (p2_1<=6)
states: 12,814 (4)
abstracting: (6<=p2_1)
states: 3,696 (3)
abstracting: (p0_2<=6)
states: 12,814 (4)
abstracting: (p1_3<=p2_1)
states: 8,785 (3)
abstracting: (p2_1<=p2_1)
states: 15,670 (4)
abstracting: (3<=p0_3)
states: 8,305 (3)
abstracting: (p0_1<=p0_3)
states: 8,600 (3)
abstracting: (p1_1<=p2_1)
states: 7,950 (3)
abstracting: (p0_3<=6)
states: 12,814 (4)
-> the formula is FALSE

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

MC time: 0m 0.014sec

checking: EF [[[[[[[6<=p1_3 | [~ [p1_1<=p2_2] | 2<=p0_2]] & ~ [[4<=p1_2 & ~ [p1_3<=p2_2]]]] & [[~ [2<=p0_2] | 2<=p0_2] | [p2_1<=4 | p0_2<=2]]] | [[[~ [[[p1_2<=p0_2 & p0_1<=3] | [4<=p0_3 & 3<=p2_1]]] | [6<=p0_3 & [~ [p2_3<=p2_1] | [p0_2<=p2_1 & p2_1<=1]]]] | p0_2<=4] & p1_1<=p2_1]] | [[[[[[[p2_1<=2 & p0_2<=6] | 2<=p1_1] | [[p2_2<=4 | p1_2<=3] | [2<=p0_2 | 2<=p1_3]]] | p2_3<=p1_3] & p1_3<=p1_2] | ~ [p1_1<=5]] & [[~ [6<=p1_2] & [~ [[1<=p2_3 & ~ [p0_3<=p0_1]]] & [2<=p1_2 | [p2_2<=p1_1 & ~ [p0_1<=p1_3]]]]] & [~ [[p1_2<=p2_3 | ~ [p1_2<=p1_2]]] & [[3<=p0_3 | [[p2_1<=1 | p0_3<=0] | ~ [4<=p0_1]]] & [[[p1_2<=1 | p1_3<=p0_3] | [p2_1<=p1_3 & p0_2<=6]] | [[5<=p2_1 | 3<=p2_3] & [p2_2<=1 | p2_1<=2]]]]]]]] & [~ [[[p1_2<=5 & [[[[4<=p1_3 | p0_2<=4] | 1<=p2_1] & ~ [[p2_3<=p0_1 & p1_3<=6]]] | ~ [p2_1<=2]]] | [~ [p1_2<=6] | [p1_1<=p2_2 & [p1_1<=p2_2 & ~ [[p1_3<=p0_3 | 2<=p0_3]]]]]]] & ~ [[[[5<=p0_3 | p2_2<=p0_1] | [[[6<=p1_3 | p0_1<=2] | [p2_3<=p1_1 | p0_1<=p2_1]] & [~ [6<=p1_3] | [4<=p0_2 & p0_1<=p2_1]]]] | p0_1<=3]]]]]
normalized: E [true U [[~ [[p0_1<=3 | [[[[4<=p0_2 & p0_1<=p2_1] | ~ [6<=p1_3]] & [[p2_3<=p1_1 | p0_1<=p2_1] | [6<=p1_3 | p0_1<=2]]] | [5<=p0_3 | p2_2<=p0_1]]]] & ~ [[[[p1_1<=p2_2 & [p1_1<=p2_2 & ~ [[p1_3<=p0_3 | 2<=p0_3]]]] | ~ [p1_2<=6]] | [p1_2<=5 & [~ [p2_1<=2] | [~ [[p2_3<=p0_1 & p1_3<=6]] & [1<=p2_1 | [4<=p1_3 | p0_2<=4]]]]]]]] & [[[[[[[[p2_2<=1 | p2_1<=2] & [5<=p2_1 | 3<=p2_3]] | [[p2_1<=p1_3 & p0_2<=6] | [p1_2<=1 | p1_3<=p0_3]]] & [3<=p0_3 | [~ [4<=p0_1] | [p2_1<=1 | p0_3<=0]]]] & ~ [[p1_2<=p2_3 | ~ [p1_2<=p1_2]]]] & [[[2<=p1_2 | [p2_2<=p1_1 & ~ [p0_1<=p1_3]]] & ~ [[1<=p2_3 & ~ [p0_3<=p0_1]]]] & ~ [6<=p1_2]]] & [~ [p1_1<=5] | [p1_3<=p1_2 & [p2_3<=p1_3 | [[[2<=p0_2 | 2<=p1_3] | [p2_2<=4 | p1_2<=3]] | [2<=p1_1 | [p2_1<=2 & p0_2<=6]]]]]]] | [[p1_1<=p2_1 & [p0_2<=4 | [[6<=p0_3 & [[p0_2<=p2_1 & p2_1<=1] | ~ [p2_3<=p2_1]]] | ~ [[[4<=p0_3 & 3<=p2_1] | [p1_2<=p0_2 & p0_1<=3]]]]]] | [[[p2_1<=4 | p0_2<=2] | [2<=p0_2 | ~ [2<=p0_2]]] & [~ [[4<=p1_2 & ~ [p1_3<=p2_2]]] & [6<=p1_3 | [2<=p0_2 | ~ [p1_1<=p2_2]]]]]]]]]

abstracting: (p1_1<=p2_2)
states: 8,785 (3)
abstracting: (2<=p0_2)
states: 10,274 (4)
abstracting: (6<=p1_3)
states: 3,528 (3)
abstracting: (p1_3<=p2_2)
states: 8,785 (3)
abstracting: (4<=p1_2)
states: 6,128 (3)
abstracting: (2<=p0_2)
states: 10,274 (4)
abstracting: (2<=p0_2)
states: 10,274 (4)
abstracting: (p0_2<=2)
states: 7,365 (3)
abstracting: (p2_1<=4)
states: 10,654 (4)
abstracting: (p0_1<=3)
states: 9,334 (3)
abstracting: (p1_2<=p0_2)
states: 7,950 (3)
abstracting: (3<=p2_1)
states: 8,305 (3)
abstracting: (4<=p0_3)
states: 6,336 (3)
abstracting: (p2_3<=p2_1)
states: 8,600 (3)
abstracting: (p2_1<=1)
states: 5,396 (3)
abstracting: (p0_2<=p2_1)
states: 8,600 (3)
abstracting: (6<=p0_3)
states: 3,696 (3)
abstracting: (p0_2<=4)
states: 10,654 (4)
abstracting: (p1_1<=p2_1)
states: 7,950 (3)
abstracting: (p0_2<=6)
states: 12,814 (4)
abstracting: (p2_1<=2)
states: 7,365 (3)
abstracting: (2<=p1_1)
states: 10,044 (4)
abstracting: (p1_2<=3)
states: 9,542 (3)
abstracting: (p2_2<=4)
states: 10,654 (4)
abstracting: (2<=p1_3)
states: 10,044 (4)
abstracting: (2<=p0_2)
states: 10,274 (4)
abstracting: (p2_3<=p1_3)
states: 7,720 (3)
abstracting: (p1_3<=p1_2)
states: 8,666 (3)
abstracting: (p1_1<=5)
states: 12,142 (4)
abstracting: (6<=p1_2)
states: 3,528 (3)
abstracting: (p0_3<=p0_1)
states: 8,600 (3)
abstracting: (1<=p2_3)
states: 13,034 (4)
abstracting: (p0_1<=p1_3)
states: 8,519 (3)
abstracting: (p2_2<=p1_1)
states: 8,519 (3)
abstracting: (2<=p1_2)
states: 10,044 (4)
abstracting: (p1_2<=p1_2)
states: 15,670 (4)
abstracting: (p1_2<=p2_3)
states: 8,785 (3)
abstracting: (p0_3<=0)
states: 2,636 (3)
abstracting: (p2_1<=1)
states: 5,396 (3)
abstracting: (4<=p0_1)
states: 6,336 (3)
abstracting: (3<=p0_3)
states: 8,305 (3)
abstracting: (p1_3<=p0_3)
states: 7,950 (3)
abstracting: (p1_2<=1)
states: 5,626 (3)
abstracting: (p0_2<=6)
states: 12,814 (4)
abstracting: (p2_1<=p1_3)
states: 8,519 (3)
abstracting: (3<=p2_3)
states: 8,305 (3)
abstracting: (5<=p2_1)
states: 5,016 (3)
abstracting: (p2_1<=2)
states: 7,365 (3)
abstracting: (p2_2<=1)
states: 5,396 (3)
abstracting: (p0_2<=4)
states: 10,654 (4)
abstracting: (4<=p1_3)
states: 6,128 (3)
abstracting: (1<=p2_1)
states: 13,034 (4)
abstracting: (p1_3<=6)
states: 12,973 (4)
abstracting: (p2_3<=p0_1)
states: 8,600 (3)
abstracting: (p2_1<=2)
states: 7,365 (3)
abstracting: (p1_2<=5)
states: 12,142 (4)
abstracting: (p1_2<=6)
states: 12,973 (4)
abstracting: (2<=p0_3)
states: 10,274 (4)
abstracting: (p1_3<=p0_3)
states: 7,950 (3)
abstracting: (p1_1<=p2_2)
states: 8,785 (3)
abstracting: (p1_1<=p2_2)
states: 8,785 (3)
abstracting: (p2_2<=p0_1)
states: 8,600 (3)
abstracting: (5<=p0_3)
states: 5,016 (3)
abstracting: (p0_1<=2)
states: 7,365 (3)
abstracting: (6<=p1_3)
states: 3,528 (3)
abstracting: (p0_1<=p2_1)
states: 15,670 (4)
abstracting: (p2_3<=p1_1)
states: 8,519 (3)
abstracting: (6<=p1_3)
states: 3,528 (3)
abstracting: (p0_1<=p2_1)
states: 15,670 (4)
abstracting: (4<=p0_2)
states: 6,336 (3)
abstracting: (p0_1<=3)
states: 9,334 (3)
-> the formula is FALSE

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

MC time: 0m 0.013sec

totally nodes used: 46017 (4.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 135972 52014 187986
used/not used/entry size/cache size: 66514 67042350 16 1024MB
basic ops cache: hits/miss/sum: 164859 109626 274485
used/not used/entry size/cache size: 194919 16582297 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: 23761 9405 33166
used/not used/entry size/cache size: 9405 8379203 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 67071093
1 34839
2 1695
3 553
4 216
5 133
6 94
7 35
8 27
9 24
>= 10 155

Total processing time: 0m 4.370sec


BK_STOP 1680818200839

--------------------
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 ReachabilityCardinality -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:122 (13), effective:27 (3)

iterations count:63 (7), effective:18 (2)

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

iterations count:41 (4), effective:16 (1)

iterations count:57 (6), effective:21 (2)

iterations count:122 (13), effective:35 (3)

iterations count:119 (13), effective:38 (4)

iterations count:347 (38), effective:116 (12)

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

iterations count:127 (14), effective:40 (4)

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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-167987247400446"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;