fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r330-tall-167889203400537
Last Updated
May 14, 2023

About the Execution of Marcie+red for RefineWMG-PT-002003

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5450.527 8784.00 13532.00 392.50 FFTFTFTFTFFTFTTT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.0K Feb 26 16:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 16:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 26 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 16:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 16:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 16:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 16:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.9K 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 RefineWMG-PT-002003-CTLCardinality-00
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-01
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-02
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-03
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-04
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-05
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-06
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-07
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-08
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-09
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-10
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-11
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-12
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-13
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-14
FORMULA_NAME RefineWMG-PT-002003-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679169846912

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=RefineWMG-PT-002003
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:04:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 20:04:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:04:08] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2023-03-18 20:04:08] [INFO ] Transformed 14 places.
[2023-03-18 20:04:08] [INFO ] Transformed 11 transitions.
[2023-03-18 20:04:08] [INFO ] Parsed PT model containing 14 places and 11 transitions and 32 arcs in 72 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Initial state reduction rules removed 1 formulas.
FORMULA RefineWMG-PT-002003-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 8 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-18 20:04:08] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-18 20:04:08] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
[2023-03-18 20:04:08] [INFO ] Invariant cache hit.
[2023-03-18 20:04:08] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 20:04:08] [INFO ] Invariant cache hit.
[2023-03-18 20:04:08] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-18 20:04:08] [INFO ] Invariant cache hit.
[2023-03-18 20:04:08] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 14/14 places, 11/11 transitions.
Support contains 14 out of 14 places after structural reductions.
[2023-03-18 20:04:08] [INFO ] Flatten gal took : 14 ms
[2023-03-18 20:04:08] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:04:08] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 57) seen :43
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-18 20:04:10] [INFO ] Invariant cache hit.
[2023-03-18 20:04:10] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-18 20:04:10] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :11 sat :0 real:3
[2023-03-18 20:04:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-18 20:04:10] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :0
Fused 14 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 14 atomic propositions for a total of 15 simplifications.
FORMULA RefineWMG-PT-002003-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:04:10] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:04:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA RefineWMG-PT-002003-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-002003-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-002003-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-002003-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:04:10] [INFO ] Input system was already deterministic with 11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Graph (trivial) has 4 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
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 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 8 transition count 8
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 9 place count 7 transition count 7
Applied a total of 9 rules in 7 ms. Remains 7 /14 variables (removed 7) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-18 20:04:10] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 20:04:10] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 7/14 places, 7/11 transitions.
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:04:10] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-18 20:04:10] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-18 20:04:10] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:04:10] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 20:04:10] [INFO ] Invariant cache hit.
[2023-03-18 20:04:10] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:10] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 20:04:10] [INFO ] Invariant cache hit.
[2023-03-18 20:04:10] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:10] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Graph (trivial) has 5 edges and 14 vertex of which 4 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
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 1 with 3 rules applied. Total rules applied 5 place count 8 transition count 7
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 1 with 2 rules applied. Total rules applied 7 place count 7 transition count 6
Applied a total of 7 rules in 1 ms. Remains 7 /14 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-18 20:04:10] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:04:10] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 7/14 places, 6/11 transitions.
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:10] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-18 20:04:10] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-18 20:04:10] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:10] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Graph (trivial) has 4 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
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 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 8 transition count 8
Applied a total of 7 rules in 2 ms. Remains 8 /14 variables (removed 6) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-18 20:04:10] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:04:10] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 8/14 places, 8/11 transitions.
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:10] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-18 20:04:10] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-18 20:04:10] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:10] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 20:04:10] [INFO ] Invariant cache hit.
[2023-03-18 20:04:10] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:10] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 20:04:10] [INFO ] Invariant cache hit.
[2023-03-18 20:04:10] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:10] [INFO ] Input system was already deterministic with 11 transitions.
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:10] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:04:10] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-18 20:04:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 14 places, 11 transitions and 32 arcs took 0 ms.
Total runtime 2415 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: 14 NrTr: 11 NrArc: 32)

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

net check time: 0m 0.000sec

init dd package: 0m 2.673sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 122 (1.2e+02) #states 184,320 (5)



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

checking: AG [EX [0<=0]]
normalized: ~ [E [true U ~ [EX [0<=0]]]]

abstracting: (0<=0)
states: 184,320 (5)
.-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [AG [~ [5<=p9]]]
normalized: ~ [EX [E [true U 5<=p9]]]

abstracting: (5<=p9)
states: 15,360 (4)
.-> the formula is FALSE

FORMULA RefineWMG-PT-002003-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[1<=p3 | EG [EF [AG [~ [p13<=0]]]]]]
normalized: ~ [E [true U ~ [[EG [E [true U ~ [E [true U p13<=0]]]] | 1<=p3]]]]

abstracting: (1<=p3)
states: 153,600 (5)
abstracting: (p13<=0)
states: 46,080 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[AG [~ [p2<=p11]] & EF [4<=p1]]]
normalized: E [true U [E [true U 4<=p1] & ~ [E [true U p2<=p11]]]]

abstracting: (p2<=p11)
states: 76,800 (4)
abstracting: (4<=p1)
states: 30,720 (4)
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [AG [[~ [p1<=p4] & ~ [p13<=p9]]]]
normalized: E [true U ~ [E [true U ~ [[~ [p13<=p9] & ~ [p1<=p4]]]]]]

abstracting: (p1<=p4)
states: 107,520 (5)
abstracting: (p13<=p9)
states: 113,280 (5)
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [EF [[p11<=p4 | EF [[[p9<=1 | 7<=p6] & [p13<=p7 & p6<=1]]]]]]
normalized: ~ [E [true U ~ [E [true U [E [true U [[p13<=p7 & p6<=1] & [p9<=1 | 7<=p6]]] | p11<=p4]]]]]

abstracting: (p11<=p4)
states: 113,280 (5)
abstracting: (7<=p6)
states: 0
abstracting: (p9<=1)
states: 98,304 (4)
abstracting: (p6<=1)
states: 92,160 (4)
abstracting: (p13<=p7)
states: 115,200 (5)
-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[AG [A [[[p2<=p1 | p11<=p3] | [p4<=5 | 3<=p5]] U [~ [3<=p6] | EX [0<=0]]]] & p1<=p8]]
normalized: E [true U [p1<=p8 & ~ [E [true U ~ [[~ [EG [~ [[EX [0<=0] | ~ [3<=p6]]]]] & ~ [E [~ [[EX [0<=0] | ~ [3<=p6]]] U [~ [[[p4<=5 | 3<=p5] | [p2<=p1 | p11<=p3]]] & ~ [[EX [0<=0] | ~ [3<=p6]]]]]]]]]]]]

abstracting: (3<=p6)
states: 46,080 (4)
abstracting: (0<=0)
states: 184,320 (5)
.abstracting: (p11<=p3)
states: 138,240 (5)
abstracting: (p2<=p1)
states: 83,200 (4)
abstracting: (3<=p5)
states: 46,080 (4)
abstracting: (p4<=5)
states: 178,176 (5)
abstracting: (3<=p6)
states: 46,080 (4)
abstracting: (0<=0)
states: 184,320 (5)
.abstracting: (3<=p6)
states: 46,080 (4)
abstracting: (0<=0)
states: 184,320 (5)
..
EG iterations: 1
abstracting: (p1<=p8)
states: 109,440 (5)
-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[EF [1<=p5] & [EF [[EX [~ [p3<=4]] & [~ [p9<=3] & ~ [p10<=p6]]]] | AX [[[~ [p1<=p2] & ~ [p7<=p4]] | AX [~ [p6<=p5]]]]]]]
normalized: ~ [E [true U ~ [[[~ [EX [~ [[~ [EX [p6<=p5]] | [~ [p7<=p4] & ~ [p1<=p2]]]]]] | E [true U [[~ [p10<=p6] & ~ [p9<=3]] & EX [~ [p3<=4]]]]] & E [true U 1<=p5]]]]]

abstracting: (1<=p5)
states: 138,240 (5)
abstracting: (p3<=4)
states: 153,600 (5)
.abstracting: (p9<=3)
states: 153,600 (5)
abstracting: (p10<=p6)
states: 115,200 (5)
abstracting: (p1<=p2)
states: 130,816 (5)
abstracting: (p7<=p4)
states: 113,280 (5)
abstracting: (p6<=p5)
states: 92,160 (4)
..-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: E [E [E [AF [EG [p0<=5]] U [EF [p9<=p2] & [AX [2<=p7] | AG [p12<=0]]]] U EF [1<=p5]] U [p2<=p4 & [~ [p6<=p3] & p9<=1]]]
normalized: E [E [E [~ [EG [~ [EG [p0<=5]]]] U [[~ [E [true U ~ [p12<=0]]] | ~ [EX [~ [2<=p7]]]] & E [true U p9<=p2]]] U E [true U 1<=p5]] U [p2<=p4 & [p9<=1 & ~ [p6<=p3]]]]

abstracting: (p6<=p3)
states: 138,240 (5)
abstracting: (p9<=1)
states: 98,304 (4)
abstracting: (p2<=p4)
states: 83,200 (4)
abstracting: (1<=p5)
states: 138,240 (5)
abstracting: (p9<=p2)
states: 130,816 (5)
abstracting: (2<=p7)
states: 92,160 (4)
.abstracting: (p12<=0)
states: 46,080 (4)
abstracting: (p0<=5)
states: 178,176 (5)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: ~ [A [p3<=1 U ~ [[[[AX [2<=p12] & [EX [3<=p10] & AG [3<=p7]]] | AG [[2<=p0 & 1<=p7]]] | [~ [[p1<=7 | 1<=p9]] | [[p0<=p2 & p0<=p5] | 6<=p2]]]]]]
normalized: ~ [[~ [EG [[[[6<=p2 | [p0<=p2 & p0<=p5]] | ~ [[p1<=7 | 1<=p9]]] | [~ [E [true U ~ [[2<=p0 & 1<=p7]]]] | [[~ [E [true U ~ [3<=p7]]] & EX [3<=p10]] & ~ [EX [~ [2<=p12]]]]]]]] & ~ [E [[[[6<=p2 | [p0<=p2 & p0<=p5]] | ~ [[p1<=7 | 1<=p9]]] | [~ [E [true U ~ [[2<=p0 & 1<=p7]]]] | [[~ [E [true U ~ [3<=p7]]] & EX [3<=p10]] & ~ [EX [~ [2<=p12]]]]]] U [~ [p3<=1] & [[[6<=p2 | [p0<=p2 & p0<=p5]] | ~ [[p1<=7 | 1<=p9]]] | [~ [E [true U ~ [[2<=p0 & 1<=p7]]]] | [[~ [E [true U ~ [3<=p7]]] & EX [3<=p10]] & ~ [EX [~ [2<=p12]]]]]]]]]]]

abstracting: (2<=p12)
states: 92,160 (4)
.abstracting: (3<=p10)
states: 46,080 (4)
.abstracting: (3<=p7)
states: 46,080 (4)
abstracting: (1<=p7)
states: 138,240 (5)
abstracting: (2<=p0)
states: 86,016 (4)
abstracting: (1<=p9)
states: 129,024 (5)
abstracting: (p1<=7)
states: 184,320 (5)
abstracting: (p0<=p5)
states: 109,440 (5)
abstracting: (p0<=p2)
states: 130,816 (5)
abstracting: (6<=p2)
states: 0
abstracting: (p3<=1)
states: 61,440 (4)
abstracting: (2<=p12)
states: 92,160 (4)
.abstracting: (3<=p10)
states: 46,080 (4)
.abstracting: (3<=p7)
states: 46,080 (4)
abstracting: (1<=p7)
states: 138,240 (5)
abstracting: (2<=p0)
states: 86,016 (4)
abstracting: (1<=p9)
states: 129,024 (5)
abstracting: (p1<=7)
states: 184,320 (5)
abstracting: (p0<=p5)
states: 109,440 (5)
abstracting: (p0<=p2)
states: 130,816 (5)
abstracting: (6<=p2)
states: 0
abstracting: (2<=p12)
states: 92,160 (4)
.abstracting: (3<=p10)
states: 46,080 (4)
.abstracting: (3<=p7)
states: 46,080 (4)
abstracting: (1<=p7)
states: 138,240 (5)
abstracting: (2<=p0)
states: 86,016 (4)
abstracting: (1<=p9)
states: 129,024 (5)
abstracting: (p1<=7)
states: 184,320 (5)
abstracting: (p0<=p5)
states: 109,440 (5)
abstracting: (p0<=p2)
states: 130,816 (5)
abstracting: (6<=p2)
states: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-002003-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

totally nodes used: 17665 (1.8e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 51280 39661 90941
used/not used/entry size/cache size: 52625 67056239 16 1024MB
basic ops cache: hits/miss/sum: 26396 26176 52572
used/not used/entry size/cache size: 47345 16729871 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: 3137 2655 5792
used/not used/entry size/cache size: 2655 8385953 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 67092756
1 15616
2 253
3 131
4 26
5 9
6 12
7 7
8 16
9 3
>= 10 35

Total processing time: 0m 4.223sec


BK_STOP 1679169855696

--------------------
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:581 (52), effective:246 (22)

initing FirstDep: 0m 0.000sec


iterations count:169 (15), effective:63 (5)

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

iterations count:165 (15), effective:67 (6)

iterations count:88 (8), effective:35 (3)

iterations count:87 (7), effective:33 (3)

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

iterations count:75 (6), effective:30 (2)

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

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

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

iterations count:456 (41), effective:190 (17)

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

iterations count:53 (4), effective:21 (1)

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

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

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

iterations count:103 (9), effective:43 (3)

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

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

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

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

iterations count:95 (8), effective:36 (3)

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

iterations count:17 (1), effective:3 (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="RefineWMG-PT-002003"
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 RefineWMG-PT-002003, 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-167889203400537"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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