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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.8K Feb 25 15:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 15:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 15:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 15:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 15:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 15:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 15:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 15:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 43K 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 ResAllocation-PT-R010C002-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679181601900

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=ResAllocation-PT-R010C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:20:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 23:20:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:20:03] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-18 23:20:03] [INFO ] Transformed 40 places.
[2023-03-18 23:20:03] [INFO ] Transformed 22 transitions.
[2023-03-18 23:20:03] [INFO ] Parsed PT model containing 40 places and 22 transitions and 100 arcs in 95 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R010C002-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 9 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 40 cols
[2023-03-18 23:20:03] [INFO ] Computed 20 place invariants in 10 ms
[2023-03-18 23:20:03] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-18 23:20:03] [INFO ] Invariant cache hit.
[2023-03-18 23:20:03] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-18 23:20:03] [INFO ] Invariant cache hit.
[2023-03-18 23:20:03] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 258 ms. Remains : 40/40 places, 22/22 transitions.
Support contains 38 out of 40 places after structural reductions.
[2023-03-18 23:20:04] [INFO ] Flatten gal took : 19 ms
[2023-03-18 23:20:04] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:20:04] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10000 steps, including 297 resets, run finished after 547 ms. (steps per millisecond=18 ) properties (out of 93) seen :72
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :6
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-18 23:20:04] [INFO ] Invariant cache hit.
[2023-03-18 23:20:05] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-18 23:20:05] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:13
[2023-03-18 23:20:05] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-18 23:20:05] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :13 sat :2
[2023-03-18 23:20:05] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :13 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-18 23:20:05] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :13 sat :2
Fused 15 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 7 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 2 place count 39 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 39 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 38 transition count 20
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 38 transition count 19
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 35 transition count 19
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 35 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 33 transition count 18
Applied a total of 11 rules in 13 ms. Remains 33 /40 variables (removed 7) and now considering 18/22 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 33/40 places, 18/22 transitions.
Incomplete random walk after 10000 steps, including 536 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 170 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Probably explored full state space saw : 832 states, properties seen :0
Probabilistic random walk after 3104 steps, saw 832 distinct states, run finished after 24 ms. (steps per millisecond=129 ) properties seen :0
Explored full state space saw : 832 states, properties seen :0
Exhaustive walk after 3104 steps, saw 832 distinct states, run finished after 9 ms. (steps per millisecond=344 ) properties seen :0
Successfully simplified 15 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R010C002-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:20:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ResAllocation-PT-R010C002-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:20:05] [INFO ] Input system was already deterministic with 22 transitions.
Support contains 37 out of 40 places (down from 38) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 38 transition count 21
Applied a total of 3 rules in 3 ms. Remains 38 /40 variables (removed 2) and now considering 21/22 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 38/40 places, 21/22 transitions.
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 38 transition count 21
Applied a total of 3 rules in 2 ms. Remains 38 /40 variables (removed 2) and now considering 21/22 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 38/40 places, 21/22 transitions.
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:05] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 2 place count 39 transition count 21
Applied a total of 2 rules in 3 ms. Remains 39 /40 variables (removed 1) and now considering 21/22 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 39/40 places, 21/22 transitions.
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:05] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:05] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-18 23:20:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 22 transitions and 100 arcs took 0 ms.
Total runtime 2168 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: 40 NrTr: 22 NrArc: 100)

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

net check time: 0m 0.000sec

init dd package: 0m 2.794sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 116 (1.2e+02) #states 6,144 (3)



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

checking: EG [1<=p19]
normalized: EG [1<=p19]

abstracting: (1<=p19)
states: 2,816 (3)
............................................................................................
EG iterations: 92
-> the formula is FALSE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: EX [AF [[p31<=0 | AG [1<=p28]]]]
normalized: EX [~ [EG [~ [[~ [E [true U ~ [1<=p28]]] | p31<=0]]]]]

abstracting: (p31<=0)
states: 1,792 (3)
abstracting: (1<=p28)
states: 1,536 (3)
..................
EG iterations: 18
.-> the formula is FALSE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EX [AF [~ [A [[~ [1<=p27] & ~ [p37<=p9]] U 1<=p21]]]]
normalized: EX [~ [EG [[~ [EG [~ [1<=p21]]] & ~ [E [~ [1<=p21] U [~ [[~ [p37<=p9] & ~ [1<=p27]]] & ~ [1<=p21]]]]]]]]

abstracting: (1<=p21)
states: 5,632 (3)
abstracting: (1<=p27)
states: 4,864 (3)
abstracting: (p37<=p9)
states: 4,224 (3)
abstracting: (1<=p21)
states: 5,632 (3)
abstracting: (1<=p21)
states: 5,632 (3)
...............................................
EG iterations: 47
.
EG iterations: 1
.-> the formula is FALSE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [~ [E [EX [AG [1<=p39]] U ~ [[EX [p22<=0] | E [p29<=p19 U 1<=p25]]]]]]
normalized: ~ [E [true U E [EX [~ [E [true U ~ [1<=p39]]]] U ~ [[E [p29<=p19 U 1<=p25] | EX [p22<=0]]]]]]

abstracting: (p22<=0)
states: 5,376 (3)
.abstracting: (1<=p25)
states: 5,120 (3)
abstracting: (p29<=p19)
states: 3,584 (3)
abstracting: (1<=p39)
states: 3,328 (3)
.-> the formula is FALSE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AX [AX [AG [[A [1<=p8 U p22<=p38] | [~ [1<=p21] | ~ [1<=p12]]]]]]
normalized: ~ [EX [EX [E [true U ~ [[[~ [1<=p12] | ~ [1<=p21]] | [~ [EG [~ [p22<=p38]]] & ~ [E [~ [p22<=p38] U [~ [1<=p8] & ~ [p22<=p38]]]]]]]]]]]

abstracting: (p22<=p38)
states: 5,760 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (p22<=p38)
states: 5,760 (3)
abstracting: (p22<=p38)
states: 5,760 (3)
................
EG iterations: 16
abstracting: (1<=p21)
states: 5,632 (3)
abstracting: (1<=p12)
states: 1,280 (3)
..-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: A [~ [1<=p5] U ~ [EF [[~ [[EX [1<=p27] & [p34<=1 & p34<=0]]] & ~ [[1<=p11 & p38<=p2]]]]]]
normalized: [~ [EG [E [true U [~ [[1<=p11 & p38<=p2]] & ~ [[[p34<=1 & p34<=0] & EX [1<=p27]]]]]]] & ~ [E [E [true U [~ [[1<=p11 & p38<=p2]] & ~ [[[p34<=1 & p34<=0] & EX [1<=p27]]]]] U [E [true U [~ [[1<=p11 & p38<=p2]] & ~ [[[p34<=1 & p34<=0] & EX [1<=p27]]]]] & 1<=p5]]]]

abstracting: (1<=p5)
states: 2,816 (3)
abstracting: (1<=p27)
states: 4,864 (3)
.abstracting: (p34<=0)
states: 3,840 (3)
abstracting: (p34<=1)
states: 6,144 (3)
abstracting: (p38<=p2)
states: 4,480 (3)
abstracting: (1<=p11)
states: 2,816 (3)
abstracting: (1<=p27)
states: 4,864 (3)
.abstracting: (p34<=0)
states: 3,840 (3)
abstracting: (p34<=1)
states: 6,144 (3)
abstracting: (p38<=p2)
states: 4,480 (3)
abstracting: (1<=p11)
states: 2,816 (3)
abstracting: (1<=p27)
states: 4,864 (3)
.abstracting: (p34<=0)
states: 3,840 (3)
abstracting: (p34<=1)
states: 6,144 (3)
abstracting: (p38<=p2)
states: 4,480 (3)
abstracting: (1<=p11)
states: 2,816 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EG [[AG [[[~ [1<=p23] & [~ [p39<=1] & p2<=p7]] | [p37<=p11 & p31<=1]]] | EF [AG [p19<=0]]]]
normalized: EG [[E [true U ~ [E [true U ~ [p19<=0]]]] | ~ [E [true U ~ [[[p37<=p11 & p31<=1] | [[p2<=p7 & ~ [p39<=1]] & ~ [1<=p23]]]]]]]]

abstracting: (1<=p23)
states: 5,376 (3)
abstracting: (p39<=1)
states: 6,144 (3)
abstracting: (p2<=p7)
states: 4,736 (3)
abstracting: (p31<=1)
states: 6,144 (3)
abstracting: (p37<=p11)
states: 4,224 (3)
abstracting: (p19<=0)
states: 3,328 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: [EG [[EG [[1<=p17 & [~ [p34<=1] | ~ [p37<=0]]]] & ~ [E [1<=p12 U [AF [p12<=p10] | [1<=p0 | 1<=p10]]]]]] | EF [~ [1<=p21]]]
normalized: [E [true U ~ [1<=p21]] | EG [[~ [E [1<=p12 U [[1<=p0 | 1<=p10] | ~ [EG [~ [p12<=p10]]]]]] & EG [[[~ [p37<=0] | ~ [p34<=1]] & 1<=p17]]]]]

abstracting: (1<=p17)
states: 2,816 (3)
abstracting: (p34<=1)
states: 6,144 (3)
abstracting: (p37<=0)
states: 2,560 (3)
...........................................................................
EG iterations: 75
abstracting: (p12<=p10)
states: 5,504 (3)
.............................
EG iterations: 29
abstracting: (1<=p10)
states: 1,536 (3)
abstracting: (1<=p0)
states: 2,816 (3)
abstracting: (1<=p12)
states: 1,280 (3)
.
EG iterations: 1
abstracting: (1<=p21)
states: 5,632 (3)
-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: [EX [EF [EG [~ [p32<=0]]]] | [EF [EG [AX [1<=p2]]] & AF [E [[p27<=p4 | EF [1<=p34]] U ~ [[AX [p19<=p38] & [1<=p30 & p0<=p18]]]]]]]
normalized: [[~ [EG [~ [E [[E [true U 1<=p34] | p27<=p4] U ~ [[[1<=p30 & p0<=p18] & ~ [EX [~ [p19<=p38]]]]]]]]] & E [true U EG [~ [EX [~ [1<=p2]]]]]] | EX [E [true U EG [~ [p32<=0]]]]]

abstracting: (p32<=0)
states: 4,096 (3)
.................
EG iterations: 17
.abstracting: (1<=p2)
states: 2,560 (3)
..................
EG iterations: 17
abstracting: (p19<=p38)
states: 3,328 (3)
.abstracting: (p0<=p18)
states: 3,584 (3)
abstracting: (1<=p30)
states: 1,792 (3)
abstracting: (p27<=p4)
states: 3,328 (3)
abstracting: (1<=p34)
states: 2,304 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: EG [[AG [[AX [p22<=0] | [[~ [p33<=p15] & [p2<=0 & 1<=p1]] | 1<=p14]]] | [p19<=p23 | [~ [p29<=p33] & ~ [p1<=0]]]]]
normalized: EG [[[[~ [p1<=0] & ~ [p29<=p33]] | p19<=p23] | ~ [E [true U ~ [[[[[p2<=0 & 1<=p1] & ~ [p33<=p15]] | 1<=p14] | ~ [EX [~ [p22<=0]]]]]]]]]

abstracting: (p22<=0)
states: 5,376 (3)
.abstracting: (1<=p14)
states: 1,024 (3)
abstracting: (p33<=p15)
states: 3,840 (3)
abstracting: (1<=p1)
states: 2,816 (3)
abstracting: (p2<=0)
states: 3,584 (3)
abstracting: (p19<=p23)
states: 5,760 (3)
abstracting: (p29<=p33)
states: 4,864 (3)
abstracting: (p1<=0)
states: 3,328 (3)
..............
EG iterations: 14
-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: A [EX [AG [AX [AF [p38<=0]]]] U [AG [[A [p19<=p9 U p19<=p9] | [[p19<=p1 & p1<=p4] | 1<=p6]]] | [~ [AX [1<=p12]] & ~ [A [1<=p31 U [EF [1<=p32] | ~ [1<=p35]]]]]]]
normalized: [~ [EG [~ [[[~ [[~ [EG [~ [[~ [1<=p35] | E [true U 1<=p32]]]]] & ~ [E [~ [[~ [1<=p35] | E [true U 1<=p32]]] U [~ [1<=p31] & ~ [[~ [1<=p35] | E [true U 1<=p32]]]]]]]] & EX [~ [1<=p12]]] | ~ [E [true U ~ [[[1<=p6 | [p19<=p1 & p1<=p4]] | [~ [EG [~ [p19<=p9]]] & ~ [E [~ [p19<=p9] U [~ [p19<=p9] & ~ [p19<=p9]]]]]]]]]]]]] & ~ [E [~ [[[~ [[~ [EG [~ [[~ [1<=p35] | E [true U 1<=p32]]]]] & ~ [E [~ [[~ [1<=p35] | E [true U 1<=p32]]] U [~ [1<=p31] & ~ [[~ [1<=p35] | E [true U 1<=p32]]]]]]]] & EX [~ [1<=p12]]] | ~ [E [true U ~ [[[1<=p6 | [p19<=p1 & p1<=p4]] | [~ [EG [~ [p19<=p9]]] & ~ [E [~ [p19<=p9] U [~ [p19<=p9] & ~ [p19<=p9]]]]]]]]]]] U [~ [EX [~ [E [true U EX [EG [~ [p38<=0]]]]]]] & ~ [[[~ [[~ [EG [~ [[~ [1<=p35] | E [true U 1<=p32]]]]] & ~ [E [~ [[~ [1<=p35] | E [true U 1<=p32]]] U [~ [1<=p31] & ~ [[~ [1<=p35] | E [true U 1<=p32]]]]]]]] & EX [~ [1<=p12]]] | ~ [E [true U ~ [[[1<=p6 | [p19<=p1 & p1<=p4]] | [~ [EG [~ [p19<=p9]]] & ~ [E [~ [p19<=p9] U [~ [p19<=p9] & ~ [p19<=p9]]]]]]]]]]]]]]]

abstracting: (p19<=p9)
states: 4,608 (3)
abstracting: (p19<=p9)
states: 4,608 (3)
abstracting: (p19<=p9)
states: 4,608 (3)
abstracting: (p19<=p9)
states: 4,608 (3)
..........................
EG iterations: 26
abstracting: (p1<=p4)
states: 4,480 (3)
abstracting: (p19<=p1)
states: 4,608 (3)
abstracting: (1<=p6)
states: 2,048 (3)
abstracting: (1<=p12)
states: 1,280 (3)
.abstracting: (1<=p32)
states: 2,048 (3)
abstracting: (1<=p35)
states: 3,840 (3)
abstracting: (1<=p31)
states: 4,352 (3)
abstracting: (1<=p32)
states: 2,048 (3)
abstracting: (1<=p35)
states: 3,840 (3)
abstracting: (1<=p32)
states: 2,048 (3)
abstracting: (1<=p35)
states: 3,840 (3)
.
EG iterations: 1
abstracting: (p38<=0)
states: 3,328 (3)
.............................
EG iterations: 29
..abstracting: (p19<=p9)
states: 4,608 (3)
abstracting: (p19<=p9)
states: 4,608 (3)
abstracting: (p19<=p9)
states: 4,608 (3)
abstracting: (p19<=p9)
states: 4,608 (3)
..........................
EG iterations: 26
abstracting: (p1<=p4)
states: 4,480 (3)
abstracting: (p19<=p1)
states: 4,608 (3)
abstracting: (1<=p6)
states: 2,048 (3)
abstracting: (1<=p12)
states: 1,280 (3)
.abstracting: (1<=p32)
states: 2,048 (3)
abstracting: (1<=p35)
states: 3,840 (3)
abstracting: (1<=p31)
states: 4,352 (3)
abstracting: (1<=p32)
states: 2,048 (3)
abstracting: (1<=p35)
states: 3,840 (3)
abstracting: (1<=p32)
states: 2,048 (3)
abstracting: (1<=p35)
states: 3,840 (3)
.
EG iterations: 1
abstracting: (p19<=p9)
states: 4,608 (3)
abstracting: (p19<=p9)
states: 4,608 (3)
abstracting: (p19<=p9)
states: 4,608 (3)
abstracting: (p19<=p9)
states: 4,608 (3)
..........................
EG iterations: 26
abstracting: (p1<=p4)
states: 4,480 (3)
abstracting: (p19<=p1)
states: 4,608 (3)
abstracting: (1<=p6)
states: 2,048 (3)
abstracting: (1<=p12)
states: 1,280 (3)
.abstracting: (1<=p32)
states: 2,048 (3)
abstracting: (1<=p35)
states: 3,840 (3)
abstracting: (1<=p31)
states: 4,352 (3)
abstracting: (1<=p32)
states: 2,048 (3)
abstracting: (1<=p35)
states: 3,840 (3)
abstracting: (1<=p32)
states: 2,048 (3)
abstracting: (1<=p35)
states: 3,840 (3)
.
EG iterations: 1
.............................................
EG iterations: 45
-> the formula is FALSE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.047sec

checking: E [~ [[[~ [EX [p29<=p27]] | [[p10<=1 & p37<=p23] | EG [p31<=0]]] & AX [[p3<=0 | p9<=0]]]] U [A [[EX [EF [p20<=p19]] | A [[1<=p34 & 1<=p9] U AF [1<=p22]]] U ~ [1<=p14]] & [~ [AF [1<=p19]] & EX [0<=0]]]]
normalized: E [~ [[~ [EX [~ [[p3<=0 | p9<=0]]]] & [[EG [p31<=0] | [p10<=1 & p37<=p23]] | ~ [EX [p29<=p27]]]]] U [[EX [0<=0] & EG [~ [1<=p19]]] & [~ [EG [1<=p14]] & ~ [E [1<=p14 U [1<=p14 & ~ [[[~ [EG [EG [~ [1<=p22]]]] & ~ [E [EG [~ [1<=p22]] U [~ [[1<=p34 & 1<=p9]] & EG [~ [1<=p22]]]]]] | EX [E [true U p20<=p19]]]]]]]]]]

abstracting: (p20<=p19)
states: 5,888 (3)
.abstracting: (1<=p22)
states: 768
.
EG iterations: 1
abstracting: (1<=p9)
states: 2,816 (3)
abstracting: (1<=p34)
states: 2,304 (3)
abstracting: (1<=p22)
states: 768
.
EG iterations: 1
abstracting: (1<=p22)
states: 768
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p14)
states: 1,024 (3)
abstracting: (1<=p14)
states: 1,024 (3)
abstracting: (1<=p14)
states: 1,024 (3)
.
EG iterations: 1
abstracting: (1<=p19)
states: 2,816 (3)
...............................................
EG iterations: 47
abstracting: (0<=0)
states: 6,144 (3)
.abstracting: (p29<=p27)
states: 5,504 (3)
.abstracting: (p37<=p23)
states: 5,760 (3)
abstracting: (p10<=1)
states: 6,144 (3)
abstracting: (p31<=0)
states: 1,792 (3)
.................
EG iterations: 17
abstracting: (p9<=0)
states: 3,328 (3)
abstracting: (p3<=0)
states: 3,328 (3)
.-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: ~ [A [~ [[AG [~ [[1<=p10 | 1<=p21]]] & [~ [AG [p28<=0]] & ~ [[p39<=p8 | p25<=p18]]]]] U A [~ [[AX [p11<=0] & [[p7<=0 & p17<=1] | [1<=p33 & p31<=p16]]]] U [[1<=p28 & ~ [[p24<=p34 & p24<=p3]]] | ~ [p35<=p21]]]]]
normalized: ~ [[~ [EG [~ [[~ [EG [~ [[~ [p35<=p21] | [1<=p28 & ~ [[p24<=p34 & p24<=p3]]]]]]] & ~ [E [~ [[~ [p35<=p21] | [1<=p28 & ~ [[p24<=p34 & p24<=p3]]]]] U [[[[1<=p33 & p31<=p16] | [p7<=0 & p17<=1]] & ~ [EX [~ [p11<=0]]]] & ~ [[~ [p35<=p21] | [1<=p28 & ~ [[p24<=p34 & p24<=p3]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[~ [p35<=p21] | [1<=p28 & ~ [[p24<=p34 & p24<=p3]]]]]]] & ~ [E [~ [[~ [p35<=p21] | [1<=p28 & ~ [[p24<=p34 & p24<=p3]]]]] U [[[[1<=p33 & p31<=p16] | [p7<=0 & p17<=1]] & ~ [EX [~ [p11<=0]]]] & ~ [[~ [p35<=p21] | [1<=p28 & ~ [[p24<=p34 & p24<=p3]]]]]]]]]] U [[[~ [[p39<=p8 | p25<=p18]] & E [true U ~ [p28<=0]]] & ~ [E [true U [1<=p10 | 1<=p21]]]] & ~ [[~ [EG [~ [[~ [p35<=p21] | [1<=p28 & ~ [[p24<=p34 & p24<=p3]]]]]]] & ~ [E [~ [[~ [p35<=p21] | [1<=p28 & ~ [[p24<=p34 & p24<=p3]]]]] U [[[[1<=p33 & p31<=p16] | [p7<=0 & p17<=1]] & ~ [EX [~ [p11<=0]]]] & ~ [[~ [p35<=p21] | [1<=p28 & ~ [[p24<=p34 & p24<=p3]]]]]]]]]]]]]]]

abstracting: (p24<=p3)
states: 5,504 (3)
abstracting: (p24<=p34)
states: 5,632 (3)
abstracting: (1<=p28)
states: 1,536 (3)
abstracting: (p35<=p21)
states: 5,888 (3)
abstracting: (p11<=0)
states: 3,328 (3)
.abstracting: (p17<=1)
states: 6,144 (3)
abstracting: (p7<=0)
states: 3,328 (3)
abstracting: (p31<=p16)
states: 2,560 (3)
abstracting: (1<=p33)
states: 4,096 (3)
abstracting: (p24<=p3)
states: 5,504 (3)
abstracting: (p24<=p34)
states: 5,632 (3)
abstracting: (1<=p28)
states: 1,536 (3)
abstracting: (p35<=p21)
states: 5,888 (3)
abstracting: (p24<=p3)
states: 5,504 (3)
abstracting: (p24<=p34)
states: 5,632 (3)
abstracting: (1<=p28)
states: 1,536 (3)
abstracting: (p35<=p21)
states: 5,888 (3)
...............................
EG iterations: 31
abstracting: (1<=p21)
states: 5,632 (3)
abstracting: (1<=p10)
states: 1,536 (3)
abstracting: (p28<=0)
states: 4,608 (3)
abstracting: (p25<=p18)
states: 1,536 (3)
abstracting: (p39<=p8)
states: 3,840 (3)
abstracting: (p24<=p3)
states: 5,504 (3)
abstracting: (p24<=p34)
states: 5,632 (3)
abstracting: (1<=p28)
states: 1,536 (3)
abstracting: (p35<=p21)
states: 5,888 (3)
abstracting: (p11<=0)
states: 3,328 (3)
.abstracting: (p17<=1)
states: 6,144 (3)
abstracting: (p7<=0)
states: 3,328 (3)
abstracting: (p31<=p16)
states: 2,560 (3)
abstracting: (1<=p33)
states: 4,096 (3)
abstracting: (p24<=p3)
states: 5,504 (3)
abstracting: (p24<=p34)
states: 5,632 (3)
abstracting: (1<=p28)
states: 1,536 (3)
abstracting: (p35<=p21)
states: 5,888 (3)
abstracting: (p24<=p3)
states: 5,504 (3)
abstracting: (p24<=p34)
states: 5,632 (3)
abstracting: (1<=p28)
states: 1,536 (3)
abstracting: (p35<=p21)
states: 5,888 (3)
...............................
EG iterations: 31
abstracting: (p24<=p3)
states: 5,504 (3)
abstracting: (p24<=p34)
states: 5,632 (3)
abstracting: (1<=p28)
states: 1,536 (3)
abstracting: (p35<=p21)
states: 5,888 (3)
abstracting: (p11<=0)
states: 3,328 (3)
.abstracting: (p17<=1)
states: 6,144 (3)
abstracting: (p7<=0)
states: 3,328 (3)
abstracting: (p31<=p16)
states: 2,560 (3)
abstracting: (1<=p33)
states: 4,096 (3)
abstracting: (p24<=p3)
states: 5,504 (3)
abstracting: (p24<=p34)
states: 5,632 (3)
abstracting: (1<=p28)
states: 1,536 (3)
abstracting: (p35<=p21)
states: 5,888 (3)
abstracting: (p24<=p3)
states: 5,504 (3)
abstracting: (p24<=p34)
states: 5,632 (3)
abstracting: (1<=p28)
states: 1,536 (3)
abstracting: (p35<=p21)
states: 5,888 (3)
...............................
EG iterations: 31
...............................
EG iterations: 31
-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

totally nodes used: 254028 (2.5e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 127038 409270 536308
used/not used/entry size/cache size: 606708 66502156 16 1024MB
basic ops cache: hits/miss/sum: 47559 144992 192551
used/not used/entry size/cache size: 308669 16468547 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: 762 1969 2731
used/not used/entry size/cache size: 1969 8386639 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 66866981
1 230847
2 10019
3 932
4 78
5 7
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.662sec


BK_STOP 1679181611175

--------------------
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:434 (19), effective:110 (5)

initing FirstDep: 0m 0.000sec


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

iterations count:29 (1), effective:2 (0)

iterations count:30 (1), effective:3 (0)

iterations count:27 (1), effective:2 (0)

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

iterations count:579 (26), effective:174 (7)

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

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

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

iterations count:58 (2), effective:11 (0)

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

iterations count:112 (5), effective:29 (1)

iterations count:53 (2), effective:11 (0)

iterations count:188 (8), effective:56 (2)

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

iterations count:235 (10), effective:65 (2)

iterations count:146 (6), effective:40 (1)

iterations count:627 (28), effective:193 (8)

iterations count:45 (2), effective:9 (0)

iterations count:50 (2), effective:9 (0)

iterations count:195 (8), effective:54 (2)

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

iterations count:175 (7), effective:49 (2)

iterations count:60 (2), effective:14 (0)

iterations count:60 (2), effective:14 (0)

iterations count:60 (2), effective:14 (0)

iterations count:141 (6), effective:36 (1)

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

iterations count:175 (7), effective:49 (2)

iterations count:60 (2), effective:14 (0)

iterations count:60 (2), effective:14 (0)

iterations count:60 (2), effective:14 (0)

iterations count:27 (1), effective:2 (0)

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

iterations count:175 (7), effective:49 (2)

iterations count:60 (2), effective:14 (0)

iterations count:60 (2), effective:14 (0)

iterations count:60 (2), effective:14 (0)

iterations count:49 (2), effective:9 (0)

iterations count:52 (2), effective:8 (0)

iterations count:153 (6), effective:33 (1)

iterations count:84 (3), effective:19 (0)

iterations count:316 (14), effective:93 (4)

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

iterations count:102 (4), effective:27 (1)

iterations count:316 (14), effective:93 (4)

iterations count:316 (14), effective:93 (4)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R010C002"
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 ResAllocation-PT-R010C002, 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-167889203600737"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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