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.r330-tall-167889203100305.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 Raft-PT-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203100305
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.0K Feb 26 17:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 17:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 17:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 17:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 17:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 17:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 17:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 41K Mar 5 18:23 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 Raft-PT-04-CTLCardinality-00
FORMULA_NAME Raft-PT-04-CTLCardinality-01
FORMULA_NAME Raft-PT-04-CTLCardinality-02
FORMULA_NAME Raft-PT-04-CTLCardinality-03
FORMULA_NAME Raft-PT-04-CTLCardinality-04
FORMULA_NAME Raft-PT-04-CTLCardinality-05
FORMULA_NAME Raft-PT-04-CTLCardinality-06
FORMULA_NAME Raft-PT-04-CTLCardinality-07
FORMULA_NAME Raft-PT-04-CTLCardinality-08
FORMULA_NAME Raft-PT-04-CTLCardinality-09
FORMULA_NAME Raft-PT-04-CTLCardinality-10
FORMULA_NAME Raft-PT-04-CTLCardinality-11
FORMULA_NAME Raft-PT-04-CTLCardinality-12
FORMULA_NAME Raft-PT-04-CTLCardinality-13
FORMULA_NAME Raft-PT-04-CTLCardinality-14
FORMULA_NAME Raft-PT-04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679139963544

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=Raft-PT-04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 11:46:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 11:46:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 11:46:05] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2023-03-18 11:46:05] [INFO ] Transformed 88 places.
[2023-03-18 11:46:05] [INFO ] Transformed 160 transitions.
[2023-03-18 11:46:05] [INFO ] Found NUPN structural information;
[2023-03-18 11:46:05] [INFO ] Parsed PT model containing 88 places and 160 transitions and 563 arcs in 105 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 18 transitions
Reduce redundant transitions removed 18 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Raft-PT-04-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Applied a total of 0 rules in 11 ms. Remains 88 /88 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2023-03-18 11:46:05] [INFO ] Flow matrix only has 126 transitions (discarded 16 similar events)
// Phase 1: matrix 126 rows 88 cols
[2023-03-18 11:46:05] [INFO ] Computed 16 place invariants in 12 ms
[2023-03-18 11:46:05] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-18 11:46:05] [INFO ] Flow matrix only has 126 transitions (discarded 16 similar events)
[2023-03-18 11:46:05] [INFO ] Invariant cache hit.
[2023-03-18 11:46:05] [INFO ] State equation strengthened by 64 read => feed constraints.
[2023-03-18 11:46:05] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2023-03-18 11:46:05] [INFO ] Flow matrix only has 126 transitions (discarded 16 similar events)
[2023-03-18 11:46:05] [INFO ] Invariant cache hit.
[2023-03-18 11:46:05] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 450 ms. Remains : 88/88 places, 142/142 transitions.
Support contains 48 out of 88 places after structural reductions.
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 33 ms
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 14 ms
[2023-03-18 11:46:06] [INFO ] Input system was already deterministic with 142 transitions.
Support contains 43 out of 88 places (down from 48) after GAL structural reductions.
Finished random walk after 6755 steps, including 2 resets, run visited all 35 properties in 241 ms. (steps per millisecond=28 )
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 9 ms
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 8 ms
[2023-03-18 11:46:06] [INFO ] Input system was already deterministic with 142 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 83 transition count 133
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 83 transition count 133
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 79 transition count 129
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 27 place count 68 transition count 118
Iterating global reduction 0 with 11 rules applied. Total rules applied 38 place count 68 transition count 118
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 49 place count 68 transition count 107
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 68 transition count 103
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 64 transition count 99
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 71 place count 54 transition count 89
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 54 transition count 89
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 91 place count 54 transition count 79
Applied a total of 91 rules in 33 ms. Remains 54 /88 variables (removed 34) and now considering 79/142 (removed 63) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 54/88 places, 79/142 transitions.
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:46:06] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 85 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 85 transition count 136
Applied a total of 6 rules in 4 ms. Remains 85 /88 variables (removed 3) and now considering 136/142 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 85/88 places, 136/142 transitions.
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 12 ms
[2023-03-18 11:46:06] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 85 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 85 transition count 136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 83 transition count 134
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 78 transition count 129
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 78 transition count 129
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 78 transition count 124
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 78 transition count 120
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 75 transition count 117
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 71 transition count 113
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 71 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 47 place count 71 transition count 109
Applied a total of 47 rules in 26 ms. Remains 71 /88 variables (removed 17) and now considering 109/142 (removed 33) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 71/88 places, 109/142 transitions.
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:06] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 85 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 85 transition count 136
Applied a total of 6 rules in 4 ms. Remains 85 /88 variables (removed 3) and now considering 136/142 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 85/88 places, 136/142 transitions.
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:46:06] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 84 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 84 transition count 134
Applied a total of 8 rules in 2 ms. Remains 84 /88 variables (removed 4) and now considering 134/142 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 84/88 places, 134/142 transitions.
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:46:06] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 85 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 85 transition count 136
Applied a total of 6 rules in 3 ms. Remains 85 /88 variables (removed 3) and now considering 136/142 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 85/88 places, 136/142 transitions.
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:46:06] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 84 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 84 transition count 134
Applied a total of 8 rules in 7 ms. Remains 84 /88 variables (removed 4) and now considering 134/142 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 84/88 places, 134/142 transitions.
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:06] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 83 transition count 133
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 83 transition count 133
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 79 transition count 129
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 26 place count 69 transition count 119
Iterating global reduction 0 with 10 rules applied. Total rules applied 36 place count 69 transition count 119
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 46 place count 69 transition count 109
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 69 transition count 105
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 65 transition count 101
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 70 place count 53 transition count 89
Iterating global reduction 1 with 12 rules applied. Total rules applied 82 place count 53 transition count 89
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 94 place count 53 transition count 77
Applied a total of 94 rules in 16 ms. Remains 53 /88 variables (removed 35) and now considering 77/142 (removed 65) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 53/88 places, 77/142 transitions.
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:46:06] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 84 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 84 transition count 134
Applied a total of 8 rules in 2 ms. Remains 84 /88 variables (removed 4) and now considering 134/142 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 84/88 places, 134/142 transitions.
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:06] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 85 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 85 transition count 136
Applied a total of 6 rules in 2 ms. Remains 85 /88 variables (removed 3) and now considering 136/142 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 85/88 places, 136/142 transitions.
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:46:06] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 85 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 85 transition count 136
Applied a total of 6 rules in 1 ms. Remains 85 /88 variables (removed 3) and now considering 136/142 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 85/88 places, 136/142 transitions.
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:06] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 84 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 84 transition count 134
Applied a total of 8 rules in 2 ms. Remains 84 /88 variables (removed 4) and now considering 134/142 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 84/88 places, 134/142 transitions.
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 10 ms
[2023-03-18 11:46:06] [INFO ] Input system was already deterministic with 134 transitions.
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:46:06] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:46:06] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-18 11:46:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 88 places, 142 transitions and 527 arcs took 1 ms.
Total runtime 1919 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: 88 NrTr: 142 NrArc: 527)

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

net check time: 0m 0.000sec

init dd package: 0m 2.697sec


RS generation: 0m53.815sec


-> reachability set: #nodes 1211400 (1.2e+06) #states 2,965,858,466,581 (12)



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

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA Raft-PT-04-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.455sec

checking: EX [EX [AX [AF [[p54<=1 & 1<=p54]]]]]
normalized: EX [EX [~ [EX [EG [~ [[p54<=1 & 1<=p54]]]]]]]

abstracting: (1<=p54)
states: 588,876,726,020 (11)
abstracting: (p54<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
...-> the formula is FALSE

FORMULA Raft-PT-04-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.213sec

checking: EF [EG [AG [[EG [[p58<=1 & 1<=p58]] & [p14<=0 & 0<=p14]]]]]
normalized: E [true U EG [~ [E [true U ~ [[EG [[p58<=1 & 1<=p58]] & [p14<=0 & 0<=p14]]]]]]]

abstracting: (0<=p14)
states: 2,965,858,466,581 (12)
abstracting: (p14<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p58)
states: 588,876,726,020 (11)
abstracting: (p58<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-04-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m33.359sec

checking: EX [EF [[[p3<=0 & 0<=p3] | [p29<=1 & 1<=p29]]]]
normalized: EX [E [true U [[p29<=1 & 1<=p29] | [p3<=0 & 0<=p3]]]]

abstracting: (0<=p3)
states: 2,965,858,466,581 (12)
abstracting: (p3<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p29)
states: 588,876,726,020 (11)
abstracting: (p29<=1)
states: 2,965,858,466,581 (12)
.-> the formula is TRUE

FORMULA Raft-PT-04-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.064sec

checking: EF [[[p8<=1 & 1<=p8] | ~ [E [[p51<=1 & 1<=p51] U [p1<=0 & 0<=p1]]]]]
normalized: E [true U [~ [E [[p51<=1 & 1<=p51] U [p1<=0 & 0<=p1]]] | [p8<=1 & 1<=p8]]]

abstracting: (1<=p8)
states: 588,876,726,020 (11)
abstracting: (p8<=1)
states: 2,965,858,466,581 (12)
abstracting: (0<=p1)
states: 2,965,858,466,581 (12)
abstracting: (p1<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p51)
states: 588,876,726,020 (11)
abstracting: (p51<=1)
states: 2,965,858,466,581 (12)
-> the formula is TRUE

FORMULA Raft-PT-04-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29.071sec

checking: EF [AX [[[p32<=1 & 1<=p32] & [AG [[p42<=0 & 0<=p42]] & [p68<=1 & 1<=p68]]]]]
normalized: E [true U ~ [EX [~ [[[[p68<=1 & 1<=p68] & ~ [E [true U ~ [[p42<=0 & 0<=p42]]]]] & [p32<=1 & 1<=p32]]]]]]

abstracting: (1<=p32)
states: 588,876,726,020 (11)
abstracting: (p32<=1)
states: 2,965,858,466,581 (12)
abstracting: (0<=p42)
states: 2,965,858,466,581 (12)
abstracting: (p42<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p68)
states: 588,876,726,020 (11)
abstracting: (p68<=1)
states: 2,965,858,466,581 (12)
.-> the formula is FALSE

FORMULA Raft-PT-04-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.265sec

checking: AG [[[p14<=0 & 0<=p14] | [[p84<=1 & 1<=p84] | AX [AF [[[p3<=0 & 0<=p3] & [p64<=0 & 0<=p64]]]]]]]
normalized: ~ [E [true U ~ [[[~ [EX [EG [~ [[[p64<=0 & 0<=p64] & [p3<=0 & 0<=p3]]]]]] | [p84<=1 & 1<=p84]] | [p14<=0 & 0<=p14]]]]]

abstracting: (0<=p14)
states: 2,965,858,466,581 (12)
abstracting: (p14<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p84)
states: 593,171,693,316 (11)
abstracting: (p84<=1)
states: 2,965,858,466,581 (12)
abstracting: (0<=p3)
states: 2,965,858,466,581 (12)
abstracting: (p3<=0)
states: 2,376,981,740,561 (12)
abstracting: (0<=p64)
states: 2,965,858,466,581 (12)
abstracting: (p64<=0)
states: 2,376,981,740,561 (12)
.
EG iterations: 1
.
before gc: list nodes free: 1979795

after gc: idd nodes used:4535650, unused:59464350; list nodes free:284961109
-> the formula is FALSE

FORMULA Raft-PT-04-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m29.285sec

checking: E [~ [[[[p15<=0 & 0<=p15] | [p23<=1 & 1<=p23]] & EG [[[p84<=1 & 1<=p84] | [[p21<=0 & 0<=p21] | [p76<=1 & 1<=p76]]]]]] U EF [EX [0<=0]]]
normalized: E [~ [[EG [[[[p76<=1 & 1<=p76] | [p21<=0 & 0<=p21]] | [p84<=1 & 1<=p84]]] & [[p23<=1 & 1<=p23] | [p15<=0 & 0<=p15]]]] U E [true U EX [0<=0]]]

abstracting: (0<=0)
states: 2,965,858,466,581 (12)
.abstracting: (0<=p15)
states: 2,965,858,466,581 (12)
abstracting: (p15<=0)
states: 2,355,506,904,081 (12)
abstracting: (1<=p23)
states: 588,876,726,020 (11)
abstracting: (p23<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p84)
states: 593,171,693,316 (11)
abstracting: (p84<=1)
states: 2,965,858,466,581 (12)
abstracting: (0<=p21)
states: 2,965,858,466,581 (12)
abstracting: (p21<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p76)
states: 588,876,726,020 (11)
abstracting: (p76<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Raft-PT-04-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m24.300sec

checking: [E [[p76<=1 & 1<=p76] U ~ [[[~ [AX [[p62<=1 & 1<=p62]]] | AF [[[p37<=0 & 0<=p37] | [p33<=1 & 1<=p33]]]] & [[p7<=0 & 0<=p7] & EX [~ [[[p10<=1 & 1<=p10] | [p9<=1 & 1<=p9]]]]]]]] & EF [EG [~ [[p1<=1 & 1<=p1]]]]]
normalized: [E [true U EG [~ [[p1<=1 & 1<=p1]]]] & E [[p76<=1 & 1<=p76] U ~ [[[EX [~ [[[p9<=1 & 1<=p9] | [p10<=1 & 1<=p10]]]] & [p7<=0 & 0<=p7]] & [~ [EG [~ [[[p33<=1 & 1<=p33] | [p37<=0 & 0<=p37]]]]] | EX [~ [[p62<=1 & 1<=p62]]]]]]]]

abstracting: (1<=p62)
states: 588,876,726,020 (11)
abstracting: (p62<=1)
states: 2,965,858,466,581 (12)
.abstracting: (0<=p37)
states: 2,965,858,466,581 (12)
abstracting: (p37<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p33)
states: 588,876,726,020 (11)
abstracting: (p33<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
abstracting: (0<=p7)
states: 2,965,858,466,581 (12)
abstracting: (p7<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p10)
states: 610,351,562,500 (11)
abstracting: (p10<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p9)
states: 588,876,726,020 (11)
abstracting: (p9<=1)
states: 2,965,858,466,581 (12)
.abstracting: (1<=p76)
states: 588,876,726,020 (11)
abstracting: (p76<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p1)
states: 588,876,726,020 (11)
abstracting: (p1<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Raft-PT-04-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 9.952sec

checking: [EF [[EG [AF [[[p79<=1 & 1<=p79] | [p73<=0 & 0<=p73]]]] | AF [[~ [E [[p82<=1 & 1<=p82] U [[p74<=0 & 0<=p74] | [p49<=1 & 1<=p49]]]] | [[p45<=1 & 1<=p45] | [p41<=1 & 1<=p41]]]]]] & EF [AG [[[p62<=1 & 1<=p62] | ~ [[p51<=0 & 0<=p51]]]]]]
normalized: [E [true U ~ [E [true U ~ [[~ [[p51<=0 & 0<=p51]] | [p62<=1 & 1<=p62]]]]]] & E [true U [~ [EG [~ [[[[p41<=1 & 1<=p41] | [p45<=1 & 1<=p45]] | ~ [E [[p82<=1 & 1<=p82] U [[p49<=1 & 1<=p49] | [p74<=0 & 0<=p74]]]]]]]] | EG [~ [EG [~ [[[p73<=0 & 0<=p73] | [p79<=1 & 1<=p79]]]]]]]]]

abstracting: (1<=p79)
states: 588,876,726,020 (11)
abstracting: (p79<=1)
states: 2,965,858,466,581 (12)
abstracting: (0<=p73)
states: 2,965,858,466,581 (12)
abstracting: (p73<=0)
states: 2,376,981,740,561 (12)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p74)
states: 2,965,858,466,581 (12)
abstracting: (p74<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p49)
states: 588,876,726,020 (11)
abstracting: (p49<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p82)
states: 593,171,693,316 (11)
abstracting: (p82<=1)
states: 2,965,858,466,581 (12)

before gc: list nodes free: 206778

after gc: idd nodes used:5540086, unused:58459914; list nodes free:282199097
abstracting: (1<=p45)
states: 610,351,562,500 (11)
abstracting: (p45<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p41)
states: 588,876,726,020 (11)
abstracting: (p41<=1)
states: 2,965,858,466,581 (12)
..
EG iterations: 2
abstracting: (1<=p62)
states: 588,876,726,020 (11)
abstracting: (p62<=1)
states: 2,965,858,466,581 (12)
abstracting: (0<=p51)
states: 2,965,858,466,581 (12)
abstracting: (p51<=0)
states: 2,376,981,740,561 (12)
-> the formula is FALSE

FORMULA Raft-PT-04-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m30.374sec

checking: EX [A [~ [[[p67<=0 & 0<=p67] | [p3<=1 & 1<=p3]]] U [A [~ [[[[p30<=0 & 0<=p30] | [p77<=1 & 1<=p77]] | [[p33<=0 & 0<=p33] | [p63<=1 & 1<=p63]]]] U AX [[p35<=1 & 1<=p35]]] & [[p0<=0 & 0<=p0] | [[p75<=1 & 1<=p75] | ~ [[p64<=0 & 0<=p64]]]]]]]
normalized: EX [[~ [EG [~ [[[[~ [[p64<=0 & 0<=p64]] | [p75<=1 & 1<=p75]] | [p0<=0 & 0<=p0]] & [~ [EG [EX [~ [[p35<=1 & 1<=p35]]]]] & ~ [E [EX [~ [[p35<=1 & 1<=p35]]] U [[[[p63<=1 & 1<=p63] | [p33<=0 & 0<=p33]] | [[p77<=1 & 1<=p77] | [p30<=0 & 0<=p30]]] & EX [~ [[p35<=1 & 1<=p35]]]]]]]]]]] & ~ [E [~ [[[[~ [[p64<=0 & 0<=p64]] | [p75<=1 & 1<=p75]] | [p0<=0 & 0<=p0]] & [~ [EG [EX [~ [[p35<=1 & 1<=p35]]]]] & ~ [E [EX [~ [[p35<=1 & 1<=p35]]] U [[[[p63<=1 & 1<=p63] | [p33<=0 & 0<=p33]] | [[p77<=1 & 1<=p77] | [p30<=0 & 0<=p30]]] & EX [~ [[p35<=1 & 1<=p35]]]]]]]]] U [[[p3<=1 & 1<=p3] | [p67<=0 & 0<=p67]] & ~ [[[[~ [[p64<=0 & 0<=p64]] | [p75<=1 & 1<=p75]] | [p0<=0 & 0<=p0]] & [~ [EG [EX [~ [[p35<=1 & 1<=p35]]]]] & ~ [E [EX [~ [[p35<=1 & 1<=p35]]] U [[[[p63<=1 & 1<=p63] | [p33<=0 & 0<=p33]] | [[p77<=1 & 1<=p77] | [p30<=0 & 0<=p30]]] & EX [~ [[p35<=1 & 1<=p35]]]]]]]]]]]]]]

abstracting: (1<=p35)
states: 610,351,562,500 (11)
abstracting: (p35<=1)
states: 2,965,858,466,581 (12)
.abstracting: (0<=p30)
states: 2,965,858,466,581 (12)
abstracting: (p30<=0)
states: 2,355,506,904,081 (12)
abstracting: (1<=p77)
states: 588,876,726,020 (11)
abstracting: (p77<=1)
states: 2,965,858,466,581 (12)
abstracting: (0<=p33)
states: 2,965,858,466,581 (12)
abstracting: (p33<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p63)
states: 588,876,726,020 (11)
abstracting: (p63<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p35)
states: 610,351,562,500 (11)
abstracting: (p35<=1)
states: 2,965,858,466,581 (12)
.abstracting: (1<=p35)
states: 610,351,562,500 (11)
abstracting: (p35<=1)
states: 2,965,858,466,581 (12)
..
EG iterations: 1
abstracting: (0<=p0)
states: 2,965,858,466,581 (12)
abstracting: (p0<=0)
states: 2,965,858,466,580 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (0<=p64)
states: 2,965,858,466,581 (12)
abstracting: (p64<=0)
states: 2,376,981,740,561 (12)
abstracting: (0<=p67)
states: 2,965,858,466,581 (12)
abstracting: (p67<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p3)
states: 588,876,726,020 (11)
abstracting: (p3<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p35)
states: 610,351,562,500 (11)
abstracting: (p35<=1)
states: 2,965,858,466,581 (12)
.abstracting: (0<=p30)
states: 2,965,858,466,581 (12)
abstracting: (p30<=0)
states: 2,355,506,904,081 (12)
abstracting: (1<=p77)
states: 588,876,726,020 (11)
abstracting: (p77<=1)
states: 2,965,858,466,581 (12)
abstracting: (0<=p33)
states: 2,965,858,466,581 (12)
abstracting: (p33<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p63)
states: 588,876,726,020 (11)
abstracting: (p63<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p35)
states: 610,351,562,500 (11)
abstracting: (p35<=1)
states: 2,965,858,466,581 (12)
.abstracting: (1<=p35)
states: 610,351,562,500 (11)
abstracting: (p35<=1)
states: 2,965,858,466,581 (12)
..
EG iterations: 1
abstracting: (0<=p0)
states: 2,965,858,466,581 (12)
abstracting: (p0<=0)
states: 2,965,858,466,580 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (0<=p64)
states: 2,965,858,466,581 (12)
abstracting: (p64<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p35)
states: 610,351,562,500 (11)
abstracting: (p35<=1)
states: 2,965,858,466,581 (12)
.abstracting: (0<=p30)
states: 2,965,858,466,581 (12)
abstracting: (p30<=0)
states: 2,355,506,904,081 (12)
abstracting: (1<=p77)
states: 588,876,726,020 (11)
abstracting: (p77<=1)
states: 2,965,858,466,581 (12)
abstracting: (0<=p33)
states: 2,965,858,466,581 (12)
abstracting: (p33<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p63)
states: 588,876,726,020 (11)
abstracting: (p63<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p35)
states: 610,351,562,500 (11)
abstracting: (p35<=1)
states: 2,965,858,466,581 (12)
.abstracting: (1<=p35)
states: 610,351,562,500 (11)
abstracting: (p35<=1)
states: 2,965,858,466,581 (12)
..
EG iterations: 1
abstracting: (0<=p0)
states: 2,965,858,466,581 (12)
abstracting: (p0<=0)
states: 2,965,858,466,580 (12)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (0<=p64)
states: 2,965,858,466,581 (12)
abstracting: (p64<=0)
states: 2,376,981,740,561 (12)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Raft-PT-04-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m44.425sec

checking: AG [[E [A [EG [[[p72<=0 & 0<=p72] | [p5<=1 & 1<=p5]]] U AG [[p57<=1 & 1<=p57]]] U [AF [[[p34<=1 & 1<=p34] | [p29<=0 & 0<=p29]]] & ~ [[[p71<=0 & 0<=p71] | [p62<=1 & 1<=p62]]]]] | [EX [AG [A [[p50<=0 & 0<=p50] U [[p84<=0 & 0<=p84] | [p50<=1 & 1<=p50]]]]] | [p79<=1 & 1<=p79]]]]
normalized: ~ [E [true U ~ [[[[p79<=1 & 1<=p79] | EX [~ [E [true U ~ [[~ [EG [~ [[[p50<=1 & 1<=p50] | [p84<=0 & 0<=p84]]]]] & ~ [E [~ [[[p50<=1 & 1<=p50] | [p84<=0 & 0<=p84]]] U [~ [[p50<=0 & 0<=p50]] & ~ [[[p50<=1 & 1<=p50] | [p84<=0 & 0<=p84]]]]]]]]]]]] | E [[~ [EG [E [true U ~ [[p57<=1 & 1<=p57]]]]] & ~ [E [E [true U ~ [[p57<=1 & 1<=p57]]] U [~ [EG [[[p5<=1 & 1<=p5] | [p72<=0 & 0<=p72]]]] & E [true U ~ [[p57<=1 & 1<=p57]]]]]]] U [~ [[[p62<=1 & 1<=p62] | [p71<=0 & 0<=p71]]] & ~ [EG [~ [[[p29<=0 & 0<=p29] | [p34<=1 & 1<=p34]]]]]]]]]]]

abstracting: (1<=p34)
states: 588,876,726,020 (11)
abstracting: (p34<=1)
states: 2,965,858,466,581 (12)
abstracting: (0<=p29)
states: 2,965,858,466,581 (12)
abstracting: (p29<=0)
states: 2,376,981,740,561 (12)
.
EG iterations: 1
abstracting: (0<=p71)
states: 2,965,858,466,581 (12)
abstracting: (p71<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p62)
states: 588,876,726,020 (11)
abstracting: (p62<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p57)
states: 588,876,726,020 (11)
abstracting: (p57<=1)
states: 2,965,858,466,581 (12)
abstracting: (0<=p72)
states: 2,965,858,466,581 (12)
abstracting: (p72<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p5)
states: 610,351,562,500 (11)
abstracting: (p5<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
abstracting: (1<=p57)
states: 588,876,726,020 (11)
abstracting: (p57<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p57)
states: 588,876,726,020 (11)
abstracting: (p57<=1)
states: 2,965,858,466,581 (12)

EG iterations: 0
abstracting: (0<=p84)
states: 2,965,858,466,581 (12)
abstracting: (p84<=0)
states: 2,372,686,773,265 (12)
abstracting: (1<=p50)
states: 610,351,562,500 (11)
abstracting: (p50<=1)
states: 2,965,858,466,581 (12)
abstracting: (0<=p50)
states: 2,965,858,466,581 (12)
abstracting: (p50<=0)
states: 2,355,506,904,081 (12)
abstracting: (0<=p84)
states: 2,965,858,466,581 (12)
abstracting: (p84<=0)
states: 2,372,686,773,265 (12)
abstracting: (1<=p50)
states: 610,351,562,500 (11)
abstracting: (p50<=1)
states: 2,965,858,466,581 (12)
abstracting: (0<=p84)
states: 2,965,858,466,581 (12)
abstracting: (p84<=0)
states: 2,372,686,773,265 (12)
abstracting: (1<=p50)
states: 610,351,562,500 (11)
abstracting: (p50<=1)
states: 2,965,858,466,581 (12)

before gc: list nodes free: 3225880

after gc: idd nodes used:11773826, unused:52226174; list nodes free:252855203
.
EG iterations: 1
.abstracting: (1<=p79)
states: 588,876,726,020 (11)
abstracting: (p79<=1)
states: 2,965,858,466,581 (12)
-> the formula is FALSE

FORMULA Raft-PT-04-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m 2.858sec

totally nodes used: 217671456 (2.2e+08)
number of garbage collections: 3
fire ops cache: hits/miss/sum: 510765066 1269610653 1780375719
used/not used/entry size/cache size: 63896312 3212552 16 1024MB
basic ops cache: hits/miss/sum: 76691230 180566227 257257457
used/not used/entry size/cache size: 16078688 698528 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: 6401728 15697501 22099229
used/not used/entry size/cache size: 1131518 7257090 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 33882157
1 22310374
2 8192943
3 2175494
4 456059
5 78832
6 11356
7 1473
8 153
9 21
>= 10 2

Total processing time: 15m10.809sec


BK_STOP 1679140878581

--------------------
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

384740 676523 697371 1180189
iterations count:482051 (3394), effective:29724 (209)

initing FirstDep: 0m 0.000sec


iterations count:876 (6), effective:17 (0)

iterations count:254 (1), effective:5 (0)

iterations count:261 (1), effective:5 (0)

iterations count:807 (5), effective:28 (0)

iterations count:976 (6), effective:18 (0)

iterations count:1873 (13), effective:82 (0)

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

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

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

iterations count:261 (1), effective:5 (0)

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

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

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

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

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

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

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

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

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

iterations count:1497 (10), effective:35 (0)

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

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

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

iterations count:606 (4), effective:33 (0)

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="Raft-PT-04"
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 Raft-PT-04, 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 r330-tall-167889203100305"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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