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.r202-smll-167840348600382.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 HexagonalGrid-PT-126, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348600382
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.3K Feb 26 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 26 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 18K Mar 5 18:22 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 HexagonalGrid-PT-126-ReachabilityCardinality-00
FORMULA_NAME HexagonalGrid-PT-126-ReachabilityCardinality-01
FORMULA_NAME HexagonalGrid-PT-126-ReachabilityCardinality-02
FORMULA_NAME HexagonalGrid-PT-126-ReachabilityCardinality-03
FORMULA_NAME HexagonalGrid-PT-126-ReachabilityCardinality-04
FORMULA_NAME HexagonalGrid-PT-126-ReachabilityCardinality-05
FORMULA_NAME HexagonalGrid-PT-126-ReachabilityCardinality-06
FORMULA_NAME HexagonalGrid-PT-126-ReachabilityCardinality-07
FORMULA_NAME HexagonalGrid-PT-126-ReachabilityCardinality-08
FORMULA_NAME HexagonalGrid-PT-126-ReachabilityCardinality-09
FORMULA_NAME HexagonalGrid-PT-126-ReachabilityCardinality-10
FORMULA_NAME HexagonalGrid-PT-126-ReachabilityCardinality-11
FORMULA_NAME HexagonalGrid-PT-126-ReachabilityCardinality-12
FORMULA_NAME HexagonalGrid-PT-126-ReachabilityCardinality-13
FORMULA_NAME HexagonalGrid-PT-126-ReachabilityCardinality-14
FORMULA_NAME HexagonalGrid-PT-126-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678734005731

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=HexagonalGrid-PT-126
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:00:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 19:00:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:00:09] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-13 19:00:09] [INFO ] Transformed 31 places.
[2023-03-13 19:00:09] [INFO ] Transformed 42 transitions.
[2023-03-13 19:00:09] [INFO ] Parsed PT model containing 31 places and 42 transitions and 168 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 955 ms. (steps per millisecond=10 ) properties (out of 16) seen :2
FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 42 rows 31 cols
[2023-03-13 19:00:11] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-13 19:00:12] [INFO ] After 331ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-13 19:00:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-13 19:00:12] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 19:00:12] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :0
FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 3229 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: HexagonalGrid_PT_126
(NrP: 31 NrTr: 42 NrArc: 168)

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

net check time: 0m 0.000sec

init dd package: 0m 3.369sec


RS generation: 0m 0.082sec


-> reachability set: #nodes 1925 (1.9e+03) #states 2,664,192 (6)



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

checking: AG [pol2_1_1<=4]
normalized: ~ [E [true U ~ [pol2_1_1<=4]]]

abstracting: (pol2_1_1<=4)
states: 2,664,192 (6)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [6<=pb3_1_1]
normalized: E [true U 6<=pb3_1_1]

abstracting: (6<=pb3_1_1)
states: 40,193 (4)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.164sec

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

abstracting: (3<=pol5_1_1)
states: 0
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (pil6_1_1<=3)
states: 2,664,192 (6)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[~ [[po6_1_1<=pbl_1_1 | 6<=po1_1_1]] & pol2_1_1<=1] & po1_1_1<=pil2_1_1]]
normalized: E [true U [[~ [[po6_1_1<=pbl_1_1 | 6<=po1_1_1]] & pol2_1_1<=1] & po1_1_1<=pil2_1_1]]

abstracting: (po1_1_1<=pil2_1_1)
states: 2,293,504 (6)
abstracting: (pol2_1_1<=1)
states: 2,664,192 (6)
abstracting: (6<=po1_1_1)
states: 0
abstracting: (po6_1_1<=pbl_1_1)
states: 2,664,192 (6)
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[[~ [3<=pi2_1_1] | [pil1_1_1<=0 | [~ [po5_1_1<=pb2_1_1] | ~ [pil2_1_1<=pol4_1_1]]]] | pol3_1_1<=6]]
normalized: ~ [E [true U ~ [[[[[~ [pil2_1_1<=pol4_1_1] | ~ [po5_1_1<=pb2_1_1]] | pil1_1_1<=0] | ~ [3<=pi2_1_1]] | pol3_1_1<=6]]]]

abstracting: (pol3_1_1<=6)
states: 2,664,192 (6)
abstracting: (3<=pi2_1_1)
states: 0
abstracting: (pil1_1_1<=0)
states: 1,003,136 (6)
abstracting: (po5_1_1<=pb2_1_1)
states: 2,236,928 (6)
abstracting: (pil2_1_1<=pol4_1_1)
states: 2,031,744 (6)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EF [[~ [[[[[~ [pil6_1_1<=4] | pi2_1_1<=5] | [[pol2_1_1<=6 | 6<=pol6_1_1] & ~ [pil6_1_1<=6]]] & ~ [[[pi1_1_1<=4 & 2<=pil1_1_1] | ~ [3<=pbl_1_1]]]] | [~ [pi3_1_1<=3] & 2<=pol2_1_1]]] | ~ [[pol2_1_1<=5 | 6<=pil1_1_1]]]]
normalized: E [true U [~ [[pol2_1_1<=5 | 6<=pil1_1_1]] | ~ [[[~ [pi3_1_1<=3] & 2<=pol2_1_1] | [~ [[~ [3<=pbl_1_1] | [pi1_1_1<=4 & 2<=pil1_1_1]]] & [[~ [pil6_1_1<=6] & [pol2_1_1<=6 | 6<=pol6_1_1]] | [~ [pil6_1_1<=4] | pi2_1_1<=5]]]]]]]

abstracting: (pi2_1_1<=5)
states: 2,664,192 (6)
abstracting: (pil6_1_1<=4)
states: 2,664,192 (6)
abstracting: (6<=pol6_1_1)
states: 0
abstracting: (pol2_1_1<=6)
states: 2,664,192 (6)
abstracting: (pil6_1_1<=6)
states: 2,664,192 (6)
abstracting: (2<=pil1_1_1)
states: 0
abstracting: (pi1_1_1<=4)
states: 2,664,192 (6)
abstracting: (3<=pbl_1_1)
states: 2,664,192 (6)
abstracting: (2<=pol2_1_1)
states: 0
abstracting: (pi3_1_1<=3)
states: 2,664,192 (6)
abstracting: (6<=pil1_1_1)
states: 0
abstracting: (pol2_1_1<=5)
states: 2,664,192 (6)
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [~ [[[[[~ [[[[6<=pol2_1_1 | po6_1_1<=1] & ~ [pi5_1_1<=1]] | po2_1_1<=1]] & [po4_1_1<=pi5_1_1 | ~ [[[pb2_1_1<=pb2_1_1 & 2<=po4_1_1] & [pi2_1_1<=5 & pol3_1_1<=4]]]]] & 2<=pb1_1_1] | ~ [pil4_1_1<=pi3_1_1]] | [pb1_1_1<=5 & ~ [[~ [[[pb5_1_1<=pol5_1_1 | pi2_1_1<=pol2_1_1] | pb5_1_1<=pil3_1_1]] & ~ [pol2_1_1<=1]]]]]]]
normalized: E [true U ~ [[[~ [[~ [pol2_1_1<=1] & ~ [[[pb5_1_1<=pol5_1_1 | pi2_1_1<=pol2_1_1] | pb5_1_1<=pil3_1_1]]]] & pb1_1_1<=5] | [~ [pil4_1_1<=pi3_1_1] | [[[~ [[[pi2_1_1<=5 & pol3_1_1<=4] & [pb2_1_1<=pb2_1_1 & 2<=po4_1_1]]] | po4_1_1<=pi5_1_1] & ~ [[[~ [pi5_1_1<=1] & [6<=pol2_1_1 | po6_1_1<=1]] | po2_1_1<=1]]] & 2<=pb1_1_1]]]]]

abstracting: (2<=pb1_1_1)
states: 887,040 (5)
abstracting: (po2_1_1<=1)
states: 2,664,192 (6)
abstracting: (po6_1_1<=1)
states: 2,664,192 (6)
abstracting: (6<=pol2_1_1)
states: 0
abstracting: (pi5_1_1<=1)
states: 2,664,192 (6)
abstracting: (po4_1_1<=pi5_1_1)
states: 2,031,744 (6)
abstracting: (2<=po4_1_1)
states: 0
abstracting: (pb2_1_1<=pb2_1_1)
states: 2,664,192 (6)
abstracting: (pol3_1_1<=4)
states: 2,664,192 (6)
abstracting: (pi2_1_1<=5)
states: 2,664,192 (6)
abstracting: (pil4_1_1<=pi3_1_1)
states: 1,635,584 (6)
abstracting: (pb1_1_1<=5)
states: 2,623,999 (6)
abstracting: (pb5_1_1<=pil3_1_1)
states: 1,512,448 (6)
abstracting: (pi2_1_1<=pol2_1_1)
states: 2,293,504 (6)
abstracting: (pb5_1_1<=pol5_1_1)
states: 1,512,448 (6)
abstracting: (pol2_1_1<=1)
states: 2,664,192 (6)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.218sec

checking: EF [~ [[~ [[[~ [[[5<=pil2_1_1 | po4_1_1<=4] | [pi6_1_1<=4 | pb2_1_1<=1]]] & ~ [[pol4_1_1<=3 & [po3_1_1<=pi2_1_1 | pil1_1_1<=pb2_1_1]]]] & [[~ [[pi5_1_1<=3 & pb4_1_1<=6]] & pil1_1_1<=pb3_1_1] & [[~ [pol3_1_1<=pol5_1_1] | [5<=pol4_1_1 & po6_1_1<=1]] & 2<=po4_1_1]]]] | ~ [[~ [[pi1_1_1<=0 & [[~ [5<=pol4_1_1] | [pi5_1_1<=pol1_1_1 | pil6_1_1<=pil5_1_1]] | [[pb6_1_1<=pil2_1_1 & 5<=po6_1_1] | [6<=pil1_1_1 & po1_1_1<=1]]]]] | ~ [[4<=po2_1_1 & ~ [3<=pb3_1_1]]]]]]]]
normalized: E [true U ~ [[~ [[~ [[4<=po2_1_1 & ~ [3<=pb3_1_1]]] | ~ [[pi1_1_1<=0 & [[[6<=pil1_1_1 & po1_1_1<=1] | [pb6_1_1<=pil2_1_1 & 5<=po6_1_1]] | [[pi5_1_1<=pol1_1_1 | pil6_1_1<=pil5_1_1] | ~ [5<=pol4_1_1]]]]]]] | ~ [[[[2<=po4_1_1 & [[5<=pol4_1_1 & po6_1_1<=1] | ~ [pol3_1_1<=pol5_1_1]]] & [pil1_1_1<=pb3_1_1 & ~ [[pi5_1_1<=3 & pb4_1_1<=6]]]] & [~ [[pol4_1_1<=3 & [po3_1_1<=pi2_1_1 | pil1_1_1<=pb2_1_1]]] & ~ [[[pi6_1_1<=4 | pb2_1_1<=1] | [5<=pil2_1_1 | po4_1_1<=4]]]]]]]]]

abstracting: (po4_1_1<=4)
states: 2,664,192 (6)
abstracting: (5<=pil2_1_1)
states: 0
abstracting: (pb2_1_1<=1)
states: 1,777,152 (6)
abstracting: (pi6_1_1<=4)
states: 2,664,192 (6)
abstracting: (pil1_1_1<=pb2_1_1)
states: 2,006,272 (6)
abstracting: (po3_1_1<=pi2_1_1)
states: 2,031,744 (6)
abstracting: (pol4_1_1<=3)
states: 2,664,192 (6)
abstracting: (pb4_1_1<=6)
states: 2,650,350 (6)
abstracting: (pi5_1_1<=3)
states: 2,664,192 (6)
abstracting: (pil1_1_1<=pb3_1_1)
states: 2,006,272 (6)
abstracting: (pol3_1_1<=pol5_1_1)
states: 2,031,744 (6)
abstracting: (po6_1_1<=1)
states: 2,664,192 (6)
abstracting: (5<=pol4_1_1)
states: 0
abstracting: (2<=po4_1_1)
states: 0
abstracting: (5<=pol4_1_1)
states: 0
abstracting: (pil6_1_1<=pil5_1_1)
states: 2,031,744 (6)
abstracting: (pi5_1_1<=pol1_1_1)
states: 2,293,504 (6)
abstracting: (5<=po6_1_1)
states: 0
abstracting: (pb6_1_1<=pil2_1_1)
states: 1,512,448 (6)
abstracting: (po1_1_1<=1)
states: 2,664,192 (6)
abstracting: (6<=pil1_1_1)
states: 0
abstracting: (pi1_1_1<=0)
states: 1,661,056 (6)
abstracting: (3<=pb3_1_1)
states: 467,456 (5)
abstracting: (4<=po2_1_1)
states: 0
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: EF [[[[~ [[[[pi2_1_1<=pol4_1_1 | [~ [pb2_1_1<=pil4_1_1] | 6<=pol5_1_1]] | pi2_1_1<=3] | pil5_1_1<=pi1_1_1]] | [~ [[[[pbl_1_1<=pb4_1_1 & [5<=po4_1_1 | pb1_1_1<=pi6_1_1]] & 1<=pi2_1_1] & ~ [[pil4_1_1<=pb6_1_1 | [pol1_1_1<=pb3_1_1 & pol3_1_1<=3]]]]] | pi5_1_1<=0]] | ~ [[~ [[[~ [po3_1_1<=5] & [pi2_1_1<=pi6_1_1 & pil3_1_1<=3]] | [[5<=pil2_1_1 | 6<=pi1_1_1] & pol1_1_1<=pil2_1_1]]] & ~ [[~ [[pb3_1_1<=pil4_1_1 & po2_1_1<=0]] & ~ [5<=po6_1_1]]]]]] & ~ [po2_1_1<=1]]]
normalized: E [true U [~ [po2_1_1<=1] & [~ [[~ [[~ [5<=po6_1_1] & ~ [[pb3_1_1<=pil4_1_1 & po2_1_1<=0]]]] & ~ [[[pol1_1_1<=pil2_1_1 & [5<=pil2_1_1 | 6<=pi1_1_1]] | [[pi2_1_1<=pi6_1_1 & pil3_1_1<=3] & ~ [po3_1_1<=5]]]]]] | [[pi5_1_1<=0 | ~ [[~ [[pil4_1_1<=pb6_1_1 | [pol1_1_1<=pb3_1_1 & pol3_1_1<=3]]] & [1<=pi2_1_1 & [pbl_1_1<=pb4_1_1 & [5<=po4_1_1 | pb1_1_1<=pi6_1_1]]]]]] | ~ [[pil5_1_1<=pi1_1_1 | [pi2_1_1<=3 | [pi2_1_1<=pol4_1_1 | [6<=pol5_1_1 | ~ [pb2_1_1<=pil4_1_1]]]]]]]]]]

abstracting: (pb2_1_1<=pil4_1_1)
states: 1,512,448 (6)
abstracting: (6<=pol5_1_1)
states: 0
abstracting: (pi2_1_1<=pol4_1_1)
states: 2,293,504 (6)
abstracting: (pi2_1_1<=3)
states: 2,664,192 (6)
abstracting: (pil5_1_1<=pi1_1_1)
states: 1,635,584 (6)
abstracting: (pb1_1_1<=pi6_1_1)
states: 1,349,888 (6)
abstracting: (5<=po4_1_1)
states: 0
abstracting: (pbl_1_1<=pb4_1_1)
states: 3,580 (3)
abstracting: (1<=pi2_1_1)
states: 1,003,136 (6)
abstracting: (pol3_1_1<=3)
states: 2,664,192 (6)
abstracting: (pol1_1_1<=pb3_1_1)
states: 2,006,272 (6)
abstracting: (pil4_1_1<=pb6_1_1)
states: 2,006,272 (6)
abstracting: (pi5_1_1<=0)
states: 1,661,056 (6)
abstracting: (po3_1_1<=5)
states: 2,664,192 (6)
abstracting: (pil3_1_1<=3)
states: 2,664,192 (6)
abstracting: (pi2_1_1<=pi6_1_1)
states: 2,031,744 (6)
abstracting: (6<=pi1_1_1)
states: 0
abstracting: (5<=pil2_1_1)
states: 0
abstracting: (pol1_1_1<=pil2_1_1)
states: 2,031,744 (6)
abstracting: (po2_1_1<=0)
states: 1,661,056 (6)
abstracting: (pb3_1_1<=pil4_1_1)
states: 1,512,448 (6)
abstracting: (5<=po6_1_1)
states: 0
abstracting: (po2_1_1<=1)
states: 2,664,192 (6)
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: AG [[[~ [1<=pil5_1_1] | [2<=pil2_1_1 & [6<=pil1_1_1 & ~ [[~ [4<=po5_1_1] | 1<=pi3_1_1]]]]] | [[[~ [[[pil1_1_1<=pb1_1_1 & [[pil6_1_1<=pbl_1_1 | pb5_1_1<=1] & [1<=pil3_1_1 | pi4_1_1<=0]]] & ~ [[[pb1_1_1<=pol3_1_1 & pil3_1_1<=4] | po4_1_1<=4]]]] & ~ [[[[6<=pil2_1_1 | 1<=pb1_1_1] | 6<=pb5_1_1] | pol5_1_1<=2]]] | [pol4_1_1<=3 | [[~ [pil6_1_1<=pi4_1_1] & [pil1_1_1<=pi3_1_1 & [5<=pol3_1_1 | [po1_1_1<=po5_1_1 & 1<=pol6_1_1]]]] | [~ [[pi5_1_1<=pol2_1_1 & pi6_1_1<=0]] | pil2_1_1<=pol4_1_1]]]] | [pb6_1_1<=4 & ~ [5<=pi4_1_1]]]]]
normalized: ~ [E [true U ~ [[[[pb6_1_1<=4 & ~ [5<=pi4_1_1]] | [[pol4_1_1<=3 | [[pil2_1_1<=pol4_1_1 | ~ [[pi5_1_1<=pol2_1_1 & pi6_1_1<=0]]] | [[pil1_1_1<=pi3_1_1 & [5<=pol3_1_1 | [po1_1_1<=po5_1_1 & 1<=pol6_1_1]]] & ~ [pil6_1_1<=pi4_1_1]]]] | [~ [[pol5_1_1<=2 | [6<=pb5_1_1 | [6<=pil2_1_1 | 1<=pb1_1_1]]]] & ~ [[~ [[po4_1_1<=4 | [pb1_1_1<=pol3_1_1 & pil3_1_1<=4]]] & [pil1_1_1<=pb1_1_1 & [[1<=pil3_1_1 | pi4_1_1<=0] & [pil6_1_1<=pbl_1_1 | pb5_1_1<=1]]]]]]]] | [[2<=pil2_1_1 & [6<=pil1_1_1 & ~ [[1<=pi3_1_1 | ~ [4<=po5_1_1]]]]] | ~ [1<=pil5_1_1]]]]]]

abstracting: (1<=pil5_1_1)
states: 1,661,056 (6)
abstracting: (4<=po5_1_1)
states: 0
abstracting: (1<=pi3_1_1)
states: 1,003,136 (6)
abstracting: (6<=pil1_1_1)
states: 0
abstracting: (2<=pil2_1_1)
states: 0
abstracting: (pb5_1_1<=1)
states: 1,777,152 (6)
abstracting: (pil6_1_1<=pbl_1_1)
states: 2,664,192 (6)
abstracting: (pi4_1_1<=0)
states: 1,661,056 (6)
abstracting: (1<=pil3_1_1)
states: 1,661,056 (6)
abstracting: (pil1_1_1<=pb1_1_1)
states: 2,006,272 (6)
abstracting: (pil3_1_1<=4)
states: 2,664,192 (6)
abstracting: (pb1_1_1<=pol3_1_1)
states: 1,512,448 (6)
abstracting: (po4_1_1<=4)
states: 2,664,192 (6)
abstracting: (1<=pb1_1_1)
states: 1,579,008 (6)
abstracting: (6<=pil2_1_1)
states: 0
abstracting: (6<=pb5_1_1)
states: 40,193 (4)
abstracting: (pol5_1_1<=2)
states: 2,664,192 (6)
abstracting: (pil6_1_1<=pi4_1_1)
states: 1,635,584 (6)
abstracting: (1<=pol6_1_1)
states: 1,661,056 (6)
abstracting: (po1_1_1<=po5_1_1)
states: 2,031,744 (6)
abstracting: (5<=pol3_1_1)
states: 0
abstracting: (pil1_1_1<=pi3_1_1)
states: 1,635,584 (6)
abstracting: (pi6_1_1<=0)
states: 1,661,056 (6)
abstracting: (pi5_1_1<=pol2_1_1)
states: 2,293,504 (6)
abstracting: (pil2_1_1<=pol4_1_1)
states: 2,031,744 (6)
abstracting: (pol4_1_1<=3)
states: 2,664,192 (6)
abstracting: (5<=pi4_1_1)
states: 0
abstracting: (pb6_1_1<=4)
states: 2,562,816 (6)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: EF [~ [[~ [[[[[~ [[pol3_1_1<=pol1_1_1 | pol6_1_1<=pi5_1_1]] | [[pi2_1_1<=pi3_1_1 | 4<=pi2_1_1] | [po2_1_1<=pb1_1_1 | pi3_1_1<=pol1_1_1]]] & 3<=po6_1_1] & [[[~ [po4_1_1<=pil5_1_1] & 5<=pb2_1_1] | ~ [[pil3_1_1<=pb5_1_1 | pol5_1_1<=2]]] & [1<=pil1_1_1 | ~ [[1<=pil5_1_1 & 3<=pil1_1_1]]]]] | [[5<=pi3_1_1 & [[pb6_1_1<=1 & ~ [pi6_1_1<=pol6_1_1]] & po4_1_1<=1]] & [[pol6_1_1<=pi3_1_1 | [[pil4_1_1<=2 | pil5_1_1<=3] | [po5_1_1<=2 & pol5_1_1<=pb6_1_1]]] & ~ [[pi4_1_1<=pil1_1_1 | pol3_1_1<=0]]]]]] & ~ [2<=po1_1_1]]]]
normalized: E [true U ~ [[~ [2<=po1_1_1] & ~ [[[[~ [[pi4_1_1<=pil1_1_1 | pol3_1_1<=0]] & [pol6_1_1<=pi3_1_1 | [[po5_1_1<=2 & pol5_1_1<=pb6_1_1] | [pil4_1_1<=2 | pil5_1_1<=3]]]] & [5<=pi3_1_1 & [po4_1_1<=1 & [pb6_1_1<=1 & ~ [pi6_1_1<=pol6_1_1]]]]] | [[[1<=pil1_1_1 | ~ [[1<=pil5_1_1 & 3<=pil1_1_1]]] & [~ [[pil3_1_1<=pb5_1_1 | pol5_1_1<=2]] | [5<=pb2_1_1 & ~ [po4_1_1<=pil5_1_1]]]] & [3<=po6_1_1 & [[[po2_1_1<=pb1_1_1 | pi3_1_1<=pol1_1_1] | [pi2_1_1<=pi3_1_1 | 4<=pi2_1_1]] | ~ [[pol3_1_1<=pol1_1_1 | pol6_1_1<=pi5_1_1]]]]]]]]]]

abstracting: (pol6_1_1<=pi5_1_1)
states: 1,635,584 (6)
abstracting: (pol3_1_1<=pol1_1_1)
states: 2,031,744 (6)
abstracting: (4<=pi2_1_1)
states: 0
abstracting: (pi2_1_1<=pi3_1_1)
states: 2,031,744 (6)
abstracting: (pi3_1_1<=pol1_1_1)
states: 2,293,504 (6)
abstracting: (po2_1_1<=pb1_1_1)
states: 2,236,928 (6)
abstracting: (3<=po6_1_1)
states: 0
abstracting: (po4_1_1<=pil5_1_1)
states: 2,293,504 (6)
abstracting: (5<=pb2_1_1)
states: 101,376 (5)
abstracting: (pol5_1_1<=2)
states: 2,664,192 (6)
abstracting: (pil3_1_1<=pb5_1_1)
states: 2,006,272 (6)
abstracting: (3<=pil1_1_1)
states: 0
abstracting: (1<=pil5_1_1)
states: 1,661,056 (6)
abstracting: (1<=pil1_1_1)
states: 1,661,056 (6)
abstracting: (pi6_1_1<=pol6_1_1)
states: 2,293,504 (6)
abstracting: (pb6_1_1<=1)
states: 1,777,152 (6)
abstracting: (po4_1_1<=1)
states: 2,664,192 (6)
abstracting: (5<=pi3_1_1)
states: 0
abstracting: (pil5_1_1<=3)
states: 2,664,192 (6)
abstracting: (pil4_1_1<=2)
states: 2,664,192 (6)
abstracting: (pol5_1_1<=pb6_1_1)
states: 2,006,272 (6)
abstracting: (po5_1_1<=2)
states: 2,664,192 (6)
abstracting: (pol6_1_1<=pi3_1_1)
states: 1,635,584 (6)
abstracting: (pol3_1_1<=0)
states: 1,003,136 (6)
abstracting: (pi4_1_1<=pil1_1_1)
states: 2,293,504 (6)
abstracting: (2<=po1_1_1)
states: 0
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: AG [[4<=pi4_1_1 | [~ [[6<=pil6_1_1 & [[~ [pb2_1_1<=pol2_1_1] & [[[pol3_1_1<=pb6_1_1 | pb3_1_1<=6] & ~ [pil6_1_1<=po6_1_1]] & [pi3_1_1<=6 & pol6_1_1<=pi2_1_1]]] & [pb1_1_1<=4 | [pb3_1_1<=pb6_1_1 | 1<=po4_1_1]]]]] | [~ [[[~ [pi6_1_1<=pbl_1_1] & [[5<=pol1_1_1 & pi1_1_1<=5] | ~ [pi1_1_1<=pb6_1_1]]] | [[[pi2_1_1<=0 & 3<=pil5_1_1] | [pb6_1_1<=3 | pb1_1_1<=po2_1_1]] | [[6<=pil3_1_1 | pol5_1_1<=po1_1_1] & [6<=pol4_1_1 | po5_1_1<=2]]]]] | ~ [[[~ [[[2<=pil1_1_1 & po4_1_1<=pi1_1_1] | [po2_1_1<=pil4_1_1 | pil3_1_1<=3]]] & pb4_1_1<=4] | pol4_1_1<=pil3_1_1]]]]]]
normalized: ~ [E [true U ~ [[4<=pi4_1_1 | [[~ [[pol4_1_1<=pil3_1_1 | [pb4_1_1<=4 & ~ [[[po2_1_1<=pil4_1_1 | pil3_1_1<=3] | [2<=pil1_1_1 & po4_1_1<=pi1_1_1]]]]]] | ~ [[[[[6<=pol4_1_1 | po5_1_1<=2] & [6<=pil3_1_1 | pol5_1_1<=po1_1_1]] | [[pb6_1_1<=3 | pb1_1_1<=po2_1_1] | [pi2_1_1<=0 & 3<=pil5_1_1]]] | [[~ [pi1_1_1<=pb6_1_1] | [5<=pol1_1_1 & pi1_1_1<=5]] & ~ [pi6_1_1<=pbl_1_1]]]]] | ~ [[6<=pil6_1_1 & [[pb1_1_1<=4 | [pb3_1_1<=pb6_1_1 | 1<=po4_1_1]] & [[[pi3_1_1<=6 & pol6_1_1<=pi2_1_1] & [~ [pil6_1_1<=po6_1_1] & [pol3_1_1<=pb6_1_1 | pb3_1_1<=6]]] & ~ [pb2_1_1<=pol2_1_1]]]]]]]]]]

abstracting: (pb2_1_1<=pol2_1_1)
states: 1,512,448 (6)
abstracting: (pb3_1_1<=6)
states: 2,650,350 (6)
abstracting: (pol3_1_1<=pb6_1_1)
states: 2,006,272 (6)
abstracting: (pil6_1_1<=po6_1_1)
states: 1,635,584 (6)
abstracting: (pol6_1_1<=pi2_1_1)
states: 1,635,584 (6)
abstracting: (pi3_1_1<=6)
states: 2,664,192 (6)
abstracting: (1<=po4_1_1)
states: 1,003,136 (6)
abstracting: (pb3_1_1<=pb6_1_1)
states: 1,661,056 (6)
abstracting: (pb1_1_1<=4)
states: 2,562,816 (6)
abstracting: (6<=pil6_1_1)
states: 0
abstracting: (pi6_1_1<=pbl_1_1)
states: 2,664,192 (6)
abstracting: (pi1_1_1<=5)
states: 2,664,192 (6)
abstracting: (5<=pol1_1_1)
states: 0
abstracting: (pi1_1_1<=pb6_1_1)
states: 2,236,928 (6)
abstracting: (3<=pil5_1_1)
states: 0
abstracting: (pi2_1_1<=0)
states: 1,661,056 (6)
abstracting: (pb1_1_1<=po2_1_1)
states: 1,349,888 (6)
abstracting: (pb6_1_1<=3)
states: 2,436,096 (6)
abstracting: (pol5_1_1<=po1_1_1)
states: 1,635,584 (6)
abstracting: (6<=pil3_1_1)
states: 0
abstracting: (po5_1_1<=2)
states: 2,664,192 (6)
abstracting: (6<=pol4_1_1)
states: 0
abstracting: (po4_1_1<=pi1_1_1)
states: 2,031,744 (6)
abstracting: (2<=pil1_1_1)
states: 0
abstracting: (pil3_1_1<=3)
states: 2,664,192 (6)
abstracting: (po2_1_1<=pil4_1_1)
states: 2,293,504 (6)
abstracting: (pb4_1_1<=4)
states: 2,562,816 (6)
abstracting: (pol4_1_1<=pil3_1_1)
states: 2,031,744 (6)
abstracting: (4<=pi4_1_1)
states: 0
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: AG [[[~ [[[pb2_1_1<=po6_1_1 | ~ [[[po3_1_1<=3 & pil4_1_1<=pi1_1_1] & [po1_1_1<=pi3_1_1 | pb2_1_1<=pb1_1_1]]]] & [pil6_1_1<=4 & [[~ [3<=pb5_1_1] & pil6_1_1<=po5_1_1] & [[1<=po3_1_1 | pi4_1_1<=pb5_1_1] | 6<=po1_1_1]]]]] | [[pb4_1_1<=4 | ~ [pil2_1_1<=5]] | [[[pil3_1_1<=po6_1_1 | [~ [1<=pol5_1_1] | pb2_1_1<=6]] | [[2<=po5_1_1 | [po3_1_1<=pil6_1_1 | [pb2_1_1<=6 & po6_1_1<=po5_1_1]]] & [[5<=pol2_1_1 & ~ [pb5_1_1<=2]] | ~ [[2<=pil3_1_1 & po1_1_1<=3]]]]] | [[[[[pil5_1_1<=5 | 3<=pi4_1_1] & [pil1_1_1<=5 & pi3_1_1<=2]] | pol6_1_1<=2] | [4<=pb4_1_1 & 1<=pil3_1_1]] & [[1<=po5_1_1 & [~ [2<=po4_1_1] | [pi1_1_1<=1 & pil1_1_1<=po1_1_1]]] | 1<=pil2_1_1]]]]] | [4<=po6_1_1 & [po1_1_1<=po5_1_1 & pi4_1_1<=1]]]]
normalized: ~ [E [true U ~ [[[4<=po6_1_1 & [po1_1_1<=po5_1_1 & pi4_1_1<=1]] | [[[[[1<=pil2_1_1 | [1<=po5_1_1 & [[pi1_1_1<=1 & pil1_1_1<=po1_1_1] | ~ [2<=po4_1_1]]]] & [[4<=pb4_1_1 & 1<=pil3_1_1] | [pol6_1_1<=2 | [[pil1_1_1<=5 & pi3_1_1<=2] & [pil5_1_1<=5 | 3<=pi4_1_1]]]]] | [[[~ [[2<=pil3_1_1 & po1_1_1<=3]] | [5<=pol2_1_1 & ~ [pb5_1_1<=2]]] & [2<=po5_1_1 | [po3_1_1<=pil6_1_1 | [pb2_1_1<=6 & po6_1_1<=po5_1_1]]]] | [pil3_1_1<=po6_1_1 | [pb2_1_1<=6 | ~ [1<=pol5_1_1]]]]] | [pb4_1_1<=4 | ~ [pil2_1_1<=5]]] | ~ [[[pil6_1_1<=4 & [[6<=po1_1_1 | [1<=po3_1_1 | pi4_1_1<=pb5_1_1]] & [pil6_1_1<=po5_1_1 & ~ [3<=pb5_1_1]]]] & [pb2_1_1<=po6_1_1 | ~ [[[po1_1_1<=pi3_1_1 | pb2_1_1<=pb1_1_1] & [po3_1_1<=3 & pil4_1_1<=pi1_1_1]]]]]]]]]]]

abstracting: (pil4_1_1<=pi1_1_1)
states: 1,635,584 (6)
abstracting: (po3_1_1<=3)
states: 2,664,192 (6)
abstracting: (pb2_1_1<=pb1_1_1)
states: 1,661,056 (6)
abstracting: (po1_1_1<=pi3_1_1)
states: 2,031,744 (6)
abstracting: (pb2_1_1<=po6_1_1)
states: 1,349,888 (6)
abstracting: (3<=pb5_1_1)
states: 467,456 (5)
abstracting: (pil6_1_1<=po5_1_1)
states: 1,635,584 (6)
abstracting: (pi4_1_1<=pb5_1_1)
states: 2,236,928 (6)
abstracting: (1<=po3_1_1)
states: 1,003,136 (6)
abstracting: (6<=po1_1_1)
states: 0
abstracting: (pil6_1_1<=4)
states: 2,664,192 (6)
abstracting: (pil2_1_1<=5)
states: 2,664,192 (6)
abstracting: (pb4_1_1<=4)
states: 2,562,816 (6)
abstracting: (1<=pol5_1_1)
states: 1,661,056 (6)
abstracting: (pb2_1_1<=6)
states: 2,650,350 (6)
abstracting: (pil3_1_1<=po6_1_1)
states: 1,635,584 (6)
abstracting: (po6_1_1<=po5_1_1)
states: 2,031,744 (6)
abstracting: (pb2_1_1<=6)
states: 2,650,350 (6)
abstracting: (po3_1_1<=pil6_1_1)
states: 2,293,504 (6)
abstracting: (2<=po5_1_1)
states: 0
abstracting: (pb5_1_1<=2)
states: 2,196,736 (6)
abstracting: (5<=pol2_1_1)
states: 0
abstracting: (po1_1_1<=3)
states: 2,664,192 (6)
abstracting: (2<=pil3_1_1)
states: 0
abstracting: (3<=pi4_1_1)
states: 0
abstracting: (pil5_1_1<=5)
states: 2,664,192 (6)
abstracting: (pi3_1_1<=2)
states: 2,664,192 (6)
abstracting: (pil1_1_1<=5)
states: 2,664,192 (6)
abstracting: (pol6_1_1<=2)
states: 2,664,192 (6)
abstracting: (1<=pil3_1_1)
states: 1,661,056 (6)
abstracting: (4<=pb4_1_1)
states: 228,096 (5)
abstracting: (2<=po4_1_1)
states: 0
abstracting: (pil1_1_1<=po1_1_1)
states: 1,635,584 (6)
abstracting: (pi1_1_1<=1)
states: 2,664,192 (6)
abstracting: (1<=po5_1_1)
states: 1,003,136 (6)
abstracting: (1<=pil2_1_1)
states: 1,661,056 (6)
abstracting: (pi4_1_1<=1)
states: 2,664,192 (6)
abstracting: (po1_1_1<=po5_1_1)
states: 2,031,744 (6)
abstracting: (4<=po6_1_1)
states: 0
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: AG [[[~ [1<=pil1_1_1] & [~ [[~ [[[[pb2_1_1<=pil4_1_1 & pol4_1_1<=2] & pol4_1_1<=2] & pil2_1_1<=pb6_1_1]] & [[[~ [pol1_1_1<=pb4_1_1] | [pb4_1_1<=pb1_1_1 & pb6_1_1<=0]] | [[pb1_1_1<=5 | po2_1_1<=pb4_1_1] & ~ [pil2_1_1<=pil6_1_1]]] | [~ [po3_1_1<=6] & [~ [pol2_1_1<=pb6_1_1] & [pol1_1_1<=0 | 1<=po1_1_1]]]]]] | [pb3_1_1<=4 & [[[pi6_1_1<=pil2_1_1 & [pol5_1_1<=pi4_1_1 | [po5_1_1<=po2_1_1 & po4_1_1<=po2_1_1]]] & ~ [[[1<=pol4_1_1 | pi5_1_1<=5] & [3<=pol3_1_1 & pil3_1_1<=2]]]] & [[[~ [pil1_1_1<=pb1_1_1] & [po3_1_1<=pol2_1_1 & 5<=pb3_1_1]] | po3_1_1<=pil4_1_1] | [~ [[6<=pb4_1_1 | pb6_1_1<=pb1_1_1]] & ~ [[6<=pb4_1_1 & 2<=po3_1_1]]]]]]]] | [pil3_1_1<=6 | [~ [[pb6_1_1<=6 & [[[~ [pol1_1_1<=po3_1_1] | [po3_1_1<=0 | pol2_1_1<=pb1_1_1]] | [~ [pil1_1_1<=po1_1_1] | 2<=po6_1_1]] | po6_1_1<=0]]] & [~ [[~ [2<=pil4_1_1] | [po1_1_1<=5 | [[3<=po3_1_1 | 1<=pb1_1_1] | [pi6_1_1<=2 | pi5_1_1<=6]]]]] | pb6_1_1<=pi2_1_1]]]]]
normalized: ~ [E [true U ~ [[[pil3_1_1<=6 | [[pb6_1_1<=pi2_1_1 | ~ [[[po1_1_1<=5 | [[pi6_1_1<=2 | pi5_1_1<=6] | [3<=po3_1_1 | 1<=pb1_1_1]]] | ~ [2<=pil4_1_1]]]] & ~ [[pb6_1_1<=6 & [po6_1_1<=0 | [[2<=po6_1_1 | ~ [pil1_1_1<=po1_1_1]] | [[po3_1_1<=0 | pol2_1_1<=pb1_1_1] | ~ [pol1_1_1<=po3_1_1]]]]]]]] | [[[pb3_1_1<=4 & [[[~ [[6<=pb4_1_1 & 2<=po3_1_1]] & ~ [[6<=pb4_1_1 | pb6_1_1<=pb1_1_1]]] | [po3_1_1<=pil4_1_1 | [[po3_1_1<=pol2_1_1 & 5<=pb3_1_1] & ~ [pil1_1_1<=pb1_1_1]]]] & [~ [[[3<=pol3_1_1 & pil3_1_1<=2] & [1<=pol4_1_1 | pi5_1_1<=5]]] & [pi6_1_1<=pil2_1_1 & [pol5_1_1<=pi4_1_1 | [po5_1_1<=po2_1_1 & po4_1_1<=po2_1_1]]]]]] | ~ [[[[[[pol1_1_1<=0 | 1<=po1_1_1] & ~ [pol2_1_1<=pb6_1_1]] & ~ [po3_1_1<=6]] | [[~ [pil2_1_1<=pil6_1_1] & [pb1_1_1<=5 | po2_1_1<=pb4_1_1]] | [[pb4_1_1<=pb1_1_1 & pb6_1_1<=0] | ~ [pol1_1_1<=pb4_1_1]]]] & ~ [[pil2_1_1<=pb6_1_1 & [pol4_1_1<=2 & [pb2_1_1<=pil4_1_1 & pol4_1_1<=2]]]]]]] & ~ [1<=pil1_1_1]]]]]]

abstracting: (1<=pil1_1_1)
states: 1,661,056 (6)
abstracting: (pol4_1_1<=2)
states: 2,664,192 (6)
abstracting: (pb2_1_1<=pil4_1_1)
states: 1,512,448 (6)
abstracting: (pol4_1_1<=2)
states: 2,664,192 (6)
abstracting: (pil2_1_1<=pb6_1_1)
states: 2,006,272 (6)
abstracting: (pol1_1_1<=pb4_1_1)
states: 2,006,272 (6)
abstracting: (pb6_1_1<=0)
states: 1,085,184 (6)
abstracting: (pb4_1_1<=pb1_1_1)
states: 1,661,056 (6)
abstracting: (po2_1_1<=pb4_1_1)
states: 2,236,928 (6)
abstracting: (pb1_1_1<=5)
states: 2,623,999 (6)
abstracting: (pil2_1_1<=pil6_1_1)
states: 2,031,744 (6)
abstracting: (po3_1_1<=6)
states: 2,664,192 (6)
abstracting: (pol2_1_1<=pb6_1_1)
states: 2,006,272 (6)
abstracting: (1<=po1_1_1)
states: 1,003,136 (6)
abstracting: (pol1_1_1<=0)
states: 1,003,136 (6)
abstracting: (po4_1_1<=po2_1_1)
states: 2,031,744 (6)
abstracting: (po5_1_1<=po2_1_1)
states: 2,031,744 (6)
abstracting: (pol5_1_1<=pi4_1_1)
states: 1,635,584 (6)
abstracting: (pi6_1_1<=pil2_1_1)
states: 2,293,504 (6)
abstracting: (pi5_1_1<=5)
states: 2,664,192 (6)
abstracting: (1<=pol4_1_1)
states: 1,661,056 (6)
abstracting: (pil3_1_1<=2)
states: 2,664,192 (6)
abstracting: (3<=pol3_1_1)
states: 0
abstracting: (pil1_1_1<=pb1_1_1)
states: 2,006,272 (6)
abstracting: (5<=pb3_1_1)
states: 101,376 (5)
abstracting: (po3_1_1<=pol2_1_1)
states: 2,293,504 (6)
abstracting: (po3_1_1<=pil4_1_1)
states: 2,293,504 (6)
abstracting: (pb6_1_1<=pb1_1_1)
states: 1,661,056 (6)
abstracting: (6<=pb4_1_1)
states: 40,193 (4)
abstracting: (2<=po3_1_1)
states: 0
abstracting: (6<=pb4_1_1)
states: 40,193 (4)
abstracting: (pb3_1_1<=4)
states: 2,562,816 (6)
abstracting: (pol1_1_1<=po3_1_1)
states: 1,635,584 (6)
abstracting: (pol2_1_1<=pb1_1_1)
states: 2,006,272 (6)
abstracting: (po3_1_1<=0)
states: 1,661,056 (6)
abstracting: (pil1_1_1<=po1_1_1)
states: 1,635,584 (6)
abstracting: (2<=po6_1_1)
states: 0
abstracting: (po6_1_1<=0)
states: 1,661,056 (6)
abstracting: (pb6_1_1<=6)
states: 2,650,350 (6)
abstracting: (2<=pil4_1_1)
states: 0
abstracting: (1<=pb1_1_1)
states: 1,579,008 (6)
abstracting: (3<=po3_1_1)
states: 0
abstracting: (pi5_1_1<=6)
states: 2,664,192 (6)
abstracting: (pi6_1_1<=2)
states: 2,664,192 (6)
abstracting: (po1_1_1<=5)
states: 2,664,192 (6)
abstracting: (pb6_1_1<=pi2_1_1)
states: 1,349,888 (6)
abstracting: (pil3_1_1<=6)
states: 2,664,192 (6)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.047sec

checking: EF [[[~ [[~ [[~ [4<=pb2_1_1] | po3_1_1<=pi2_1_1]] & [3<=pb6_1_1 & [[~ [[pi3_1_1<=po3_1_1 & pil1_1_1<=4]] & ~ [pb4_1_1<=pi1_1_1]] | pil2_1_1<=pi1_1_1]]]] & [[[~ [[~ [pb5_1_1<=pil5_1_1] & [[pil6_1_1<=1 | pb3_1_1<=pil5_1_1] & [pb4_1_1<=pi6_1_1 | 3<=pi6_1_1]]]] & [[[pi1_1_1<=po3_1_1 & ~ [1<=pb5_1_1]] | [[po2_1_1<=pol2_1_1 | pol2_1_1<=pi2_1_1] & [3<=po2_1_1 & po3_1_1<=pil3_1_1]]] | ~ [[[5<=pb5_1_1 & 2<=pi1_1_1] & [pol2_1_1<=pil2_1_1 & pol6_1_1<=6]]]]] & pi6_1_1<=po4_1_1] | [~ [pbl_1_1<=3] | ~ [pbl_1_1<=1]]]] & ~ [[[~ [[pi4_1_1<=pb5_1_1 & [[[2<=pb1_1_1 & po5_1_1<=pb5_1_1] | pi1_1_1<=0] & ~ [[6<=pol4_1_1 & pol5_1_1<=1]]]]] | ~ [[~ [4<=po1_1_1] & [~ [[2<=po1_1_1 | pol4_1_1<=pb4_1_1]] & [[4<=po4_1_1 & 4<=pi3_1_1] & [pol2_1_1<=5 | pol6_1_1<=pb5_1_1]]]]]] & [[~ [[1<=pil5_1_1 & [[2<=pol1_1_1 & pol5_1_1<=pol1_1_1] & ~ [pol5_1_1<=pil5_1_1]]]] | [~ [[[6<=pb1_1_1 & 6<=pol1_1_1] & pi3_1_1<=6]] | ~ [[po1_1_1<=0 & pb6_1_1<=pil1_1_1]]]] & [~ [2<=pol1_1_1] | ~ [[[5<=pil3_1_1 | pbl_1_1<=1] | 6<=pil3_1_1]]]]]]]]
normalized: E [true U [~ [[[[~ [[6<=pil3_1_1 | [5<=pil3_1_1 | pbl_1_1<=1]]] | ~ [2<=pol1_1_1]] & [[~ [[po1_1_1<=0 & pb6_1_1<=pil1_1_1]] | ~ [[pi3_1_1<=6 & [6<=pb1_1_1 & 6<=pol1_1_1]]]] | ~ [[1<=pil5_1_1 & [~ [pol5_1_1<=pil5_1_1] & [2<=pol1_1_1 & pol5_1_1<=pol1_1_1]]]]]] & [~ [[[[[pol2_1_1<=5 | pol6_1_1<=pb5_1_1] & [4<=po4_1_1 & 4<=pi3_1_1]] & ~ [[2<=po1_1_1 | pol4_1_1<=pb4_1_1]]] & ~ [4<=po1_1_1]]] | ~ [[pi4_1_1<=pb5_1_1 & [~ [[6<=pol4_1_1 & pol5_1_1<=1]] & [pi1_1_1<=0 | [2<=pb1_1_1 & po5_1_1<=pb5_1_1]]]]]]]] & [[[~ [pbl_1_1<=1] | ~ [pbl_1_1<=3]] | [pi6_1_1<=po4_1_1 & [[~ [[[pol2_1_1<=pil2_1_1 & pol6_1_1<=6] & [5<=pb5_1_1 & 2<=pi1_1_1]]] | [[[3<=po2_1_1 & po3_1_1<=pil3_1_1] & [po2_1_1<=pol2_1_1 | pol2_1_1<=pi2_1_1]] | [pi1_1_1<=po3_1_1 & ~ [1<=pb5_1_1]]]] & ~ [[[[pb4_1_1<=pi6_1_1 | 3<=pi6_1_1] & [pil6_1_1<=1 | pb3_1_1<=pil5_1_1]] & ~ [pb5_1_1<=pil5_1_1]]]]]] & ~ [[[3<=pb6_1_1 & [pil2_1_1<=pi1_1_1 | [~ [pb4_1_1<=pi1_1_1] & ~ [[pi3_1_1<=po3_1_1 & pil1_1_1<=4]]]]] & ~ [[po3_1_1<=pi2_1_1 | ~ [4<=pb2_1_1]]]]]]]]

abstracting: (4<=pb2_1_1)
states: 228,096 (5)
abstracting: (po3_1_1<=pi2_1_1)
states: 2,031,744 (6)
abstracting: (pil1_1_1<=4)
states: 2,664,192 (6)
abstracting: (pi3_1_1<=po3_1_1)
states: 2,031,744 (6)
abstracting: (pb4_1_1<=pi1_1_1)
states: 1,349,888 (6)
abstracting: (pil2_1_1<=pi1_1_1)
states: 1,635,584 (6)
abstracting: (3<=pb6_1_1)
states: 467,456 (5)
abstracting: (pb5_1_1<=pil5_1_1)
states: 1,512,448 (6)
abstracting: (pb3_1_1<=pil5_1_1)
states: 1,512,448 (6)
abstracting: (pil6_1_1<=1)
states: 2,664,192 (6)
abstracting: (3<=pi6_1_1)
states: 0
abstracting: (pb4_1_1<=pi6_1_1)
states: 1,349,888 (6)
abstracting: (1<=pb5_1_1)
states: 1,579,008 (6)
abstracting: (pi1_1_1<=po3_1_1)
states: 2,031,744 (6)
abstracting: (pol2_1_1<=pi2_1_1)
states: 1,635,584 (6)
abstracting: (po2_1_1<=pol2_1_1)
states: 1,661,056 (6)
abstracting: (po3_1_1<=pil3_1_1)
states: 2,293,504 (6)
abstracting: (3<=po2_1_1)
states: 0
abstracting: (2<=pi1_1_1)
states: 0
abstracting: (5<=pb5_1_1)
states: 101,376 (5)
abstracting: (pol6_1_1<=6)
states: 2,664,192 (6)
abstracting: (pol2_1_1<=pil2_1_1)
states: 2,031,744 (6)
abstracting: (pi6_1_1<=po4_1_1)
states: 2,031,744 (6)
abstracting: (pbl_1_1<=3)
states: 0
abstracting: (pbl_1_1<=1)
states: 0
abstracting: (po5_1_1<=pb5_1_1)
states: 2,236,928 (6)
abstracting: (2<=pb1_1_1)
states: 887,040 (5)
abstracting: (pi1_1_1<=0)
states: 1,661,056 (6)
abstracting: (pol5_1_1<=1)
states: 2,664,192 (6)
abstracting: (6<=pol4_1_1)
states: 0
abstracting: (pi4_1_1<=pb5_1_1)
states: 2,236,928 (6)
abstracting: (4<=po1_1_1)
states: 0
abstracting: (pol4_1_1<=pb4_1_1)
states: 2,006,272 (6)
abstracting: (2<=po1_1_1)
states: 0
abstracting: (4<=pi3_1_1)
states: 0
abstracting: (4<=po4_1_1)
states: 0
abstracting: (pol6_1_1<=pb5_1_1)
states: 2,006,272 (6)
abstracting: (pol2_1_1<=5)
states: 2,664,192 (6)
abstracting: (pol5_1_1<=pol1_1_1)
states: 2,031,744 (6)
abstracting: (2<=pol1_1_1)
states: 0
abstracting: (pol5_1_1<=pil5_1_1)
states: 2,031,744 (6)
abstracting: (1<=pil5_1_1)
states: 1,661,056 (6)
abstracting: (6<=pol1_1_1)
states: 0
abstracting: (6<=pb1_1_1)
states: 40,193 (4)
abstracting: (pi3_1_1<=6)
states: 2,664,192 (6)
abstracting: (pb6_1_1<=pil1_1_1)
states: 1,512,448 (6)
abstracting: (po1_1_1<=0)
states: 1,661,056 (6)
abstracting: (2<=pol1_1_1)
states: 0
abstracting: (pbl_1_1<=1)
states: 0
abstracting: (5<=pil3_1_1)
states: 0
abstracting: (6<=pil3_1_1)
states: 0
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

totally nodes used: 185391 (1.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 854780 976644 1831424
used/not used/entry size/cache size: 1008583 66100281 16 1024MB
basic ops cache: hits/miss/sum: 371264 416227 787491
used/not used/entry size/cache size: 694939 16082277 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: 59497 53147 112644
used/not used/entry size/cache size: 53056 8335552 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 66929887
1 174656
2 3625
3 454
4 44
5 43
6 37
7 20
8 16
9 11
>= 10 71

Total processing time: 0m 5.627sec


BK_STOP 1678734019204

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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:1242 (29), effective:124 (2)

initing FirstDep: 0m 0.000sec


iterations count:1455 (34), effective:93 (2)

iterations count:1982 (47), effective:110 (2)

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="HexagonalGrid-PT-126"
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 HexagonalGrid-PT-126, 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 r202-smll-167840348600382"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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