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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 5.9K Feb 25 15:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 15:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 15:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 15:26 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 4.0K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 15:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 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 35K 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-R003C005-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679180716844

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-R003C005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:05:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 23:05:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:05:18] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-03-18 23:05:18] [INFO ] Transformed 30 places.
[2023-03-18 23:05:18] [INFO ] Transformed 20 transitions.
[2023-03-18 23:05:18] [INFO ] Parsed PT model containing 30 places and 20 transitions and 84 arcs in 95 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 9 ms.
Initial state reduction rules removed 2 formulas.
FORMULA ResAllocation-PT-R003C005-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C005-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 30 cols
[2023-03-18 23:05:18] [INFO ] Computed 15 place invariants in 7 ms
[2023-03-18 23:05:18] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-18 23:05:18] [INFO ] Invariant cache hit.
[2023-03-18 23:05:18] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-18 23:05:18] [INFO ] Invariant cache hit.
[2023-03-18 23:05:18] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 30/30 places, 20/20 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-03-18 23:05:19] [INFO ] Flatten gal took : 17 ms
[2023-03-18 23:05:19] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:05:19] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10000 steps, including 747 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 50) seen :43
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 186 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 175 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 203 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 192 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 195 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 23:05:19] [INFO ] Invariant cache hit.
[2023-03-18 23:05:19] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 23:05:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-18 23:05:19] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R003C005-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:05:19] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:05:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:05:19] [INFO ] Input system was already deterministic with 20 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:19] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:20] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 20/20 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 29 transition count 19
Applied a total of 2 rules in 17 ms. Remains 29 /30 variables (removed 1) and now considering 19/20 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 29/30 places, 19/20 transitions.
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:20] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:05:20] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:20] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 24 transition count 15
Applied a total of 11 rules in 3 ms. Remains 24 /30 variables (removed 6) and now considering 15/20 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 24/30 places, 15/20 transitions.
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:05:20] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:20] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:20] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:05:20] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 20/20 transitions.
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 5 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 25 transition count 16
Applied a total of 9 rules in 8 ms. Remains 25 /30 variables (removed 5) and now considering 16/20 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 25/30 places, 16/20 transitions.
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:20] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
FORMULA ResAllocation-PT-R003C005-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:20] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:20] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 20/20 transitions.
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:05:20] [INFO ] Input system was already deterministic with 20 transitions.
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:05:20] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:05:20] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-18 23:05:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 20 transitions and 84 arcs took 1 ms.
Total runtime 1879 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: 30 NrTr: 20 NrArc: 84)

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

net check time: 0m 0.000sec

init dd package: 0m 2.723sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 166 (1.7e+02) #states 1,200 (3)



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

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

abstracting: (0<=0)
states: 1,200 (3)
..
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (p0<=0)
states: 640
..-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: AX [EX [AG [p24<=p14]]]
normalized: ~ [EX [~ [EX [~ [E [true U ~ [p24<=p14]]]]]]]

abstracting: (p24<=p14)
states: 848
..-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EX [p25<=p1]
normalized: EX [p25<=p1]

abstracting: (p25<=p1)
states: 856
.-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: [EG [p24<=p25] & AF [p22<=0]]
normalized: [~ [EG [~ [p22<=0]]] & EG [p24<=p25]]

abstracting: (p24<=p25)
states: 640
...........
EG iterations: 11
abstracting: (p22<=0)
states: 848
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: E [1<=p25 U EX [[~ [EX [1<=p28]] | [~ [1<=p13] | 1<=p15]]]]
normalized: E [1<=p25 U EX [[[~ [1<=p13] | 1<=p15] | ~ [EX [1<=p28]]]]]

abstracting: (1<=p28)
states: 368
.abstracting: (1<=p15)
states: 600
abstracting: (1<=p13)
states: 592
.abstracting: (1<=p25)
states: 640
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[AX [[[p6<=1 & p22<=p3] | EX [0<=0]]] & EF [p19<=p17]]]
normalized: ~ [E [true U ~ [[E [true U p19<=p17] & ~ [EX [~ [[EX [0<=0] | [p6<=1 & p22<=p3]]]]]]]]]

abstracting: (p22<=p3)
states: 996
abstracting: (p6<=1)
states: 1,200 (3)
abstracting: (0<=0)
states: 1,200 (3)
..abstracting: (p19<=p17)
states: 916
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EX [[[EX [[~ [p5<=0] & ~ [1<=p7]]] & 1<=p13] | [EG [p12<=0] & ~ [E [p2<=p9 U ~ [p18<=p4]]]]]]
normalized: EX [[[~ [E [p2<=p9 U ~ [p18<=p4]]] & EG [p12<=0]] | [1<=p13 & EX [[~ [1<=p7] & ~ [p5<=0]]]]]]

abstracting: (p5<=0)
states: 720
abstracting: (1<=p7)
states: 592
.abstracting: (1<=p13)
states: 592
abstracting: (p12<=0)
states: 672
........
EG iterations: 8
abstracting: (p18<=p4)
states: 1,136 (3)
abstracting: (p2<=p9)
states: 992
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EG [[[AX [A [EX [p21<=0] U [p29<=1 & p16<=p18]]] | EF [~ [1<=p24]]] | [p25<=0 | [1<=p3 | ~ [p17<=0]]]]]
normalized: EG [[[[~ [p17<=0] | 1<=p3] | p25<=0] | [E [true U ~ [1<=p24]] | ~ [EX [~ [[~ [EG [~ [[p29<=1 & p16<=p18]]]] & ~ [E [~ [[p29<=1 & p16<=p18]] U [~ [EX [p21<=0]] & ~ [[p29<=1 & p16<=p18]]]]]]]]]]]]

abstracting: (p16<=p18)
states: 944
abstracting: (p29<=1)
states: 1,200 (3)
abstracting: (p21<=0)
states: 672
.abstracting: (p16<=p18)
states: 944
abstracting: (p29<=1)
states: 1,200 (3)
abstracting: (p16<=p18)
states: 944
abstracting: (p29<=1)
states: 1,200 (3)
.
EG iterations: 1
.abstracting: (1<=p24)
states: 560
abstracting: (p25<=0)
states: 560
abstracting: (1<=p3)
states: 528
abstracting: (p17<=0)
states: 608

EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AX [A [E [A [AF [1<=p13] U ~ [p0<=p15]] U ~ [p16<=p27]] U [~ [EX [p16<=p14]] | p16<=p5]]]
normalized: ~ [EX [~ [[~ [EG [~ [[p16<=p5 | ~ [EX [p16<=p14]]]]]] & ~ [E [~ [[p16<=p5 | ~ [EX [p16<=p14]]]] U [~ [E [[~ [EG [p0<=p15]] & ~ [E [p0<=p15 U [p0<=p15 & EG [~ [1<=p13]]]]]] U ~ [p16<=p27]]] & ~ [[p16<=p5 | ~ [EX [p16<=p14]]]]]]]]]]]

abstracting: (p16<=p14)
states: 1,072 (3)
.abstracting: (p16<=p5)
states: 1,072 (3)
abstracting: (p16<=p27)
states: 1,072 (3)
abstracting: (1<=p13)
states: 592
.......
EG iterations: 7
abstracting: (p0<=p15)
states: 912
abstracting: (p0<=p15)
states: 912
abstracting: (p0<=p15)
states: 912
..........
EG iterations: 10
abstracting: (p16<=p14)
states: 1,072 (3)
.abstracting: (p16<=p5)
states: 1,072 (3)
abstracting: (p16<=p14)
states: 1,072 (3)
.abstracting: (p16<=p5)
states: 1,072 (3)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: ~ [A [~ [[p3<=p20 | E [~ [p7<=p21] U AG [p17<=p3]]]] U ~ [A [~ [AG [p8<=p4]] U A [[p6<=1 & p12<=p29] U AG [p15<=p27]]]]]]
normalized: ~ [[~ [EG [[~ [EG [~ [[~ [EG [E [true U ~ [p15<=p27]]]] & ~ [E [E [true U ~ [p15<=p27]] U [~ [[p6<=1 & p12<=p29]] & E [true U ~ [p15<=p27]]]]]]]]] & ~ [E [~ [[~ [EG [E [true U ~ [p15<=p27]]]] & ~ [E [E [true U ~ [p15<=p27]] U [~ [[p6<=1 & p12<=p29]] & E [true U ~ [p15<=p27]]]]]]] U [~ [E [true U ~ [p8<=p4]]] & ~ [[~ [EG [E [true U ~ [p15<=p27]]]] & ~ [E [E [true U ~ [p15<=p27]] U [~ [[p6<=1 & p12<=p29]] & E [true U ~ [p15<=p27]]]]]]]]]]]]] & ~ [E [[~ [EG [~ [[~ [EG [E [true U ~ [p15<=p27]]]] & ~ [E [E [true U ~ [p15<=p27]] U [~ [[p6<=1 & p12<=p29]] & E [true U ~ [p15<=p27]]]]]]]]] & ~ [E [~ [[~ [EG [E [true U ~ [p15<=p27]]]] & ~ [E [E [true U ~ [p15<=p27]] U [~ [[p6<=1 & p12<=p29]] & E [true U ~ [p15<=p27]]]]]]] U [~ [E [true U ~ [p8<=p4]]] & ~ [[~ [EG [E [true U ~ [p15<=p27]]]] & ~ [E [E [true U ~ [p15<=p27]] U [~ [[p6<=1 & p12<=p29]] & E [true U ~ [p15<=p27]]]]]]]]]]] U [[p3<=p20 | E [~ [p7<=p21] U ~ [E [true U ~ [p17<=p3]]]]] & [~ [EG [~ [[~ [EG [E [true U ~ [p15<=p27]]]] & ~ [E [E [true U ~ [p15<=p27]] U [~ [[p6<=1 & p12<=p29]] & E [true U ~ [p15<=p27]]]]]]]]] & ~ [E [~ [[~ [EG [E [true U ~ [p15<=p27]]]] & ~ [E [E [true U ~ [p15<=p27]] U [~ [[p6<=1 & p12<=p29]] & E [true U ~ [p15<=p27]]]]]]] U [~ [E [true U ~ [p8<=p4]]] & ~ [[~ [EG [E [true U ~ [p15<=p27]]]] & ~ [E [E [true U ~ [p15<=p27]] U [~ [[p6<=1 & p12<=p29]] & E [true U ~ [p15<=p27]]]]]]]]]]]]]]]]

abstracting: (p15<=p27)
states: 920
abstracting: (p12<=p29)
states: 1,024 (3)
abstracting: (p6<=1)
states: 1,200 (3)
abstracting: (p15<=p27)
states: 920
abstracting: (p15<=p27)
states: 920
......
EG iterations: 6
abstracting: (p8<=p4)
states: 1,016 (3)
abstracting: (p15<=p27)
states: 920
abstracting: (p12<=p29)
states: 1,024 (3)
abstracting: (p6<=1)
states: 1,200 (3)
abstracting: (p15<=p27)
states: 920
abstracting: (p15<=p27)
states: 920
......
EG iterations: 6
abstracting: (p15<=p27)
states: 920
abstracting: (p12<=p29)
states: 1,024 (3)
abstracting: (p6<=1)
states: 1,200 (3)
abstracting: (p15<=p27)
states: 920
abstracting: (p15<=p27)
states: 920
......
EG iterations: 6
.
EG iterations: 1
abstracting: (p17<=p3)
states: 860
abstracting: (p7<=p21)
states: 872
abstracting: (p3<=p20)
states: 744
abstracting: (p15<=p27)
states: 920
abstracting: (p12<=p29)
states: 1,024 (3)
abstracting: (p6<=1)
states: 1,200 (3)
abstracting: (p15<=p27)
states: 920
abstracting: (p15<=p27)
states: 920
......
EG iterations: 6
abstracting: (p8<=p4)
states: 1,016 (3)
abstracting: (p15<=p27)
states: 920
abstracting: (p12<=p29)
states: 1,024 (3)
abstracting: (p6<=1)
states: 1,200 (3)
abstracting: (p15<=p27)
states: 920
abstracting: (p15<=p27)
states: 920
......
EG iterations: 6
abstracting: (p15<=p27)
states: 920
abstracting: (p12<=p29)
states: 1,024 (3)
abstracting: (p6<=1)
states: 1,200 (3)
abstracting: (p15<=p27)
states: 920
abstracting: (p15<=p27)
states: 920
......
EG iterations: 6
.
EG iterations: 1
abstracting: (p15<=p27)
states: 920
abstracting: (p12<=p29)
states: 1,024 (3)
abstracting: (p6<=1)
states: 1,200 (3)
abstracting: (p15<=p27)
states: 920
abstracting: (p15<=p27)
states: 920
......
EG iterations: 6
abstracting: (p8<=p4)
states: 1,016 (3)
abstracting: (p15<=p27)
states: 920
abstracting: (p12<=p29)
states: 1,024 (3)
abstracting: (p6<=1)
states: 1,200 (3)
abstracting: (p15<=p27)
states: 920
abstracting: (p15<=p27)
states: 920
......
EG iterations: 6
abstracting: (p15<=p27)
states: 920
abstracting: (p12<=p29)
states: 1,024 (3)
abstracting: (p6<=1)
states: 1,200 (3)
abstracting: (p15<=p27)
states: 920
abstracting: (p15<=p27)
states: 920
......
EG iterations: 6
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.015sec

checking: [~ [A [p20<=p24 U [~ [[p29<=p10 | p22<=p10]] | AG [1<=p21]]]] & AF [[[E [p11<=p15 U 1<=p10] | [p18<=p4 & [AF [p6<=p14] | [1<=p0 | ~ [1<=p18]]]]] & EF [1<=p17]]]]
normalized: [~ [EG [~ [[E [true U 1<=p17] & [[p18<=p4 & [[1<=p0 | ~ [1<=p18]] | ~ [EG [~ [p6<=p14]]]]] | E [p11<=p15 U 1<=p10]]]]]] & ~ [[~ [EG [~ [[~ [E [true U ~ [1<=p21]]] | ~ [[p29<=p10 | p22<=p10]]]]]] & ~ [E [~ [[~ [E [true U ~ [1<=p21]]] | ~ [[p29<=p10 | p22<=p10]]]] U [~ [p20<=p24] & ~ [[~ [E [true U ~ [1<=p21]]] | ~ [[p29<=p10 | p22<=p10]]]]]]]]]]

abstracting: (p22<=p10)
states: 980
abstracting: (p29<=p10)
states: 632
abstracting: (1<=p21)
states: 528
abstracting: (p20<=p24)
states: 1,088 (3)
abstracting: (p22<=p10)
states: 980
abstracting: (p29<=p10)
states: 632
abstracting: (1<=p21)
states: 528
abstracting: (p22<=p10)
states: 980
abstracting: (p29<=p10)
states: 632
abstracting: (1<=p21)
states: 528
.
EG iterations: 1
abstracting: (1<=p10)
states: 352
abstracting: (p11<=p15)
states: 896
abstracting: (p6<=p14)
states: 1,120 (3)
.......
EG iterations: 7
abstracting: (1<=p18)
states: 80
abstracting: (1<=p0)
states: 560
abstracting: (p18<=p4)
states: 1,136 (3)
abstracting: (1<=p17)
states: 592
.........
EG iterations: 9
-> the formula is TRUE

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

MC time: 0m 0.005sec

totally nodes used: 44527 (4.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 23299 85688 108987
used/not used/entry size/cache size: 120363 66988501 16 1024MB
basic ops cache: hits/miss/sum: 11312 30242 41554
used/not used/entry size/cache size: 60236 16716980 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: 600 2015 2615
used/not used/entry size/cache size: 2015 8386593 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 67065250
1 42725
2 866
3 22
4 1
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.349sec


BK_STOP 1679180725503

--------------------
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:154 (7), effective:30 (1)

initing FirstDep: 0m 0.000sec


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

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

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

iterations count:153 (7), effective:29 (1)

iterations count:125 (6), effective:16 (0)

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

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

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

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

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

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:7 (0)

iterations count:87 (4), effective:11 (0)

iterations count:73 (3), effective:7 (0)

iterations count:60 (3), effective:8 (0)

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:7 (0)

iterations count:87 (4), effective:11 (0)

iterations count:73 (3), effective:7 (0)

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

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:7 (0)

iterations count:87 (4), effective:11 (0)

iterations count:73 (3), effective:7 (0)

iterations count:64 (3), effective:9 (0)

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

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:7 (0)

iterations count:87 (4), effective:11 (0)

iterations count:73 (3), effective:7 (0)

iterations count:60 (3), effective:8 (0)

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:7 (0)

iterations count:87 (4), effective:11 (0)

iterations count:73 (3), effective:7 (0)

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

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:7 (0)

iterations count:87 (4), effective:11 (0)

iterations count:73 (3), effective:7 (0)

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

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:7 (0)

iterations count:87 (4), effective:11 (0)

iterations count:73 (3), effective:7 (0)

iterations count:60 (3), effective:8 (0)

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:7 (0)

iterations count:87 (4), effective:11 (0)

iterations count:73 (3), effective:7 (0)

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

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:7 (0)

iterations count:87 (4), effective:11 (0)

iterations count:73 (3), effective:7 (0)

iterations count:74 (3), effective:8 (0)

iterations count:74 (3), effective:8 (0)

iterations count:61 (3), effective:8 (0)

iterations count:74 (3), effective:8 (0)

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

iterations count:50 (2), effective:4 (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="ResAllocation-PT-R003C005"
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-R003C005, 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-167889203600681"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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