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-167873952300850.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is QuasiCertifProtocol-COL-32, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952300850
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 01:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 131K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-32-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679684902953

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-32
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 19:08:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 19:08:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 19:08:24] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-24 19:08:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 19:08:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 711 ms
[2023-03-24 19:08:25] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
[2023-03-24 19:08:25] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2023-03-24 19:08:25] [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 11 formulas.
FORMULA QuasiCertifProtocol-COL-32-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 10 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 225 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 21) seen :10
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 59 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-24 19:08:26] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-24 19:08:26] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-24 19:08:26] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:8
[2023-03-24 19:08:26] [INFO ] After 42ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :1 real:8
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-24 19:08:26] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :1 real:8
[2023-03-24 19:08:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-24 19:08:26] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-24 19:08:26] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-24 19:08:26] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
Fused 11 Parikh solutions to 5 different solutions.
Finished Parikh walk after 94 steps, including 0 resets, run visited all 9 properties in 6 ms. (steps per millisecond=15 )
Parikh walk visited 9 properties in 6 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2023-03-24 19:08:26] [INFO ] Flatten gal took : 29 ms
[2023-03-24 19:08:26] [INFO ] Flatten gal took : 6 ms
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2023-03-24 19:08:26] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 28 ms.
[2023-03-24 19:08:26] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Support contains 3736 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 34 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-24 19:08:27] [INFO ] Computed 3232 place invariants in 429 ms
[2023-03-24 19:08:28] [INFO ] Implicit Places using invariants in 1155 ms returned []
[2023-03-24 19:08:28] [INFO ] Invariant cache hit.
[2023-03-24 19:08:29] [INFO ] Implicit Places using invariants and state equation in 1408 ms returned []
Implicit Place search using SMT with State Equation took 2568 ms to find 0 implicit places.
[2023-03-24 19:08:29] [INFO ] Invariant cache hit.
[2023-03-24 19:08:30] [INFO ] Dead Transitions using invariants and state equation in 1465 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3736/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4068 ms. Remains : 3736/3806 places, 506/506 transitions.
Support contains 3736 out of 3736 places after structural reductions.
[2023-03-24 19:08:31] [INFO ] Flatten gal took : 229 ms
[2023-03-24 19:08:31] [INFO ] Flatten gal took : 168 ms
[2023-03-24 19:08:32] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 39) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) 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 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=11 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
[2023-03-24 19:08:33] [INFO ] Invariant cache hit.
[2023-03-24 19:08:38] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 744 ms returned sat
[2023-03-24 19:08:38] [INFO ] After 3887ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-24 19:08:41] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 704 ms returned sat
[2023-03-24 19:09:03] [INFO ] After 20097ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :28
[2023-03-24 19:09:03] [INFO ] After 20104ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :28
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-24 19:09:03] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :28
Fused 31 Parikh solutions to 21 different solutions.
Parikh walk visited 27 properties in 108 ms.
Support contains 3502 out of 3736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 3736 transition count 503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 3735 transition count 503
Applied a total of 4 rules in 127 ms. Remains 3735 /3736 variables (removed 1) and now considering 503/506 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 3735/3736 places, 503/506 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 831 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 437377 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 437377 steps, saw 78774 distinct states, run finished after 3002 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 503 rows 3735 cols
[2023-03-24 19:09:08] [INFO ] Computed 3233 place invariants in 70 ms
[2023-03-24 19:09:09] [INFO ] [Real]Absence check using 0 positive and 3233 generalized place invariants in 661 ms returned sat
[2023-03-24 19:09:09] [INFO ] After 1319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 19:09:11] [INFO ] [Nat]Absence check using 0 positive and 3233 generalized place invariants in 722 ms returned sat
[2023-03-24 19:09:20] [INFO ] After 10242ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
[2023-03-24 19:09:20] [INFO ] Flatten gal took : 116 ms
[2023-03-24 19:09:20] [INFO ] Flatten gal took : 120 ms
[2023-03-24 19:09:21] [INFO ] Input system was already deterministic with 506 transitions.
Computed a total of 3736 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3736 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 219 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 19:09:21] [INFO ] Flatten gal took : 84 ms
[2023-03-24 19:09:21] [INFO ] Flatten gal took : 89 ms
[2023-03-24 19:09:21] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 304 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 19:09:22] [INFO ] Flatten gal took : 80 ms
[2023-03-24 19:09:22] [INFO ] Flatten gal took : 81 ms
[2023-03-24 19:09:22] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3735 transition count 505
Applied a total of 2 rules in 650 ms. Remains 3735 /3736 variables (removed 1) and now considering 505/506 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 651 ms. Remains : 3735/3736 places, 505/506 transitions.
[2023-03-24 19:09:23] [INFO ] Flatten gal took : 74 ms
[2023-03-24 19:09:23] [INFO ] Flatten gal took : 75 ms
[2023-03-24 19:09:23] [INFO ] Input system was already deterministic with 505 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.12 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3701 transition count 503
Applied a total of 2 rules in 579 ms. Remains 3701 /3736 variables (removed 35) and now considering 503/506 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 579 ms. Remains : 3701/3736 places, 503/506 transitions.
[2023-03-24 19:09:23] [INFO ] Flatten gal took : 72 ms
[2023-03-24 19:09:23] [INFO ] Flatten gal took : 73 ms
[2023-03-24 19:09:24] [INFO ] Input system was already deterministic with 503 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 242 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 242 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 19:09:24] [INFO ] Flatten gal took : 75 ms
[2023-03-24 19:09:24] [INFO ] Flatten gal took : 78 ms
[2023-03-24 19:09:24] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 127 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 19:09:24] [INFO ] Flatten gal took : 78 ms
[2023-03-24 19:09:24] [INFO ] Flatten gal took : 80 ms
[2023-03-24 19:09:25] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 243 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 19:09:25] [INFO ] Flatten gal took : 73 ms
[2023-03-24 19:09:25] [INFO ] Flatten gal took : 78 ms
[2023-03-24 19:09:25] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 238 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 19:09:25] [INFO ] Flatten gal took : 73 ms
[2023-03-24 19:09:25] [INFO ] Flatten gal took : 74 ms
[2023-03-24 19:09:26] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.12 ms
Discarding 34 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 3702 transition count 504
Applied a total of 2 rules in 316 ms. Remains 3702 /3736 variables (removed 34) and now considering 504/506 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 316 ms. Remains : 3702/3736 places, 504/506 transitions.
[2023-03-24 19:09:26] [INFO ] Flatten gal took : 78 ms
[2023-03-24 19:09:26] [INFO ] Flatten gal took : 79 ms
[2023-03-24 19:09:26] [INFO ] Input system was already deterministic with 504 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.11 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 285 ms. Remains 3702 /3736 variables (removed 34) and now considering 504/506 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 286 ms. Remains : 3702/3736 places, 504/506 transitions.
[2023-03-24 19:09:27] [INFO ] Flatten gal took : 74 ms
[2023-03-24 19:09:27] [INFO ] Flatten gal took : 76 ms
[2023-03-24 19:09:27] [INFO ] Input system was already deterministic with 504 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3736 transition count 506
Applied a total of 1 rules in 566 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 566 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 19:09:27] [INFO ] Flatten gal took : 75 ms
[2023-03-24 19:09:28] [INFO ] Flatten gal took : 78 ms
[2023-03-24 19:09:28] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 252 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 19:09:28] [INFO ] Flatten gal took : 72 ms
[2023-03-24 19:09:28] [INFO ] Flatten gal took : 73 ms
[2023-03-24 19:09:28] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.9 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3701 transition count 503
Applied a total of 2 rules in 560 ms. Remains 3701 /3736 variables (removed 35) and now considering 503/506 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 562 ms. Remains : 3701/3736 places, 503/506 transitions.
[2023-03-24 19:09:29] [INFO ] Flatten gal took : 70 ms
[2023-03-24 19:09:29] [INFO ] Flatten gal took : 81 ms
[2023-03-24 19:09:29] [INFO ] Input system was already deterministic with 503 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 113 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 19:09:29] [INFO ] Flatten gal took : 77 ms
[2023-03-24 19:09:29] [INFO ] Flatten gal took : 80 ms
[2023-03-24 19:09:29] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.10 ms
Discarding 34 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 280 ms. Remains 3701 /3736 variables (removed 35) and now considering 503/506 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 281 ms. Remains : 3701/3736 places, 503/506 transitions.
[2023-03-24 19:09:30] [INFO ] Flatten gal took : 65 ms
[2023-03-24 19:09:30] [INFO ] Flatten gal took : 74 ms
[2023-03-24 19:09:30] [INFO ] Input system was already deterministic with 503 transitions.
Incomplete random walk after 10000 steps, including 246 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3609 steps, run visited all 1 properties in 19 ms. (steps per millisecond=189 )
Probabilistic random walk after 3609 steps, saw 3541 distinct states, run finished after 19 ms. (steps per millisecond=189 ) properties seen :1
FORMULA QuasiCertifProtocol-COL-32-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2023-03-24 19:09:30] [INFO ] Flatten gal took : 102 ms
[2023-03-24 19:09:30] [INFO ] Flatten gal took : 102 ms
[2023-03-24 19:09:31] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 18 ms.
[2023-03-24 19:09:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3736 places, 506 transitions and 7870 arcs took 8 ms.
Total runtime 66710 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: 3736 NrTr: 506 NrArc: 7870)

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

net check time: 0m 0.001sec

init dd package: 0m 3.046sec


before gc: list nodes free: 4966070

after gc: idd nodes used:56892596, unused:7107404; list nodes free:33512795

RS generation: 9m 3.723sec


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


CANNOT_COMPUTE


BK_STOP 1679685560018

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

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


initing FirstDep: 0m 0.002sec

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-32"
export BK_EXAMINATION="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-32, 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-167873952300850"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-32.tgz
mv QuasiCertifProtocol-COL-32 execution
cd execution
if [ "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 ;