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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.5K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 01:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 01:39 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 120K 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-28-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679684289937

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-28
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 18:58:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 18:58:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 18:58:11] [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 18:58:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 18:58:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 735 ms
[2023-03-24 18:58:12] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
[2023-03-24 18:58:12] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2023-03-24 18:58:12] [INFO ] Skeletonized 16 HLPN properties in 3 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.
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 15 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 10027 steps, including 258 resets, run finished after 189 ms. (steps per millisecond=53 ) properties (out of 73) seen :16
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 57) 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 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1002 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 57) 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 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 57) 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 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 57) seen :0
Running SMT prover for 57 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-24 18:58:12] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-24 18:58:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-24 18:58:13] [INFO ] After 22ms SMT Verify possible using state equation in real domain returned unsat :10 sat :2 real:45
[2023-03-24 18:58:13] [INFO ] After 31ms SMT Verify possible using trap constraints in real domain returned unsat :10 sat :2 real:45
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-24 18:58:13] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :10 sat :2 real:45
[2023-03-24 18:58:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-24 18:58:13] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :36 sat :21
[2023-03-24 18:58:13] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :36 sat :21
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-24 18:58:13] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :36 sat :21
Fused 57 Parikh solutions to 20 different solutions.
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=119 )
Parikh walk visited 21 properties in 47 ms.
Successfully simplified 36 atomic propositions for a total of 15 simplifications.
[2023-03-24 18:58:13] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-24 18:58:13] [INFO ] Flatten gal took : 25 ms
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 18:58:13] [INFO ] Flatten gal took : 6 ms
Domain [tsid(29), tsid(29)] of place n9 breaks symmetries in sort tsid
[2023-03-24 18:58:13] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions 6489 arcs in 25 ms.
[2023-03-24 18:58:13] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 2940 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 2969 transition count 446
Applied a total of 29 rules in 20 ms. Remains 2969 /2998 variables (removed 29) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2969 cols
[2023-03-24 18:58:13] [INFO ] Computed 2524 place invariants in 129 ms
[2023-03-24 18:58:14] [INFO ] Implicit Places using invariants in 980 ms returned []
[2023-03-24 18:58:14] [INFO ] Invariant cache hit.
[2023-03-24 18:58:31] [INFO ] Implicit Places using invariants and state equation in 16843 ms returned []
Implicit Place search using SMT with State Equation took 17826 ms to find 0 implicit places.
[2023-03-24 18:58:31] [INFO ] Invariant cache hit.
[2023-03-24 18:58:32] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2969/2998 places, 446/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18997 ms. Remains : 2969/2998 places, 446/446 transitions.
Support contains 2940 out of 2969 places after structural reductions.
[2023-03-24 18:58:32] [INFO ] Flatten gal took : 169 ms
[2023-03-24 18:58:33] [INFO ] Flatten gal took : 110 ms
[2023-03-24 18:58:33] [INFO ] Input system was already deterministic with 446 transitions.
Incomplete random walk after 10000 steps, including 301 resets, run finished after 992 ms. (steps per millisecond=10 ) properties (out of 59) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 49) 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 49) 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 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 49) 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 49) 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 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) 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 49) 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 49) 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 49) 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 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 49) 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 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 49) 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 49) seen :0
Running SMT prover for 49 properties.
[2023-03-24 18:58:34] [INFO ] Invariant cache hit.
[2023-03-24 18:58:37] [INFO ] [Real]Absence check using 32 positive place invariants in 32 ms returned sat
[2023-03-24 18:58:38] [INFO ] [Real]Absence check using 32 positive and 2492 generalized place invariants in 557 ms returned sat
[2023-03-24 18:58:39] [INFO ] After 4555ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:45
[2023-03-24 18:58:41] [INFO ] [Nat]Absence check using 32 positive place invariants in 33 ms returned sat
[2023-03-24 18:58:42] [INFO ] [Nat]Absence check using 32 positive and 2492 generalized place invariants in 480 ms returned sat
[2023-03-24 18:59:04] [INFO ] After 20748ms SMT Verify possible using state equation in natural domain returned unsat :20 sat :28
[2023-03-24 18:59:04] [INFO ] After 20754ms SMT Verify possible using trap constraints in natural domain returned unsat :20 sat :28
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-24 18:59:04] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :20 sat :28
Fused 49 Parikh solutions to 6 different solutions.
Parikh walk visited 17 properties in 62 ms.
Support contains 1076 out of 2969 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2969/2969 places, 446/446 transitions.
Graph (complete) has 30289 edges and 2969 vertex of which 2937 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.14 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Discarding 58 places :
Implicit places reduction removed 58 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 178 rules applied. Total rules applied 179 place count 2879 transition count 326
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 180 place count 2878 transition count 326
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Ensure Unique test removed 841 places
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 957 rules applied. Total rules applied 1137 place count 1979 transition count 268
Applied a total of 1137 rules in 398 ms. Remains 1979 /2969 variables (removed 990) and now considering 268/446 (removed 178) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 398 ms. Remains : 1979/2969 places, 268/446 transitions.
Incomplete random walk after 10000 steps, including 312 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 300985 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{4=1, 8=1, 9=1, 11=1}
Probabilistic random walk after 300985 steps, saw 49314 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :4
Running SMT prover for 8 properties.
// Phase 1: matrix 268 rows 1979 cols
[2023-03-24 18:59:09] [INFO ] Computed 1711 place invariants in 28 ms
[2023-03-24 18:59:10] [INFO ] [Real]Absence check using 29 positive place invariants in 17 ms returned sat
[2023-03-24 18:59:10] [INFO ] [Real]Absence check using 29 positive and 1682 generalized place invariants in 312 ms returned sat
[2023-03-24 18:59:11] [INFO ] After 1304ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:1
[2023-03-24 18:59:11] [INFO ] [Nat]Absence check using 29 positive place invariants in 7 ms returned sat
[2023-03-24 18:59:11] [INFO ] [Nat]Absence check using 29 positive and 1682 generalized place invariants in 329 ms returned sat
[2023-03-24 18:59:11] [INFO ] After 653ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 28 atomic propositions for a total of 12 simplifications.
[2023-03-24 18:59:12] [INFO ] Flatten gal took : 77 ms
[2023-03-24 18:59:12] [INFO ] Flatten gal took : 72 ms
[2023-03-24 18:59:12] [INFO ] Input system was already deterministic with 446 transitions.
Support contains 2849 out of 2969 places (down from 2851) after GAL structural reductions.
Computed a total of 2969 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2969 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in SI_CTL mode, iteration 0 : 2969/2969 places, 446/446 transitions.
Graph (complete) has 30289 edges and 2969 vertex of which 1168 are kept as prefixes of interest. Removing 1801 places using SCC suffix rule.19 ms
Discarding 1801 places :
Also discarding 87 output transitions
Drop transitions removed 87 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 1167 transition count 272
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 1167 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 1166 transition count 271
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 1166 transition count 271
Applied a total of 91 rules in 287 ms. Remains 1166 /2969 variables (removed 1803) and now considering 271/446 (removed 175) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 287 ms. Remains : 1166/2969 places, 271/446 transitions.
[2023-03-24 18:59:12] [INFO ] Flatten gal took : 25 ms
[2023-03-24 18:59:12] [INFO ] Flatten gal took : 24 ms
[2023-03-24 18:59:12] [INFO ] Input system was already deterministic with 271 transitions.
Incomplete random walk after 10000 steps, including 254 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5204 steps, run visited all 1 properties in 34 ms. (steps per millisecond=153 )
Probabilistic random walk after 5204 steps, saw 5059 distinct states, run finished after 34 ms. (steps per millisecond=153 ) properties seen :1
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 2969/2969 places, 446/446 transitions.
Graph (complete) has 30289 edges and 2969 vertex of which 1137 are kept as prefixes of interest. Removing 1832 places using SCC suffix rule.10 ms
Discarding 1832 places :
Also discarding 89 output transitions
Drop transitions removed 89 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 1136 transition count 270
Applied a total of 87 rules in 42 ms. Remains 1136 /2969 variables (removed 1833) and now considering 270/446 (removed 176) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 1136/2969 places, 270/446 transitions.
[2023-03-24 18:59:12] [INFO ] Flatten gal took : 23 ms
[2023-03-24 18:59:12] [INFO ] Flatten gal took : 25 ms
[2023-03-24 18:59:12] [INFO ] Input system was already deterministic with 270 transitions.
Incomplete random walk after 10000 steps, including 258 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3204 steps, run visited all 1 properties in 56 ms. (steps per millisecond=57 )
Probabilistic random walk after 3204 steps, saw 3139 distinct states, run finished after 57 ms. (steps per millisecond=56 ) properties seen :1
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 2969/2969 places, 446/446 transitions.
Graph (complete) has 30289 edges and 2969 vertex of which 2906 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.13 ms
Discarding 63 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 2906 transition count 444
Applied a total of 2 rules in 222 ms. Remains 2906 /2969 variables (removed 63) and now considering 444/446 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 222 ms. Remains : 2906/2969 places, 444/446 transitions.
[2023-03-24 18:59:13] [INFO ] Flatten gal took : 59 ms
[2023-03-24 18:59:13] [INFO ] Flatten gal took : 61 ms
[2023-03-24 18:59:13] [INFO ] Input system was already deterministic with 444 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2969/2969 places, 446/446 transitions.
Graph (complete) has 30289 edges and 2969 vertex of which 2935 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.8 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 99 ms. Remains 2935 /2969 variables (removed 34) and now considering 444/446 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 100 ms. Remains : 2935/2969 places, 444/446 transitions.
[2023-03-24 18:59:13] [INFO ] Flatten gal took : 58 ms
[2023-03-24 18:59:13] [INFO ] Flatten gal took : 62 ms
[2023-03-24 18:59:14] [INFO ] Input system was already deterministic with 444 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2969/2969 places, 446/446 transitions.
Graph (complete) has 30289 edges and 2969 vertex of which 2906 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.7 ms
Discarding 63 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 194 ms. Remains 2905 /2969 variables (removed 64) and now considering 443/446 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 194 ms. Remains : 2905/2969 places, 443/446 transitions.
[2023-03-24 18:59:14] [INFO ] Flatten gal took : 50 ms
[2023-03-24 18:59:14] [INFO ] Flatten gal took : 52 ms
[2023-03-24 18:59:14] [INFO ] Input system was already deterministic with 443 transitions.
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 2969/2969 places, 446/446 transitions.
Graph (complete) has 30289 edges and 2969 vertex of which 2007 are kept as prefixes of interest. Removing 962 places using SCC suffix rule.7 ms
Discarding 962 places :
Also discarding 60 output transitions
Drop transitions removed 60 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 2006 transition count 328
Applied a total of 58 rules in 60 ms. Remains 2006 /2969 variables (removed 963) and now considering 328/446 (removed 118) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 2006/2969 places, 328/446 transitions.
[2023-03-24 18:59:14] [INFO ] Flatten gal took : 35 ms
[2023-03-24 18:59:14] [INFO ] Flatten gal took : 35 ms
[2023-03-24 18:59:14] [INFO ] Input system was already deterministic with 328 transitions.
Incomplete random walk after 10000 steps, including 253 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5616 steps, run visited all 1 properties in 110 ms. (steps per millisecond=51 )
Probabilistic random walk after 5616 steps, saw 5497 distinct states, run finished after 111 ms. (steps per millisecond=50 ) properties seen :1
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 2969/2969 places, 446/446 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 2937 transition count 446
Applied a total of 32 rules in 147 ms. Remains 2937 /2969 variables (removed 32) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 2937/2969 places, 446/446 transitions.
[2023-03-24 18:59:15] [INFO ] Flatten gal took : 55 ms
[2023-03-24 18:59:15] [INFO ] Flatten gal took : 55 ms
[2023-03-24 18:59:15] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2969/2969 places, 446/446 transitions.
Graph (complete) has 30289 edges and 2969 vertex of which 1137 are kept as prefixes of interest. Removing 1832 places using SCC suffix rule.12 ms
Discarding 1832 places :
Also discarding 89 output transitions
Drop transitions removed 89 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 1136 transition count 270
Applied a total of 87 rules in 38 ms. Remains 1136 /2969 variables (removed 1833) and now considering 270/446 (removed 176) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 1136/2969 places, 270/446 transitions.
[2023-03-24 18:59:15] [INFO ] Flatten gal took : 21 ms
[2023-03-24 18:59:15] [INFO ] Flatten gal took : 21 ms
[2023-03-24 18:59:15] [INFO ] Input system was already deterministic with 270 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2969/2969 places, 446/446 transitions.
Graph (complete) has 30289 edges and 2969 vertex of which 179 are kept as prefixes of interest. Removing 2790 places using SCC suffix rule.6 ms
Discarding 2790 places :
Also discarding 178 output transitions
Drop transitions removed 178 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 178 transition count 123
Applied a total of 145 rules in 11 ms. Remains 178 /2969 variables (removed 2791) and now considering 123/446 (removed 323) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 178/2969 places, 123/446 transitions.
[2023-03-24 18:59:15] [INFO ] Flatten gal took : 3 ms
[2023-03-24 18:59:15] [INFO ] Flatten gal took : 3 ms
[2023-03-24 18:59:15] [INFO ] Input system was already deterministic with 123 transitions.
Incomplete random walk after 10000 steps, including 257 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2384 steps, run visited all 1 properties in 9 ms. (steps per millisecond=264 )
Probabilistic random walk after 2384 steps, saw 2327 distinct states, run finished after 9 ms. (steps per millisecond=264 ) properties seen :1
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 2969/2969 places, 446/446 transitions.
Graph (complete) has 30289 edges and 2969 vertex of which 2906 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.6 ms
Discarding 63 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 173 ms. Remains 2905 /2969 variables (removed 64) and now considering 443/446 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 174 ms. Remains : 2905/2969 places, 443/446 transitions.
[2023-03-24 18:59:15] [INFO ] Flatten gal took : 49 ms
[2023-03-24 18:59:15] [INFO ] Flatten gal took : 51 ms
[2023-03-24 18:59:15] [INFO ] Input system was already deterministic with 443 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2969/2969 places, 446/446 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 2936 transition count 446
Applied a total of 33 rules in 149 ms. Remains 2936 /2969 variables (removed 33) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 2936/2969 places, 446/446 transitions.
[2023-03-24 18:59:16] [INFO ] Flatten gal took : 55 ms
[2023-03-24 18:59:16] [INFO ] Flatten gal took : 56 ms
[2023-03-24 18:59:16] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2969/2969 places, 446/446 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 2937 transition count 446
Applied a total of 32 rules in 80 ms. Remains 2937 /2969 variables (removed 32) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 2937/2969 places, 446/446 transitions.
[2023-03-24 18:59:16] [INFO ] Flatten gal took : 55 ms
[2023-03-24 18:59:16] [INFO ] Flatten gal took : 56 ms
[2023-03-24 18:59:16] [INFO ] Input system was already deterministic with 446 transitions.
[2023-03-24 18:59:16] [INFO ] Flatten gal took : 58 ms
[2023-03-24 18:59:16] [INFO ] Flatten gal took : 71 ms
[2023-03-24 18:59:16] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-24 18:59:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2969 places, 446 transitions and 6460 arcs took 8 ms.
Total runtime 65461 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: 2969 NrTr: 446 NrArc: 6460)

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

net check time: 0m 0.002sec

init dd package: 0m 2.673sec


before gc: list nodes free: 1274950

after gc: idd nodes used:39720641, unused:24279359; list nodes free:117014038

RS generation: 5m 9.498sec


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


CANNOT_COMPUTE


BK_STOP 1679684699726

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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.003sec

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-28"
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-28, 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-167873952300841"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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