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

About the Execution of Marcie+red for QuasiCertifProtocol-COL-32

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10578.132 423253.00 451513.00 1398.00 FF?T???T???TTF?F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r298-tall-167873952300849.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-32, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952300849
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 01:41 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 131K 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-32-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679684899847

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-32
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 19:08:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 19:08:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 19:08: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-24 19:08:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 19:08:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 691 ms
[2023-03-24 19:08:22] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
[2023-03-24 19:08:22] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2023-03-24 19:08:22] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
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 1 formulas.
Remains 16 properties that can be checked using skeleton over-approximation.
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 10012 steps, including 236 resets, run finished after 164 ms. (steps per millisecond=61 ) properties (out of 64) seen :11
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1004 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1009 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=126 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 53) seen :0
Running SMT prover for 53 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-24 19:08:22] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-24 19:08:23] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-24 19:08:23] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:52
[2023-03-24 19:08:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-24 19:08:23] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :35 sat :18
[2023-03-24 19:08:23] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :35 sat :18
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-24 19:08:23] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :35 sat :18
Fused 53 Parikh solutions to 17 different solutions.
Finished Parikh walk after 144 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=48 )
Parikh walk visited 18 properties in 62 ms.
Successfully simplified 35 atomic propositions for a total of 16 simplifications.
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 19:08:23] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2023-03-24 19:08:23] [INFO ] Flatten gal took : 25 ms
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 19:08:23] [INFO ] Flatten gal took : 4 ms
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2023-03-24 19:08:23] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 25 ms.
[2023-03-24 19:08:23] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Support contains 3674 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Applied a total of 0 rules in 25 ms. Remains 3806 /3806 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3806 cols
[2023-03-24 19:08:23] [INFO ] Computed 3301 place invariants in 197 ms
[2023-03-24 19:08:25] [INFO ] Implicit Places using invariants in 1497 ms returned []
[2023-03-24 19:08:25] [INFO ] Invariant cache hit.
[2023-03-24 19:08:27] [INFO ] Implicit Places using invariants and state equation in 2542 ms returned []
Implicit Place search using SMT with State Equation took 4046 ms to find 0 implicit places.
[2023-03-24 19:08:27] [INFO ] Invariant cache hit.
[2023-03-24 19:08:29] [INFO ] Dead Transitions using invariants and state equation in 1488 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5561 ms. Remains : 3806/3806 places, 506/506 transitions.
Support contains 3674 out of 3806 places after structural reductions.
[2023-03-24 19:08:29] [INFO ] Flatten gal took : 231 ms
[2023-03-24 19:08:29] [INFO ] Flatten gal took : 165 ms
[2023-03-24 19:08:29] [INFO ] Input system was already deterministic with 506 transitions.
Support contains 3641 out of 3806 places (down from 3674) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 711 ms. (steps per millisecond=14 ) properties (out of 37) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) seen :0
Running SMT prover for 33 properties.
[2023-03-24 19:08:30] [INFO ] Invariant cache hit.
[2023-03-24 19:08:33] [INFO ] After 2098ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:33
[2023-03-24 19:08:35] [INFO ] [Nat]Absence check using 37 positive place invariants in 46 ms returned sat
[2023-03-24 19:08:35] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 673 ms returned sat
[2023-03-24 19:08:58] [INFO ] After 16225ms SMT Verify possible using state equation in natural domain returned unsat :15 sat :16
[2023-03-24 19:08:58] [INFO ] After 16234ms SMT Verify possible using trap constraints in natural domain returned unsat :15 sat :16
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-24 19:08:58] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :15 sat :16
Fused 33 Parikh solutions to 8 different solutions.
Parikh walk visited 10 properties in 60 ms.
Support contains 1289 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3802 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.22 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 267 rules applied. Total rules applied 268 place count 3736 transition count 305
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 66 Pre rules applied. Total rules applied 268 place count 3736 transition count 239
Deduced a syphon composed of 66 places in 4 ms
Ensure Unique test removed 32 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 164 rules applied. Total rules applied 432 place count 3638 transition count 239
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 433 place count 3637 transition count 239
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 499 place count 3604 transition count 206
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 500 place count 3604 transition count 205
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 501 place count 3603 transition count 204
Ensure Unique test removed 33 places
Iterating post reduction 2 with 33 rules applied. Total rules applied 534 place count 3570 transition count 204
Applied a total of 534 rules in 891 ms. Remains 3570 /3806 variables (removed 236) and now considering 204/506 (removed 302) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 891 ms. Remains : 3570/3806 places, 204/506 transitions.
Incomplete random walk after 10000 steps, including 95 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 204 rows 3570 cols
[2023-03-24 19:08:59] [INFO ] Computed 3366 place invariants in 20 ms
[2023-03-24 19:09:00] [INFO ] [Real]Absence check using 1089 positive place invariants in 215 ms returned sat
[2023-03-24 19:09:01] [INFO ] [Real]Absence check using 1089 positive and 2277 generalized place invariants in 534 ms returned sat
[2023-03-24 19:09:01] [INFO ] After 1353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 19:09:01] [INFO ] [Nat]Absence check using 1089 positive place invariants in 234 ms returned sat
[2023-03-24 19:09:02] [INFO ] [Nat]Absence check using 1089 positive and 2277 generalized place invariants in 547 ms returned sat
[2023-03-24 19:09:04] [INFO ] After 2822ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 17 atomic propositions for a total of 9 simplifications.
[2023-03-24 19:09:04] [INFO ] Flatten gal took : 133 ms
[2023-03-24 19:09:04] [INFO ] Flatten gal took : 118 ms
[2023-03-24 19:09:04] [INFO ] Input system was already deterministic with 506 transitions.
Support contains 3572 out of 3806 places (down from 3605) after GAL structural reductions.
Computed a total of 3806 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3806 transition count 506
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 LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 413 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 414 ms. Remains : 3736/3806 places, 506/506 transitions.
[2023-03-24 19:09:05] [INFO ] Flatten gal took : 98 ms
[2023-03-24 19:09:05] [INFO ] Flatten gal took : 96 ms
[2023-03-24 19:09:05] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 3737 transition count 506
Applied a total of 69 rules in 354 ms. Remains 3737 /3806 variables (removed 69) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 3737/3806 places, 506/506 transitions.
[2023-03-24 19:09:05] [INFO ] Flatten gal took : 102 ms
[2023-03-24 19:09:05] [INFO ] Flatten gal took : 105 ms
[2023-03-24 19:09:06] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 203 are kept as prefixes of interest. Removing 3603 places using SCC suffix rule.20 ms
Discarding 3603 places :
Also discarding 202 output transitions
Drop transitions removed 202 transitions
Ensure Unique test removed 164 transitions
Reduce isomorphic transitions removed 164 transitions.
Iterating post reduction 0 with 164 rules applied. Total rules applied 165 place count 203 transition count 140
Applied a total of 165 rules in 37 ms. Remains 203 /3806 variables (removed 3603) and now considering 140/506 (removed 366) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 203/3806 places, 140/506 transitions.
[2023-03-24 19:09:06] [INFO ] Flatten gal took : 6 ms
[2023-03-24 19:09:06] [INFO ] Flatten gal took : 6 ms
[2023-03-24 19:09:06] [INFO ] Input system was already deterministic with 140 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 2581 are kept as prefixes of interest. Removing 1225 places using SCC suffix rule.17 ms
Discarding 1225 places :
Also discarding 66 output transitions
Drop transitions removed 66 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 2580 transition count 374
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 2580 transition count 374
Applied a total of 67 rules in 200 ms. Remains 2580 /3806 variables (removed 1226) and now considering 374/506 (removed 132) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 201 ms. Remains : 2580/3806 places, 374/506 transitions.
[2023-03-24 19:09:06] [INFO ] Flatten gal took : 56 ms
[2023-03-24 19:09:06] [INFO ] Flatten gal took : 57 ms
[2023-03-24 19:09:06] [INFO ] Input system was already deterministic with 374 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 269 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 269 ms. Remains : 3736/3806 places, 506/506 transitions.
[2023-03-24 19:09:06] [INFO ] Flatten gal took : 77 ms
[2023-03-24 19:09:06] [INFO ] Flatten gal took : 81 ms
[2023-03-24 19:09:07] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3802 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.15 ms
Discarding 4 places :
Also discarding 0 output 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 3801 transition count 505
Applied a total of 2 rules in 604 ms. Remains 3801 /3806 variables (removed 5) and now considering 505/506 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 608 ms. Remains : 3801/3806 places, 505/506 transitions.
[2023-03-24 19:09:07] [INFO ] Flatten gal took : 78 ms
[2023-03-24 19:09:07] [INFO ] Flatten gal took : 80 ms
[2023-03-24 19:09:08] [INFO ] Input system was already deterministic with 505 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 244 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 3736/3806 places, 506/506 transitions.
[2023-03-24 19:09:08] [INFO ] Flatten gal took : 77 ms
[2023-03-24 19:09:08] [INFO ] Flatten gal took : 81 ms
[2023-03-24 19:09:08] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3735 are kept as prefixes of interest. Removing 71 places using SCC suffix rule.14 ms
Discarding 71 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 167 ms. Remains 3734 /3806 variables (removed 72) and now considering 503/506 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 167 ms. Remains : 3734/3806 places, 503/506 transitions.
[2023-03-24 19:09:08] [INFO ] Flatten gal took : 78 ms
[2023-03-24 19:09:08] [INFO ] Flatten gal took : 79 ms
[2023-03-24 19:09:09] [INFO ] Input system was already deterministic with 503 transitions.
Incomplete random walk after 10000 steps, including 246 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9351 steps, run visited all 1 properties in 287 ms. (steps per millisecond=32 )
Probabilistic random walk after 9351 steps, saw 9183 distinct states, run finished after 294 ms. (steps per millisecond=31 ) properties seen :1
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 3738 transition count 506
Applied a total of 68 rules in 245 ms. Remains 3738 /3806 variables (removed 68) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 3738/3806 places, 506/506 transitions.
[2023-03-24 19:09:10] [INFO ] Flatten gal took : 78 ms
[2023-03-24 19:09:10] [INFO ] Flatten gal took : 79 ms
[2023-03-24 19:09:10] [INFO ] Input system was already deterministic with 506 transitions.
[2023-03-24 19:09:10] [INFO ] Flatten gal took : 79 ms
[2023-03-24 19:09:10] [INFO ] Flatten gal took : 77 ms
[2023-03-24 19:09:10] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-24 19:09:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3806 places, 506 transitions and 8173 arcs took 10 ms.
Total runtime 49147 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 3806 NrTr: 506 NrArc: 8173)

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

net check time: 0m 0.001sec

init dd package: 0m 2.785sec


before gc: list nodes free: 1843519

after gc: idd nodes used:45423935, unused:18576065; list nodes free:87120315

RS generation: 5m34.498sec


-> last computed set: #nodes 45420163 (4.5e+07) #states 2,097,153 (6)


CANNOT_COMPUTE


BK_STOP 1679685323100

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec

idd.cc:820: DD Exception: No free nodes

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-32"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is QuasiCertifProtocol-COL-32, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tall-167873952300849"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-32.tgz
mv QuasiCertifProtocol-COL-32 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;