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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10350.063 535102.00 561996.00 1531.20 F?F?????????TF?? 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-167873952300834.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-22, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952300834
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 01:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 01:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:30 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 104K 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-22-CTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679683746206

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-22
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 18:49:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 18:49:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 18:49:07] [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:49:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 18:49:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 715 ms
[2023-03-24 18:49:08] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
[2023-03-24 18:49:08] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2023-03-24 18:49:08] [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 9 formulas.
FORMULA QuasiCertifProtocol-COL-22-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 8 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 10006 steps, including 304 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 20) seen :12
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 108 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-24 18:49:09] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-24 18:49:09] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-24 18:49:09] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:5
[2023-03-24 18:49:09] [INFO ] After 45ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :2 real:5
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-24 18:49:09] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :2 real:5
[2023-03-24 18:49:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-24 18:49:09] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-03-24 18:49:09] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-24 18:49:09] [INFO ] After 186ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 8 Parikh solutions to 5 different solutions.
Finished Parikh walk after 125 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=125 )
Parikh walk visited 6 properties in 9 ms.
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA QuasiCertifProtocol-COL-22-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 18:49:09] [INFO ] Flatten gal took : 29 ms
[2023-03-24 18:49:09] [INFO ] Flatten gal took : 6 ms
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2023-03-24 18:49:09] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 23 ms.
[2023-03-24 18:49:09] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Support contains 1916 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 16 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-24 18:49:10] [INFO ] Computed 1562 place invariants in 129 ms
[2023-03-24 18:49:10] [INFO ] Implicit Places using invariants in 723 ms returned []
[2023-03-24 18:49:10] [INFO ] Invariant cache hit.
[2023-03-24 18:49:11] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1651 ms to find 0 implicit places.
[2023-03-24 18:49:11] [INFO ] Invariant cache hit.
[2023-03-24 18:49:12] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1916/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2402 ms. Remains : 1916/1966 places, 356/356 transitions.
Support contains 1916 out of 1916 places after structural reductions.
[2023-03-24 18:49:12] [INFO ] Flatten gal took : 160 ms
[2023-03-24 18:49:12] [INFO ] Flatten gal took : 129 ms
[2023-03-24 18:49:13] [INFO ] Input system was already deterministic with 356 transitions.
Incomplete random walk after 10000 steps, including 369 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 40) seen :6
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 78 ms. (steps per millisecond=12 ) properties (out of 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 34) 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 34) 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 34) seen :0
Running SMT prover for 34 properties.
[2023-03-24 18:49:14] [INFO ] Invariant cache hit.
[2023-03-24 18:49:16] [INFO ] [Real]Absence check using 0 positive and 1562 generalized place invariants in 288 ms returned sat
[2023-03-24 18:49:17] [INFO ] After 2038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:34
[2023-03-24 18:49:18] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 281 ms returned sat
[2023-03-24 18:49:32] [INFO ] After 12739ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :28
[2023-03-24 18:49:40] [INFO ] After 20485ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :28
Attempting to minimize the solution found.
Minimization took 1695 ms.
[2023-03-24 18:49:42] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :27
Fused 34 Parikh solutions to 27 different solutions.
Finished Parikh walk after 130 steps, including 0 resets, run visited all 11 properties in 6 ms. (steps per millisecond=21 )
Parikh walk visited 28 properties in 38 ms.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-22-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 18:49:42] [INFO ] Flatten gal took : 71 ms
[2023-03-24 18:49:42] [INFO ] Flatten gal took : 78 ms
[2023-03-24 18:49:42] [INFO ] Input system was already deterministic with 356 transitions.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
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 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 144 are kept as prefixes of interest. Removing 1772 places using SCC suffix rule.17 ms
Discarding 1772 places :
Also discarding 140 output transitions
Drop transitions removed 140 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 143 transition count 100
Applied a total of 116 rules in 34 ms. Remains 143 /1916 variables (removed 1773) and now considering 100/356 (removed 256) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 143/1916 places, 100/356 transitions.
[2023-03-24 18:49:42] [INFO ] Flatten gal took : 5 ms
[2023-03-24 18:49:42] [INFO ] Flatten gal took : 4 ms
[2023-03-24 18:49:42] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 10 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 1916/1916 places, 356/356 transitions.
[2023-03-24 18:49:42] [INFO ] Flatten gal took : 51 ms
[2023-03-24 18:49:42] [INFO ] Flatten gal took : 56 ms
[2023-03-24 18:49:43] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 296 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 299 ms. Remains : 1916/1916 places, 356/356 transitions.
[2023-03-24 18:49:43] [INFO ] Flatten gal took : 42 ms
[2023-03-24 18:49:43] [INFO ] Flatten gal took : 44 ms
[2023-03-24 18:49:43] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 55 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 1916/1916 places, 356/356 transitions.
[2023-03-24 18:49:43] [INFO ] Flatten gal took : 41 ms
[2023-03-24 18:49:43] [INFO ] Flatten gal took : 41 ms
[2023-03-24 18:49:43] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 114 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 1916/1916 places, 356/356 transitions.
[2023-03-24 18:49:43] [INFO ] Flatten gal took : 36 ms
[2023-03-24 18:49:43] [INFO ] Flatten gal took : 38 ms
[2023-03-24 18:49:44] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 32 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 1916/1916 places, 356/356 transitions.
[2023-03-24 18:49:44] [INFO ] Flatten gal took : 40 ms
[2023-03-24 18:49:44] [INFO ] Flatten gal took : 39 ms
[2023-03-24 18:49:44] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 65 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 1916/1916 places, 356/356 transitions.
[2023-03-24 18:49:44] [INFO ] Flatten gal took : 35 ms
[2023-03-24 18:49:44] [INFO ] Flatten gal took : 36 ms
[2023-03-24 18:49:44] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 31 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 1916/1916 places, 356/356 transitions.
[2023-03-24 18:49:44] [INFO ] Flatten gal took : 36 ms
[2023-03-24 18:49:44] [INFO ] Flatten gal took : 38 ms
[2023-03-24 18:49:44] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 64 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 1916/1916 places, 356/356 transitions.
[2023-03-24 18:49:44] [INFO ] Flatten gal took : 35 ms
[2023-03-24 18:49:44] [INFO ] Flatten gal took : 36 ms
[2023-03-24 18:49:44] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.10 ms
Discarding 24 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 67 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 1891/1916 places, 353/356 transitions.
[2023-03-24 18:49:44] [INFO ] Flatten gal took : 33 ms
[2023-03-24 18:49:44] [INFO ] Flatten gal took : 35 ms
[2023-03-24 18:49:45] [INFO ] Input system was already deterministic with 353 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.7 ms
Discarding 24 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 64 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 1891/1916 places, 353/356 transitions.
[2023-03-24 18:49:45] [INFO ] Flatten gal took : 32 ms
[2023-03-24 18:49:45] [INFO ] Flatten gal took : 35 ms
[2023-03-24 18:49:45] [INFO ] Input system was already deterministic with 353 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.6 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 59 ms. Remains 1892 /1916 variables (removed 24) and now considering 354/356 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 1892/1916 places, 354/356 transitions.
[2023-03-24 18:49:45] [INFO ] Flatten gal took : 35 ms
[2023-03-24 18:49:45] [INFO ] Flatten gal took : 36 ms
[2023-03-24 18:49:45] [INFO ] Input system was already deterministic with 354 transitions.
[2023-03-24 18:49:45] [INFO ] Flatten gal took : 56 ms
[2023-03-24 18:49:45] [INFO ] Flatten gal took : 54 ms
[2023-03-24 18:49:45] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 17 ms.
[2023-03-24 18:49:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1916 places, 356 transitions and 4110 arcs took 5 ms.
Total runtime 38212 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 1916 NrTr: 356 NrArc: 4110)

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

net check time: 0m 0.001sec

init dd package: 0m 2.840sec


before gc: list nodes free: 1373512

after gc: idd nodes used:41422490, unused:22577510; list nodes free:107457512

RS generation: 7m41.459sec


-> last computed set: #nodes 41420597 (4.1e+07) #states 4,194,305 (6)


CANNOT_COMPUTE


BK_STOP 1679684281308

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.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-22"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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