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.r298-tall-167873952200802.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 QuasiCertifProtocol-COL-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952200802
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.4K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 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 34K 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 QuasiCertifProtocol-COL-02-CTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679677612416

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=QuasiCertifProtocol-COL-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 17:06:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 17:06:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 17:06:54] [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-24 17:06:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 17:06:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 438 ms
[2023-03-24 17:06:54] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
[2023-03-24 17:06:54] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2023-03-24 17:06:54] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
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 8 formulas.
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 10 properties that can be checked using skeleton over-approximation.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 1338 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 26) seen :18
Incomplete Best-First random walk after 10000 steps, including 400 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 718 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 453 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 442 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-24 17:06:55] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-24 17:06:55] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-24 17:06:55] [INFO ] After 30ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1
[2023-03-24 17:06:55] [INFO ] After 37ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-24 17:06:55] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 17:06:55] [INFO ] Flatten gal took : 17 ms
[2023-03-24 17:06:55] [INFO ] Flatten gal took : 4 ms
Domain [tsid(3), tsid(3)] of place n9 breaks symmetries in sort tsid
[2023-03-24 17:06:55] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions 223 arcs in 7 ms.
[2023-03-24 17:06:55] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 76 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 76 transition count 56
Applied a total of 10 rules in 10 ms. Remains 76 /86 variables (removed 10) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2023-03-24 17:06:55] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-24 17:06:55] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-24 17:06:55] [INFO ] Invariant cache hit.
[2023-03-24 17:06:55] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-24 17:06:55] [INFO ] Invariant cache hit.
[2023-03-24 17:06:55] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/86 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 76/86 places, 56/56 transitions.
Support contains 76 out of 76 places after structural reductions.
[2023-03-24 17:06:55] [INFO ] Flatten gal took : 9 ms
[2023-03-24 17:06:55] [INFO ] Flatten gal took : 10 ms
[2023-03-24 17:06:55] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 10000 steps, including 1642 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 33) seen :12
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :15
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-24 17:06:56] [INFO ] Invariant cache hit.
[2023-03-24 17:06:56] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-24 17:06:56] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-24 17:06:56] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 19 ms returned sat
[2023-03-24 17:06:56] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2023-03-24 17:06:56] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-24 17:06:56] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
[2023-03-24 17:06:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 8 ms
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 6 ms
[2023-03-24 17:06:56] [INFO ] Input system was already deterministic with 56 transitions.
Computed a total of 76 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 56
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 1 formulas.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 55
Applied a total of 2 rules in 12 ms. Remains 75 /76 variables (removed 1) and now considering 55/56 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 75/76 places, 55/56 transitions.
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 4 ms
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 4 ms
[2023-03-24 17:06:56] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 76/76 places, 56/56 transitions.
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 4 ms
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 5 ms
[2023-03-24 17:06:56] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 76/76 places, 56/56 transitions.
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 3 ms
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 3 ms
[2023-03-24 17:06:56] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 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
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 54
Applied a total of 2 rules in 7 ms. Remains 72 /76 variables (removed 4) and now considering 54/56 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 72/76 places, 54/56 transitions.
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 4 ms
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 4 ms
[2023-03-24 17:06:56] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 0 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 76/76 places, 56/56 transitions.
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 3 ms
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 3 ms
[2023-03-24 17:06:56] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 53
Applied a total of 2 rules in 6 ms. Remains 71 /76 variables (removed 5) and now considering 53/56 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 71/76 places, 53/56 transitions.
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 3 ms
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 3 ms
[2023-03-24 17:06:56] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 54
Applied a total of 2 rules in 12 ms. Remains 72 /76 variables (removed 4) and now considering 54/56 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 72/76 places, 54/56 transitions.
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 3 ms
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 3 ms
[2023-03-24 17:06:56] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 13 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.0 ms
Discarding 63 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 12 transition count 10
Applied a total of 19 rules in 2 ms. Remains 12 /76 variables (removed 64) and now considering 10/56 (removed 46) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 12/76 places, 10/56 transitions.
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 1 ms
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 1 ms
[2023-03-24 17:06:56] [INFO ] Input system was already deterministic with 10 transitions.
Finished random walk after 77 steps, including 14 resets, run visited all 1 properties in 2 ms. (steps per millisecond=38 )
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 76/76 places, 56/56 transitions.
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 4 ms
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 4 ms
[2023-03-24 17:06:56] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 76/76 places, 56/56 transitions.
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 3 ms
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 4 ms
[2023-03-24 17:06:56] [INFO ] Input system was already deterministic with 56 transitions.
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 4 ms
[2023-03-24 17:06:56] [INFO ] Flatten gal took : 5 ms
[2023-03-24 17:06:56] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-24 17:06:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 76 places, 56 transitions and 190 arcs took 0 ms.
Total runtime 2719 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: 76 NrTr: 56 NrArc: 190)

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

net check time: 0m 0.000sec

init dd package: 0m 2.794sec


RS generation: 0m 0.016sec


-> reachability set: #nodes 1305 (1.3e+03) #states 1,029 (3)



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

checking: AX [EF [[[1<=p0 & 1<=p59] | [[1<=p0 & 1<=p60] | [1<=p0 & 1<=p58]]]]]
normalized: ~ [EX [~ [E [true U [[1<=p0 & 1<=p59] | [[1<=p0 & 1<=p60] | [1<=p0 & 1<=p58]]]]]]]

abstracting: (1<=p58)
states: 84
abstracting: (1<=p0)
states: 219
abstracting: (1<=p60)
states: 84
abstracting: (1<=p0)
states: 219
abstracting: (1<=p59)
states: 84
abstracting: (1<=p0)
states: 219
.-> the formula is FALSE

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

MC time: 0m 0.022sec

checking: EG [[[p32<=0 | p59<=0] & [[p33<=0 | p60<=0] & [p31<=0 | p58<=0]]]]
normalized: EG [[[[p31<=0 | p58<=0] & [p33<=0 | p60<=0]] & [p32<=0 | p59<=0]]]

abstracting: (p59<=0)
states: 945
abstracting: (p32<=0)
states: 957
abstracting: (p60<=0)
states: 945
abstracting: (p33<=0)
states: 957
abstracting: (p58<=0)
states: 945
abstracting: (p31<=0)
states: 957
.
EG iterations: 1
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EG [[[[[p30<=0 | p70<=0] | [p29<=0 | p28<=0]] & [p39<=0 | p57<=0]] & [[p38<=0 | p56<=0] & [p37<=0 | p55<=0]]]]
normalized: EG [[[[p37<=0 | p55<=0] & [p38<=0 | p56<=0]] & [[p39<=0 | p57<=0] & [[p29<=0 | p28<=0] | [p30<=0 | p70<=0]]]]]

abstracting: (p70<=0)
states: 710
abstracting: (p30<=0)
states: 463
abstracting: (p28<=0)
states: 463
abstracting: (p29<=0)
states: 463
abstracting: (p57<=0)
states: 975
abstracting: (p39<=0)
states: 997
abstracting: (p56<=0)
states: 975
abstracting: (p38<=0)
states: 997
abstracting: (p55<=0)
states: 975
abstracting: (p37<=0)
states: 997
.
EG iterations: 1
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: E [1<=0 U ~ [EG [[A [AG [[1<=p68 | [1<=p67 | 1<=p69]]] U [[[1<=p32 & 1<=p59] | [1<=p33 & 1<=p60]] | [[1<=p31 & 1<=p58] | 1<=p70]]] | [EX [1<=p74] | ~ [[[1<=p0 & 1<=p65] | [[1<=p0 & 1<=p66] | [1<=p0 & 1<=p64]]]]]]]]]
normalized: E [1<=0 U ~ [EG [[[~ [[[[1<=p0 & 1<=p64] | [1<=p0 & 1<=p66]] | [1<=p0 & 1<=p65]]] | EX [1<=p74]] | [~ [EG [~ [[[[1<=p31 & 1<=p58] | 1<=p70] | [[1<=p33 & 1<=p60] | [1<=p32 & 1<=p59]]]]]] & ~ [E [~ [[[[1<=p31 & 1<=p58] | 1<=p70] | [[1<=p33 & 1<=p60] | [1<=p32 & 1<=p59]]]] U [E [true U ~ [[[1<=p67 | 1<=p69] | 1<=p68]]] & ~ [[[[1<=p31 & 1<=p58] | 1<=p70] | [[1<=p33 & 1<=p60] | [1<=p32 & 1<=p59]]]]]]]]]]]]

abstracting: (1<=p59)
states: 84
abstracting: (1<=p32)
states: 72
abstracting: (1<=p60)
states: 84
abstracting: (1<=p33)
states: 72
abstracting: (1<=p70)
states: 319
abstracting: (1<=p58)
states: 84
abstracting: (1<=p31)
states: 72
abstracting: (1<=p68)
states: 144
abstracting: (1<=p69)
states: 144
abstracting: (1<=p67)
states: 144
abstracting: (1<=p59)
states: 84
abstracting: (1<=p32)
states: 72
abstracting: (1<=p60)
states: 84
abstracting: (1<=p33)
states: 72
abstracting: (1<=p70)
states: 319
abstracting: (1<=p58)
states: 84
abstracting: (1<=p31)
states: 72
abstracting: (1<=p59)
states: 84
abstracting: (1<=p32)
states: 72
abstracting: (1<=p60)
states: 84
abstracting: (1<=p33)
states: 72
abstracting: (1<=p70)
states: 319
abstracting: (1<=p58)
states: 84
abstracting: (1<=p31)
states: 72
.
EG iterations: 1
abstracting: (1<=p74)
states: 32
.abstracting: (1<=p65)
states: 291
abstracting: (1<=p0)
states: 219
abstracting: (1<=p66)
states: 291
abstracting: (1<=p0)
states: 219
abstracting: (1<=p64)
states: 291
abstracting: (1<=p0)
states: 219
.
EG iterations: 1
abstracting: (1<=0)
states: 0
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.073sec

checking: AF [AG [[[1<=p40 & 1<=p41] & [1<=p42 & [1<=p74 & [E [AG [[[1<=p32 & 1<=p59] | [[1<=p33 & 1<=p60] | [1<=p31 & 1<=p58]]]] U ~ [[[[1<=p10 & 1<=p11] & [1<=p12 & 1<=p64]] | [[[1<=p13 & 1<=p14] & [1<=p15 & 1<=p65]] | [[1<=p16 & 1<=p17] & [1<=p18 & 1<=p66]]]]]] | [[p0<=0 | p47<=0] & [[p0<=0 | p48<=0] & [p0<=0 | p46<=0]]]]]]]]]
normalized: ~ [EG [E [true U ~ [[[1<=p42 & [1<=p74 & [[[[p0<=0 | p46<=0] & [p0<=0 | p48<=0]] & [p0<=0 | p47<=0]] | E [~ [E [true U ~ [[[[1<=p31 & 1<=p58] | [1<=p33 & 1<=p60]] | [1<=p32 & 1<=p59]]]]] U ~ [[[[[1<=p18 & 1<=p66] & [1<=p16 & 1<=p17]] | [[1<=p15 & 1<=p65] & [1<=p13 & 1<=p14]]] | [[1<=p12 & 1<=p64] & [1<=p10 & 1<=p11]]]]]]]] & [1<=p40 & 1<=p41]]]]]]

abstracting: (1<=p41)
states: 32
abstracting: (1<=p40)
states: 32
abstracting: (1<=p11)
states: 222
abstracting: (1<=p10)
states: 222
abstracting: (1<=p64)
states: 291
abstracting: (1<=p12)
states: 222
abstracting: (1<=p14)
states: 222
abstracting: (1<=p13)
states: 222
abstracting: (1<=p65)
states: 291
abstracting: (1<=p15)
states: 222
abstracting: (1<=p17)
states: 222
abstracting: (1<=p16)
states: 222
abstracting: (1<=p66)
states: 291
abstracting: (1<=p18)
states: 222
abstracting: (1<=p59)
states: 84
abstracting: (1<=p32)
states: 72
abstracting: (1<=p60)
states: 84
abstracting: (1<=p33)
states: 72
abstracting: (1<=p58)
states: 84
abstracting: (1<=p31)
states: 72
abstracting: (p47<=0)
states: 567
abstracting: (p0<=0)
states: 810
abstracting: (p48<=0)
states: 567
abstracting: (p0<=0)
states: 810
abstracting: (p46<=0)
states: 567
abstracting: (p0<=0)
states: 810
abstracting: (1<=p74)
states: 32
abstracting: (1<=p42)
states: 32

EG iterations: 0
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EG [EF [[[EF [[[1<=p28 & 1<=p29] & [1<=p30 & 1<=p70]]] | 1<=p71] | [A [~ [[[1<=p0 & 1<=p67] | [[1<=p0 & 1<=p68] | [1<=p0 & 1<=p69]]]] U [[1<=p73 | [1<=p0 & 1<=p65]] | [[1<=p0 & 1<=p66] | [1<=p0 & 1<=p64]]]] | AX [[[[p20<=0 | p23<=0] | [p26<=0 | p50<=0]] & [[[p19<=0 | p22<=0] | [p25<=0 | p49<=0]] & [[p21<=0 | p24<=0] | [p27<=0 | p51<=0]]]]]]]]]
normalized: EG [E [true U [[~ [EX [~ [[[[[p27<=0 | p51<=0] | [p21<=0 | p24<=0]] & [[p25<=0 | p49<=0] | [p19<=0 | p22<=0]]] & [[p26<=0 | p50<=0] | [p20<=0 | p23<=0]]]]]] | [~ [EG [~ [[[[1<=p0 & 1<=p64] | [1<=p0 & 1<=p66]] | [1<=p73 | [1<=p0 & 1<=p65]]]]]] & ~ [E [~ [[[[1<=p0 & 1<=p64] | [1<=p0 & 1<=p66]] | [1<=p73 | [1<=p0 & 1<=p65]]]] U [[[[1<=p0 & 1<=p69] | [1<=p0 & 1<=p68]] | [1<=p0 & 1<=p67]] & ~ [[[[1<=p0 & 1<=p64] | [1<=p0 & 1<=p66]] | [1<=p73 | [1<=p0 & 1<=p65]]]]]]]]] | [1<=p71 | E [true U [[1<=p30 & 1<=p70] & [1<=p28 & 1<=p29]]]]]]]

abstracting: (1<=p29)
states: 566
abstracting: (1<=p28)
states: 566
abstracting: (1<=p70)
states: 319
abstracting: (1<=p30)
states: 566
abstracting: (1<=p71)
states: 4
abstracting: (1<=p65)
states: 291
abstracting: (1<=p0)
states: 219
abstracting: (1<=p73)
states: 4
abstracting: (1<=p66)
states: 291
abstracting: (1<=p0)
states: 219
abstracting: (1<=p64)
states: 291
abstracting: (1<=p0)
states: 219
abstracting: (1<=p67)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p68)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p69)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p65)
states: 291
abstracting: (1<=p0)
states: 219
abstracting: (1<=p73)
states: 4
abstracting: (1<=p66)
states: 291
abstracting: (1<=p0)
states: 219
abstracting: (1<=p64)
states: 291
abstracting: (1<=p0)
states: 219
abstracting: (1<=p65)
states: 291
abstracting: (1<=p0)
states: 219
abstracting: (1<=p73)
states: 4
abstracting: (1<=p66)
states: 291
abstracting: (1<=p0)
states: 219
abstracting: (1<=p64)
states: 291
abstracting: (1<=p0)
states: 219
.
EG iterations: 1
abstracting: (p23<=0)
states: 893
abstracting: (p20<=0)
states: 893
abstracting: (p50<=0)
states: 585
abstracting: (p26<=0)
states: 893
abstracting: (p22<=0)
states: 893
abstracting: (p19<=0)
states: 893
abstracting: (p49<=0)
states: 585
abstracting: (p25<=0)
states: 893
abstracting: (p24<=0)
states: 893
abstracting: (p21<=0)
states: 893
abstracting: (p51<=0)
states: 585
abstracting: (p27<=0)
states: 893
.
EG iterations: 0
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: E [[E [A [EF [[[1<=p0 & 1<=p59] | [[1<=p0 & 1<=p60] | [1<=p0 & 1<=p58]]]] U EF [[[1<=p0 & 1<=p57] | [[1<=p0 & 1<=p55] | [1<=p0 & 1<=p56]]]]] U ~ [A [[[1<=p75 | [1<=p0 & 1<=p47]] | [[1<=p0 & 1<=p48] | [1<=p0 & 1<=p46]]] U ~ [[[1<=p45 & 1<=p54] | [[1<=p43 & 1<=p52] | [1<=p44 & 1<=p53]]]]]]] & [~ [EG [A [1<=p74 U [[1<=p0 & 1<=p57] | [[1<=p0 & 1<=p55] | [1<=p0 & 1<=p56]]]]]] & 1<=p75]] U [[1<=p34 & 1<=p35] & [1<=p36 & 1<=p72]]]
normalized: E [[[1<=p75 & ~ [EG [[~ [EG [~ [[[[1<=p0 & 1<=p56] | [1<=p0 & 1<=p55]] | [1<=p0 & 1<=p57]]]]] & ~ [E [~ [[[[1<=p0 & 1<=p56] | [1<=p0 & 1<=p55]] | [1<=p0 & 1<=p57]]] U [~ [1<=p74] & ~ [[[[1<=p0 & 1<=p56] | [1<=p0 & 1<=p55]] | [1<=p0 & 1<=p57]]]]]]]]]] & E [[~ [EG [~ [E [true U [[[1<=p0 & 1<=p56] | [1<=p0 & 1<=p55]] | [1<=p0 & 1<=p57]]]]]] & ~ [E [~ [E [true U [[[1<=p0 & 1<=p56] | [1<=p0 & 1<=p55]] | [1<=p0 & 1<=p57]]]] U [~ [E [true U [[[1<=p0 & 1<=p58] | [1<=p0 & 1<=p60]] | [1<=p0 & 1<=p59]]]] & ~ [E [true U [[[1<=p0 & 1<=p56] | [1<=p0 & 1<=p55]] | [1<=p0 & 1<=p57]]]]]]]] U ~ [[~ [EG [[[[1<=p44 & 1<=p53] | [1<=p43 & 1<=p52]] | [1<=p45 & 1<=p54]]]] & ~ [E [[[[1<=p44 & 1<=p53] | [1<=p43 & 1<=p52]] | [1<=p45 & 1<=p54]] U [~ [[[[1<=p0 & 1<=p46] | [1<=p0 & 1<=p48]] | [1<=p75 | [1<=p0 & 1<=p47]]]] & [[[1<=p44 & 1<=p53] | [1<=p43 & 1<=p52]] | [1<=p45 & 1<=p54]]]]]]]]] U [[1<=p36 & 1<=p72] & [1<=p34 & 1<=p35]]]

abstracting: (1<=p35)
states: 32
abstracting: (1<=p34)
states: 32
abstracting: (1<=p72)
states: 32
abstracting: (1<=p36)
states: 32
abstracting: (1<=p54)
states: 27
abstracting: (1<=p45)
states: 32
abstracting: (1<=p52)
states: 27
abstracting: (1<=p43)
states: 32
abstracting: (1<=p53)
states: 27
abstracting: (1<=p44)
states: 32
abstracting: (1<=p47)
states: 462
abstracting: (1<=p0)
states: 219
abstracting: (1<=p75)
states: 4
abstracting: (1<=p48)
states: 462
abstracting: (1<=p0)
states: 219
abstracting: (1<=p46)
states: 462
abstracting: (1<=p0)
states: 219
abstracting: (1<=p54)
states: 27
abstracting: (1<=p45)
states: 32
abstracting: (1<=p52)
states: 27
abstracting: (1<=p43)
states: 32
abstracting: (1<=p53)
states: 27
abstracting: (1<=p44)
states: 32
abstracting: (1<=p54)
states: 27
abstracting: (1<=p45)
states: 32
abstracting: (1<=p52)
states: 27
abstracting: (1<=p43)
states: 32
abstracting: (1<=p53)
states: 27
abstracting: (1<=p44)
states: 32
......
EG iterations: 6
abstracting: (1<=p57)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p55)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p56)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p59)
states: 84
abstracting: (1<=p0)
states: 219
abstracting: (1<=p60)
states: 84
abstracting: (1<=p0)
states: 219
abstracting: (1<=p58)
states: 84
abstracting: (1<=p0)
states: 219
abstracting: (1<=p57)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p55)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p56)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p57)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p55)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p56)
states: 54
abstracting: (1<=p0)
states: 219
.
EG iterations: 1
abstracting: (1<=p57)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p55)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p56)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p74)
states: 32
abstracting: (1<=p57)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p55)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p56)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p57)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p55)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p56)
states: 54
abstracting: (1<=p0)
states: 219
.
EG iterations: 1
.........
EG iterations: 9
abstracting: (1<=p75)
states: 4
-> the formula is FALSE

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

MC time: 0m 0.038sec

checking: [AF [[[~ [E [~ [[[1<=p32 & 1<=p59] | [[1<=p33 & 1<=p60] | [1<=p31 & 1<=p58]]]] U 1<=p70]] & [[1<=p45 & 1<=p54] | [[1<=p43 & 1<=p52] | [1<=p44 & 1<=p53]]]] & [p68<=0 & [p67<=0 & p69<=0]]]] | ~ [A [~ [[[1<=p0 & 1<=p57] | [[1<=p0 & 1<=p55] | [1<=p0 & 1<=p56]]]] U [[~ [[EX [[[[1<=p10 & 1<=p11] & [1<=p12 & 1<=p64]] | [[[1<=p13 & 1<=p14] & [1<=p15 & 1<=p65]] | [[1<=p16 & 1<=p17] & [1<=p18 & 1<=p66]]]]] & E [1<=p73 U [[1<=p28 & 1<=p29] & [1<=p30 & 1<=p70]]]]] | [1<=p0 & 1<=p67]] | [[1<=p0 & 1<=p68] | [1<=p0 & 1<=p69]]]]]]
normalized: [~ [[~ [EG [~ [[[[1<=p0 & 1<=p69] | [1<=p0 & 1<=p68]] | [[1<=p0 & 1<=p67] | ~ [[E [1<=p73 U [[1<=p30 & 1<=p70] & [1<=p28 & 1<=p29]]] & EX [[[[[1<=p18 & 1<=p66] & [1<=p16 & 1<=p17]] | [[1<=p15 & 1<=p65] & [1<=p13 & 1<=p14]]] | [[1<=p12 & 1<=p64] & [1<=p10 & 1<=p11]]]]]]]]]]] & ~ [E [~ [[[[1<=p0 & 1<=p69] | [1<=p0 & 1<=p68]] | [[1<=p0 & 1<=p67] | ~ [[E [1<=p73 U [[1<=p30 & 1<=p70] & [1<=p28 & 1<=p29]]] & EX [[[[[1<=p18 & 1<=p66] & [1<=p16 & 1<=p17]] | [[1<=p15 & 1<=p65] & [1<=p13 & 1<=p14]]] | [[1<=p12 & 1<=p64] & [1<=p10 & 1<=p11]]]]]]]]] U [[[[1<=p0 & 1<=p56] | [1<=p0 & 1<=p55]] | [1<=p0 & 1<=p57]] & ~ [[[[1<=p0 & 1<=p69] | [1<=p0 & 1<=p68]] | [[1<=p0 & 1<=p67] | ~ [[E [1<=p73 U [[1<=p30 & 1<=p70] & [1<=p28 & 1<=p29]]] & EX [[[[[1<=p18 & 1<=p66] & [1<=p16 & 1<=p17]] | [[1<=p15 & 1<=p65] & [1<=p13 & 1<=p14]]] | [[1<=p12 & 1<=p64] & [1<=p10 & 1<=p11]]]]]]]]]]]]]] | ~ [EG [~ [[[p68<=0 & [p67<=0 & p69<=0]] & [[[[1<=p44 & 1<=p53] | [1<=p43 & 1<=p52]] | [1<=p45 & 1<=p54]] & ~ [E [~ [[[[1<=p31 & 1<=p58] | [1<=p33 & 1<=p60]] | [1<=p32 & 1<=p59]]] U 1<=p70]]]]]]]]

abstracting: (1<=p70)
states: 319
abstracting: (1<=p59)
states: 84
abstracting: (1<=p32)
states: 72
abstracting: (1<=p60)
states: 84
abstracting: (1<=p33)
states: 72
abstracting: (1<=p58)
states: 84
abstracting: (1<=p31)
states: 72
abstracting: (1<=p54)
states: 27
abstracting: (1<=p45)
states: 32
abstracting: (1<=p52)
states: 27
abstracting: (1<=p43)
states: 32
abstracting: (1<=p53)
states: 27
abstracting: (1<=p44)
states: 32
abstracting: (p69<=0)
states: 885
abstracting: (p67<=0)
states: 885
abstracting: (p68<=0)
states: 885
..
EG iterations: 2
abstracting: (1<=p11)
states: 222
abstracting: (1<=p10)
states: 222
abstracting: (1<=p64)
states: 291
abstracting: (1<=p12)
states: 222
abstracting: (1<=p14)
states: 222
abstracting: (1<=p13)
states: 222
abstracting: (1<=p65)
states: 291
abstracting: (1<=p15)
states: 222
abstracting: (1<=p17)
states: 222
abstracting: (1<=p16)
states: 222
abstracting: (1<=p66)
states: 291
abstracting: (1<=p18)
states: 222
.abstracting: (1<=p29)
states: 566
abstracting: (1<=p28)
states: 566
abstracting: (1<=p70)
states: 319
abstracting: (1<=p30)
states: 566
abstracting: (1<=p73)
states: 4
abstracting: (1<=p67)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p68)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p69)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p57)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p55)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p56)
states: 54
abstracting: (1<=p0)
states: 219
abstracting: (1<=p11)
states: 222
abstracting: (1<=p10)
states: 222
abstracting: (1<=p64)
states: 291
abstracting: (1<=p12)
states: 222
abstracting: (1<=p14)
states: 222
abstracting: (1<=p13)
states: 222
abstracting: (1<=p65)
states: 291
abstracting: (1<=p15)
states: 222
abstracting: (1<=p17)
states: 222
abstracting: (1<=p16)
states: 222
abstracting: (1<=p66)
states: 291
abstracting: (1<=p18)
states: 222
.abstracting: (1<=p29)
states: 566
abstracting: (1<=p28)
states: 566
abstracting: (1<=p70)
states: 319
abstracting: (1<=p30)
states: 566
abstracting: (1<=p73)
states: 4
abstracting: (1<=p67)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p68)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p69)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p11)
states: 222
abstracting: (1<=p10)
states: 222
abstracting: (1<=p64)
states: 291
abstracting: (1<=p12)
states: 222
abstracting: (1<=p14)
states: 222
abstracting: (1<=p13)
states: 222
abstracting: (1<=p65)
states: 291
abstracting: (1<=p15)
states: 222
abstracting: (1<=p17)
states: 222
abstracting: (1<=p16)
states: 222
abstracting: (1<=p66)
states: 291
abstracting: (1<=p18)
states: 222
.abstracting: (1<=p29)
states: 566
abstracting: (1<=p28)
states: 566
abstracting: (1<=p70)
states: 319
abstracting: (1<=p30)
states: 566
abstracting: (1<=p73)
states: 4
abstracting: (1<=p67)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p68)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p69)
states: 144
abstracting: (1<=p0)
states: 219
........
EG iterations: 8
-> the formula is FALSE

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

MC time: 0m 0.028sec

checking: [AG [[[p40<=0 | p41<=0] | [p42<=0 | p74<=0]]] | [EX [A [[[[1<=p3 & 1<=p6] & [1<=p9 & 1<=p48]] | [[[1<=p2 & 1<=p5] & [1<=p8 & 1<=p47]] | [[1<=p1 & 1<=p4] & [1<=p7 & 1<=p46]]]] U 1<=p71]] | EG [[E [[[1<=p0 & 1<=p59] | [[1<=p0 & 1<=p60] | [1<=p0 & 1<=p58]]] U [[1<=p34 & 1<=p35] & [1<=p36 & 1<=p72]]] | [~ [E [1<=p74 U [[1<=p0 & 1<=p67] | [[1<=p0 & 1<=p68] | [1<=p0 & 1<=p69]]]]] | ~ [A [E [1<=p72 U [[[1<=p10 & 1<=p11] & [1<=p12 & 1<=p64]] | [[[1<=p13 & 1<=p14] & [1<=p15 & 1<=p65]] | [[1<=p16 & 1<=p17] & [1<=p18 & 1<=p66]]]]] U [[[1<=p0 & 1<=p63] | [1<=p0 & 1<=p61]] | [[1<=p0 & 1<=p62] | [[1<=p28 & 1<=p29] & [1<=p30 & 1<=p70]]]]]]]]]]]
normalized: [[EG [[[~ [[~ [EG [~ [[[[[1<=p30 & 1<=p70] & [1<=p28 & 1<=p29]] | [1<=p0 & 1<=p62]] | [[1<=p0 & 1<=p61] | [1<=p0 & 1<=p63]]]]]] & ~ [E [~ [[[[[1<=p30 & 1<=p70] & [1<=p28 & 1<=p29]] | [1<=p0 & 1<=p62]] | [[1<=p0 & 1<=p61] | [1<=p0 & 1<=p63]]]] U [~ [E [1<=p72 U [[[[1<=p18 & 1<=p66] & [1<=p16 & 1<=p17]] | [[1<=p15 & 1<=p65] & [1<=p13 & 1<=p14]]] | [[1<=p12 & 1<=p64] & [1<=p10 & 1<=p11]]]]] & ~ [[[[[1<=p30 & 1<=p70] & [1<=p28 & 1<=p29]] | [1<=p0 & 1<=p62]] | [[1<=p0 & 1<=p61] | [1<=p0 & 1<=p63]]]]]]]]] | ~ [E [1<=p74 U [[[1<=p0 & 1<=p69] | [1<=p0 & 1<=p68]] | [1<=p0 & 1<=p67]]]]] | E [[[[1<=p0 & 1<=p58] | [1<=p0 & 1<=p60]] | [1<=p0 & 1<=p59]] U [[1<=p36 & 1<=p72] & [1<=p34 & 1<=p35]]]]] | EX [[~ [EG [~ [1<=p71]]] & ~ [E [~ [1<=p71] U [~ [[[[[1<=p7 & 1<=p46] & [1<=p1 & 1<=p4]] | [[1<=p8 & 1<=p47] & [1<=p2 & 1<=p5]]] | [[1<=p9 & 1<=p48] & [1<=p3 & 1<=p6]]]] & ~ [1<=p71]]]]]]] | ~ [E [true U ~ [[[p42<=0 | p74<=0] | [p40<=0 | p41<=0]]]]]]

abstracting: (p41<=0)
states: 997
abstracting: (p40<=0)
states: 997
abstracting: (p74<=0)
states: 997
abstracting: (p42<=0)
states: 997
abstracting: (1<=p71)
states: 4
abstracting: (1<=p6)
states: 168
abstracting: (1<=p3)
states: 168
abstracting: (1<=p48)
states: 462
abstracting: (1<=p9)
states: 168
abstracting: (1<=p5)
states: 168
abstracting: (1<=p2)
states: 168
abstracting: (1<=p47)
states: 462
abstracting: (1<=p8)
states: 168
abstracting: (1<=p4)
states: 168
abstracting: (1<=p1)
states: 168
abstracting: (1<=p46)
states: 462
abstracting: (1<=p7)
states: 168
abstracting: (1<=p71)
states: 4
abstracting: (1<=p71)
states: 4
.
EG iterations: 1
.abstracting: (1<=p35)
states: 32
abstracting: (1<=p34)
states: 32
abstracting: (1<=p72)
states: 32
abstracting: (1<=p36)
states: 32
abstracting: (1<=p59)
states: 84
abstracting: (1<=p0)
states: 219
abstracting: (1<=p60)
states: 84
abstracting: (1<=p0)
states: 219
abstracting: (1<=p58)
states: 84
abstracting: (1<=p0)
states: 219
abstracting: (1<=p67)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p68)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p69)
states: 144
abstracting: (1<=p0)
states: 219
abstracting: (1<=p74)
states: 32
abstracting: (1<=p63)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p61)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p62)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p29)
states: 566
abstracting: (1<=p28)
states: 566
abstracting: (1<=p70)
states: 319
abstracting: (1<=p30)
states: 566
abstracting: (1<=p11)
states: 222
abstracting: (1<=p10)
states: 222
abstracting: (1<=p64)
states: 291
abstracting: (1<=p12)
states: 222
abstracting: (1<=p14)
states: 222
abstracting: (1<=p13)
states: 222
abstracting: (1<=p65)
states: 291
abstracting: (1<=p15)
states: 222
abstracting: (1<=p17)
states: 222
abstracting: (1<=p16)
states: 222
abstracting: (1<=p66)
states: 291
abstracting: (1<=p18)
states: 222
abstracting: (1<=p72)
states: 32
abstracting: (1<=p63)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p61)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p62)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p29)
states: 566
abstracting: (1<=p28)
states: 566
abstracting: (1<=p70)
states: 319
abstracting: (1<=p30)
states: 566
abstracting: (1<=p63)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p61)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p62)
states: 66
abstracting: (1<=p0)
states: 219
abstracting: (1<=p29)
states: 566
abstracting: (1<=p28)
states: 566
abstracting: (1<=p70)
states: 319
abstracting: (1<=p30)
states: 566
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

totally nodes used: 322157 (3.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 105304 551787 657091
used/not used/entry size/cache size: 791790 66317074 16 1024MB
basic ops cache: hits/miss/sum: 35569 208008 243577
used/not used/entry size/cache size: 321956 16455260 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: 3787 14358 18145
used/not used/entry size/cache size: 14354 8374254 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 66805834
1 285814
2 15691
3 1423
4 79
5 6
6 0
7 0
8 0
9 0
>= 10 17

Total processing time: 0m 4.724sec


BK_STOP 1679677622521

--------------------
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:875 (15), effective:56 (1)

initing FirstDep: 0m 0.000sec


iterations count:91 (1), effective:7 (0)

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

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

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

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

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

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

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

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

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

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

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

iterations count:91 (1), effective:7 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:80 (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="QuasiCertifProtocol-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 QuasiCertifProtocol-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 r298-tall-167873952200802"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-02.tgz
mv QuasiCertifProtocol-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 ;