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.r266-smll-167863541000466.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 PermAdmissibility-COL-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863541000466
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.8K Feb 26 01:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 01:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 01:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 01:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 01:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 01:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 01:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 54K 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 PermAdmissibility-COL-02-CTLFireability-00
FORMULA_NAME PermAdmissibility-COL-02-CTLFireability-01
FORMULA_NAME PermAdmissibility-COL-02-CTLFireability-02
FORMULA_NAME PermAdmissibility-COL-02-CTLFireability-03
FORMULA_NAME PermAdmissibility-COL-02-CTLFireability-04
FORMULA_NAME PermAdmissibility-COL-02-CTLFireability-05
FORMULA_NAME PermAdmissibility-COL-02-CTLFireability-06
FORMULA_NAME PermAdmissibility-COL-02-CTLFireability-07
FORMULA_NAME PermAdmissibility-COL-02-CTLFireability-08
FORMULA_NAME PermAdmissibility-COL-02-CTLFireability-09
FORMULA_NAME PermAdmissibility-COL-02-CTLFireability-10
FORMULA_NAME PermAdmissibility-COL-02-CTLFireability-11
FORMULA_NAME PermAdmissibility-COL-02-CTLFireability-12
FORMULA_NAME PermAdmissibility-COL-02-CTLFireability-13
FORMULA_NAME PermAdmissibility-COL-02-CTLFireability-14
FORMULA_NAME PermAdmissibility-COL-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679076257679

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 18:04:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 18:04:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 18:04:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-17 18:04:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 18:04:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1086 ms
[2023-03-17 18:04:22] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
FORMULA PermAdmissibility-COL-02-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 18:04:22] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 8 ms.
[2023-03-17 18:04:22] [INFO ] Skeletonized 15 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PermAdmissibility-COL-02-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 4 formulas.
FORMULA PermAdmissibility-COL-02-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 11 properties that can be checked using skeleton over-approximation.
Initial state reduction rules removed 2 formulas.
FORMULA PermAdmissibility-COL-02-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 43 steps, including 0 resets, run visited all 17 properties in 25 ms. (steps per millisecond=1 )
[2023-03-17 18:04:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-17 18:04:23] [INFO ] Flatten gal took : 35 ms
FORMULA PermAdmissibility-COL-02-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 18:04:23] [INFO ] Flatten gal took : 11 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2023-03-17 18:04:23] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 15 ms.
[2023-03-17 18:04:23] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Support contains 32 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 11 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 32 cols
[2023-03-17 18:04:23] [INFO ] Computed 16 place invariants in 13 ms
[2023-03-17 18:04:23] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-17 18:04:23] [INFO ] Invariant cache hit.
[2023-03-17 18:04:23] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-03-17 18:04:23] [INFO ] Invariant cache hit.
[2023-03-17 18:04:23] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/40 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 562 ms. Remains : 32/40 places, 16/16 transitions.
Support contains 32 out of 32 places after structural reductions.
[2023-03-17 18:04:23] [INFO ] Flatten gal took : 9 ms
[2023-03-17 18:04:23] [INFO ] Flatten gal took : 10 ms
[2023-03-17 18:04:23] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 43 steps, including 0 resets, run visited all 20 properties in 28 ms. (steps per millisecond=1 )
[2023-03-17 18:04:23] [INFO ] Flatten gal took : 7 ms
[2023-03-17 18:04:23] [INFO ] Flatten gal took : 8 ms
[2023-03-17 18:04:23] [INFO ] Input system was already deterministic with 16 transitions.
Computed a total of 32 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 32/32 places, 16/16 transitions.
[2023-03-17 18:04:23] [INFO ] Flatten gal took : 6 ms
[2023-03-17 18:04:23] [INFO ] Flatten gal took : 7 ms
[2023-03-17 18:04:23] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 2 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/32 places, 16/16 transitions.
[2023-03-17 18:04:23] [INFO ] Flatten gal took : 5 ms
[2023-03-17 18:04:23] [INFO ] Flatten gal took : 7 ms
[2023-03-17 18:04:23] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 2 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 31/32 places, 16/16 transitions.
[2023-03-17 18:04:23] [INFO ] Flatten gal took : 6 ms
[2023-03-17 18:04:23] [INFO ] Flatten gal took : 6 ms
[2023-03-17 18:04:23] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 24 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 9 ms. Remains 22 /32 variables (removed 10) and now considering 12/16 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 22/32 places, 12/16 transitions.
[2023-03-17 18:04:23] [INFO ] Flatten gal took : 3 ms
[2023-03-17 18:04:23] [INFO ] Flatten gal took : 4 ms
[2023-03-17 18:04:24] [INFO ] Input system was already deterministic with 12 transitions.
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=10 )
FORMULA PermAdmissibility-COL-02-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 20 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 3 ms. Remains 19 /32 variables (removed 13) and now considering 10/16 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 19/32 places, 10/16 transitions.
[2023-03-17 18:04:24] [INFO ] Flatten gal took : 3 ms
[2023-03-17 18:04:24] [INFO ] Flatten gal took : 4 ms
[2023-03-17 18:04:24] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 3 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 31/32 places, 16/16 transitions.
[2023-03-17 18:04:24] [INFO ] Flatten gal took : 5 ms
[2023-03-17 18:04:24] [INFO ] Flatten gal took : 6 ms
[2023-03-17 18:04:24] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 2 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/32 places, 16/16 transitions.
[2023-03-17 18:04:24] [INFO ] Flatten gal took : 5 ms
[2023-03-17 18:04:24] [INFO ] Flatten gal took : 5 ms
[2023-03-17 18:04:24] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 4 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 30/32 places, 16/16 transitions.
[2023-03-17 18:04:24] [INFO ] Flatten gal took : 5 ms
[2023-03-17 18:04:24] [INFO ] Flatten gal took : 5 ms
[2023-03-17 18:04:24] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
FORMULA PermAdmissibility-COL-02-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/32 places, 16/16 transitions.
[2023-03-17 18:04:24] [INFO ] Flatten gal took : 4 ms
[2023-03-17 18:04:24] [INFO ] Flatten gal took : 5 ms
[2023-03-17 18:04:24] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 28 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 4 ms. Remains 26 /32 variables (removed 6) and now considering 14/16 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 26/32 places, 14/16 transitions.
[2023-03-17 18:04:24] [INFO ] Flatten gal took : 4 ms
[2023-03-17 18:04:24] [INFO ] Flatten gal took : 5 ms
[2023-03-17 18:04:24] [INFO ] Input system was already deterministic with 14 transitions.
Finished random walk after 37 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=12 )
FORMULA PermAdmissibility-COL-02-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-17 18:04:24] [INFO ] Flatten gal took : 6 ms
[2023-03-17 18:04:24] [INFO ] Flatten gal took : 6 ms
[2023-03-17 18:04:24] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-17 18:04:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 16 transitions and 75 arcs took 1 ms.
Total runtime 2769 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 32 NrTr: 16 NrArc: 75)

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

net check time: 0m 0.000sec

init dd package: 0m 3.624sec


RS generation: 0m 0.003sec


-> reachability set: #nodes 490 (4.9e+02) #states 153



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

checking: AG [AX [EF [EX [[p16<=0 | [p17<=0 | p20<=0]]]]]]
normalized: ~ [E [true U EX [~ [E [true U EX [[[p17<=0 | p20<=0] | p16<=0]]]]]]]

abstracting: (p16<=0)
states: 91
abstracting: (p20<=0)
states: 91
abstracting: (p17<=0)
states: 136
..-> the formula is FALSE

FORMULA PermAdmissibility-COL-02-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EX [AF [EG [[p1<=0 | [p3<=0 | p5<=0]]]]]
normalized: EX [~ [EG [~ [EG [[[p3<=0 | p5<=0] | p1<=0]]]]]]

abstracting: (p1<=0)
states: 136
abstracting: (p5<=0)
states: 105
abstracting: (p3<=0)
states: 78
..........................
EG iterations: 26
...............................
EG iterations: 31
.-> the formula is TRUE

FORMULA PermAdmissibility-COL-02-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: AX [AG [[EF [[1<=p0 & [1<=p6 & 1<=p7]]] & [[p22<=0 | p27<=0] | [p30<=0 | [AG [[p10<=0 | [p13<=0 | p14<=0]]] & [p16<=0 | [p17<=0 | p20<=0]]]]]]]]
normalized: ~ [EX [E [true U ~ [[[[[[[p17<=0 | p20<=0] | p16<=0] & ~ [E [true U ~ [[[p13<=0 | p14<=0] | p10<=0]]]]] | p30<=0] | [p22<=0 | p27<=0]] & E [true U [[1<=p6 & 1<=p7] & 1<=p0]]]]]]]

abstracting: (1<=p0)
states: 17
abstracting: (1<=p7)
states: 62
abstracting: (1<=p6)
states: 87
abstracting: (p27<=0)
states: 66
abstracting: (p22<=0)
states: 91
abstracting: (p30<=0)
states: 136
abstracting: (p10<=0)
states: 136
abstracting: (p14<=0)
states: 66
abstracting: (p13<=0)
states: 91
abstracting: (p16<=0)
states: 91
abstracting: (p20<=0)
states: 91
abstracting: (p17<=0)
states: 136
.-> the formula is FALSE

FORMULA PermAdmissibility-COL-02-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: E [[1<=p10 & [1<=p13 & 1<=p14]] U [~ [EG [EF [[1<=p25 & [1<=p26 & 1<=p28]]]]] & AG [~ [A [[1<=p16 & [1<=p18 & 1<=p20]] U [1<=p26 & [1<=p28 & 1<=p31]]]]]]]
normalized: E [[[1<=p13 & 1<=p14] & 1<=p10] U [~ [EG [E [true U [[1<=p26 & 1<=p28] & 1<=p25]]]] & ~ [E [true U [~ [EG [~ [[[1<=p28 & 1<=p31] & 1<=p26]]]] & ~ [E [~ [[[1<=p28 & 1<=p31] & 1<=p26]] U [~ [[[1<=p18 & 1<=p20] & 1<=p16]] & ~ [[[1<=p28 & 1<=p31] & 1<=p26]]]]]]]]]]

abstracting: (1<=p26)
states: 75
abstracting: (1<=p31)
states: 17
abstracting: (1<=p28)
states: 48
abstracting: (1<=p16)
states: 62
abstracting: (1<=p20)
states: 62
abstracting: (1<=p18)
states: 17
abstracting: (1<=p26)
states: 75
abstracting: (1<=p31)
states: 17
abstracting: (1<=p28)
states: 48
abstracting: (1<=p26)
states: 75
abstracting: (1<=p31)
states: 17
abstracting: (1<=p28)
states: 48
..................
EG iterations: 18
abstracting: (1<=p25)
states: 17
abstracting: (1<=p28)
states: 48
abstracting: (1<=p26)
states: 75
..........................
EG iterations: 26
abstracting: (1<=p10)
states: 17
abstracting: (1<=p14)
states: 87
abstracting: (1<=p13)
states: 62
-> the formula is FALSE

FORMULA PermAdmissibility-COL-02-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EX [A [~ [[AF [[[1<=p21 & 1<=p24] & 1<=p19]] | [[1<=p25 & [1<=p26 & 1<=p28]] | EX [[1<=p19 & [1<=p21 & 1<=p23]]]]]] U E [~ [[AX [[1<=p26 & [1<=p28 & 1<=p31]]] | EF [[1<=p1 & [1<=p3 & 1<=p5]]]]] U [1<=p16 & [1<=p18 & 1<=p20]]]]]
normalized: EX [[~ [EG [~ [E [~ [[E [true U [[1<=p3 & 1<=p5] & 1<=p1]] | ~ [EX [~ [[[1<=p28 & 1<=p31] & 1<=p26]]]]]] U [[1<=p18 & 1<=p20] & 1<=p16]]]]] & ~ [E [~ [E [~ [[E [true U [[1<=p3 & 1<=p5] & 1<=p1]] | ~ [EX [~ [[[1<=p28 & 1<=p31] & 1<=p26]]]]]] U [[1<=p18 & 1<=p20] & 1<=p16]]] U [[[EX [[1<=p19 & [1<=p21 & 1<=p23]]] | [1<=p25 & [1<=p26 & 1<=p28]]] | ~ [EG [~ [[[1<=p21 & 1<=p24] & 1<=p19]]]]] & ~ [E [~ [[E [true U [[1<=p3 & 1<=p5] & 1<=p1]] | ~ [EX [~ [[[1<=p28 & 1<=p31] & 1<=p26]]]]]] U [[1<=p18 & 1<=p20] & 1<=p16]]]]]]]]

abstracting: (1<=p16)
states: 62
abstracting: (1<=p20)
states: 62
abstracting: (1<=p18)
states: 17
abstracting: (1<=p26)
states: 75
abstracting: (1<=p31)
states: 17
abstracting: (1<=p28)
states: 48
.abstracting: (1<=p1)
states: 17
abstracting: (1<=p5)
states: 48
abstracting: (1<=p3)
states: 75
abstracting: (1<=p19)
states: 33
abstracting: (1<=p24)
states: 17
abstracting: (1<=p21)
states: 33
.
EG iterations: 1
abstracting: (1<=p28)
states: 48
abstracting: (1<=p26)
states: 75
abstracting: (1<=p25)
states: 17
abstracting: (1<=p23)
states: 17
abstracting: (1<=p21)
states: 33
abstracting: (1<=p19)
states: 33
.abstracting: (1<=p16)
states: 62
abstracting: (1<=p20)
states: 62
abstracting: (1<=p18)
states: 17
abstracting: (1<=p26)
states: 75
abstracting: (1<=p31)
states: 17
abstracting: (1<=p28)
states: 48
.abstracting: (1<=p1)
states: 17
abstracting: (1<=p5)
states: 48
abstracting: (1<=p3)
states: 75
abstracting: (1<=p16)
states: 62
abstracting: (1<=p20)
states: 62
abstracting: (1<=p18)
states: 17
abstracting: (1<=p26)
states: 75
abstracting: (1<=p31)
states: 17
abstracting: (1<=p28)
states: 48
.abstracting: (1<=p1)
states: 17
abstracting: (1<=p5)
states: 48
abstracting: (1<=p3)
states: 75
................
EG iterations: 16
.-> the formula is FALSE

FORMULA PermAdmissibility-COL-02-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: E [AX [EG [[[E [[1<=p9 & [1<=p11 & 1<=p15]] U [1<=p11 & [1<=p12 & 1<=p15]]] & 1<=p10] & [1<=p13 & 1<=p14]]]] U ~ [A [[EF [[[1<=p9 & [1<=p11 & 1<=p15]] | [1<=p16 & [1<=p17 & 1<=p20]]]] & ~ [[[AF [[1<=p25 & [1<=p26 & 1<=p28]]] & 1<=p22] & [1<=p27 & 1<=p30]]]] U EF [[1<=p22 & [1<=p27 & 1<=p29]]]]]]
normalized: E [~ [EX [~ [EG [[[1<=p13 & 1<=p14] & [E [[[1<=p11 & 1<=p15] & 1<=p9] U [[1<=p12 & 1<=p15] & 1<=p11]] & 1<=p10]]]]]] U ~ [[~ [EG [~ [E [true U [[1<=p27 & 1<=p29] & 1<=p22]]]]] & ~ [E [~ [E [true U [[1<=p27 & 1<=p29] & 1<=p22]]] U [~ [[~ [[[1<=p27 & 1<=p30] & [~ [EG [~ [[[1<=p26 & 1<=p28] & 1<=p25]]]] & 1<=p22]]] & E [true U [[[1<=p17 & 1<=p20] & 1<=p16] | [[1<=p11 & 1<=p15] & 1<=p9]]]]] & ~ [E [true U [[1<=p27 & 1<=p29] & 1<=p22]]]]]]]]]

abstracting: (1<=p22)
states: 62
abstracting: (1<=p29)
states: 17
abstracting: (1<=p27)
states: 87
abstracting: (1<=p9)
states: 17
abstracting: (1<=p15)
states: 48
abstracting: (1<=p11)
states: 75
abstracting: (1<=p16)
states: 62
abstracting: (1<=p20)
states: 62
abstracting: (1<=p17)
states: 17
abstracting: (1<=p22)
states: 62
abstracting: (1<=p25)
states: 17
abstracting: (1<=p28)
states: 48
abstracting: (1<=p26)
states: 75
................
EG iterations: 16
abstracting: (1<=p30)
states: 17
abstracting: (1<=p27)
states: 87
abstracting: (1<=p22)
states: 62
abstracting: (1<=p29)
states: 17
abstracting: (1<=p27)
states: 87
abstracting: (1<=p22)
states: 62
abstracting: (1<=p29)
states: 17
abstracting: (1<=p27)
states: 87
.
EG iterations: 1
abstracting: (1<=p10)
states: 17
abstracting: (1<=p11)
states: 75
abstracting: (1<=p15)
states: 48
abstracting: (1<=p12)
states: 17
abstracting: (1<=p9)
states: 17
abstracting: (1<=p15)
states: 48
abstracting: (1<=p11)
states: 75
abstracting: (1<=p14)
states: 87
abstracting: (1<=p13)
states: 62
..
EG iterations: 2
.-> the formula is FALSE

FORMULA PermAdmissibility-COL-02-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EG [A [A [[~ [[1<=p0 & [1<=p6 & 1<=p7]]] & [E [[1<=p2 & [1<=p6 & 1<=p7]] U [1<=p25 & [1<=p26 & 1<=p28]]] | [[1<=p19 & [1<=p21 & 1<=p24]] | [1<=p2 & [1<=p6 & 1<=p7]]]]] U ~ [[[1<=p22 & [1<=p27 & 1<=p29]] & [[1<=p22 & 1<=p27] & [1<=p30 & [[1<=p10 & [1<=p13 & 1<=p14]] | [1<=p22 & [1<=p27 & 1<=p29]]]]]]]] U EG [~ [[1<=p0 & [1<=p6 & 1<=p7]]]]]]
normalized: EG [[~ [EG [~ [EG [~ [[1<=p0 & [1<=p6 & 1<=p7]]]]]]] & ~ [E [~ [EG [~ [[1<=p0 & [1<=p6 & 1<=p7]]]]] U [~ [[~ [EG [[[[1<=p30 & [[1<=p22 & [1<=p27 & 1<=p29]] | [1<=p10 & [1<=p13 & 1<=p14]]]] & [1<=p22 & 1<=p27]] & [1<=p22 & [1<=p27 & 1<=p29]]]]] & ~ [E [[[[1<=p30 & [[1<=p22 & [1<=p27 & 1<=p29]] | [1<=p10 & [1<=p13 & 1<=p14]]]] & [1<=p22 & 1<=p27]] & [1<=p22 & [1<=p27 & 1<=p29]]] U [~ [[[[[1<=p2 & [1<=p6 & 1<=p7]] | [1<=p19 & [1<=p21 & 1<=p24]]] | E [[1<=p2 & [1<=p6 & 1<=p7]] U [1<=p25 & [1<=p26 & 1<=p28]]]] & ~ [[1<=p0 & [1<=p6 & 1<=p7]]]]] & [[[1<=p30 & [[1<=p22 & [1<=p27 & 1<=p29]] | [1<=p10 & [1<=p13 & 1<=p14]]]] & [1<=p22 & 1<=p27]] & [1<=p22 & [1<=p27 & 1<=p29]]]]]]]] & ~ [EG [~ [[1<=p0 & [1<=p6 & 1<=p7]]]]]]]]]]

abstracting: (1<=p7)
states: 62
abstracting: (1<=p6)
states: 87
abstracting: (1<=p0)
states: 17
..............................
EG iterations: 30
abstracting: (1<=p29)
states: 17
abstracting: (1<=p27)
states: 87
abstracting: (1<=p22)
states: 62
abstracting: (1<=p27)
states: 87
abstracting: (1<=p22)
states: 62
abstracting: (1<=p14)
states: 87
abstracting: (1<=p13)
states: 62
abstracting: (1<=p10)
states: 17
abstracting: (1<=p29)
states: 17
abstracting: (1<=p27)
states: 87
abstracting: (1<=p22)
states: 62
abstracting: (1<=p30)
states: 17
abstracting: (1<=p7)
states: 62
abstracting: (1<=p6)
states: 87
abstracting: (1<=p0)
states: 17
abstracting: (1<=p28)
states: 48
abstracting: (1<=p26)
states: 75
abstracting: (1<=p25)
states: 17
abstracting: (1<=p7)
states: 62
abstracting: (1<=p6)
states: 87
abstracting: (1<=p2)
states: 17
abstracting: (1<=p24)
states: 17
abstracting: (1<=p21)
states: 33
abstracting: (1<=p19)
states: 33
abstracting: (1<=p7)
states: 62
abstracting: (1<=p6)
states: 87
abstracting: (1<=p2)
states: 17
abstracting: (1<=p29)
states: 17
abstracting: (1<=p27)
states: 87
abstracting: (1<=p22)
states: 62
abstracting: (1<=p27)
states: 87
abstracting: (1<=p22)
states: 62
abstracting: (1<=p14)
states: 87
abstracting: (1<=p13)
states: 62
abstracting: (1<=p10)
states: 17
abstracting: (1<=p29)
states: 17
abstracting: (1<=p27)
states: 87
abstracting: (1<=p22)
states: 62
abstracting: (1<=p30)
states: 17
abstracting: (1<=p29)
states: 17
abstracting: (1<=p27)
states: 87
abstracting: (1<=p22)
states: 62
abstracting: (1<=p27)
states: 87
abstracting: (1<=p22)
states: 62
abstracting: (1<=p14)
states: 87
abstracting: (1<=p13)
states: 62
abstracting: (1<=p10)
states: 17
abstracting: (1<=p29)
states: 17
abstracting: (1<=p27)
states: 87
abstracting: (1<=p22)
states: 62
abstracting: (1<=p30)
states: 17
..
EG iterations: 2
abstracting: (1<=p7)
states: 62
abstracting: (1<=p6)
states: 87
abstracting: (1<=p0)
states: 17
..............................
EG iterations: 30
abstracting: (1<=p7)
states: 62
abstracting: (1<=p6)
states: 87
abstracting: (1<=p0)
states: 17
..............................
EG iterations: 30
.................................
EG iterations: 33
.
EG iterations: 1
-> the formula is FALSE

FORMULA PermAdmissibility-COL-02-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

totally nodes used: 21993 (2.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 29560 73533 103093
used/not used/entry size/cache size: 96662 67012202 16 1024MB
basic ops cache: hits/miss/sum: 8297 34773 43070
used/not used/entry size/cache size: 60116 16717100 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: 828 2852 3680
used/not used/entry size/cache size: 2852 8385756 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 67089030
1 18619
2 860
3 202
4 57
5 28
6 18
7 8
8 8
9 4
>= 10 30

Total processing time: 0m 5.267sec


BK_STOP 1679076270595

--------------------
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 CTLFireability -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:168 (10), effective:32 (2)

initing FirstDep: 0m 0.000sec


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

iterations count:164 (10), effective:31 (1)

iterations count:88 (5), effective:15 (0)

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

iterations count:186 (11), effective:35 (2)

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

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

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

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

iterations count:75 (4), effective:13 (0)

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

iterations count:75 (4), effective:13 (0)

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

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

iterations count:75 (4), effective:13 (0)

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

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

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

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

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

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

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

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

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

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

iterations count:109 (6), effective:21 (1)

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="PermAdmissibility-COL-02"
export BK_EXAMINATION="CTLFireability"
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 PermAdmissibility-COL-02, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r266-smll-167863541000466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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