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.r170-tall-167838856600017.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 ERK-PT-000100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856600017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.6K Feb 26 16:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 16:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 16:38 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 3.6K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 16:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 16:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 16:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 16:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 6.7K 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 ERK-PT-000100-CTLCardinality-00
FORMULA_NAME ERK-PT-000100-CTLCardinality-01
FORMULA_NAME ERK-PT-000100-CTLCardinality-02
FORMULA_NAME ERK-PT-000100-CTLCardinality-03
FORMULA_NAME ERK-PT-000100-CTLCardinality-04
FORMULA_NAME ERK-PT-000100-CTLCardinality-05
FORMULA_NAME ERK-PT-000100-CTLCardinality-06
FORMULA_NAME ERK-PT-000100-CTLCardinality-07
FORMULA_NAME ERK-PT-000100-CTLCardinality-08
FORMULA_NAME ERK-PT-000100-CTLCardinality-09
FORMULA_NAME ERK-PT-000100-CTLCardinality-10
FORMULA_NAME ERK-PT-000100-CTLCardinality-11
FORMULA_NAME ERK-PT-000100-CTLCardinality-12
FORMULA_NAME ERK-PT-000100-CTLCardinality-13
FORMULA_NAME ERK-PT-000100-CTLCardinality-14
FORMULA_NAME ERK-PT-000100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678463955558

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ERK-PT-000100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 15:59:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 15:59:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 15:59:17] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-10 15:59:17] [INFO ] Transformed 11 places.
[2023-03-10 15:59:17] [INFO ] Transformed 11 transitions.
[2023-03-10 15:59:17] [INFO ] Parsed PT model containing 11 places and 11 transitions and 34 arcs in 79 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 9 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-10 15:59:17] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-10 15:59:17] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-10 15:59:17] [INFO ] Invariant cache hit.
[2023-03-10 15:59:17] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-10 15:59:17] [INFO ] Invariant cache hit.
[2023-03-10 15:59:17] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 246 ms. Remains : 11/11 places, 11/11 transitions.
Support contains 11 out of 11 places after structural reductions.
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 16 ms
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 4 ms
[2023-03-10 15:59:17] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 89) seen :84
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 15:59:18] [INFO ] Invariant cache hit.
[2023-03-10 15:59:18] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 15:59:18] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-10 15:59:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 15:59:18] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-10 15:59:18] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-10 15:59:18] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 614 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=153 )
Parikh walk visited 1 properties in 4 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 2 ms
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 3 ms
[2023-03-10 15:59:18] [INFO ] Input system was already deterministic with 11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Applied a total of 3 rules in 6 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 9/11 places, 10/11 transitions.
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 9 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 8 transition count 8
Applied a total of 8 rules in 3 ms. Remains 8 /11 variables (removed 3) and now considering 8/11 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 8/11 places, 8/11 transitions.
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 0 ms
[2023-03-10 15:59:18] [INFO ] Input system was already deterministic with 8 transitions.
Finished random walk after 303 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=303 )
FORMULA ERK-PT-000100-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 11 transition count 9
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 7 transition count 9
Applied a total of 6 rules in 1 ms. Remains 7 /11 variables (removed 4) and now considering 9/11 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 7/11 places, 9/11 transitions.
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 11
Applied a total of 1 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Input system was already deterministic with 11 transitions.
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:18] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-10 15:59:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 11 places, 11 transitions and 34 arcs took 1 ms.
Total runtime 1224 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 11 NrTr: 11 NrArc: 34)

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

net check time: 0m 0.000sec

init dd package: 0m 2.798sec


RS generation: 0m 0.032sec


-> reachability set: #nodes 1011 (1.0e+03) #states 15,914,114,086 (10)



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

checking: EG [EX [0<=0]]
normalized: EG [EX [0<=0]]

abstracting: (0<=0)
states: 15,914,114,086 (10)
.
EG iterations: 0
-> the formula is TRUE

FORMULA ERK-PT-000100-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.118sec

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 15,914,114,086 (10)
.-> the formula is TRUE

FORMULA ERK-PT-000100-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [AG [~ [59<=p5]]]
normalized: E [true U ~ [E [true U 59<=p5]]]

abstracting: (59<=p5)
states: 91,373,667 (7)
-> the formula is FALSE

FORMULA ERK-PT-000100-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.278sec

checking: AF [[~ [E [~ [p4<=14] U 32<=p10]] | AG [EF [~ [36<=p10]]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [E [true U ~ [36<=p10]]]]] | ~ [E [~ [p4<=14] U 32<=p10]]]]]]

abstracting: (32<=p10)
states: 15,675,572,398 (10)
abstracting: (p4<=14)
states: 5,103,938,424 (9)
abstracting: (36<=p10)
states: 15,545,328,019 (10)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ERK-PT-000100-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.044sec

checking: EG [AG [E [[~ [[p5<=p9 & p0<=10]] | ~ [[p10<=87 | 71<=p3]]] U 19<=p1]]]
normalized: EG [~ [E [true U ~ [E [[~ [[p10<=87 | 71<=p3]] | ~ [[p5<=p9 & p0<=10]]] U 19<=p1]]]]]

abstracting: (19<=p1)
states: 7,554,067,878 (9)
abstracting: (p0<=10)
states: 50,544,637 (7)
abstracting: (p5<=p9)
states: 9,936,555,811 (9)
abstracting: (71<=p3)
states: 711,383,784 (8)
abstracting: (p10<=87)
states: 9,736,536,810 (9)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ERK-PT-000100-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.390sec

checking: AG [[EX [EX [AG [82<=p7]]] | [EX [AF [E [p5<=p3 U p4<=64]]] | [~ [p0<=97] & EG [[p5<=p9 & p0<=48]]]]]]
normalized: ~ [E [true U ~ [[EX [EX [~ [E [true U ~ [82<=p7]]]]] | [[EG [[p5<=p9 & p0<=48]] & ~ [p0<=97]] | EX [~ [EG [~ [E [p5<=p3 U p4<=64]]]]]]]]]]

abstracting: (p4<=64)
states: 14,754,484,654 (10)
abstracting: (p5<=p3)
states: 11,169,567,851 (10)
.
EG iterations: 1
.abstracting: (p0<=97)
states: 15,761,068,785 (10)
abstracting: (p0<=48)
states: 3,473,889,055 (9)
abstracting: (p5<=p9)
states: 9,936,555,811 (9)
.
EG iterations: 1
abstracting: (82<=p7)
states: 6,290,310,981 (9)
..-> the formula is FALSE

FORMULA ERK-PT-000100-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.758sec

checking: [E [96<=p4 U EF [[p10<=83 | [p10<=48 & ~ [p2<=p4]]]]] & AF [[~ [14<=p6] | ~ [A [p3<=96 U p2<=90]]]]]
normalized: [~ [EG [~ [[~ [[~ [E [~ [p2<=90] U [~ [p2<=90] & ~ [p3<=96]]]] & ~ [EG [~ [p2<=90]]]]] | ~ [14<=p6]]]]] & E [96<=p4 U E [true U [p10<=83 | [p10<=48 & ~ [p2<=p4]]]]]]

abstracting: (p2<=p4)
states: 9,660,662,726 (9)
abstracting: (p10<=48)
states: 1,152,368,035 (9)
abstracting: (p10<=83)
states: 8,238,630,967 (9)
abstracting: (96<=p4)
states: 6,011,614 (6)
abstracting: (14<=p6)
states: 9,345,522,252 (9)
abstracting: (p2<=90)
states: 15,910,559,392 (10)
.
EG iterations: 1
abstracting: (p3<=96)
states: 15,910,653,726 (10)
abstracting: (p2<=90)
states: 15,910,559,392 (10)
abstracting: (p2<=90)
states: 15,910,559,392 (10)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ERK-PT-000100-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.285sec

checking: E [EG [AG [~ [AG [p1<=p5]]]] U [AX [p7<=p9] & [~ [EX [p2<=p7]] & AF [E [AX [p0<=p2] U ~ [[p4<=80 & p7<=91]]]]]]]
normalized: E [EG [~ [E [true U ~ [E [true U ~ [p1<=p5]]]]]] U [[~ [EG [~ [E [~ [EX [~ [p0<=p2]]] U ~ [[p4<=80 & p7<=91]]]]]] & ~ [EX [p2<=p7]]] & ~ [EX [~ [p7<=p9]]]]]

abstracting: (p7<=p9)
states: 877,678,516 (8)
.abstracting: (p2<=p7)
states: 15,085,887,856 (10)
.abstracting: (p7<=91)
states: 12,727,611,844 (10)
abstracting: (p4<=80)
states: 15,676,857,990 (10)
abstracting: (p0<=p2)
states: 2,096,181,906 (9)
..
EG iterations: 1
abstracting: (p1<=p5)
states: 6,338,798,466 (9)

EG iterations: 0
-> the formula is TRUE

FORMULA ERK-PT-000100-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.258sec

checking: [E [EX [~ [E [EG [66<=p7] U p1<=p7]]] U AG [[~ [A [81<=p1 U 60<=p4]] | [EX [p0<=98] & ~ [p2<=35]]]]] & EF [[~ [73<=p2] & AX [EF [~ [p9<=p4]]]]]]
normalized: [E [true U [~ [EX [~ [E [true U ~ [p9<=p4]]]]] & ~ [73<=p2]]] & E [EX [~ [E [EG [66<=p7] U p1<=p7]]] U ~ [E [true U ~ [[[~ [p2<=35] & EX [p0<=98]] | ~ [[~ [EG [~ [60<=p4]]] & ~ [E [~ [60<=p4] U [~ [81<=p1] & ~ [60<=p4]]]]]]]]]]]]

abstracting: (60<=p4)
states: 1,637,959,225 (9)
abstracting: (81<=p1)
states: 42,314,503 (7)
abstracting: (60<=p4)
states: 1,637,959,225 (9)
abstracting: (60<=p4)
states: 1,637,959,225 (9)
.
EG iterations: 1
abstracting: (p0<=98)
states: 15,836,066,235 (10)
.abstracting: (p2<=35)
states: 12,662,600,535 (10)
abstracting: (p1<=p7)
states: 15,085,887,856 (10)
abstracting: (66<=p7)
states: 10,302,562,921 (10)
.
EG iterations: 1
.abstracting: (73<=p2)
states: 145,651,485 (8)
abstracting: (p9<=p4)
states: 9,660,662,726 (9)
.-> the formula is FALSE

FORMULA ERK-PT-000100-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.620sec

checking: EX [AG [[[~ [E [p6<=p5 U p6<=54]] | AG [[p1<=35 & 58<=p8]]] | [p4<=p8 | [~ [p2<=p4] & ~ [p3<=p0]]]]]]
normalized: EX [~ [E [true U ~ [[[p4<=p8 | [~ [p3<=p0] & ~ [p2<=p4]]] | [~ [E [true U ~ [[p1<=35 & 58<=p8]]]] | ~ [E [p6<=p5 U p6<=54]]]]]]]]

abstracting: (p6<=54)
states: 15,001,352,278 (10)
abstracting: (p6<=p5)
states: 6,338,798,466 (9)
abstracting: (58<=p8)
states: 1,857,295,044 (9)
abstracting: (p1<=35)
states: 12,662,600,535 (10)
abstracting: (p2<=p4)
states: 9,660,662,726 (9)
abstracting: (p3<=p0)
states: 14,304,769,986 (10)
abstracting: (p4<=p8)
states: 8,050,755,076 (9)
.-> the formula is FALSE

FORMULA ERK-PT-000100-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.686sec

checking: AG [[EG [EF [AG [p6<=p10]]] | A [E [A [p3<=88 U p4<=58] U [EX [0<=0] | E [39<=p7 U p4<=67]]] U [AF [[98<=p1 & 80<=p10]] & ~ [[~ [p6<=p9] | p6<=48]]]]]]
normalized: ~ [E [true U ~ [[[~ [EG [~ [[~ [[p6<=48 | ~ [p6<=p9]]] & ~ [EG [~ [[98<=p1 & 80<=p10]]]]]]]] & ~ [E [~ [[~ [[p6<=48 | ~ [p6<=p9]]] & ~ [EG [~ [[98<=p1 & 80<=p10]]]]]] U [~ [E [[~ [EG [~ [p4<=58]]] & ~ [E [~ [p4<=58] U [~ [p3<=88] & ~ [p4<=58]]]]] U [E [39<=p7 U p4<=67] | EX [0<=0]]]] & ~ [[~ [[p6<=48 | ~ [p6<=p9]]] & ~ [EG [~ [[98<=p1 & 80<=p10]]]]]]]]]] | EG [E [true U ~ [E [true U ~ [p6<=p10]]]]]]]]]

abstracting: (p6<=p10)
states: 14,672,653,216 (10)
.
EG iterations: 1
abstracting: (80<=p10)
states: 9,003,560,314 (9)
abstracting: (98<=p1)
states: 76,660 (4)
.
EG iterations: 1
abstracting: (p6<=p9)
states: 8,096,736,336 (9)
abstracting: (p6<=48)
states: 14,479,704,967 (10)
abstracting: (0<=0)
states: 15,914,114,086 (10)
.abstracting: (p4<=67)
states: 14,995,165,979 (10)
abstracting: (39<=p7)
states: 14,479,331,386 (10)
abstracting: (p4<=58)
states: 14,168,525,087 (10)
abstracting: (p3<=88)
states: 15,854,697,274 (10)
abstracting: (p4<=58)
states: 14,168,525,087 (10)
abstracting: (p4<=58)
states: 14,168,525,087 (10)
.
EG iterations: 1
abstracting: (80<=p10)
states: 9,003,560,314 (9)
abstracting: (98<=p1)
states: 76,660 (4)
.
EG iterations: 1
abstracting: (p6<=p9)
states: 8,096,736,336 (9)
abstracting: (p6<=48)
states: 14,479,704,967 (10)
abstracting: (80<=p10)
states: 9,003,560,314 (9)
abstracting: (98<=p1)
states: 76,660 (4)
.
EG iterations: 1
abstracting: (p6<=p9)
states: 8,096,736,336 (9)
abstracting: (p6<=48)
states: 14,479,704,967 (10)

EG iterations: 0
-> the formula is FALSE

FORMULA ERK-PT-000100-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.148sec

checking: [AG [[[EG [46<=p9] & ~ [E [67<=p8 U [p3<=63 & 40<=p1]]]] & [[[~ [p7<=92] | ~ [p6<=p8]] | [~ [89<=p1] | ~ [78<=p2]]] & ~ [99<=p1]]]] | ~ [E [A [p2<=32 U A [EX [p8<=64] U p3<=p8]] U AX [A [A [26<=p7 U p4<=32] U ~ [p3<=19]]]]]]
normalized: [~ [E [[~ [EG [~ [[~ [EG [~ [p3<=p8]]] & ~ [E [~ [p3<=p8] U [~ [EX [p8<=64]] & ~ [p3<=p8]]]]]]]] & ~ [E [~ [[~ [EG [~ [p3<=p8]]] & ~ [E [~ [p3<=p8] U [~ [EX [p8<=64]] & ~ [p3<=p8]]]]]] U [~ [p2<=32] & ~ [[~ [EG [~ [p3<=p8]]] & ~ [E [~ [p3<=p8] U [~ [EX [p8<=64]] & ~ [p3<=p8]]]]]]]]]] U ~ [EX [~ [[~ [EG [p3<=19]] & ~ [E [p3<=19 U [p3<=19 & ~ [[~ [EG [~ [p4<=32]]] & ~ [E [~ [p4<=32] U [~ [26<=p7] & ~ [p4<=32]]]]]]]]]]]]]]] | ~ [E [true U ~ [[[~ [99<=p1] & [[~ [78<=p2] | ~ [89<=p1]] | [~ [p6<=p8] | ~ [p7<=92]]]] & [~ [E [67<=p8 U [p3<=63 & 40<=p1]]] & EG [46<=p9]]]]]]]

abstracting: (46<=p9)
states: 1,763,096,412 (9)
.
EG iterations: 1
abstracting: (40<=p1)
states: 2,577,720,432 (9)
abstracting: (p3<=63)
states: 14,666,658,864 (10)
abstracting: (67<=p8)
states: 995,424,885 (8)
abstracting: (p7<=92)
states: 13,063,275,504 (10)
abstracting: (p6<=p8)
states: 9,660,662,726 (9)
abstracting: (89<=p1)
states: 6,732,817 (6)
abstracting: (78<=p2)
states: 70,593,900 (7)
abstracting: (99<=p1)
states: 25,654 (4)
abstracting: (p4<=32)
states: 9,864,928,062 (9)
abstracting: (26<=p7)
states: 15,430,667,395 (10)
abstracting: (p4<=32)
states: 9,864,928,062 (9)
abstracting: (p4<=32)
states: 9,864,928,062 (9)
.
EG iterations: 1
abstracting: (p3<=19)
states: 6,575,421,127 (9)
abstracting: (p3<=19)
states: 6,575,421,127 (9)
abstracting: (p3<=19)
states: 6,575,421,127 (9)
.
EG iterations: 1
.abstracting: (p3<=p8)
states: 8,050,755,076 (9)
abstracting: (p8<=64)
states: 14,754,484,654 (10)
.abstracting: (p3<=p8)
states: 8,050,755,076 (9)
abstracting: (p3<=p8)
states: 8,050,755,076 (9)
.
EG iterations: 1
abstracting: (p2<=32)
states: 12,081,014,011 (10)
abstracting: (p3<=p8)
states: 8,050,755,076 (9)
abstracting: (p8<=64)
states: 14,754,484,654 (10)
.abstracting: (p3<=p8)
states: 8,050,755,076 (9)
abstracting: (p3<=p8)
states: 8,050,755,076 (9)
.
EG iterations: 1
abstracting: (p3<=p8)
states: 8,050,755,076 (9)
abstracting: (p8<=64)
states: 14,754,484,654 (10)
.abstracting: (p3<=p8)
states: 8,050,755,076 (9)
abstracting: (p3<=p8)
states: 8,050,755,076 (9)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA ERK-PT-000100-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.604sec

checking: A [[[[~ [p6<=18] & p10<=p7] & EG [[~ [[EG [p1<=p7] | [p1<=p2 & 83<=p4]]] & ~ [AF [p8<=p10]]]]] & [A [[48<=p9 & p6<=p9] U [44<=p3 | p8<=21]] & AX [10<=p1]]] U EG [[AF [38<=p3] | E [EX [p2<=p5] U AG [p8<=49]]]]]
normalized: [~ [EG [~ [EG [[E [EX [p2<=p5] U ~ [E [true U ~ [p8<=49]]]] | ~ [EG [~ [38<=p3]]]]]]]] & ~ [E [~ [EG [[E [EX [p2<=p5] U ~ [E [true U ~ [p8<=49]]]] | ~ [EG [~ [38<=p3]]]]]] U [~ [[[~ [EX [~ [10<=p1]]] & [~ [EG [~ [[44<=p3 | p8<=21]]]] & ~ [E [~ [[44<=p3 | p8<=21]] U [~ [[48<=p9 & p6<=p9]] & ~ [[44<=p3 | p8<=21]]]]]]] & [EG [[EG [~ [p8<=p10]] & ~ [[[p1<=p2 & 83<=p4] | EG [p1<=p7]]]]] & [p10<=p7 & ~ [p6<=18]]]]] & ~ [EG [[E [EX [p2<=p5] U ~ [E [true U ~ [p8<=49]]]] | ~ [EG [~ [38<=p3]]]]]]]]]]

abstracting: (38<=p3)
states: 4,989,068,448 (9)
.
EG iterations: 1
abstracting: (p8<=49)
states: 13,012,663,430 (10)
abstracting: (p2<=p5)
states: 6,338,798,466 (9)
..
EG iterations: 1
abstracting: (p6<=18)
states: 8,360,046,208 (9)
abstracting: (p10<=p7)
states: 6,533,937,046 (9)
abstracting: (p1<=p7)
states: 15,085,887,856 (10)
.
EG iterations: 1
abstracting: (83<=p4)
states: 178,180,689 (8)
abstracting: (p1<=p2)
states: 8,096,736,336 (9)
abstracting: (p8<=p10)
states: 15,085,887,856 (10)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (p8<=21)
states: 7,131,870,526 (9)
abstracting: (44<=p3)
states: 3,865,482,645 (9)
abstracting: (p6<=p9)
states: 8,096,736,336 (9)
abstracting: (48<=p9)
states: 1,538,577,810 (9)
abstracting: (p8<=21)
states: 7,131,870,526 (9)
abstracting: (44<=p3)
states: 3,865,482,645 (9)
abstracting: (p8<=21)
states: 7,131,870,526 (9)
abstracting: (44<=p3)
states: 3,865,482,645 (9)
.
EG iterations: 1
abstracting: (10<=p1)
states: 10,978,203,600 (10)
.abstracting: (38<=p3)
states: 4,989,068,448 (9)
.
EG iterations: 1
abstracting: (p8<=49)
states: 13,012,663,430 (10)
abstracting: (p2<=p5)
states: 6,338,798,466 (9)
..
EG iterations: 1
abstracting: (38<=p3)
states: 4,989,068,448 (9)
.
EG iterations: 1
abstracting: (p8<=49)
states: 13,012,663,430 (10)
abstracting: (p2<=p5)
states: 6,338,798,466 (9)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA ERK-PT-000100-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.700sec

checking: E [~ [EF [EG [p7<=p4]]] U [AF [[AG [[p6<=48 & p0<=84]] & p2<=58]] | [[~ [[A [21<=p1 U p7<=p3] & EG [E [p2<=68 U p1<=p6]]]] & 4<=p0] & [p8<=p6 & [~ [p8<=38] | [[~ [72<=p0] & ~ [81<=p2]] & [p4<=91 & [p1<=91 & [55<=p1 | p8<=61]]]]]]]]]
normalized: E [~ [E [true U EG [p7<=p4]]] U [[[p8<=p6 & [[[p4<=91 & [p1<=91 & [55<=p1 | p8<=61]]] & [~ [81<=p2] & ~ [72<=p0]]] | ~ [p8<=38]]] & [4<=p0 & ~ [[EG [E [p2<=68 U p1<=p6]] & [~ [EG [~ [p7<=p3]]] & ~ [E [~ [p7<=p3] U [~ [21<=p1] & ~ [p7<=p3]]]]]]]]] | ~ [EG [~ [[p2<=58 & ~ [E [true U ~ [[p6<=48 & p0<=84]]]]]]]]]]

abstracting: (p0<=84)
states: 13,245,431,986 (10)
abstracting: (p6<=48)
states: 14,479,704,967 (10)
abstracting: (p2<=58)
states: 15,261,893,440 (10)

EG iterations: 0
abstracting: (p7<=p3)
states: 17,861,951 (7)
abstracting: (21<=p1)
states: 6,910,553,772 (9)
abstracting: (p7<=p3)
states: 17,861,951 (7)
abstracting: (p7<=p3)
states: 17,861,951 (7)
.
EG iterations: 1
abstracting: (p1<=p6)
states: 8,096,736,336 (9)
abstracting: (p2<=68)
states: 15,675,572,398 (10)
.
EG iterations: 1
abstracting: (4<=p0)
states: 15,910,577,193 (10)
abstracting: (p8<=38)
states: 11,123,514,454 (10)
abstracting: (72<=p0)
states: 6,499,189,768 (9)
abstracting: (81<=p2)
states: 42,314,503 (7)
abstracting: (p8<=61)
states: 14,479,331,386 (10)
abstracting: (55<=p1)
states: 912,761,808 (8)
abstracting: (p1<=91)
states: 15,911,643,409 (10)
abstracting: (p4<=91)
states: 15,886,587,301 (10)
abstracting: (p8<=p6)
states: 6,533,937,046 (9)
abstracting: (p7<=p4)
states: 2,901,450,656 (9)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ERK-PT-000100-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.792sec

checking: [E [[p10<=0 & EF [[[[39<=p10 & p10<=44] | p7<=20] & [54<=p8 | AF [p9<=p3]]]]] U [[EX [[[87<=p4 | p4<=52] & AG [p6<=p9]]] | [~ [91<=p10] | p2<=p8]] & [[[2<=p1 | AX [8<=p2]] & [~ [[p7<=p3 & p2<=91]] & [~ [p7<=15] | AG [p8<=p0]]]] | [AX [[p5<=p4 | 80<=p6]] | EX [[p4<=8 & p5<=84]]]]]] & EX [~ [A [[AF [28<=p1] | [[22<=p0 & p9<=p1] | p0<=44]] U EG [E [p9<=62 U 32<=p5]]]]]]
normalized: [EX [~ [[~ [EG [~ [EG [E [p9<=62 U 32<=p5]]]]] & ~ [E [~ [EG [E [p9<=62 U 32<=p5]]] U [~ [[[p0<=44 | [22<=p0 & p9<=p1]] | ~ [EG [~ [28<=p1]]]]] & ~ [EG [E [p9<=62 U 32<=p5]]]]]]]]] & E [[p10<=0 & E [true U [[54<=p8 | ~ [EG [~ [p9<=p3]]]] & [p7<=20 | [39<=p10 & p10<=44]]]]] U [[[EX [[p4<=8 & p5<=84]] | ~ [EX [~ [[p5<=p4 | 80<=p6]]]]] | [[[~ [E [true U ~ [p8<=p0]]] | ~ [p7<=15]] & ~ [[p7<=p3 & p2<=91]]] & [2<=p1 | ~ [EX [~ [8<=p2]]]]]] & [[p2<=p8 | ~ [91<=p10]] | EX [[~ [E [true U ~ [p6<=p9]]] & [87<=p4 | p4<=52]]]]]]]

abstracting: (p4<=52)
states: 13,436,005,726 (10)
abstracting: (87<=p4)
states: 90,094,900 (7)
abstracting: (p6<=p9)
states: 8,096,736,336 (9)
.abstracting: (91<=p10)
states: 4,935,910,486 (9)
abstracting: (p2<=p8)
states: 9,660,662,726 (9)
abstracting: (8<=p2)
states: 11,864,933,800 (10)
.abstracting: (2<=p1)
states: 14,823,650,820 (10)
abstracting: (p2<=91)
states: 15,911,643,409 (10)
abstracting: (p7<=p3)
states: 17,861,951 (7)
abstracting: (p7<=15)
states: 129,395,160 (8)
abstracting: (p8<=p0)
states: 14,304,769,986 (10)
abstracting: (80<=p6)
states: 50,576,218 (7)
abstracting: (p5<=p4)
states: 11,169,567,851 (10)
.abstracting: (p5<=84)
states: 15,913,745,866 (10)
abstracting: (p4<=8)
states: 3,186,502,242 (9)
.abstracting: (p10<=44)
states: 841,610,388 (8)
abstracting: (39<=p10)
states: 15,418,234,338 (10)
abstracting: (p7<=20)
states: 270,888,618 (8)
abstracting: (p9<=p3)
states: 9,660,662,726 (9)
.
EG iterations: 1
abstracting: (54<=p8)
states: 2,345,541,016 (9)
abstracting: (p10<=0)
states: 5,151 (3)
abstracting: (32<=p5)
states: 1,675,350,222 (9)
abstracting: (p9<=62)
states: 15,463,665,126 (10)
.
EG iterations: 1
abstracting: (28<=p1)
states: 4,961,264,325 (9)
.
EG iterations: 1
abstracting: (p9<=p1)
states: 8,096,736,336 (9)
abstracting: (22<=p0)
states: 15,558,055,548 (10)
abstracting: (p0<=44)
states: 2,741,320,872 (9)
abstracting: (32<=p5)
states: 1,675,350,222 (9)
abstracting: (p9<=62)
states: 15,463,665,126 (10)
.
EG iterations: 1
abstracting: (32<=p5)
states: 1,675,350,222 (9)
abstracting: (p9<=62)
states: 15,463,665,126 (10)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is FALSE

FORMULA ERK-PT-000100-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.378sec

totally nodes used: 4468257 (4.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 187112428 8395771 195508199
used/not used/entry size/cache size: 11236738 55872126 16 1024MB
basic ops cache: hits/miss/sum: 100208870 6020738 106229608
used/not used/entry size/cache size: 6349232 10427984 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: 5225034 216490 5441524
used/not used/entry size/cache size: 213303 8175305 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 63336279
1 3520641
2 192877
3 28510
4 8988
5 4155
6 2392
7 1086
8 1637
9 1566
>= 10 10733

Total processing time: 1m 6.637sec


BK_STOP 1678464026689

--------------------
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 CTLCardinality -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:2411 (219), effective:800 (72)

initing FirstDep: 0m 0.000sec


iterations count:955 (86), effective:354 (32)

iterations count:139 (12), effective:32 (2)

iterations count:1311 (119), effective:390 (35)

iterations count:277 (25), effective:76 (6)

iterations count:1495 (135), effective:512 (46)

iterations count:83 (7), effective:36 (3)

iterations count:410 (37), effective:114 (10)

iterations count:1637 (148), effective:478 (43)

iterations count:351 (31), effective:102 (9)

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

iterations count:417 (37), effective:200 (18)

iterations count:227 (20), effective:144 (13)

iterations count:322 (29), effective:103 (9)

iterations count:2179 (198), effective:648 (58)

iterations count:71 (6), effective:20 (1)

iterations count:1611 (146), effective:505 (45)

iterations count:79 (7), effective:34 (3)

iterations count:232 (21), effective:106 (9)

iterations count:179 (16), effective:84 (7)

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

iterations count:54 (4), effective:43 (3)

iterations count:460 (41), effective:200 (18)

iterations count:1031 (93), effective:306 (27)

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

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

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

iterations count:550 (50), effective:153 (13)

iterations count:1578 (143), effective:446 (40)

iterations count:893 (81), effective:252 (22)

iterations count:308 (28), effective:66 (6)

iterations count:440 (40), effective:132 (12)

iterations count:615 (55), effective:183 (16)

iterations count:1111 (101), effective:300 (27)

iterations count:164 (14), effective:51 (4)

iterations count:1111 (101), effective:300 (27)

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

iterations count:1111 (101), effective:300 (27)

iterations count:606 (55), effective:170 (15)

iterations count:251 (22), effective:80 (7)

iterations count:497 (45), effective:193 (17)

iterations count:1061 (96), effective:300 (27)

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

iterations count:181 (16), effective:56 (5)

iterations count:1231 (111), effective:405 (36)

iterations count:1651 (150), effective:517 (47)

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

iterations count:427 (38), effective:160 (14)

iterations count:427 (38), effective:160 (14)

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

iterations count:427 (38), effective:160 (14)

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="ERK-PT-000100"
export BK_EXAMINATION="CTLCardinality"
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 ERK-PT-000100, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838856600017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ERK-PT-000100.tgz
mv ERK-PT-000100 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;